Skip to main content
SpringerLink
Log in

A K-medoids Clustering Algorithm with Initial Centers Optimized by a P System

  • Conference paper
  • First Online:
Human Centered Computing (HCC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8944))

Included in the following conference series:

Abstract

In this paper an improved K-medoids algorithm by a specific P system is proposed which extends the application of membrane computing. The traditional K-medoids clustering results vary accordingly to the initial centers which are selected randomly. In order to conquer the defect, we improve the algorithm by selecting the k initial centers based on the density parameter of data points. P system is adequate to solve clustering problem for its high parallelism and lower computational time complexity. A specific P system with the aim of realizing the improved K-medoids algorithm to form clusters is constructed. By computation of the designed system, it obtains one possible clustering result in a non-deterministic and maximal parallel way. Through example verification, it can improve the quality of clustering.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Han, J. Kambr, M.: Data Mining Concepts and Techniques, ch.8. Elsevier Inc., USA (2012)

    Google Scholar 

  2. Zhang, Y., Cheng, E.: An Optimized Method for Selection of the Initial Centers of K-Means Clustering. In: Qin, Z., Huynh, V.-N. (eds.) IUKM 2013. LNCS, vol. 8032, pp. 149–156. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Khan, S.S., Ahmadb, A.: Cluster center initialization algorithm for K-means clustering. Pattern Recognition Letters 25(11), 1293–1302 (2004)

    Article  Google Scholar 

  4. Park, H.S., Jun, C.H.: A simple and fast algorithm for K-medoids clustering. Expert Systems with Applications 36(2), 3336–3341 (2009)

    Article  Google Scholar 

  5. Ester, M., Kriedel, H., Sander, J., et al.: A Density-Based Algorithm for Discovering clustering Clusters in large spatial database with Noise. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, Portland, USA, pp. 226–231 (1996)

    Google Scholar 

  6. Paun, G.: A quick introduction to membrane computing. The Journal of Logic and Algebraic Programing 79, 291–294 (2010)

    Article  MATH  Google Scholar 

  7. Paun, G., Rozenberg, G., Salomaa, A.: Membrane Computing, pp. 282–301. Oxford University Press, New York (2010)

    Google Scholar 

  8. Zhao, Y., Liu, X., Qu, J.: The K-medoids clustering algorithm by a class of P system. Information and Computational Science 9(18) (2012)

    Google Scholar 

  9. Han, L., Xiang, L., Liu, X., Luan, J.: The K-medoids Algorithm with Initial Centers Optimized Based on a P System. Information and Computational Science 11(6) (2014)

    Google Scholar 

  10. Pérez Jiménez, M.J., Romero Campero, F.J.: Attacking the Common Algorithmic Problem by Recognizer P Systems. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 304–315. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Management Science and Engineering, Shandong Normal University, Jinan, China

    Qian Li

  2. College of Management Science and Engineering, Shandong Normal University, East of Wenhua Road, No. 88, Jinan, 250014, Shandong, China

    Xiyu Liu

Authors
  1. Qian Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiyu Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiyu Liu .

Editor information

Editors and Affiliations

  1. Wuhan University of Technology, Wuhan, China

    Qiaohong Zu

  2. Fujitsu Laboratories of Europe, Middlesex, United Kingdom

    Bo Hu

  3. Fudan University, Shanghai, China

    Ning Gu

  4. Telecommunications and Information Communication Technology, National Institute of Posts, Phnom Penh, Cambodia

    Sopheap Seng

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Li, Q., Liu, X. (2015). A K-medoids Clustering Algorithm with Initial Centers Optimized by a P System. In: Zu, Q., Hu, B., Gu, N., Seng, S. (eds) Human Centered Computing. HCC 2014. Lecture Notes in Computer Science(), vol 8944. Springer, Cham. https://doi.org/10.1007/978-3-319-15554-8_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15554-8_40

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15553-1

  • Online ISBN: 978-3-319-15554-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation