Advertisement

Granular Computing Using Information Tables

  • Y. Y. Yao
  • Ning Zhong
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 95)

Abstract

A simple and more concrete granular computing model may be developed using the notion of information tables. In this framework, each object in a finite nonempty universe is described by a finite set of attributes. Based on attribute values of objects, one may decompose the universe into parts called granules. Objects in each granule share the same or similar description in terms of their attribute values. Studies along this line have been carried out in the theories of rough sets and databases. Within the proposed model, this paper reviews the pertinent existing results and presents their generalizations and applications.

Keywords

Equivalence Class Equivalence Relation Association Rule Binary Relation Information Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Codd, E.F. A relational model of data for large shared data banks, Communication of ACM, 13, 377–387, 1970.MATHCrossRefGoogle Scholar
  2. 2.
    Gaines, B.R. The trade-off between knowledge and data in knowledge acquisition, in: Knowledge Discovery in Databases, Piatetsky-Shapiro, G. and Frawley, W.J. (Eds.), AAAI/MIT Press, 491–505, 1991.Google Scholar
  3. 3.
    Gray, B. and Orlowska, M.E. CCAIIA: clustering categorical attributes into interesting association rules, in: Research and Development in Knowledge Discovery and Data Mining, Wu, X., Kotagiri, R,. and Bork, K.B. (Eds.), Springer-Verlag, Heidelberg, Germany, 132–143, 1998.Google Scholar
  4. 4.
    Hadjimichael, M. and Wasilewska, A. Rule reduction for knowledge representation system, Bulletin of Polish Academy of Science, Mathematics, 37, 63–69, 1990.Google Scholar
  5. 5.
    Han, J., Cai, Y., and Cercone, N. Data-driven discovery of quantitative rules in data bases, IEEE Transactions on Knowledge and Data Engineering, 5, 29–40, 1993.CrossRefGoogle Scholar
  6. 6.
    Ho, K.M. and Scott, P.D. Zeta: a global method for discretization of continuous variables, Proceedings of KDD-97, 191–194, 1997.Google Scholar
  7. 7.
    Jardine, N. and Sibson, R., 1971, Mathematical Taxonomy, Wiley, New York.MATHGoogle Scholar
  8. 8.
    Lee, T.T. An information-theoretic analysis of relational databases — part I: data dependencies and information metric, IEEE Transactions on Software Engineering, SE-13, 1049–1061, 1987.Google Scholar
  9. 9.
    Lin, T.Y., 1998, Granular computing on binary relations I: data mining and neighborhood systems, II: rough set representations and belief functions, in: Rough Sets in Knowledge Discovery 1, Polkowski, L. and Skowron, A. (Eds.), Physica-Verlag, Heidelberg, 107–140, 1998.Google Scholar
  10. 10.
    Lin, T.Y. and Hadjimichael, M. Non-classificatory generalization in data mining, Proceedings of the Fourth International Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery, 404–411, 1996.Google Scholar
  11. 11.
    Lin, T.Y., Zhong, N., Dong, J.Z., and Ohsuga, S. Frameworks for mining binary relations in data, in: Rough Sets and Current Trends in Computing, Polkowski, L. and Skowron, A. (Eds.), Springer-Verlag, Berlin, 387–393, 1998.Google Scholar
  12. 12.
    Lipski, W. Jr. On databases with incomplete information, Journal of the ACM, 28, 41–70, 1981.MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Liu, H., Lu, H., and Yao, J. Identifying relevant databases for multidatabase mining, in: Research and Development in Knowledge Discovery and Data Mining, Wu, X., Kotagiri, R,. and Bork, K.B. (Eds.), Springer-Verlag, Heidelberg, Germany, 211–221, 1998.Google Scholar
  14. 14.
    Malvestuto, F.M. Statistical treatment of the information content of a database, Information Systems, 11, 211–223, 1986.MATHCrossRefGoogle Scholar
  15. 15.
    Orlowska, E. Semantics of knowledge operators, Bulletin of Polish Academy of Science, Mathematics, 35, 255–263, 1987.MathSciNetMATHGoogle Scholar
  16. 16.
    Orlowska, E. Reasoning about vague concepts, Bulletin of Polish Academy of Science, Mathematics, 35, 643–652, 1987.MathSciNetMATHGoogle Scholar
  17. 17.
    Pawlak, Z. Information systems — theoretical foundations, Information Systems, 6, 205–218, 1981.MATHCrossRefGoogle Scholar
  18. 18.
    Pawlak, Z. Rough sets, International Journal of Computer and Information Sciences, 11, 341–356, 1982.MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Pawlak, Z. Rough Sets, Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, 1991.MATHGoogle Scholar
  20. 20.
    Pawlak, Z., Granularity of knowledge, indiscernibility and rough sets, Proceedings of 1998 IEEE International Conference on Fuzzy Systems, 106–110, 1998.Google Scholar
  21. 21.
    Polkowski, L. and Skowron, A. Towards adaptive calculus of granules, Proceedings of 1998 IEEE International Conference on Fuzzy Systems, 111–116, 1998.Google Scholar
  22. 22.
    Quinlan, J.R., Learning efficient classification procedures and their application to chess endgames, in: Machine Learning: An Artificial Intelligence Approach, Vol. 1, Michalski, J.S., Carbonell, J.G., and Mirchell, T.M. (Eds.), Morgan Kaufmann, Palo Alto, CA, 463–482, 1983.Google Scholar
  23. 23.
    Silverstein, C., Brin, S., and Motwani, R. Beyond market baskets: generalizing association rules to dependence rules, Data Mining and Knowledge Discovery, 2, 39–68, 1998.CrossRefGoogle Scholar
  24. 24.
    Skowron, A. and Stepaniuk, J. Information granules and approximation spaces, Proceedings of Seventh International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, 354–361, 1998.Google Scholar
  25. 25.
    Slowinski, R. and Vanderpooten, D. Similarity relation as a basis for rough approximations, in: Advances in Machine Intelligence & Soft-Computing IV, Wang, P.P. (Ed.), Department of Electrical Engineering, Duke University, Durham, North Carolina, 17–33, 1997.Google Scholar
  26. 26.
    Tsumoto, S. and Tanaka, H. Automated discovery of functional components of proteins from amino-acid sequences based on rough sets and change of representation, Proceedings of KDD-95, 318–324, 1995.Google Scholar
  27. 27.
    Vakarelov, D. A modal logic for similarity relations in Pawlak knowledge representation systems, Fundamenta Informaticae, XV, 61–79, 1991.Google Scholar
  28. 28.
    Wasilewska, A. Conditional knowledge representation system — model for an implementation, Bulletin of Polish Academy of Science, Mathematics, 37, 63–69, 1990.MathSciNetGoogle Scholar
  29. 29.
    Yager, R.R. and Filev, D. Operations for granular computing: mixing words with numbers, Proceedings of 1998 IEEE International Conference on Fuzzy Systems, 123–128, 1998.Google Scholar
  30. 30.
    Yao, J. and Liu, H. Searching multiple databases for interesting complexes, in: KDD: Techniques and Applications, Lu, H., Motoda, H., and Liu, H. (Eds.), World Scientific, Singapore, 1997.Google Scholar
  31. 31.
    Yao, Y.Y. Relational interpretations of neighborhood operators and rough set approximation operators, Information Sciences, 111, 239–259, 1998.MathSciNetMATHCrossRefGoogle Scholar
  32. 32.
    Yao, Y.Y. Generalized rough set models, in: Rough Sets in Knowledge Discovery 1, Polkowski, L. and Skowron, A. (Eds.), Physica-Verlag, Heidelberg, 286–318, 1998.Google Scholar
  33. 33.
    Yao, Y.Y. Granular computing using neighborhood systems, in: Advances in Soft Computing: Engineering Design and Manufacturing, Roy, R., Furuhashi, T., and Chawdhry, P.K. (Eds), Springer, London, 539–553, 1999.Google Scholar
  34. 34.
    Yao, Y.Y. Stratified rough sets and granular computing, Proceedings of the 18th International Conference of the North American Fuzzy Information Processing Society, 800–804, 1999.Google Scholar
  35. 35.
    Yao, Y.Y. Rough sets, neighborhood systems, and granular computing, Proceedings of the 1999 IEEE Canadian Conference on Electrical and Computer Engineering, 1553–1558, 1999.Google Scholar
  36. 36.
    Yao, Y.Y. and Lin, T.Y. Generalization of rough sets using modal logic, Intelligent Automation and Soft Computing, an International Journal, 2, 103–120, 1996.Google Scholar
  37. 37.
    Yao, Y.Y. and Noroozi, N. A unified framework for set-based computations, Proceedings of the 3rd International Workshop on Rough Sets and Soft Computing, Lin, T.Y. (Ed.), San Jose State University, 236–243, 1994.Google Scholar
  38. 38.
    Yao, Y.Y. and Wong, S.K.M. Generalization of rough sets using relationships between attribute values, Proceedings of the 2nd Annual Joint Conference on Information Sciences, 30–33, 1995.Google Scholar
  39. 39.
    Yao, Y.Y., Wong, S.K.M., and Butz, C.J. On information-theoretic measures of attribute importance, in: Methodologies for Knowledge Discovery and Data Mining, Zhong, N. and Zhou, L. (Eds.), Springer-Verlag, Berlin, 133–137, 1999.Google Scholar
  40. 40.
    Yao, Y.Y., Wong, S.K.M., and Lin, T.Y. A review of rough set models, in: Rough Sets and Data Mining: Analysis for Imprecise Data, Lin, T.Y. and Cercone, N. (Eds.), Academic Publishers, Boston, 47–75, 1997.Google Scholar
  41. 41.
    Yao, Y.Y. and Zhong, N. An analysis of quantitative measures associated with rules, in: Methodologies for Knowledge Discovery and Data Mining, Zhong, N. and Zhou, L. (Eds.), Springer-Verlag, Berlin, 479–488, 1999.Google Scholar
  42. 42.
    Yao, Y.Y. and Zhong, N. Potential applications of granular computing in knowledge discovery and data mining, Proceedings of World Multiconference on Systemics, Cybernetics and Informatics, Volume 5, 573–580, 1999.Google Scholar
  43. 43.
    Zadeh, L.A. Fuzzy sets and information granularity, in: Advances in Fuzzy Set Theory and Applications, Gupta, N., Ragade, R. and Yager, R. (Eds.), North-Holland, Amsterdam, 3–18, 1979.Google Scholar
  44. 44.
    Zadeh, L.A. Fuzzy logic = computing with words, IEEE Transactions on Fuzzy Systems, 4, 103–111, 1996.CrossRefGoogle Scholar
  45. 45.
    Zadeh, L.A. Some reflections on soft computing, granular computing and their roles in the conception, design and utilization of information/intelligent systems, manuscript, Computer Science Division, University of California, Berkeley, USA, 1997.Google Scholar
  46. 46.
    Zadeh, L.A., Toward a restructure of the foundations of fuzzy logic (FL), Abstract of BISC Seminar, University of California, Berkeley, USA, 1997.Google Scholar
  47. 47.
    Zadeh, L.A. Towards a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic, Fuzzy Sets and Systems, 19, 111–127, 1997.MathSciNetCrossRefGoogle Scholar
  48. 48.
    Zadeh, L.A. Announcement of GrC, 1997.Google Scholar
  49. 49.
    Zadeh, L.A. Information granulation and its centrality in human and machine intelligence, in: Rough Sets and Current Trends in Computing, Polkowski, L. and Skowron, A. (Eds.), Springer-Verlag, Berlin, 35–36, 1998.CrossRefGoogle Scholar
  50. 50.
    Zembowicz, R. and Zytkow, J.M. From contingency tables to various forms of knowledge in database, in: Advances in Knowledge Discovery and Data Mining, Fayyad, U.M, Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R. (Eds.), AAAI Press/MIT Press, California, 39–81, 1996.Google Scholar
  51. 51.
    Zhong, N., Dong, J., Fujitsu, S., and Ohsuga, S. Soft techniques for rule discovery in data, Transactions of Information Processing Society of Japan, 39, 2581–2592, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Y. Y. Yao
    • 1
  • Ning Zhong
    • 2
  1. 1.Department of Computer ScienceUniversity of Regina ReginaReginaCanada
  2. 2.Department of Computer Science and Systems Engineering Faculty of EngineeringYamaguchi UniversityUbe 755Japan

Personalised recommendations