Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
A massively parallel architecture for a self-organizing neural pattern recognition machine
Computer Vision, Graphics, and Image Processing
The 'Neural' Phonetic Typewriter
Computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Cluster analysis and related issues
Handbook of pattern recognition & computer vision
Randomized algorithms
BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
CURE: an efficient clustering algorithm for large databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
ROCK: a robust clustering algorithm for categorical attributes
Information Systems
Modern Information Retrieval
P-AutoClass: Scalable Parallel Clustering for Mining Large Data Sets
IEEE Transactions on Knowledge and Data Engineering
Hierarchical Clustering Algorithms for Document Datasets
Data Mining and Knowledge Discovery
Approximate clustering in very large relational data: Research Articles
International Journal of Intelligent Systems
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable Recognition with a Vocabulary Tree
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
A survey of evolutionary algorithms for clustering
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Graph based representations of density distribution and distances for self-organizing maps
IEEE Transactions on Neural Networks
Hierarchical document clustering using local patterns
Data Mining and Knowledge Discovery
Approximate pairwise clustering for large data sets via sampling plus extension
Pattern Recognition
Fast modified global k-means algorithm for incremental cluster construction
Pattern Recognition
A hybrid particle swarm optimization approach for clustering and classification of datasets
Knowledge-Based Systems
Spectral clustering with density sensitive similarity function
Knowledge-Based Systems
A quality driven Hierarchical Data Divisive Soft Clustering for information retrieval
Knowledge-Based Systems
A dissimilarity measure for the k-Modes clustering algorithm
Knowledge-Based Systems
Spectral clustering with discriminant cuts
Knowledge-Based Systems
A fuzzy k-prototype clustering algorithm for mixed numeric and categorical data
Knowledge-Based Systems
MIFT: a mirror reflection invariant feature descriptor
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part II
Integrating wavelets with clustering and indexing for effective content-based image retrieval
Knowledge-Based Systems
A self-organizing network for hyperellipsoidal clustering (HEC)
IEEE Transactions on Neural Networks
Survey of clustering algorithms
IEEE Transactions on Neural Networks
Fast K-means algorithm based on a level histogram for image retrieval
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely studied problems in this area is the identification of clusters in a multi-dimensional dataset. This paper introduces a sample-based hierarchical adaptive K-means (SHAKM) clustering algorithm for large-scale video retrieval. To handle large databases efficiently, SHAKM employs a multilevel random sampling strategy. Furthermore, SHAKM utilises the adaptive K-means clustering algorithm to determine the correct number of clusters and to construct an unbalanced cluster tree. Furthermore, SHAKM uses the fast labelling scheme to assign each pattern in the dataset to the closest cluster. To evaluate the proposed method, several datasets are used to illustrate its effectiveness. The results show that SHAKM is fast and effective on very large datasets. Furthermore, the results demonstrate that the proposed method can be used efficiently and successfully for a project on content-based video copy detection.