705 search results - page 2 / 141 » Proximity Cluster Trees |
DAWAK
2007
Springer
13 years 11 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
PAMI
2008
13 years 5 months ago
2008
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
MICAI
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
BMCBI
2008
13 years 5 months ago
2008
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
ICPR
2002
IEEE
13 years 10 months ago
2002
IEEE
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...