Open Access   Article Go Back

Determination of Optimal Number of Clusters in Cure Using Representative Points

Khumukcham Robindro1 , Bisheshwar Khumukcham2 , Ksh. Nilakanta Singh3

  1. Department of Computer Science, Manipur University, Canchipur, Imphal, Manipur, India.
  2. Department of Computer Science, Manipur University, Canchipur, Imphal, Manipur, India.
  3. Department of Computer Science, Manipur University, Canchipur, Imphal, Manipur, India.

Correspondence should be addressed to: rbkh@manipuruniv.ac.in.

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-2 , Page no. 313-320, Feb-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i2.313320

Online published on Feb 28, 2018

Copyright © Khumukcham Robindro, Bisheshwar Khumukcham, Ksh. Nilakanta Singh . 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

XML View
PDF Download

How to Cite this Paper

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

IEEE Style Citation: Khumukcham Robindro, Bisheshwar Khumukcham, Ksh. Nilakanta Singh, “Determination of Optimal Number of Clusters in Cure Using Representative Points,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.313-320, 2018.

MLA Style Citation: Khumukcham Robindro, Bisheshwar Khumukcham, Ksh. Nilakanta Singh "Determination of Optimal Number of Clusters in Cure Using Representative Points." International Journal of Computer Sciences and Engineering 6.2 (2018): 313-320.

APA Style Citation: Khumukcham Robindro, Bisheshwar Khumukcham, Ksh. Nilakanta Singh, (2018). Determination of Optimal Number of Clusters in Cure Using Representative Points. International Journal of Computer Sciences and Engineering, 6(2), 313-320.

BibTex Style Citation:
@article{Robindro_2018,
author = {Khumukcham Robindro, Bisheshwar Khumukcham, Ksh. Nilakanta Singh},
title = {Determination of Optimal Number of Clusters in Cure Using Representative Points},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {2 2018},
volume = {6},
Issue = {2},
month = {2},
year = {2018},
issn = {2347-2693},
pages = {313-320},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1744},
doi = {https://doi.org/10.26438/ijcse/v6i2.313320}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i2.313320}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1744
TI - Determination of Optimal Number of Clusters in Cure Using Representative Points
T2 - International Journal of Computer Sciences and Engineering
AU - Khumukcham Robindro, Bisheshwar Khumukcham, Ksh. Nilakanta Singh
PY - 2018
DA - 2018/02/28
PB - IJCSE, Indore, INDIA
SP - 313-320
IS - 2
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
743 331 downloads 245 downloads
  
  
           

Abstract

In most of the clustering algorithms, the number of clusters has to be supplied in as an input. In CURE clustering algorithm also, the same problem exists. In this paper, we try to find the optimal cluster number in the CURE clustering algorithm by calculating an optimality measure corresponding to each cluster number produced by CURE clustering algorithm after it enters a range ,based on the intra cluster measure and the inter cluster measure of the clusters. The clustering along with the optimality check continues as long the optimality measure is increasing and the cluster number doesn’t fall below the minimum boundary of our range.

Key-Words / Index Term

Algorithm, Clustering, CURE, Measure

References

[1] Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms, The MIT Press, Massachusetts, 1990.
[2] Hanan Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley Publishing Company Inc., New York, 1990.
[3] R.O. Duda, P.E. Hart, D.G. Stork, Pattern Classification, second ed., Wiley-Interscience, New York, 2001.
[4] J.Han, M. Kamber, Data Mining, Morgan Kaufmann Publishers, 2000.
[5] M. Grotschel, L. Lovasz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, second ed., Algorithm and Combinatorics, vol. 2, Springer-Verlag, Berlin, Heidelberg, 1994.
[6] A.K. Jain, M.N. Murty, P.J. Flynn, Data clustering: A review, ACM Computing Surveys 31 (1999) 264–323.
[7] V.V. Vazirani, Approximation Algorithms, Springer, 2001.
[8] Sudipto Guha, Rajeev Rastogi, and Kyuseok Shim (1998) CURE: An Efficient Clustering Algorithm for Large Databases
[9] Siddheswar Ray and Rose H. Turi Determination of Number of Clusters in K-Means Clustering and Application in Colour Image Segmentation.
[10] Ng R., Han J. (1994) Efficient and effective clustering method for spatial data mining. In Proc. Conf. on Very Large Data Bases, pp 144-155.
[11] Ester M., Kriegel H., Sander J., and Xu X. (1996) A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining, AAAI Press.
[12] Hinneburg A., Keim D. (1998) An Efficient Approach to Clustering in Large Multimedia Databases with Noise. Proc AAAI.
[13] Seikholeslami G., Chatterjee S., and Zhang A. WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases. Proceedings of the 24th VLDB Conference, 1998
[14] Guha, S., R. Rastogi & K. Shim. CURE: An Efficient Clustering Algorithm for Large Databases. In Proc. Of ACM SIGMOD Intl. Conf. on Management of Data, pp. 73-82, 1998.
[15] Karypis, G., E. Han & V. Kumar. Chameleon: A hierarchical clustering algorithm using dynamic modeling. IEEE Computer, 32(8) pp. 68-75, 1999.