Skip to main content

Interval Set Cluster Analysis: A Re-formulation

  • Conference paper

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

Abstract

A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single set as the representation of a cluster, each cluster is represented by an interval set that is defined by a pair of sets called the lower and upper bounds. Elements in the lower bound are typical elements of the cluster and elements between the upper and lower bounds are fringe elements of the cluster. A cluster is therefore more realistically characterized by a set of core elements and a set of boundary elements. Two types of interval set clusterings are proposed, one is non-overlapping lower bound interval set clustering and the other is overlapping lower bound interval set clusterings, corresponding to the standard partition based and covering based clusterings.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderberg, M.R.: Cluster Analysis for Applications. Academic Press, New York (1973)

    MATH  Google Scholar 

  2. Brink, C.: Power structures. Algebra Universalis 30, 177–216 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Höppner, F., Klawonn, F., Kruse, R., Runkler, T.: Fuzzy Cluster Analysis: Methods for Classification, Data Analysis and Image Recognition. Wiley, Chichester (1999)

    MATH  Google Scholar 

  4. Iwiński, T.B.: Algebraic approach to rough sets. Bulletin of the Polish Academy of Sciences, Mathematics 35, 673–683 (1987)

    MATH  MathSciNet  Google Scholar 

  5. Marek, V.W., Truszczyński, M.: Contributions to the theory of rough sets. Fundamenta Informaticae 39, 389–409 (1999)

    MATH  MathSciNet  Google Scholar 

  6. Lingras, P.: Rough K-Medoids clustering using GAs. In: Proceedings of the 8th IEEE International Conference on Cognitive Informatics, pp. 315–319 (2009)

    Google Scholar 

  7. Lingras, P., Hogo, M., Snorek, M.: Interval set clustering of web users using modified Kohonen self-organizing maps based on the properties of rough sets. Web Intelligence and Agent Systems: An International Journal 2, 217–230 (2004)

    Google Scholar 

  8. Lingras, P., Hogo, M., Snorek, M., West, C.: Temporal analysis of clusters of supermarket customers: conventional versus interval set approach. Information Sciences 172, 215–240 (2005)

    Article  Google Scholar 

  9. Lingras, P., West, C.: Interval set clustering of web users with rough K-Means. Journal of Intelligent Information Systems 23, 5–16 (2004)

    Article  MATH  Google Scholar 

  10. Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)

    MATH  Google Scholar 

  11. Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  12. Wang, Y.Q., Zhang, X.H.: Some implication operators on interval sets and rough sets. In: Proceedings of 2009 IEEE International Conference on Cognitive Informatics, pp. 328–332 (2009)

    Google Scholar 

  13. Yao, Y.Y.: Interval-set algebra for qualitative knowledge representation. In: Proceedings of the Fifth International Conference on Computing and Information, pp. 370–374 (1993)

    Google Scholar 

  14. Yao, Y.Y.: Two views of the theory of rough sets in finite universes. International Journal of Approximation Reasoning 15, 291–317 (1996)

    Article  MATH  Google Scholar 

  15. Yao, Y.Y.: Probabilistic rough set approximations. International Journal of Approximation Reasoning 49, 255–271 (2008)

    Article  Google Scholar 

  16. Yao, Y.Y.: Interval sets and interval-set algebras. In: Proceedings of the 8th IEEE International Conference on Cognitive Informatics, pp. 307–314 (2009)

    Google Scholar 

  17. Yao, Y.Y., Wong, S.K.M.: A decision theoretic framework for approximating concepts. International Journal of Man-machine Studies 37, 793–809 (1992)

    Article  Google Scholar 

  18. Zadeh, L.A.: Fuzzy sets. Information and Control 8, 338–353 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  19. Zhang, X.H., Jia, X.Y.: Lattice-valued interval sets and t-representable interval set t-norms. In: Proceedings of 2009 IEEE International Conference on Cognitive Informatics, pp. 333–337 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yao, Y., Lingras, P., Wang, R., Miao, D. (2009). Interval Set Cluster Analysis: A Re-formulation. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2009. Lecture Notes in Computer Science(), vol 5908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10646-0_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10646-0_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10645-3

  • Online ISBN: 978-3-642-10646-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics