Sciweavers

2228 search results - page 60 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
16 years 6 months ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain
PRL
2008
135views more  PRL 2008»
15 years 6 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa
124
Voted
NIPS
2003
15 years 7 months ago
Pairwise Clustering and Graphical Models
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...
Noam Shental, Assaf Zomet, Tomer Hertz, Yair Weiss
KDD
2003
ACM
210views Data Mining» more  KDD 2003»
16 years 6 months ago
Privacy-preserving k-means clustering over vertically partitioned data
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 ...
Jaideep Vaidya, Chris Clifton
ICDM
2007
IEEE
103views Data Mining» more  ICDM 2007»
16 years 12 days ago
Mechanism Design for Clustering Aggregation by Selfish Systems
We propose a market mechanism that can be implemented on clustering aggregation problem among selfish systems, which tend to lie about their correct clustering during aggregation ...
Pinata Winoto, Yiu-ming Cheung, Jiming Liu