504 search results - page 22 / 101 » PCS: An Efficient Clustering Method for High-Dimensional Dat... |
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
IDEAL
2004
Springer
14 years 1 months ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...
WISE
2002
Springer
14 years 18 days ago
2002
Springer
In this paper, we introduce a novel framework for clustering web data which is often heterogeneous in nature. As most existing methods often integrate heterogeneous data into a un...
MLDM
2005
Springer
14 years 1 months ago
2005
Springer
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with...
ICCSA
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. In this paper, an efficient speaker identification based on robust vector quantization principal component analysis (VQ-PCA) is proposed to solve the problems from outlie...