Skip to main content

Efficient Joint Clustering Algorithms in Optimization and Geography Domains

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5012))

Included in the following conference series:

Abstract

Prior works have elaborated on the problem of joint clustering in the optimization and geography domains. However, prior works neither clearly specify the connected constraint in the geography domain nor propose efficient algorithms. In this paper, we formulate the joint clustering problem in which a connected constraint and the number of clusters should be specified. We propose an algorithm K-means with Local Search (abbreviated as KLS) to solve the joint clustering problem with the connected constraint. Experimental results show that KLS can find correct clusters efficiently.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Basu, S., Davidson, I.: Clustering with constraints: Theory and practice. In: ACM SIGKDD tutorial (2006)

    Google Scholar 

  2. Davidson, I., Ravi, S.S.: Clustering with constraints: Feasibility issues and the k-means algorithm. In: SDM (2005)

    Google Scholar 

  3. Lin, C.R., Liu, K.H., Chen, M.S.: Dual clustering: Integrating data clustering over optimization and constraint domains. IEEE Trans. on Knowledge and Data Engineering 17, 628–637 (2005)

    Article  Google Scholar 

  4. Moser, F., Ge, R., Ester, M.: Joint cluster analysis of attribute and relationship data withouta-priori specification of the number of clusters. In: ACM SIGKDD (2007)

    Google Scholar 

  5. Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice Hall, Englewood Cliffs (2002)

    Google Scholar 

  6. Tai, C.H., Dai, B.R., Chen, M.S.: Incremental clustering in geography and optimization spaces. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 272–283. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: ICML (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Takashi Washio Einoshin Suzuki Kai Ming Ting Akihiro Inokuchi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lo, CH., Peng, WC. (2008). Efficient Joint Clustering Algorithms in Optimization and Geography Domains. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2008. Lecture Notes in Computer Science(), vol 5012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68125-0_97

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68125-0_97

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68124-3

  • Online ISBN: 978-3-540-68125-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics