5046 search results - page 299 / 1010 » Non-redundant data clustering |
153
click to vote
ICDM
2007
IEEE
16 years 1 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...
171
click to vote
PKDD
1999
Springer
15 years 11 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...
204
click to vote
DEXA
2009
Springer
16 years 1 months ago
2009
Springer
Dimension hierarchies represent a substantial part of the data warehouse model. Indeed they allow decision makers to examine data at different levels of detail with On-Line Analyt...
182
Voted
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose a novel algorithm for clustering data sampled from multiple submanifolds of a Riemannian manifold. First, we learn a representation of the data using generalizations of...
185
click to vote
MLDM
2005
Springer
16 years 7 days ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...