298 search results - page 30 / 60 » Subspace Clustering of High Dimensional Data |
109
Voted
GFKL
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
115
click to vote
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
In this article we describe an algorithm for feature selection and gene clustering from high dimensional gene expression data. The method is based on measuring similarity between ...
137
Voted
KDD
2002
ACM
16 years 26 days ago
2002
ACM
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic m...
236
Voted
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We investigate variants of Lloyd’s heuristic for clustering high dimensional data in an attempt to explain its popular