Variable precision rough set model
Journal of Computer and System Sciences
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Discrete Mathematics in Computer Science
Discrete Mathematics in Computer Science
Data Mining and Machine Oriented Modeling: A Granular Computing Approach
Applied Intelligence
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Attribute (Feature) Completion - The Theory of Attributes from Data Mining Prospect
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Concept Analysis andWeb Clustering using Combinatorial Topology
ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
Knowledge Based Search Engine: Granular Computing on the Web
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
IBM Journal of Research and Development
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Generalized parameterized approximations
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
A roadmap from rough set theory to granular computing
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Some Remarks on the Concept of Approximations from the View of Knowledge Engineering
International Journal of Cognitive Informatics and Natural Intelligence
Neighborhood system of parameterized binary relations
GRC '12 Proceedings of the 2012 IEEE International Conference on Granular Computing (GrC-2012)
Uncertainty and knowledge theories new era in Granular Computing
GRC '12 Proceedings of the 2012 IEEE International Conference on Granular Computing (GrC-2012)
Hi-index | 0.00 |
This paper explains the mathematics of large scaled granular computing GrC, augmented with a new Knowledge theory, by unifying rough set theories RS into one single concept, namely, neighborhood systems NS. NS was first introduced in 1989 by T. Y. Lin to capture the concepts of “near” topology and “conflict” security. Since 1996 when the term Granular Computing GrC was coined by T. Y. Lin to label Zadeh's vision, NS has been pushed into the “heart” of GrC. In 2011, LNS, the largest NS, was axiomatized; it implied that this set of axioms defines a new mathematics that realizes Zadeh's vision. The main messages are: this new mathematics is powerful and practical.