The Property of Different Granule and Granular Methods Based on Quotient Space

  • Yan-ping ZhangEmail author
  • Ling Zhang
  • Chenchu Xu
Part of the Studies in Big Data book series (SBD, volume 8)


Nowadays, we have entered the era of big data, and we have to deal with complex systems and massive data frequently. Facing complicated objects, how to describe or present objects is the base to solve questions frequently. So we suppose that a problem solving space, or a problem space for short, is described by a triplet (XfΓ), and assume that X is a domain, R is an equivalence relation on X, Г is a topology of X, [X] is a quotient set under R. Regarding [X] as a new domain, we have a new world to analyse and to research this object, consequently we describe or present a question into different granule worlds, these granular worlds are called the quotient space. Further we are able to predigest and solve a question, i.e. we apply quotient space and granulate to represent an object. Comparing rough set and decision-making tree, the quotient space has the stronger representation. Not only it can represent vectors of the problem domain, different structures between vectors, but also it can define different attribute functions and operations etc. In this paper, we discuss the method how to represent and to partition an object in granular worlds, and educe the relationship of different granular worlds and confirm the degree of granule. We will prove three important theorems of different granules, i.e. to preserve false property theorem and to preserve true property theorem. To solve a problem in different granular worlds, the process procedure of quotient approximate will be applied. We also supply an example of solving problem by different granule worlds—the shortest path of a complex network. The example indicates that to describe or present a complicated object is equal to construct quotient space. In quotient set [X], the complexity to solve a problem is lower than X. We have a new solution method to analysis a big data based on the quotient space theory.


