3934 search results - page 283 / 787 » A monothetic clustering method |
196
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
163
click to vote
PAKDD
2009
ACM
16 years 1 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...
186
click to vote
IDA
1999
Springer
15 years 11 months ago
1999
Springer
Grand tour is a method for viewing multidimensional data via linear projections onto a sequence of two dimensional subspaces and then moving continuously from one projection to the...
202
click to vote
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
178
click to vote
BIBE
2001
IEEE
15 years 10 months ago
2001
IEEE
DNA arrays can be used to measure the expression levels of thousands of genes simultaneously. Currently most research focuses on the interpretation of the meaning of the data. How...