190 search results - page 25 / 38 » Constraint-Based Subspace Clustering. |
KDD
2006
ACM
14 years 9 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
In the past few years there has been increased research interest in detecting previously unidentified events from Web resources. Our focus in this paper is to detect events from ...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
ICCSA
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we propose a new clustering procedure for high dimensional microarray data. Major difficulty in cluster analysis of microarray data is that the number of samples to ...
PVLDB
2008
13 years 7 months ago
2008
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...