184 search results - page 14 / 37 » Random Projection for High Dimensional Data Clustering: A Cl... |
BMCBI
2005
13 years 8 months ago
2005
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...
NIPS
2001
13 years 10 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
MSS
2003
IEEE
14 years 1 months ago
2003
IEEE
When data resides on tertiary storage, clustering is the key to achieving high retrieval performance. However, a straightforward approach to clustering massive amounts of data on ...
CIKM
2000
Springer
14 years 29 days ago
2000
Springer
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...