Granular computing and dual Galois connection
Information SciencesPublished 21 July 2007
Jian-Min Ma, Wen‐Xiu Zhang, Yee Leung, Xiaoxue Song
Citations92
SJR quartileQ1
SJR score1.80
SNIP1.98
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A covering model for granular computing in a set-theoretic setting is studied and it is proved that the duality is always true for the two pairs of lower and upper approximation operators.
Abstract
A covering model for granular computing in a set-theoretic setting is studied in this paper. Under this model, a zooming-in operator is redefined. Combinations of the zooming-in and zooming-out operators form two pairs of approximation operators of the original and the granulated universe of discourse. Their properties are examined in detail. For the two pairs of lower and upper approximation operators, it is proved that the duality is always true. For a generalized approximation space, the approximation representations are just the combination operators formed on the basis of the zooming-out and zooming-in operators. Relationships between these combination operators and the dual Galois connection are also analyzed.
Keywords
Computer Science
International Journal of Parallel ProgrammingRough sets
12,138 Citations1982Zdzis aw Pawlak
The presented approach may be considered as an alternative to fuzzy sets theory and tolerance theory and some applications are outlined.
Rough Sets: Theoretical Aspects of Reasoning about Data
8,416 Citations1991Zdzisław Pawlak
Communications of the ACMRough sets
3,212 Citations1995Zdzisław Pawlak, Jerzy W. Grzymala‐Busse +2 more
This approach seems to be of fundamental importance to artificial intelligence (AI) and cognitive sciences, especially in the areas of machine learning, knowledge acquisition, decision analysis, knowledge discovery from databases, expert systems, decision support systems, inductive reasoning, and pattern recognition.
IEEE Transactions on Fuzzy SystemsFuzzy logic = computing with words
3,187 Citations1996Lotfi A. Zadeh
The point of this note is that fuzzy logic plays a pivotal role in CW and vice-versa and, as an approximation, fuzzy logic may be equated to CW.
International Journal of General SystemsROUGH FUZZY SETS AND FUZZY ROUGH SETS*
2,948 Citations1990Didier Dubois, Henri Prade
It is argued that both notions of a rough set and a fuzzy set aim to different purposes, and it is more natural to try to combine the two models of uncertainty (vagueness and coarseness) rather than to have them compete on the same problems.
Fuzzy Sets and SystemsToward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
2,875 Citations1997Lotfi A. Zadeh
M Modes of information granulation (IG) in which the granules are crisp (c-granular) play important roles in a wide variety of methods, approaches and techniques, but this does not reflect the fact that in almost all of human reasoning and concept formation thegranules are fuzzy (f- Granular).
Information SciencesRudiments of rough sets
2,036 Citations2006Zdzisław Pawlak, Andrzej Skowron
The basic concepts of rough set theory are presented and some rough set-based research directions and applications are pointed out, indicating that the rough set approach is fundamentally important in artificial intelligence and cognitive sciences.
Information SciencesToward a generalized theory of uncertainty (GTU)––an outline
1,059 Citations2005Lotfi A. Zadeh
The generalized theory of uncertainty (GTU) which is outlined in this paper breaks with this tradition and views uncertainty in a much broader perspective and represents a significant change both in perspective and direction in dealing with uncertainty and information.
Information SciencesRough sets and Boolean reasoning
955 Citations2006Zdzisław Pawlak, Andrzej Skowron
Application of rough set methods for feature selection, feature extraction, discovery of patterns and their applications for decomposition of large data tables are presented as well as the relationship of rough sets with association rules.
Studies in fuzziness and soft computingGranular Computing : An Introduction
706 Citations2000Witold Pedrycz
International Journal of Intelligent SystemsInformation granulation and rough set approximation
527 Citations2000Yiyu Yao
The granulation structures used by standard rough set theory and the corresponding approximation structures are reviewed and the notion of neighborhood systems is also explored.
Granular computing: an introduction
381 Citations2002Witold Pedrycz
The intent of the paper is to elaborate on the fundamentals of granular computing and put the entire area in a certain perspective while not moving into specific algorithmic details.
Granular Computing: basic issues and possible solutions
324 Citations2007Yiyu Yao
A set-theoretic model of GrC is proposed based on the notion of power algebras, with emphasis on the construction of granules and computation with granules.
Lecture notes in computer scienceA Partition Model of Granular Computing
317 Citations2004Yiyu Yao
This chapter examines the basic principles and issues of granular computing from semantic and algorithmic perspectives, as well as principles and operations of computing and reasoning with granules in a set-theoretic setting.
International Journal of Intelligent SystemsInformation granules: Towards foundations of granular computing
230 Citations2000Andrzej Skowron, Jarosław Stepaniuk
This work discusses a problem of synthesis of robust terms, i.e., descriptions of information granules, satisfying a given specification, an important problem for granular computing and its applications for spatial reasoning or knowledge discovery and data mining.
Information SciencesNeighborhood operator systems and approximations
229 Citations2002Wei-Zhi Wu, Wen‐Xiu Zhang
Based on a binary relation on a finite universe, six families of binary relations are obtained, and the corresponding six classes of k-step neighborhood systems are derived.
Granular Computing: An Emerging Paradigm
216 Citations2001Witold Pedrycz
This book discusses Granular Computing in Neural Networks, Fuzzy Clustering for Multiple-Model Approaches in System Identification and Control, and Induction of Rules about Complications with the Use of Rough Sets.
Lecture notes in computer scienceThe Quotient Space Theory of Problem Solving
143 Citations2007Ling Zhang, Bo Zhang
A framework of quotient space theory of problem solving, in which a problem (or problem space) is represented as a triplet, including the universe, its structure and attributes, is introduced.
Information SciencesNeighborhood systems and approximate retrieval
117 Citations2006Yiyu Yao
An approximate retrieval model is proposed based on the notion of neighborhood systems, in which each object is represented by its values on a finite set of attributes, and neighborhood systems on attribute values, which provide semantic similarity or closeness of different values.
Lecture notes in computer scienceInduction of Classification Rules by Granular Computing
110 Citations2002JingTao Yao, Yiyu Yao
For the design of granule selection heuristics, several measures on granules are suggested and a classification rule induction method is proposed that leads to finding a covering of the universe, which is more general than partition based methods.
Information SciencesOn axiomatic characterisations of crisp approximation operators
68 Citations2000Helmut Thiele
The paper presented has solved the problem under which additional assumptions a given closure operator can be represented by an upper approximation within the concepts of rough set theory.
Granular Computing on Binary Relations
68 Citations2002Tsau Young Lin
Information SciencesFuzzy reasoning model under quotient space structure
64 Citations2005Lu Zhang, Bo Zhang
The framework proposed is aimed to combine two powerful abilities in order to enhance the efficiency of fuzzy reasoning: one is the ability of computing with words based on fuzzy set methodology, the other is the able of hierarchical problem solving based on quotient space approach.
Lecture notes in computer scienceApproximations and Rough Sets Based on Tolerances
61 Citations2001Jouni Järinen
This work investigates the structure of R-rough sets, studying R-approximations, R-definable sets, and R-equalities, and investigates the relationship between these sets and each other.
Lecture notes in computer scienceGranular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions
52 Citations2003Yiyu Yao, Churn‐Jung Liau +1 more
A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions to study connections between the elements of a universe and the elements in a granulated universe.
Information SciencesRegranulation: A granular algorithm enabling communication between granular worlds
52 Citations2006Scott Dick, Adam Schenker +2 more
A granular algorithm for translating information between two granular worlds, represented as fuzzy rulebases, finds that a 7 × 7 granulation appears to be the minimum necessary precision.
A covering model of granular computing
9 Citations2005Jian-Min Ma, Wen‐Xiu Zhang +1 more
This paper is mainly to study a covering model of granular computing in a set-theoretic setting based on the assumption that a finite set of universe is granulated through a family of overlapping granules based on a reflexive relation.
Lecture notes in computer scienceGenerating Concept Hierarchies/Networks: Mining Additional Semantics in Relational Data
7 Citations2001T. Lin
In this paper, "real world" data model - relational model with additional semantics specified by binary relational structures (adopt from first order logic) - are explored; in such model, concept hierarchies/networks can be generated automatically.