459 search results - page 15 / 92 » A general model for clustering binary data |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
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...
DMIN
2007
13 years 9 months ago
2007
Abstract — New privacy regulations together with everincreasing data availability and computational power have created a huge interest in data privacy research. One major researc...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
We propose a hybrid, unsupervised document clustering approach that combines a hierarchical clustering algorithm with Expectation Maximization. We developed several heuristics to ...
NIPS
2003
13 years 9 months ago
2003
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...
SAC
2010
ACM
14 years 29 days ago
2010
ACM
Numerous privacy models based on the k-anonymity property have been introduced in the last few years. While differing in their methods and quality of their results, they all focus...