504 search results - page 19 / 101 » PCS: An Efficient Clustering Method for High-Dimensional Dat... |
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...
SSDBM
2006
IEEE
14 years 1 months ago
2006
IEEE
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...
IPPS
2003
IEEE
14 years 29 days ago
2003
IEEE
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
TKDE
2012
11 years 10 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...