504 search results - page 5 / 101 » PCS: An Efficient Clustering Method for High-Dimensional Dat... |
SDM
2004
SIAM
13 years 9 months ago
2004
SIAM
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that...
BMCBI
2007
13 years 7 months ago
2007
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
IDEAL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Normal mixture models are often used to cluster continuous data. However, conventional approaches for fitting these models will have problems in producing nonsingular es...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...