Clustering: Applied to Data Structuring and Retrieval
C. Ogechukwu N Iloanusi. International Journal of Advanced Computer Science and Applications(IJACSA), (2011)
Abstract
Clustering is a very useful scheme for data structuring and retrieval behuhcause it can handle large volumes of multi-dimensional data and employs a very fast algorithm. Other forms of data structuring techniques include hashing and binary tree structures. However, clustering has the advantage of employing little computational storage requirements and a fast speed algorithm. In this paper, clustering, k-means clustering and the approaches to effective clustering are extensively discussed. Clustering was employed as a data grouping and retrieval strategy in the filtering of fingerprints in the Fingerprint Verification Competition 2000 database 4(a). An average penetration of 7.41\% obtained from the experiment shows clearly that the clustering scheme is an effective retrieval strategy for the filtering of fingerprints.
%0 Journal Article
%1 IJACSA.2011.021116
%A Ogechukwu N Iloanusi, Charles C Osuagwu
%D 2011
%J International Journal of Advanced Computer Science and Applications(IJACSA)
%K Clustering; component; data indexing. k-means; retrieval;
%N 11
%T Clustering: Applied to Data Structuring and Retrieval
%U http://ijacsa.thesai.org/
%V 2
%X Clustering is a very useful scheme for data structuring and retrieval behuhcause it can handle large volumes of multi-dimensional data and employs a very fast algorithm. Other forms of data structuring techniques include hashing and binary tree structures. However, clustering has the advantage of employing little computational storage requirements and a fast speed algorithm. In this paper, clustering, k-means clustering and the approaches to effective clustering are extensively discussed. Clustering was employed as a data grouping and retrieval strategy in the filtering of fingerprints in the Fingerprint Verification Competition 2000 database 4(a). An average penetration of 7.41\% obtained from the experiment shows clearly that the clustering scheme is an effective retrieval strategy for the filtering of fingerprints.
@article{IJACSA.2011.021116,
abstract = {Clustering is a very useful scheme for data structuring and retrieval behuhcause it can handle large volumes of multi-dimensional data and employs a very fast algorithm. Other forms of data structuring techniques include hashing and binary tree structures. However, clustering has the advantage of employing little computational storage requirements and a fast speed algorithm. In this paper, clustering, k-means clustering and the approaches to effective clustering are extensively discussed. Clustering was employed as a data grouping and retrieval strategy in the filtering of fingerprints in the Fingerprint Verification Competition 2000 database 4(a). An average penetration of 7.41\% obtained from the experiment shows clearly that the clustering scheme is an effective retrieval strategy for the filtering of fingerprints.},
added-at = {2014-02-21T08:00:08.000+0100},
author = {{Ogechukwu N Iloanusi}, Charles C Osuagwu},
biburl = {https://www.bibsonomy.org/bibtex/2fd7e34dc9593c9ed5ca87610044ac6c2/thesaiorg},
interhash = {5b860a55c2e7f0c8d5f8787c162adc50},
intrahash = {fd7e34dc9593c9ed5ca87610044ac6c2},
journal = {International Journal of Advanced Computer Science and Applications(IJACSA)},
keywords = {Clustering; component; data indexing. k-means; retrieval;},
number = 11,
timestamp = {2014-02-21T08:00:08.000+0100},
title = {{Clustering: Applied to Data Structuring and Retrieval}},
url = {http://ijacsa.thesai.org/},
volume = 2,
year = 2011
}