1492 search results - page 98 / 299 » Geometric Clustering Using the Information Bottleneck Method |
149
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper is about the evaluation of the results of clustering algorithms, and the comparison of such algorithms. We propose a new method based on the enrichment of a se...
130
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
DEXA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. K-anonymisation is an approach to protecting private information contained within a dataset. Many k-anonymisation methods have been proposed recently and one class of suc...
137
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
129
click to vote
ICCBR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Making case adaptation practical is a longstanding challenge for casebased reasoning. One of the impediments to widespread use of automated case adaptation is the adaptat...