Sciweavers

5046 search results - page 213 / 1010
» Non-redundant data clustering
Sort
View
ICCV
2007
IEEE
16 years 28 days ago
Latent Model Clustering and Applications to Visual Recognition
We consider clustering situations in which the pairwise affinity between data points depends on a latent ”context” variable. For example, when clustering features arising fro...
Simon Polak, Amnon Shashua
IJCNN
2007
IEEE
16 years 28 days ago
Iterative Feature Selection in Gaussian Mixture Clustering with Automatic Model Selection
— This paper proposes an algorithm to deal with the feature selection in Gaussian mixture clustering by an iterative way: the algorithm iterates between the clustering and the un...
Hong Zeng, Yiu-ming Cheung
HPCC
2005
Springer
16 years 4 days ago
A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering
Hierarchical clustering methods are important in many data mining and pattern recognition tasks. In this paper we present an efficient coarse grained parallel algorithm for Single...
Albert Chan, Chunmei Gao, Andrew Rau-Chaplin
HIS
2003
15 years 8 months ago
On the Performance of Ant-based Clustering
Ant-based clustering and sorting is a nature-inspired heuristic for general clustering tasks. It has been applied variously, from problems arising in commerce, to circuit design, t...
Julia Handl, Joshua D. Knowles, Marco Dorigo
CSDA
2007
142views more  CSDA 2007»
15 years 6 months ago
DIVCLUS-T: A monothetic divisive hierarchical clustering method
DIVCLUS-T is a divisive hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. It i...
Marie Chavent, Yves Lechevallier, Olivier Briant