1093 search results - page 13 / 219 » Clustering from Constraint Graphs |
PAMI
2007
13 years 9 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
WWW
2009
ACM
14 years 10 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
APVIS
2008
13 years 11 months ago
2008
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
DATAMINE
2006
13 years 9 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
JCB
2002
13 years 9 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...