Neighborhood systems and relational databases
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Handbook of AI
Data Mining and Machine Oriented Modeling: A Granular Computing Approach
Applied Intelligence
Granular Computing on Binary Relations
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Generating Concept Hierarchies/Networks: Mining Additional Semantics in Relational Data
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
A roadmap from rough set theory to granular computing
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Hi-index | 0.00 |
This paper examines the knowledge representation theory of granulations. The key strengths of rough set theory are its capabilities in representing and processing knowledge in table format. For general granulation such capabilities are unknown. For single level granulation, two initial theories have been proposed previously by one of the authors. In this paper, the theories are re-visited, a new and deeper analysis is presented: Granular information table is an incomplete representation, so computing with words is the main method of knowledge processing. However for symmetrical granulation, the pre-topological information table is a complete representation, so the knowledge processing can be formal.