Sciweavers

670 search results - page 28 / 134
» Intractability and clustering with constraints
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
ICDM
2008
IEEE
147views Data Mining» more  ICDM 2008»
15 years 4 months ago
Clustering Documents with Active Learning Using Wikipedia
Wikipedia has been applied as a background knowledge base to various text mining problems, but very few attempts have been made to utilize it for document clustering. In this pape...
Anna Huang, David N. Milne, Eibe Frank, Ian H. Wit...
PR
2010
156views more  PR 2010»
14 years 8 months ago
Semi-supervised clustering with metric learning: An adaptive kernel method
Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel met...
Xuesong Yin, Songcan Chen, Enliang Hu, Daoqiang Zh...
JMLR
2012
13 years 5 days ago
Constrained 1-Spectral Clustering
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...
Syama Sundar Rangapuram, Matthias Hein
SIGGRAPH
1996
ACM
15 years 1 months ago
Linear-Time Dynamics Using Lagrange Multipliers
Current linear-time simulation methods for articulated figures are based exclusively on reduced-coordinate formulations. This paper describes a general, non-iterative linear-time ...
David Baraff