Quotient space Granular computing Equivalence relation The shortest path 


  1. 1.
    Zhang, B., Zhang, L.: Theory and Applications of Problem Solving. North Holland (1992)Google Scholar
  2. 2.
    Zhang, B., Zhang, L.: Theory and Applications of Problem Solving. Tsinghua University Publisher, Beijing (1990). (in Chinese)Google Scholar
  3. 3.
    Yao, Y.Y.: Perspectives of granular computing. In: Proceedings of 2005 IEEE International Conference on Granular Computing, vol. 1, pp. 85–90 (2005)Google Scholar
  4. 4.
    Bargiela, A., Pedrycz, W.: Granular Computing: An Introduction. Kluwer Academic Publishers, Boston (2002)Google Scholar
  5. 5.
    Dupre, J.: The Discorder of Things, Mataphysical Foundations of the Disunity of Science. Harvard University Press, Cambridge (1993)Google Scholar
  6. 6.
    Foster, C.L.: Algorithms, Abstraction and Implementation: Levels of Detail in Cognitive Science. Academic Press, London (1992)Google Scholar
  7. 7.
    Giunchglia, F., Walsh, T.: A theory of abstraction. Artif. Intell. 56, 323–390 (1992)CrossRefGoogle Scholar
  8. 8.
    Hobbs, J.R.: Granularity. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp. 432–435 (1985)Google Scholar
  9. 9.
    Inuiguchi, M., Hirano, S., Tsumoto, S. (eds.): Rough Set Theory and Granular Computing. Springer, Berlin (2003)zbMATHGoogle Scholar
  10. 10.
    Pedrycz, W., Bargiela, A.: An optimization of allocation of information granularity in the interpretation of data structures toward granular fuzzy clustering. IEEE Trans. Syst. Man Cybern. B Cybern. 42(3), 582–590 (2012)CrossRefGoogle Scholar
  11. 11.
    Pedrycz, A., Hirota, K., Pedrycz, W., Dong, F.: Granular representation and granular computing with fuzzy sets. Fuzzy Sets Syst. 203, 17–32 (2012)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Pedrycz, W., Song, M.: Granular fuzzy models: a study in knowledge management in fuzzy modeling. Int. J. Approx. Reasoning 53(7), 1061–1079 (2012)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Pedrycz, W., Bargiela, A.: An optimization of allocation of information granularity in the interpretation of data structures: toward granular fuzzy clustering. IEEE Trans. Syst. Man Cybern. B 42(3), 582–590 (2012)CrossRefGoogle Scholar
  14. 14.
    Pedrycz, W., Homenda, W.: Building the fundamentals of granular computing: a principle of justifiable granularity. Appl. Soft Comput. 13(10), 4209–4218 (2013)CrossRefGoogle Scholar
  15. 15.
    Chen, S.-M., Yang, M.-W., Lee, L.-W., Yang, S.-W.: Fuzzy multiple attributes group decision-making based on ranking interval type-2 fuzzy sets. Expert Syst. Appl. 39(5), 5295–5308 (2012)CrossRefGoogle Scholar
  16. 16.
    Chen, S.M., Randyanto, Y.: A novel similarity measure between intuitionistic fuzzy sets and its applications. Int. J. Pattern Recognit. Artif. Intell. 27(7), 1350021-1–1350021-34 (2013)Google Scholar
  17. 17.
    Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)CrossRefzbMATHGoogle Scholar
  18. 18.
    Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11, 341–356 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  19. 19.
    Pawlak, Z.: Rough Sets, Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)zbMATHGoogle Scholar
  20. 20.
    Pawlak, Z.: Granularity of knowledge, indiscernibility and rough sets. In: Proceedings of 1998 IEEE International Conference on Fuzzy Systems, pp. 106–110 (1998)Google Scholar
  21. 21.
    Zhang, L., Zhang, B.: Quotient Space Theory and Granule computing. CRSSC’2003, Chongqing, China, pp. 1–3 (2003) (in Chinese)Google Scholar
  22. 22.
    Zhang, L., Zhang, B.: Theory of fuzzy quotient space (methods of fuzzy granular computing). J. Softw. 14(4), 770–776 (2003). (in Chinese)zbMATHGoogle Scholar
  23. 23.
    Zhang, Y., Zhang, L., Wu, T.: The representation of different granular worlds: a quotient space. Chin. J. Comput. 27(3), 328–333 (2004). (in Chinese)Google Scholar
  24. 24.
    Zhang, L., Zhang, B.: The analysis of system performances based on quotient space granular computing. J. Comput. Sci. 31(10A), 6–9 (2004). (in Chinese)Google Scholar
  25. 25.
    Cheng, W., Shi, Y., Zhang, Y.: Application of quotient space theory in yield prediction. J. Comput. Eng. Appl. 43(13), 197–199 (2007). (in Chinese)Google Scholar
  26. 26.
    He, F., Zhang, Y., Zhao, S.: The method for the optimal path of complex network based on quotient space hierarchy model (MOCQ). In: Science Paper Online (2007). (in Chinese)
  27. 27.
    He, F., Zhang, Y., Chen, J., Zhao, S.: Dynamic information analysis model based on quotient space topology. In: Science Paper Online, vol 5(2), pp. 124–127 (2010) (in Chinese)Google Scholar
  28. 28.
    Zadeh, L.A.: Towards a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets Syst. 19, 111–127 (1997)CrossRefMathSciNetGoogle Scholar
  29. 29.
    Zadeh, L.A.: Fuzzy sets and information granulation. In: Gupta, M., Ragade, R.K., Yager, R.R. (eds.) Advances in Fuzzy Set Theory and Applications. North-Holland Publishing Company, Amsterdam (1979)Google Scholar
  30. 30.
    Zadeh, L.A.: Some reflections on soft computing, granular computing and their roles in the conception, design and utilization of information/intelligent systems. Soft. Comput. 2, 23–25 (1998)CrossRefGoogle Scholar
  31. 31.
    Larson, R., Odoni, A.: Shortest paths between all pairs of nodes. In: Urban Operations Research (1981)Google Scholar
  32. 32.
    Pemmaraju, S., Skiena, S.: All-pairs shortest paths. In: Computational Discrete Mathematics: Combinatorics and Graph Theory in Mathematica, pp 330–331. Cambridge University Press, Cambridge (2003)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyAnhui UniversityHefeiChina
  2. 2.Anhui Provincial HospitalHefeiChina

Personalised recommendations