528 search results - page 30 / 106 » Mining Subspace Correlations |
KDD
2005
ACM
14 years 8 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
The computation of covariance and correlation matrices are critical to many data mining applications and processes. Unfortunately the classical covariance and correlation matrices...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
ICPP
2000
IEEE
14 years 3 days ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
BMCBI
2008
13 years 7 months ago
2008
Background: Clustering is a popular data exploration technique widely used in microarray data analysis. Most conventional clustering algorithms, however, generate only one set of ...