5209 search results - page 298 / 1042 » Multiobjective Data Clustering |
138
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
131
Voted
TKDE
2002
15 years 4 months ago
2002
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
174
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
124
click to vote
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
128
click to vote
PKDD
1999
Springer
15 years 8 months ago
1999
Springer
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...