Skip to main content
SpringerLink
Log in

Clustering

  • Chapter
Pattern Recognition

Part of the book series: Undergraduate Topics in Computer Science ((UTICS,volume 0))

  • 5366 Accesses

Abstract

In this chapter, we will deal with the process of clustering, providing a special emphasis on various frequently used clustering algorithms.

Clustering is the process of grouping a set of patterns. It generates a partition consisting of cohesive groups or clusters from a given collection of patterns as depicted in Figure 9.1. Representations or descriptions of the clusters formed are used in decision making—classification is one of the popular decision-making paradigms used.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.95
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.

Bibliography

  1. Al-Sultan, K. S. A Tabu search approach to the clustering problem. Pattern Recognition 28: 1443–1451. 1995.

    Article  Google Scholar 

  2. Asharaf, S., M. Narasimha Murty. An adaptive rough fuzzy single pass algorithm for clustering large data sets. Pattern Recognition 36(12): 3015–3018.

    Google Scholar 

  3. Bagirov, Adil M. Modified global k-means algorithmforminimum sum-of-squares clustering problems. Pattern Recognition 41(10): 3192–3199. 2008.

    Article  MATH  Google Scholar 

  4. Bicego,Manuele, Mario A.T. Figueiredo. Soft clustering using weighted one-class support vector machines. Pattern Recognition 42(1): 27–32. 2009.

    Article  MATH  Google Scholar 

  5. Chan, Elaine Y., Wai Ki Ching, Michael K. Ng, Joshua Z. Huang. An optimization algorithmfor clustering using weighted dissimilarity measures. Pattern Recognition 37(5): 943–952. 2004.

    Article  MATH  Google Scholar 

  6. Chang, Dong-Xia, Xian-Da Zhang and Chang-Wen Zheng. A genetic algorithm with gene rearrangement for k-means clustering. Pattern Recognition 42(7): 1210–1222. 2009.

    Article  Google Scholar 

  7. Dougherty, Edward R., Marcel Brun. A probabilistic theory of clustering. Pattern Recognition 37(5): 917–925.

    Google Scholar 

  8. Duda, R.O., P.E. Hart, D.G. Stork. Pattern Classification. John Wiley and Sons. 2000.

    Google Scholar 

  9. Filippone, Maurizio, Francesco Camastra, Francesco Masulli, Stefano Rovetta. A survey of kernel and spectral methods for clustering. Pattern Recognition 41(1): 176–190. 2008.

    Article  MATH  Google Scholar 

  10. Gançarski, P., A. Blansché, A. Wania. Comparison between two co-evolutionary feature weighting algorithms in clustering. Pattern Recognition 41(3): 983–994. 2008.

    Article  MATH  Google Scholar 

  11. Jain, A.K. M. Narasimha Murty, P.J. Flynn. cata Clustering: A Review. ACM Computing Surveys 31(3): 264–329. 1999.

    Article  Google Scholar 

  12. Klein, R.W. and R.C.Dubes. Experiments in projection and clustering by simulated annealing. Pattern Recognition 22: 213–220. 1989.

    Article  MATH  Google Scholar 

  13. Likas, Aristidis, Nikos Vlassis, Jakob J. Verbeek. The global k-means clustering algorithm. Pattern Recognition 36(2): 451–461. 2003.

    Article  Google Scholar 

  14. Liu, Manhua, Xudong Jiang, Alex C. Kot. A multi-prototype clustering algorithm. Pattern Recognition 42(5): 689–698. 2009.

    Article  MATH  Google Scholar 

  15. Lughofer, Edwin. Extensions of vector quantization for incremental clustering. Pattern Recognition 41(3): 995–1011. 2008.

    Article  MATH  Google Scholar 

  16. Spath, H. Cluster Analysis: Algorithms for Data Reduction and Classification of Objects. West Sussex, U. K.: Ellis Horwood. 1980.

    Google Scholar 

  17. Wu, Kuo-Lung, Miin-Shen Yang. Alternative c-means clustering algorithms. Pattern Recognition 35(10): 2267–2278. 2002.

    Article  MATH  Google Scholar 

  18. Xiang, Shiming, Feiping Nie, Changshui Zhang. Learning a Mahalanobis distance metric for data clustering and classification. Pattern Recognition 41(12): 3600– 3612. 2008.

    Article  MATH  Google Scholar 

  19. Xiong, Yimin,Dit-Yan Yeung. Time series clustering with ARMA mixtures. Pattern Recognition 37(8): 1675–1689. 2004.

    Article  MATH  Google Scholar 

  20. Yousri, Noha A., Mohamed S. Kamel, Mohamed A. Ismai. A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities. Pattern Recognition 42(7): 1193–1209. 2009.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Automation, Indian Institute of Science, Bangalore, India

    Prof. M. Narasimha Murty & Dr. V. Susheela Devi

Authors
  1. Prof. M. Narasimha Murty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dr. V. Susheela Devi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Narasimha Murty .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Universities Press (India) Pvt. Ltd.

About this chapter

Cite this chapter

Murty, M.N., Devi, V.S. (2011). Clustering. In: Pattern Recognition. Undergraduate Topics in Computer Science, vol 0. Springer, London. https://doi.org/10.1007/978-0-85729-495-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-0-85729-495-1_9

  • Publisher Name: Springer, London

  • Print ISBN: 978-0-85729-494-4

  • Online ISBN: 978-0-85729-495-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation