Different Data Mining Techniques And Clustering Algorithms
[Full Text]
AUTHOR(S)
R. Amutha, Renuka. K
KEYWORDS
Keywords: Clustering, Supervised Learning, Unsupervised Learning Hierarchical Clustering, KMean Clustering Algorithm.
ABSTRACT
Abstract: Data mining is the process of extracting hidden information and patterns from large database. Data mining play a vital role in the leading business environment. It helps to make decisions based on the past information gathered in the database. Data mining is used in various data enhancement processes. These enhancements help in decision making. This paper depicts the various data mining techniques used to perform the mining process in enriched manner. Its also discloses the methodologies adapted in various clustering techniques.
REFERENCES
[1] S.Anitha Elavarasi and Dr. J. Akilandeswari and Dr. B. Sathiyabhama, January 2011, A Survey On Partition Clustering Algorithms.
[2] Survey of Clustering Data Mining Techniques, Pavel Berkhin, Accrue Software, Inc. www.ijarcsse.com
[3] Santos, J.M, de Sa, J.M, Alexandre, L.A , 2008. LEGClust A Clustering Algorithm based on Layered Entropic subgraph. Pattern Analysis and Machine Intelligence, IEEE Transactions : 6275.
[4] M. Livny, R.Ramakrishnan, T. Zhang, 1996. BIRCH: An Efficient Clustering Method for Very Large Databases. Proceeding ACMSIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery :103114.
[5] S. Guha, R. Rastogi, and K. Shim, 1998. CURE: An Efficient Clustering Algorithm for Large Databases. Proc. ACM Int’l Conf. Management of Data : 7384.
[6] Jiawei Han, Micheline Kamber, “Data Mining Concepts and Techniques” Elsevier Publication.
[7] Hwanjo Yu AND Jiong Yang AND Jiawei Han, “Classifying Large Data Sets Using SVM with Hierarchical Clusters”
[8] Efficient Hierarchical Clustering of Large Data Sets Using Ptrees, Anne Denton, Qiang Ding, William Perrizo And Qin Ding
[9] Parallel k/hMeans Clustering for Large Data Sets, Kilian Stoffel and Abdelkader Belkoniene
[10] Novel KMeans Based Clustering Algorithm for High Dimensional Data Sets, Madjid Khalilian, Norwati Mustapha, MD Nasir Suliman, MD Ali Mamat
[11] U. Boryczka, "Finding groups in data: Cluster analysis with ants," Applied Soft Computing Journal, vol. 9, pp. 6170,2009.
[12] D. Isa, V. P. Kallimani, and L. H. Lee, "Using the self organizing map for clustering of text documents," Expert Systems With Applications, vol. 36, pp. 95849591, 2009.
[13] DESCRY: a Density Based Clustering Algorithm for Very Large Data Sets, Fabrizio Angiulli, Clara Pizzuti, Massimo Ruffolo
[14] DensityBased Clustering in Spatial Databases: The Algorithm GDBSCAN and its Applications, Jörg Sander, Martin Ester, Hans Peter Kriegel, Xiaowei Xu
