Neighborhood operator systems and approximations
Information SciencesPublished 1 July 2002
Wei-Zhi Wu, Wen‐Xiu Zhang
Citations229
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
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.
Abstract
This paper presents a framework for the study of generalizing the standard notion of equivalence relation in rough set approximation space with various categories of k-step neighborhood systems. 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. Extensions of Pawlak's rough set approximation operators based on such neighborhood systems are proposed. Properties of neighborhood operator systems and rough set approximation operators are investigated, and their connections are examined.
Keywords
Computer ScienceEngineering
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.
Journal of Computer and System SciencesVariable precision rough set model
2,024 Citations1993Wojciech Ziarko
A generalized model of rough sets called variable precision model (VP-model), aimed at modelling classification problems involving uncertain or imprecise information, is presented and the main concepts are introduced formally and illustrated with simple examples.
Information SciencesRough set approach to incomplete information systems
1,297 Citations1998Marzena Kryszkiewicz
This work proposes reduction of knowledge that eliminates only that information, which is not essential from the point of view of classification or decision making, and shows how to find decision rules directly from such an incomplete decision table.
Information SciencesRelational interpretations of neighborhood operators and rough set approximation operators
1,025 Citations1998Yiyu Yao
This paper presents a framework for the formulation, interpretation, and comparison of neighborhood systems and rough set approximations using the more familiar notion of binary relations, and introduces a special class of neighborhood system, called 1-neighborhood systems.
Intelligent Automation & Soft ComputingGeneralization of Rough Sets using Modal Logics
462 Citations1996Yiyu Yao, T. Lin
A number of extended rough set models are proposed and examined based on the properties satisfied by a binary relation, such as serial, reflexive, symmetric, transitive, and Euclidean, which correspond to different modal logic systems.
Fuzzy Sets and SystemsFuzzy rough sets
304 Citations1992Santosh Kumar Nanda, Sarangam Majumdar
This paper introduces and discusses the concept of fuzzy rough sets, a type of rough set that is similar to a ULTIMATE model but with some properties of a Turing-complete system.
Information SciencesAutomated extraction of medical expert system rules from clinical databases based on rough set theory
264 Citations1998Shusaku Tsumoto
A rule induction method is introduced, which extracts not only classification rules but also other medical knowledge needed for diagnosis from clinical cases, and is evaluated on three clinical databases.
Lecture notes in computer scienceFuzzy Similarity Relation as a Basis for Rough Approximations
237 Citations1998Salvatore Greco, Benedetto Matarazzo +1 more
The rough sets theory was originally founded on the idea of approximating a given set by means of indiscernibility binary relation, which was assumed to be an equivalence relation (reflexive, symmetric and transitive), but now the assumption of symmetry and transitivity is relaxed.
Neighborhood systems and relational databases
198 Citations1988Tzu‐Yu Lin
This paper augments the relational database, with neighborhood systems, so the database can answer a fuzzy query, and defines directly the meaning of “very close neighborhood”.
Information SciencesA rough set approach to attribute generalization in data mining
182 Citations1998Chien-Chung Chan
A method for updating approximations of a concept incrementally is presented, using the inductive learning algorithm, LERS based on rough set theory, to implement a quasi-incremental algorithm for learning classification rules from very large data bases generalized by dynamic conceptual hierarchies provided by users.
NeurocomputingAn investigation into the application of neural networks, fuzzy logic, genetic algorithms, and rough sets to automated knowledge acquisition for classification problems
148 Citations1999Ilona Jagielska, Chris Matthews +1 more
In this study neural network and genetic algorithm fuzzy rule induction systems have been developed and applied to three classification problems and it is indicated that the genetic/fuzzy approach compares more than favourably with the neuro/ fuzzy and rough set approaches.
Studia LogicaKripke semantics for knowledge representation logics
78 Citations1990Ewa Orłowska
The proposals are made to extend the standard Kripke structures to the structures based on information systems and the underlying logics are defined and problems of their axiomatization are discussed.
Theoretical Computer ScienceSemantic analysis of inductive reasoning
49 Citations1986Ewa Orłowska
It is claimed that since concepts are relative to background knowledge, their inductive generalisations can be determined only approximately, and induction rules are defined providing a method of forming generalisations preserving positive and/or negative instances of concepts.