Open Access   Article Go Back

Hybrid Optimized Algorithms for Solving Clustering Problems in Data Mining

S. Karthikeyan1 , A.Dhakshina Moorthy2

Section:Survey Paper, Product Type: Journal Paper
Volume-7 , Issue-4 , Page no. 928-932, Apr-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i4.928932

Online published on Apr 30, 2019

Copyright © S. Karthikeyan, A.Dhakshina Moorthy . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: S. Karthikeyan, A.Dhakshina Moorthy , “Hybrid Optimized Algorithms for Solving Clustering Problems in Data Mining,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.4, pp.928-932, 2019.

MLA Style Citation: S. Karthikeyan, A.Dhakshina Moorthy "Hybrid Optimized Algorithms for Solving Clustering Problems in Data Mining." International Journal of Computer Sciences and Engineering 7.4 (2019): 928-932.

APA Style Citation: S. Karthikeyan, A.Dhakshina Moorthy , (2019). Hybrid Optimized Algorithms for Solving Clustering Problems in Data Mining. International Journal of Computer Sciences and Engineering, 7(4), 928-932.

BibTex Style Citation:
@article{Karthikeyan_2019,
author = {S. Karthikeyan, A.Dhakshina Moorthy },
title = {Hybrid Optimized Algorithms for Solving Clustering Problems in Data Mining},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {4 2019},
volume = {7},
Issue = {4},
month = {4},
year = {2019},
issn = {2347-2693},
pages = {928-932},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=4143},
doi = {https://doi.org/10.26438/ijcse/v7i4.928932}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i4.928932}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=4143
TI - Hybrid Optimized Algorithms for Solving Clustering Problems in Data Mining
T2 - International Journal of Computer Sciences and Engineering
AU - S. Karthikeyan, A.Dhakshina Moorthy
PY - 2019
DA - 2019/04/30
PB - IJCSE, Indore, INDIA
SP - 928-932
IS - 4
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
327 240 downloads 126 downloads
  
  
           

Abstract

In this paper, Cluster analysis is a group objects like observations, events etc based on the information that are found in the data describing the objects or their relations. The main goal of the clustering is that the objects in a group will be similar or related to one other and different from (or unrelated to) the objects in other groups. Extracting relevant information from large database is attaining huge significance. Clustering of relevant information from large database becomes difficult. The major objective of this work is to proposed novel clustering methods for solving clustering problem. It is used to separate the data set into a significant set of reciprocally limited clusters with respect to relationship of data and it is used to create the more number of data in the same manner surrounded by a group and extra various among groups. Data clustering is a vital concept of mining as it partitions the given dataset into meaningful set of clusters based on data similarity. This concept enhances the computation efficiency in the data analysis processes

Key-Words / Index Term

Clustering, ABC Algorithm, PSO and FA Algorithm, MOSSSA-HAC, MOSSCS-MHAC Algorithms

References

1. Abraham, Ajith, Swagatam Das, and Amit Konar, 2007. "Kernel based automatic clustering using modified particle swarm optimization algorithm." InProceedings of the 9th annual conference on Genetic and evolutionary computation, pp. 2-9. ACM, 2007.
2. Hassanzadeh, Tahereh, and Mohammad Reza Meybodi, 2012. "A new hybrid approach for data clustering using firefly algorithm and K-means." Artificial Intelligence and Signal Processing (AISP), 16th CSI International Symposium on. IEEE, 2012.
3. Tapas Kanungo, David M Mount, Nathan S Netanyahu, Christine D Piatko, Ruth Silverman, Angela Y Wu, 2002. "An efficient k-means clustering algorithm: Analysis and implementation." IEEE transactions on pattern analysis and machine intelligence 24.7: 881-892.
4. Xiaohui Yan, Yunlong Zhu, Wenping Zou, and Liang Wang, 2012. "A new approach for data clustering using hybrid artificial bee colony algorithm." Neurocomputing 97 : 241-250.
5. Yunfeng Xu, Ping Fan, and Ling Yuan, 2013. "A simple and efficient artificial bee colony algorithm." Mathematical Problems in Engineering 2013.
6. Sangeetha, J., and V. Sinthu Janita Prakash. "An Efficient Inclusive Similarity Based Clustering (ISC) Algorithm for Big Data." Computing and Communication Technologies (WCCCT), 2017 World Congress on. IEEE, 2017.
7. Tanır, Deniz, and Fidan Nuriyeva. "An effective method determining the initial cluster centers for K-means for clustering gene expression data." Computer Science and Engineering (UBMK), 2017 International Conference on. IEEE, 2017.
8. International Journal of Scientific Research in Computer Sciences and Engineering (ISSN: 2320-7639)
9. International Journal of Scientific Research in Network Security and Communication (ISSN: 2321-3256) .
10. Gan, G., J. Wu, and Z. Yang, 2009. "A genetic fuzzy k-Modes algorithm for clustering categorical data." Expert Systems with Applications 36.2 : 1615-1620.