692 search results - page 35 / 139 » A new clustering algorithm for coordinate-free data |
TDP
2010
13 years 2 months ago
2010
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
14 years 9 days ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
ACMSE
2010
ACM
13 years 6 months ago
2010
ACM
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
BIBE
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we propose a system for finding partial positive and negative coregulated gene clusters in microarray data. Genes are clustered together if they show the same p...