Sciweavers

Share
SSPR
2004
Springer

Learning from General Label Constraints

10 years 2 months ago
Learning from General Label Constraints
Most machine learning algorithms are designed either for supervised or for unsupervised learning, notably classification and clustering. Practical problems in bioinformatics and in vision however show that this setting often is an oversimplification of reality. While label information is of course invaluable in most cases, it would be a huge waste to ignore the information on the cluster structure that is present in an (often much larger) unlabeled sample set. Several recent contributions deal with this topic: given partially labeled data, exploit all information available. In this paper, we present an elegant and efficient algorithm that allows to deal with very general types of label constraints in class learning problems. The approach is based on spectral clustering, and leads to an efficient algorithm based on the simple eigenvalue problem.
Tijl De Bie, Johan A. K. Suykens, Bart De Moor
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where SSPR
Authors Tijl De Bie, Johan A. K. Suykens, Bart De Moor
Comments (0)
books