Skip to main content
SpringerLink
Log in

Homogeneity Separateness: A New Validity Measure for Clustering Problems

  • Conference paper
ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol I

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 248))

Abstract

Several validity indices have been designed to evaluate solutions obtained by clustering algorithms. Traditional indices are generally designed to evaluate center-based clustering, where clusters are assumed to be of globular shapes with defined centers or representatives. Therefore they are not suitable to evaluate clusters of arbitrary shapes, sizes and densities, where clusters have no defined centers or representatives. In this work, HS (Homogeneity Separateness) validity measure based on a different shape is proposed. It is suitable for clusters of any shapes, sizes and/or of different densities. The main concepts of the proposed measure are explained and experimental results on both synthetic and real life data set that support the proposed measure are given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hartigan, J.A.: Clustering Algorithms. Wiley Series in Probability and Mathematical statistics (1975)

    Google Scholar 

  2. Milligan, G.W., Cooper, M.C.: An examination of procedures for determining the number of clusters in a data set. Psychimetrika 50, 159–179 (1985)

    Article  Google Scholar 

  3. Dubes, R., Jain, A.K.: Validity studies in clustering methodologies. Pattern Recognition 11, 235–253 (1979)

    Article  MATH  Google Scholar 

  4. Chou, C.-H., Su, M.-C., Lai, E.: A new cluster validity measure and its application to image compression. Pattern Anal. Applic. 7, 205–220 (2004), doi:10.1007/s10044-004-0218-1

    Article  MathSciNet  Google Scholar 

  5. Gath, I., Geva, A.B.: Unsupervised optimal fuzzy clustering. IEEE Trans. Pattern Anal. Machine Intell. 11, 773–781 (1989)

    Article  Google Scholar 

  6. Gustafson, D.E., Kessel, W.C.: Fuzzy clustering with a fuzzy covariance matrix. In: Proceedings of the IEEE Conference on Decision and Control, San Diego, pp. 761–766 (January 1979)

    Google Scholar 

  7. Halkidi, M., Vazirgiannis, M.: Clustering validity assessment: Finding the optimal partitioning of a data set. In: Proc. IEEE ICDM, San Jose, CA, pp. 187–194 (2001)

    Google Scholar 

  8. Babuška, R., van der Veen, P.J., Kaymak, U.: Improved Covariance Estimation for Gustafson-Kessel Clustering, 0-7803-7280-8/02/$10.00 ©2002. IEEE (2002)

    Google Scholar 

  9. Prim, R.: Shortest connection networks and some generalization. Bell Systems Technical Journal 36, 1389–1401 (1957)

    Article  Google Scholar 

  10. Kruskal, J.: On the shortest spanning subtree and the travelling salesman problem. In: Proceedings of the American Mathematical Society, pp. 48–50 (1956)

    Google Scholar 

  11. Nesetril, J., Milkova, E., Nesetrilova, H.: Otakar boruvka on minimum spanning tree problem: Translation of both the 1926 papers, comments, history. DMATH: Discrete Mathematics 233 (2001)

    Google Scholar 

  12. Zahn, C.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers C-20, 68–86 (1971)

    Article  Google Scholar 

  13. Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Springer, Newyork (1985)

    Book  Google Scholar 

  14. Asano, T., Bhattacharya, B., Keil, M., Yao, F.: Clustering Algorithms based on minimum and maximum spanning trees. In: Proceedings of the 4th Annual Symposium on Computational Geometry, pp. 252–257 (1988)

    Google Scholar 

  15. Dunn, J.C.: A Fuzzy Relative of the ISODATA Process and its Use in Detecting Compact Well-Separated Clusters. Journal Cybern. 3(3), 32–57 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  16. Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Analysis and Machine Intelligence 1(4), 224–227 (1979)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of CSE, GMR Institute of Technology, Rajam, Srikakulam (Dist), A.P., India

    M. Ramakrishna Murty

  2. Dept. of CSE, JNTUK, Kakinada, A.P., India

    J. V. R. Murthy

  3. Dept. of CS&SE, Andhra University, Visakhapatnam, A.P., India

    P. V. G. D. Prasad Reddy

  4. Majhighariani Institute of Technology and Sciences, Rayagada, India

    Anima Naik

  5. Dept. of CSE, ANITS, Visakhapatna, A.P., India

    Suresh. C. Satapathy

Authors
  1. M. Ramakrishna Murty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. V. R. Murthy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. V. G. D. Prasad Reddy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Anima Naik
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Suresh. C. Satapathy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Ramakrishna Murty .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, Anil Neerukonda Institute of Technology and Sciences, Vishakapatnam, India

    Suresh Chandra Satapathy

  2. College of Engineering(A), Andhra University, Vishakapatnam, India

    P. S. Avadhani

  3. University of Hyderabad, Hyderabad, India

    Siba K. Udgata

  4. CSIR-National Institute of Oceanography, Visakhapatnam, India

    Sadasivuni Lakshminarayana

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Murty, M.R., Murthy, J.V.R., Reddy, P.V.G.D.P., Naik, A., Satapathy, S.C. (2014). Homogeneity Separateness: A New Validity Measure for Clustering Problems. In: Satapathy, S., Avadhani, P., Udgata, S., Lakshminarayana, S. (eds) ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol I. Advances in Intelligent Systems and Computing, vol 248. Springer, Cham. https://doi.org/10.1007/978-3-319-03107-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03107-1_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03106-4

  • Online ISBN: 978-3-319-03107-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation