Skip to main content

Supercluster in Statics and Dynamics: An Approximate Structure Imitating a Rough Set

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2017)

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

Included in the following conference series:

Abstract

We present a new method for cluster analysis that finds a composite “supercluster” consisting of two non-overlapping parts: a tight core and a less connected shell. We expand this approach to data that changes over time by assuming that the core is unchangeable, while the shell depends on the time period. We define a data recovery approximation model of a dynamic supercluster, and present a suboptimal algorithm for finding superclusters.

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

Access this chapter

Institutional subscriptions

References

  1. Bezdek, J.C., et al.: Fuzzy Models and Algorithms for Pattern Recognition and Image Processing, vol. 4. Springer Science & Business Media, New York (2006)

    Google Scholar 

  2. Ho, T.B., Nguyen, N.B.: Nonhierarchical document clustering based on a tolerance rough set model. Int. J. Intell. Syst. 17(2), 199–212 (2002)

    Article  MathSciNet  Google Scholar 

  3. Lingras, P.: Rough set clustering for web mining. In: Proceedings of the 2002 IEEE International Conference on Fuzzy Systems, Fuzzy Systems, 2002, FUZZ-IEEE 2002, vol. 2, pp. 1039–1044 (2002)

    Google Scholar 

  4. Pedrycz, W.: Knowledge-Based Clustering: From Data to Information Granules. Wiley, Hoboken (2005)

    Book  Google Scholar 

  5. Zhou, J., Pedrycz, W., Miao, D.: Shadowed sets in the characterization of rough-fuzzy clustering. Pattern Recogn. 44(8), 1738–1749 (2011)

    Article  Google Scholar 

  6. Mirkin, B., Muchnik, I.: Layered clusters of tightness set functions. Appl. Math. Lett. 15(2), 147–151 (2002)

    Article  MathSciNet  Google Scholar 

  7. Lingras, P., West, C.: Interval set clustering of web users with rough k-means. J. Intell. Inf. Syst. 23(1), 5–16 (2004)

    Article  Google Scholar 

  8. Peters, G., Crespo, F., Lingras, P., Weber, R.: Soft clustering-fuzzy and rough approaches and their extensions and derivatives. Int. J. Approx. Reason. 54(2), 307–322 (2013)

    Article  MathSciNet  Google Scholar 

  9. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data, vol. 9. Springer Science & Business Media, Dordrecht (2012)

    MATH  Google Scholar 

  10. Mirkin, B.: Clustering: A Data Recovery Approach. CRC Press, Boca Raton (2012)

    Book  Google Scholar 

  11. Martin, G.R.R.: A Song of Ice and Fire, Books 1–4. Bantam, New York (2011)

    Google Scholar 

  12. Rodin, I., et al.: Visualization of dynamic reference graphs. In: Proceedings of the 10th Workshop on Graph-Based Methods for Natural Language Processing, NAACL, vol. 16 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ivan Rodin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Rodin, I., Mirkin, B. (2017). Supercluster in Statics and Dynamics: An Approximate Structure Imitating a Rough Set. In: Polkowski, L., et al. Rough Sets. IJCRS 2017. Lecture Notes in Computer Science(), vol 10313. Springer, Cham. https://doi.org/10.1007/978-3-319-60837-2_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60837-2_46

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60836-5

  • Online ISBN: 978-3-319-60837-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics