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.

Ogechukwu N Iloanusi and Charles C. Osuagwu, “Clustering: Applied to Data Structuring and Retrieval ” International Journal of Advanced Computer Science and Applications(IJACSA), 2(11), 2011. http://dx.doi.org/10.14569/IJACSA.2011.021116

@article{Iloanusi2011,
title = {Clustering: Applied to Data Structuring and Retrieval },
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2011.021116},
url = {http://dx.doi.org/10.14569/IJACSA.2011.021116},
year = {2011},
publisher = {The Science and Information Organization},
volume = {2},
number = {11},
author = { Ogechukwu N Iloanusi and Charles C. Osuagwu}
}