1775 search results - page 141 / 355 » Learning Spectral Clustering |
IDA
2010
Springer
14 years 8 months ago
2010
Springer
We propose a clustering algorithm that effectively utilizes feature order preferences, which have the form that feature s is more important than feature t. Our clustering formulati...
ICML
2009
IEEE
15 years 11 months ago
2009
IEEE
We discuss the problem of clustering elements according to the sources that have generated them. For elements that are characterized by independent binary attributes, a closedform...
ICML
2007
IEEE
15 years 11 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
80
Voted
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. The key ...
ALT
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...