Sciweavers

6181 search results - page 509 / 1237
» Transactional Cluster Computing
Sort
View
MLDM
1999
Springer
15 years 11 months ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau
MVA
2007
159views Computer Vision» more  MVA 2007»
15 years 8 months ago
Action Recognition of Insects Using Spectral Clustering
We propose a technique to recognize actions of grasshoppers based on spectral clustering. We track the object in 3D and construct features using 3D object movement in segments of ...
Maryam Moslemi Naeini, Greg Dutton, Kristina Rothl...
NIPS
2004
15 years 8 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
Massimiliano Pavan, Marcello Pelillo
NIPS
1997
15 years 8 months ago
Active Data Clustering
Active data clustering is a novel technique for clustering of proximity data which utilizes principles from sequential experiment design in order to interleave data generation and...
Thomas Hofmann, Joachim M. Buhmann
ICML
2010
IEEE
15 years 8 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long