Sciweavers

1013 search results - page 51 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
IDEAL
2000
Springer
13 years 11 months ago
Observational Learning with Modular Networks
Observational learning algorithm is an ensemble algorithm where each network is initially trained with a bootstrapped data set and virtual data are generated from the ensemble for ...
Hyunjung Shin, Hyoungjoo Lee, Sungzoon Cho
ICDE
1999
IEEE
139views Database» more  ICDE 1999»
14 years 9 months ago
Clustering Large Datasets in Arbitrary Metric Spaces
Clustering partitions a collection of objects into groups called clusters, such that similar objects fall into the same group. Similarity between objects is defined by a distance ...
Venkatesh Ganti, Raghu Ramakrishnan, Johannes Gehr...
ICCV
2007
IEEE
14 years 2 months 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
ICPR
2006
IEEE
14 years 8 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden
CVPR
2012
IEEE
11 years 10 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...