CFP last date
20 January 2025
Reseach Article

A Novel hybrid Candidate Group Search Genetic Clustering for Large Scale Data

by Suvarna P. Patil
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 109 - Number 5
Year of Publication: 2015
Authors: Suvarna P. Patil
10.5120/19188-0685

Suvarna P. Patil . A Novel hybrid Candidate Group Search Genetic Clustering for Large Scale Data. International Journal of Computer Applications. 109, 5 ( January 2015), 38-40. DOI=10.5120/19188-0685

@article{ 10.5120/19188-0685,
author = { Suvarna P. Patil },
title = { A Novel hybrid Candidate Group Search Genetic Clustering for Large Scale Data },
journal = { International Journal of Computer Applications },
issue_date = { January 2015 },
volume = { 109 },
number = { 5 },
month = { January },
year = { 2015 },
issn = { 0975-8887 },
pages = { 38-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume109/number5/19188-0685/ },
doi = { 10.5120/19188-0685 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:44:02.247239+05:30
%A Suvarna P. Patil
%T A Novel hybrid Candidate Group Search Genetic Clustering for Large Scale Data
%J International Journal of Computer Applications
%@ 0975-8887
%V 109
%N 5
%P 38-40
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Clustering is an unsupervised approach to extract hidden patterns from the datasets. There are certain challenges in clustering, though it is very much difficult to produce good clustering, researchers have provided the solutions through various hybrid approaches. The proposed work is based on enhancing the clustering results by using two algorithms: First Candidate Group Search (CGS) is used to produce clusters and Genetic algorithm (GA). A CGS can be applied to large dataset with less computational time, but the drawback is it can't results in global optima. Hence GA is used for further optimization. Both algorithms will produce optimized clusters.

References
  1. H. Jiang, S. Yi, J. Li, F. Yang, X. Hu, "Ant clustering algorithm with k-harmonic means clustering", 2010.
  2. Hua Jiang, Shenghe Yi, Jing Li, Fengqin Yang, Xin Hu, "Ant clustering algorithm with K-harmonic means clustering", 2010.
  3. Cheng Huang Hung, Hua-Min Chiou, Wei-Ning Yang, "Candidate groups search for K-harmonic means data clustering", Applied Mathematical Modelling, Elsevier, 2013.
  4. Habiba Drias, Ilyes Khennak, Anis B, "A Hybrid Genetic Algorithm for large scale Information Retrieval", 2009.
  5. http://research. ijcaonline. org/volume88/number17/pxc3894002. pdf, "Introducing Hybrid model for Data Clustering using K-Harmonic Means Gravitational Search Algorithms", 2014.
  6. Zulal Gungor, Alper Unler, "K-Harmonic means data clustering with tabu-search method", Applied Mathematical Modelling, Elsevier, 2007.
  7. YusenLi a, JunYu b, DapengTao, "Genetic algorithm for spanning tree construction in P2P distributed interactive applications", Neurocomputing, Elsevier, 2014.
  8. Yuan Chen, Zhi-Ping Fan, Jian Ma, Shuo Zeng, "A hybrid grouping genetic algorithm for reviewer group construction problem", The Expert Systems with Applications, Elsevier, 2011.
  9. Abdolreza Hatamlou, SalwaniAbdullah, HosseinNezamabadi-pour, "A combined approach for clustering based on K-means and gravitational search algorithms", Swarm and Evolutionary Computation, Elsevier, 2012.
  10. Kweku-Muata, Osei-Bryson, "Towards supporting expert evalution of clustering results using a data mining process model", 2009.
  11. Yi Hong, Sam Kwong, "To combine steady-state genetic algorithm and ensemble learning for data clustering", 2008.
  12. Jiawei Han, By Han Kamber, "Data Mining Concept and Techniques", 2nd Edition.
  13. Ashok Kumar Thavani Andu, Dr Antony Selvdoss Thanamani, "Multidimensional Clustering Methods of Data Mining for Industrial Applications", 2013
Index Terms

Computer Science
Information Sciences

Keywords

Clustering Candidate Group Search Genetic algorithm global optima.