Random Articles
Reseach Article
Perimeter Clustering Algorithm to Reduce the Number of Iterations
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 35 - Number 8 |
| Year of Publication: 2011 |
| Authors: G. V. S. N. R. V. Prasad, Dr. Ch. Satyanarayana, Dr. V. Vijaya Kumar |
10.5120/4423-6158
|
G. V. S. N. R. V. Prasad, Dr. Ch. Satyanarayana, Dr. V. Vijaya Kumar . Perimeter Clustering Algorithm to Reduce the Number of Iterations. International Journal of Computer Applications. 35, 8 ( December 2011), 41-46. DOI=10.5120/4423-6158
Abstract
Clustering is a division of data into groups of similar objects. Clustering is an unsupervised learning, due to its unknown label class in the search domain. K-means is one of the simplest unsupervised learning algorithms that solve the well known clustering problem. It has capability to cluster large data. The main idea of K-Means is to define k centroids for each cluster. The K-means algorithm clusters the data with more complexity and the complexity further increases based on the dimensionality and data size. To overcome this we present a novel approach called perimeter K-means (PKM) clustering algorithms, which considers two data points and evaluates the perimeters. From this the two data pints are assigned to the nearest cluster center. By this the PKM reduces the overall complexity issues of K-means algorithms. The experimental result on various datasets, with various instances clearly indicates the efficacy of the proposed method. Further cluster quality and stability issues are tested by the proposed PKM.
References
- Ball.G.H. and Hall.D.J., “Some Fundamental Concepts and Synthesis Procedures for Pattern Recognition Preprocessors,” Proc. Int'l Conf. Microwaves, Circuit Theory, and Information Theory, Sept. 1964.
- Ben-Hur.A., Elisseeff.A. and Guyon.I. “A stability based method for discovering structure in clustered data,” In Pasific Symposium on Bio-computing, Vol. 7, pp 6–17, 2002.
- Bradley.P., Fayyad.U. “Scaling clustering algorithms to large databases,” KDD-98, 1998.
- Duda.R.O. and Hart.P.E. “Pattern Classification and Scene Analysis,” New York: John Wiley & Sons, 1973.
- Ester.M., Kriegel.H. and Xu.X. “A Database Interface for Clustering in Large Spatial Databases,” Proc. First Int'l Conf. Knowledge Discovery and Data Mining (KDD-95), pp. 94-99, 1995.
- Fayyad.U.M., et.al. “Advances in Knowledge Discovery and Data Mining,” AAAI/MIT Press, 1996.
- Gersho.A. and Gray.R.M. “Vector Quantization and Signal Compression,” Boston: Kluwer Academic, 1992.
- Inaba.M., Imai.H. and Katoh.N. “Experimental Results of a Randomized Clustering Algorithm,” Proc.12th Ann. ACM Symp. Computational Geometry, pp. C1-C2, May 1996.
- Inaba.M., Katoh.N. and Imai.H. “Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based clustering,” Proc. 10th Ann. ACM Symp. Computational Geometry, pp. 332-339, June 1994.
- Jain.A.K. and Dubes.R.C. “Algorithms for clustering Data”, Prentice Hall, 1988.
- Kaufman.L. and Rousseeuw.P.J. “Finding Groups in Data: An Introduction to Cluster Analysis,” New York: John Wiley & Sons, 1990.
- Kohonen.T., “Self-Organization and Associative Memory,” third ed. New York: Springer-Verlag, 1989.
- Lange.T., Braun.V., Roth.V. et al. “Stability based model selection,” In NIPS, 2003.
- Mustafa.Z. and Sims.B. “A new approach to generalized metric spaces,” J. of Nonlinear and Convex Analysis 7, pp. 289–297, 2006.
- Mustafa.Z. and Sims.B. “Fixed point theorems for contractive mappings in complete G-metric spaces,” Fixed Point Theory Appl, Art. ID 917175, pp. 10, 2009.
- Ng.R. and Han.J. “Efficient and effective clustering methods for spatial data mining,” VLDB-94, 1994.
- Shai Ben-David., Ulrike von et al. “A sober look at clustering stability,” In COLT, 2006.
- Ulrike von Luxburg and Shai Ben-David. “Towards a statistical theory of clustering,” PASCAL Workshop on Statistics and Optimization of Clustering, 2005.
- Zhang.T., Ramakrishnan.R. and Livny.M. BIRCH: “A New Data Clustering Algorithm and Its Applications,” Data Mining and Knowledge Discovery, Vol. 1, no. 2, pp. 141-182, 1997.
- Prof. G.V.S.N.R.V.Prasad, Prof.Y. Dhanalakshmi, Prof. V.Vijaya Kumar and Prof. I.Ramesh Babu “Modeling An Intrusion Detection System Using Data Mining And Genetic Algorithms Based On Fuzzy Logic”, International Journal of Computer Science and Network Security, IJCSNS, VOL.8 No.7, July 2008.
- Prof. G.V.S.N.R.V.Prasad, Prof.Y. Dhanalakshmi, Prof.V.Vijaya Kumar and Prof. I.Ramesh Babu “Mining for optimized data using clustering along with fuzzy association rules and genetic algorithms”,International Journal Of Artificial Intelligence & Applications (IJAIA),Vol. No. 2,April 2010.
Index Terms
Keywords