Sciweavers

670 search results - page 25 / 134
» Intractability and clustering with constraints
Sort
View
ICPR
2008
IEEE
16 years 18 days ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 6 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
ICCV
2005
IEEE
15 years 11 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
ICASSP
2010
IEEE
15 years 3 months ago
A supervisory approach to semi-supervised clustering
We propose a new approach to semi-supervised clustering that utilizes boosting to simultaneously learn both a similarity measure and a clustering of the data from given instancele...
Bryan Conroy, Yongxin Taylor Xi, Peter J. Ramadge
SSPR
2004
Springer
15 years 11 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 i...
Tijl De Bie, Johan A. K. Suykens, Bart De Moor