Abstract
The primary goal of granular computing is to elevate the lower level data processing to a high level knowledge processing. Such an elevation is achieved by granulating the data space into a concept space. Each granule represents certain primitive concept, and the granulation as a whole represents a knowledge. In this paper, such an intuitive idea is formalized into a mathematical theory: Zadeh’s informal words are taken literally as a formal definition of granulation. Such a mathematical notion is a mild generalization of the “old” notion of crisp/fuzzy neighborhood systems of (pre-)topological spaces. A crisp/fuzzy neighborhood is a granule and is assigned a meaningful name to represent certain primitive concept or to summarize the information content. The set of all linear combinations of these names, called formal words, mathematically forms a vector space over real numbers. Each vector is intuitively an advanced concept represented by some “weighted averaged” of primitive concepts. In terms of these concepts, the universe can be represented by a formal word table; this is one form of Zadeh’s veristic constraints. Such a representation is useful; fuzzy logic designs can be formulated as series of table transformations. So table processing techniques of rough set theory may be used to simplify these tables and their transformations. Therefore the complexity of large scaled fuzzy systems may be reduced; details will be reported in future papers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Bairamian, Goal Search in Relational Databases, Thesis, California State niversity at Northridge, 1989.
W. Chu, Neighborhood and associative query answering, Journal of Intelligent Information Systems, 1 (1992), 355–382.
K. Engesser, Some connections between topological and Modal Logic, Mathematical Logic Quarterly, 41 (1995), 49–64.
T. Y. Lin, Neighborhood Systems and Relational Database. In: Proceedings of 1988 ACM Sixteen Annual Computer Science Conference, February 23–25, 1988, 725
T. Y. Lin, Neighborhood Systems and Approximation in Database and Knowledge Base Systems. In; Proceedings of the Fourth International Symposium on Methodologies of Intelligent Systems, Poster Session, October 12–15, 1989, pp. 75–86.
T. Y. Lin, Topological and Fuzzy Rough Sets. In: Decision Support by Experience–Application of the Rough Sets Theory, R. Slowinski (ed.), Kluwer Academic Publishers, 1992, 287–304.
T. Y. Lin, Neighborhood Systems-A Qualitative Theory for Fuzzy and Rough Sets. In: Advances in Machine Intelligence and Soft Computing, Volume IV. Paul Wang (ed), 1997, 132–155. Also in Proceedings of Second Annual Joint Conference on Information Science, Wrightsville Beach, North Carolina, Sept. 28-Oct. 1, 1995, 257–260.
T. Y. Lin, An Overview of Rough Set Theory from the Point of View of Relational Databases, Bulletin of International Rough Set Society, Vol I, Nol, March, 1993, 30–34.
T. Y. Lin, Granular Computing of Binary relations I: Data Mining and Neighborhood Systems. In:Rough Sets and Knowledge Discovery Polkowski and Skowron (eds), Springer-Verlag, 1998 (to appear).
T. Y. Lin, Granular Computing of Binary relations II: Rough Set Representation and Belief Functions. In:Rough Sets and Knowledge Discovery Polkowski and Skowron (eds), Springer-Verlag, 1998 (to appear).
T. Y. Lin, Q. Liu and Y. Y. Yao A Logic System for Approximate Reasoning via Rough Sets and Topology. In: Methodologies of Intelligent Systems, Lecture notes in Artificial Intelligence, Z. Ras, and M. Zemankova (eds), 1994, 65–74.
T. Y. Lin and Q. Liu First Order Rough Logic I: Approximate Reasoning via Rough Sets, Fundamenta Informaticae. Volume 27, Number 2, 3, 1996, 137–153
B. Michael and T. Y. Lin Neighborhoods, Rough sets, and Query Relaxation. In: Rough Sets and Data Mining: Analysis of Imprecise Data (Lin and Cercone eds), Kluwer Academic Publisher, 1997, 229–238. (Final version of paper presented in CSC’95 Workshop on Rough Sets and Database Mining, March 2, 1995
Z. Pawlak, Rough sets. Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, 1991
W. Sierpenski and C. Krieger, General Topology,University of Torranto Press,1956.
A. Skowron and C. Rauszer, The discernibility matrices and functions in information systems. In: Decision Support by Experience–Application of the Rough Sets Theory R. Slowinski (ed.), Kluwer Academic Publishers, 1992, 331–362.
Lotfi Zadeh, Fuzzy Sets and Information Granularity. In: Advances in Fuzzy Sets and Information Granularity M. Gupta, R. Ragade, R. Yager (eds), North-Holland, Amsterdam, 1979, 3–18
Lotfi Zadeh, Fuzzy logic = computing with words, IEEE Transaction on Fuzzy Systems 4 (1996), 103–111.
Lotfi Zadeh, Towards a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic, Fuzzy Sets and Systems 90 (1997), 111–127.
Zimmermann, H., Fuzzy Set Theory -and its Applications, 2nd ed., Kluwer Academic Publisher, 1991.
M. Viveros, Extraction of Knowledge from databases, California State University, thesis, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lin, T.Y. (1999). Granular Computing: Fuzzy Logic and Rough Sets. In: Zadeh, L.A., Kacprzyk, J. (eds) Computing with Words in Information/Intelligent Systems 1. Studies in Fuzziness and Soft Computing, vol 33. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1873-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1873-4_9
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-662-11362-2
Online ISBN: 978-3-7908-1873-4
eBook Packages: Springer Book Archive