Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
Lists
Only you see this
Abstract
In large content-based image database applications, efficient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques for text retrieval are well understood, efficient and robust indexing methodology for image retrieval is still in its infancy. In this paper, we present a non-hierarchical clustering scheme for index generation using the Rival Penalized Competitive Learning (RPCL) algorithm. RPCL is a stochastic heuristic clustering method which provides good cluster center approximation and is computationally efficient. Using synthetic data as well as real data, we demonstrate the recall and precision performance measurement of nearest-neighbor feature retrieval based on the indexing structure generated by RPCL.
BibTeX
@inproceedings{king1999non,
author = {Irwin King and Tak-Kan Lau},
title = {{Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval}},
booktitle = {MLDM},
year = {1999},
doi = {10.1007/3-540-48097-8\_10},
}Loading related content...