Skip to main content
SpringerLink
Log in

A Three-Way Decisions Approach to “”Density-Based Overlapping Clustering

  • Chapter
Transactions on Rough Sets XVIII

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 8449))

Abstract

Most of clustering methods assume that each object must be assigned to exactly one cluster, however, overlapping clustering is more appropriate than crisp clustering in a variety of important applications such as the network structure analysis and biological information. This paper provides a three-way decisions approach for overlapping clustering based on the decision-theoretic rough set model, where each cluster is described by an interval set which is defined by a pair of sets called the lower and upper bounds, and the overlapping objects usually are distributed in the region between the lower and upper regions. Besides, a density-based clustering algorithm is proposed using the approach considering the advantages of the density-based clustering algorithms in finding the arbitrary shape clusters. The results of comparison experiments show that the three-way decisions approach is not only effective to overlapping clustering but also good at discovering the arbitrary shape clusters.

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 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

References

  1. Asharaf, S., Murty, M.N.: An adaptive rough fuzzy single pass algorithm for clustering large data sets. Pattern Recogn. 36(12), 3015–3018 (2003)

    Article  Google Scholar 

  2. Aydin, N., Naït-Abdesselam, F., Pryyma, V., Turgut, D.: Overlapping clusters algorithm in ad hoc networks. In: 2010 IEEE Global Telecommunications Conference, pp. 1–5 (2010)

    Google Scholar 

  3. Chameleon data sets: http://glaros.dtc.umn.edu/gkhome/cluto/download

  4. Chen, M., Miao, D.Q.: Interval set clustering. Expert Syst. Appl. 38, 2923–2932 (2011)

    Article  Google Scholar 

  5. Duan, L., Xu, L.D., Guo, F., Lee, J., Yan, B.P.: A local-density based spatial clustering algorithm with noise. Inf. Syst. 32(7), 978–986 (2007)

    Article  Google Scholar 

  6. Ester, M., Kriegel, H.P., Sander, J., Xu, X.W.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD (1996)

    Google Scholar 

  7. Fu, Q., Banerjee, A.: Multiplicative mixture models for overlapping clustering. In: IEEE International Conference on Data Mining, pp. 791–797 (2003)

    Google Scholar 

  8. Herbert, J.P., Yao, J.T.: Learning optimal parameters in decision-theoretic rough sets. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds.) RSKT 2009. LNCS (LNAI), vol. 5589, pp. 610–617. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Lingras, P., Bhalchandra, P., Khamitkar, S., Mekewad, S., Rathod, R.: Crisp and soft clustering of mobile calls. In: Sombattheera, C., Agarwal, A., Udgata, S.K., Lavangnananda, K. (eds.) MIWAI 2011. LNCS (LNAI), vol. 7080, pp. 147–158. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Lingras, P., Yao, Y.Y.: Time complexity of rough clustering: GAs versus K-means. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 263–270. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Liu, D., Yao, Y.Y., Li, T.R.: Three-way investment decisions with decision-theoretic rough sets. Int. J. Comput. Intell. Syst. 4(1), 66–74 (2011)

    Article  Google Scholar 

  12. Ma, S., Wang, T.J., Tang, S.W., Yang, D.Q., Gao, J.: A fast clustering algorithm based on reference and density. J. Softw. 14(6), 1089–1095 (2003)

    MATH  Google Scholar 

  13. Obadi, G., Dráždilová, P., Hlaváček, L., Martinovič, J., Snášel, V.: A tolerance rough set based overlapping clustering for the DBLP data. In: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, pp. 57–60 (2010)

    Google Scholar 

  14. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11(5), 341–356 (1982)

    Article  Google Scholar 

  15. Pawlak, Z.: Rough classification. Int. J. Man-Mach. Stud. 20(5), 469–483 (1984)

    Article  Google Scholar 

  16. Ren, Y., Liu, X.D., Liu, W.Q.: DBCAMM: a novel density based clustering algorithm via using the Mahalanobis metric. Appl. Soft Comput. 12(5), 1542–1554 (2010)

    Article  Google Scholar 

  17. Sander, J., Ester, M., Kriegel, H.P., Xu, X.W.: Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Min. Knowl. Disc. 2(2), 169–194 (1998)

    Article  Google Scholar 

  18. Subramaniam, S., Palpanas, T., Papadopoulos, D., Kalogeraki, V., Gunopulos, D.: Online outlier detection in sensor data using non-parametric models. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 187–198 (2006)

    Google Scholar 

  19. Takaki, M.: A extraction method of overlapping cluster based on network structure analysis. In: IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology, pp. 212–217 (2007)

    Google Scholar 

  20. Tsai, C.-F., Liu, C.-W.: KIDBSCAN: a new efficient data clustering algorithm. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol. 4029, pp. 702–711. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  21. Weller, A.C.: Editorial Peer Review: Its Strengths & Weaknesses. Information Today Inc., Medford (2001)

    Google Scholar 

  22. Wu, X.H., Zhou, J.J.: Possibilistic fuzzy c-means clustering model using kernel methods. In: Proceeding of the 2005 International Conference on Computational Intelligence for Modelling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC’05), vol. 2, pp. 465–470 (2005)

    Google Scholar 

  23. Yao, Y.Y.: Three-way decisions with probabilistic rough sets. Inf. Sci. 180(3), 341–353 (2010)

    Article  MathSciNet  Google Scholar 

  24. Yao, Y.Y.: The superiority of three-way decisions in probabilistic rough set models. Inf. Sci. 181(6), 1080–1096 (2011)

    Article  MathSciNet  Google Scholar 

  25. Yao, Y.Y., Lingras, P., Wang, R.Z., Miao, D.Q.: Interval set cluster analysis: a re-formulation. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS (LNAI), vol. 5908, pp. 398–405. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  26. Yao, Y.Y., Wong, S.K.M.: A decision theoretic framework for approximating concepts. Int. J. Man-Mach. Stud. 37(6), 793–809 (1992)

    Article  Google Scholar 

  27. Yousri, N.A., Kamel, M.S., Ismail, M.A.: A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds.) ICONIP 2012, Part III. LNCS, vol. 7665, pp. 577–584. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  28. Yu, H., Luo, H.: A novel possibilistic fuzzy leader clustering algorithm. Int. J. Hybrid Intell. Syst. 8(1), 31–40 (2011)

    Article  MathSciNet  Google Scholar 

  29. Zhou, B., Yao, Y.Y., Luo, J.G.: A three-way decision approach to email spam filtering. In: Farzindar, A., Kešelj, V. (eds.) Canadian AI 2010. LNCS (LNAI), vol. 6085, pp. 28–39. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  30. Lusseau, D., Newman, M.E.J.: Identifying the role that animals play in their social networks. Proc. R. Soc. Lond. Ser. B Biol. Sci. 271(Suppl 6), S477–S481 (2004)

    Google Scholar 

Download references

Acknowledgments

This work was supported in part by the China NSFC grant (No.61379114 & No.61272060).

Author information

Authors and Affiliations

  1. Chongqing Key Laboratory of Computational Intelligence, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China

    Hong Yu, Ying Wang & Peng Jiao

Authors
  1. Hong Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peng Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong Yu .

Editor information

Editors and Affiliations

  1. ECE Department Computational Intelligence Laboratory, University of Manitoba, Winnipeg, MB, Canada

    James F. Peters

  2. University of Warsaw, Warsaw, Poland

    Andrzej Skowron  & Hung Son Nguyen  & 

  3. Southwest Jiaotong University, Sichuan, China

    Tianrui Li  & Yan Yang  & 

  4. University of Regina, Regina, SK, Canada

    JingTao Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Yu, H., Wang, Y., Jiao, P. (2014). A Three-Way Decisions Approach to “”Density-Based Overlapping Clustering. In: Peters, J.F., Skowron, A., Li, T., Yang, Y., Yao, J., Nguyen, H.S. (eds) Transactions on Rough Sets XVIII. Lecture Notes in Computer Science(), vol 8449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44680-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44680-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44679-9

  • Online ISBN: 978-3-662-44680-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation