Rough sets: Some extensions
Information SciencesPublished 11 July 2006
Zdzisław Pawlak, Andrzej Skowron
Citations1,192
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.
Abstract
In this article, we present some extensions of the rough set approach and we outline a challenge for the rough set based research.
Keywords
Computer Science
TechnometricsStatistical Learning Theory
26,913 Citations1999Yuhai Wu, Vladimir Vapnik
Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
Springer series in statisticsThe Elements of Statistical Learning
24,344 Citations2001Trevor Hastie, J. Friedman +1 more
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
19,345 Citations2013Trevor Hastie, Robert Tibshirani +1 more
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
Statistical ScienceStatistical Modeling: The Two Cultures (with comments and a rejoinder by the author)
4,272 Citations2001Leo Breiman
If the goal as a field is to use data to solve problems, then the statistical community needs to move away from exclusive dependence on data models and adopt a more diverse set of tools.
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.
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.
European Journal of Operational ResearchRough sets theory for multicriteria decision analysis
1,603 Citations2001Salvatore Greco, Benedetto Matarazzo +1 more
The original rough set approach proved to be very useful in dealing with inconsistency problems following from information granulation, but is failing when preference-orders of attribute domains (criteria) are to be taken into account and it cannot handle inconsistencies following from violation of the dominance principle.
Handbook on Ontologies
1,446 Citations2004Steffen Staab, Rudi Studer
Medical Entomology and ZoologyCategorical Perception: The Groundwork of Cognition
1,434 Citations1990Stevan Harnad
Statistical modeling: The two cultures
1,341 Citations2001Leo Breiman
Fundamenta InformaticaeTOLERANCE APPROXIMATION SPACES
951 Citations1996Andrzej Skowron, Jarosław Stepaniuk
In tolerance approximation spaces the lower and upper set approximations are defined and the tolerance relation defined by the so called uncertainty function or the positive region of a given partition of objects have been chosen as invariants in the attribute reduction process.
Choice Reviews OnlineThe quark and the jaguar: adventures in the simple and the complex
795 Citations1994
American Journal of PhysicsThe Quark and the Jaguar: Adventures in the Simple and the Complex
559 Citations1997Murray Gell‐Mann, David S. Park
Advances in Soft Computing
557 Citations1999
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.
Morgan Kaufmann Publishers Inc. eBooksReadings in agents
479 Citations1997Michael N. Huhns, Munindar P. Singh
Themes, approaches, and challenges in agents and Multiagent Systems: Themes, Approaches, and Challenges are explored.
International Journal of Approximate ReasoningRough mereology: A new paradigm for approximate reasoning
433 Citations1996Lech Polkowski, Andrzej Skowron
R rough mereology is proposed as a foundation for approximate reasoning about complex objects and approximate proofs understood as schemes constructed to support the authors' assertions about the world on the basis of incomplete or uncertain knowledge.
Studies in fuzziness and soft computingRough Set Algorithms in Classification Problem
426 Citations2000Jan G. Bazan, Hung Son Nguyen +3 more
Some algorithms, based on rough set theory, that can be used for the problem of new cases classification, and several methods for computation of decision rules based on reducts for real value attribute discretization are presented.
The Mathematics of Learning: Dealing With Data
402 Citations2005Steve Smale
The mathematical foundations of learning theory are outlined and a key algorithm of it is described, which is key to developing systems tailored to a broad range of data analysis and information extraction tasks.
International Journal of Approximate ReasoningThe investigation of the Bayesian rough set model
397 Citations2005Dominik Ślȩzak, Wojciech Ziarko
A non-parametric modification of the VPRS model called the Bayesian Rough Set (BRS) model is presented, where the set approximations are defined by using the prior probability as a reference.
AI MagazineA New Direction in AI: Toward a Computational Theory of Perceptions
381 Citations2001Lotfi A. Zadeh
Perceptions are f-granular, meaning that the boundaries of perceived classes are unsharp; and the values of attributes are granulated, with a granule being a clump of values drawn together by indistinguishability, similarity, proximity, and functionality.
Studies in fuzziness and soft computingComputing with Words in Information/Intelligent Systems 2
360 Citations1999Lotfi A. Zadeh, Janusz Kacprzyk
A review of the literature on Fuzzy Logic and Intelligent Computing in Nuclear Engineering, as well as applications and tools for Linguistic Data Modeling and Analysis, published in 2016.
Theories of vagueness
341 Citations2000Rosanna Keefe
Rough Sets: Mathematical Foundations
337 Citations2002Lech Polkowski
Rough Set Theory: An Introduction is an Introduction to Logical Theory of Approximations and Topological Structures is an introduction to Set Theory.
Layered Learning in Multiagent Systems: A Winning Approach to Robotic Soccer
263 Citations2000Peter Stone
Rough set methods and applications: new developments in knowledge discovery in information systems
251 Citations2000Lech Polkowski, Shusaku Tsumoto +1 more
This book discusses Rough Sets and Rough Logic: A KDD Perspective from a Rough Set Perspective, which aims to provide a perspective on knowledge discovery in Information Systems from a rough set perspective.
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.
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.
Lecture notes in computer scienceHierarchical Neural Networks for Image Interpretation
222 Citations2003Sven Behnke
The results show clear trends in the direction of improvement in the level of supervised learning in relation to the recognition of meter values and in the application of Matrix Codes.
Managing Uncertainty in Expert Systems
197 Citations1991Jerzy W. Grzymala‐Busse
The architecture of an Expert System, a guide to expert systems, and some of the techniques used to develop and evaluate these systems:.
Choice Reviews OnlineThinking about logic: an introduction to the philosophy of logic
165 Citations1995
Think About Logic sets out to rescue logic from its undeserved reputation as an inflexible, dogmatic discipline by demonstrating that its technicalities and processes are founded on assumptions which are themselves amenable to philosophical investigation.
Studies in fuzziness and soft computingTowards an Adaptive Calculus of Granules
163 Citations1999Lech Polkowski, Andrzej Skowron
A Review of Rough Set Models
163 Citations1997Yiyu Yao, S. K. M. Wong +1 more
This paper provides a review of the Pawlak rough set model and its extensions, with emphasis on the formulation, characterization, and interpretation of various rough set models.
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
157 Citations1998Lech Polkowski, Janusz Kacprzyk +1 more
Discourse on Metaphysics
151 Citations1989Gottfried Wilhelm Leibniz
Lecture notes in computer scienceOn Generalizing Rough Set Theory
147 Citations2007Yiyu Yao
This paper summarizes various formulations of the standard rough set theory and demonstrates how those formulations can be adopted to develop different generalized rough set theories.
Lecture notes in computer scienceA New Direction in AI — Toward a Computational Theory of Perceptions
123 Citations2001Lotfi A. Zadeh
Lecture notes in computer scienceRough Sets and Bayes Factor
119 Citations2005Dominik Ślȩzak
The proposed Rough Bayesian model (RB) does not require information about the prior and posterior probabilities in case they are not provided in a confirmable way, and is related to the Bayes factor known from the Bayesian hypothesis testing methods.
Lecture notes in computer scienceToward Intelligent Systems: Calculi of Information Granules
116 Citations2001Andrzej Skowron
An approach based on calculi of information granules as a basis for approximate reasoning in intelligent systems and problems of learning in rough neural networks from experimental data and background knowledge are discussed.
Lecture notes in computer scienceTransactions on Rough Sets II
108 Citations2005James F. Peters, Didier Dubois
Classification of objects by means of attributes
106 Citations1981Zdzisław Pawlak
This paper presents a meta-analysed version of the model derived from the model developed in the second generation of the ICS PAS computer models developed in 1981.
Lecture notes in computer scienceApproximation Spaces and Information Granulation
103 Citations2004Andrzej Skowron, Roman W. Świniarski +1 more
Computational IntelligenceRough Mereological Calculi of Granules: A Rough Set Approach To Computation
101 Citations2001Lech Polkowski, Andrzej Skowron
This work presents applications of Rough Mereology to the important theoretical idea put forth by Lotfi Zadeh, i.e., Granularity of Knowledge, and defines granules of knowledge by means of the operator of mereological class and extends the idea of a granule over complex objects like decision rules as well as decision algorithms.
Lecture notes in computer scienceLayered Learning for Concept Synthesis
99 Citations2004Sinh Hoa Nguyen, Jan G. Bazan +2 more
A hierarchical scheme for synthesis of concept approximations based on given data and domain knowledge is presented and a solution, founded on rough set theory, to the problem of constructing the approximation of higher level concepts by composingThe approximation of lower level concepts is proposed.
Intelligent Technologies for Information Analysis
99 Citations2004Ning Zhong, Jiming Liu
This chapter discusses Grid-Based Data Mining and Knowledge Discovery, Constructing Hybrid Intelligent Systems for Data Mining from Agent Perspectives, and Making Agents Acceptable to People.
Lecture notes in computer scienceRough Set Analysis of Preference-Ordered Data
86 Citations2002Roman Słowiński, Salvatore Greco +1 more
The paper proposes a new approach to knowledge discovery from data, taking into account prior knowledge about preference semantics in patterns to be discovered, called Dominance-based Rough Set Approach (DRSA), able to approximate this partition by means of dominance relations.
Studies in fuzziness and soft computingApproximation Spaces, Reducts and Representatives
85 Citations1998Jarosław Stepaniuk
This chapter discusses different approaches to searching for optimal approximation spaces, basic notions concerning rough set concept based on generalized approximation spaced are presented and the problems of attribute and object selection are discussed.
Cognitive technologiesInformation Granules and Rough-Neural Computing
84 Citations2004Andrzej Skowron, Jarosław Stepaniuk
One of the goals of the project is to develop methods based on rough-neural computing for computing with words (CW) using an analogy of information granule networks with neural networks.
Studies in fuzziness and soft computingVarious Approaches to Reasoning with Frequency Based Decision Reducts: A Survey
83 Citations2000Dominik Ślȩzak
This work shows how to use reduct approximations to develop flexible tools for analysis of strongly inconsistent and/or noisy data tables and a special attention is paid to the notion of a rough membership decision reduct.
Applied optimizationDealing with Missing Data in Rough Set Analysis of Multi-Attribute and Multi-Criteria Decision Problems
80 Citations2000Salvatore Greco, Benedetto Matarazzo +1 more
An extension of the rough set methodology to the analysis of incomplete data tables and the adapted relations of indiscernibility or dominance between a pair of objects are considered as directional statements where a subject is compared to a referent object.
Fundamenta InformaticaeNormalized Decision Functions and Measures for Inconsistent Decision Tables Analysis
71 Citations2000Dominik Ślȩzak
This work considers the family of normalized decision functions acting over conditional frequency distributions computed from data tables and draws the connection between such functions and approaches to generating inexact decision rules for the new case classification.
Fundamenta InformaticaeRough Sets and Vague Concepts
69 Citations2004Andrzej Skowron
Important consequences of the paper are emphasized for research on approximation of vague concepts and reasoning about them in the framework of adaptive learning and developing new approach to vague concepts going beyond the traditional rough or fuzzy approaches.
Lecture notes in computer scienceApproximation Spaces and Information Granulation
68 Citations2005Andrzej Skowron, Roman W. Świniarski +1 more
This paper presents illustrative examples of modelling approximation spaces that include approximation spaces for function approximation, inducing concept approximation, and some other information granule approximations in a granular computing framework.
Lecture notes in computer scienceA View on Rough Set Concept Approximations
63 Citations2007Jan G. Bazan, Hung Son Nguyen +2 more
The goal is to construct a parameterized approximation mechanism making it possible to develop multi-stage multi-level concept hierarchies that are capable of maintaining acceptable level of imprecision from input to output.
Applied optimizationDecision Making: Recent Developments and Worldwide Applications
57 Citations2000Stelios H. Zanakis, Georgios I. Doukidis +1 more
This editorial focuses on decision support for the management of admissions to academic programs, decision making under Various Types of Uncertainty, and multi-Criteria Decision Analysis, Aid & Practice.
Lecture notes in computer scienceDecision Rules, Bayes’ Rule and Rough Sets
57 Citations1999Zdzisław Pawlak
This paper concerns a relationship between Bayes’ inference rule and decision rules from the rough set perspective and concludes that Bayes' inference rule should be considered as a guide to decision rules.
Electronic Notes in Theoretical Computer ScienceRough Set Approach to Pattern Extraction from Classifiers
49 Citations2003Jan G. Bazan, James F. Peters +3 more
It is shown how among formulas used for classifier construction from decision rules one can search for new patterns relevant for the incremental concept approximation.
Lecture notes in computer scienceBehavioral Pattern Identification Through Rough Set Modelling
49 Citations2005Jan G. Bazan, James F. Peters +1 more
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems, and presents a method for on-line elimination of non-relevant parts that are irrelevant for identifying a given behavioral pattern.
Lecture notes in computer scienceToward Rough Set Foundations. Mereological Approach
45 Citations2004Lech Polkowski
It is demonstrated that mereological theory of rough sets extends and generalizes rough set theory written down in naive set theory framework.
Lecture notes in computer scienceRough Sets: Trends and Challenges
42 Citations2007Andrzej Skowron, James F. Peters
How approximation spaces considered in the context of rough sets and information granule theory have evolved over the last 20 years from simple approximation spaces to more complex spaces is discussed.
Lecture notes in computer scienceIncremental versus Non-incremental Rule Induction for Multicriteria Classification
35 Citations2004Salvatore Greco, Roman Słowiński +2 more
The results show that Glance and AllRules are complementary algorithms that work very efficiently on data sets described by a low number of condition attributes and a high number of objects.
Studies in fuzziness and soft computingRough Mereology in Information Systems. A Case Study: Qualitative Spatial Reasoning
34 Citations2000Lech Polkowski, Andrzej Skowron
Rough Mereology may be regarded as an extension of Rough Set Theory as it proposes to argue in terms of similarity relations induced from a rough inclusion instead of reasoning in Terms of indiscernibility relations.
Advances in soft computingClassifiers Based on Approximate Reasoning Schemes
33 Citations2006Jan G. Bazan, Andrzej Skowron
This work discusses classifiers for complex concepts constructed from data sets and domain knowledge using approximate reasoning schemes (AR schemes) and compares the quality of two classifiers: the standard rough set classifiers based on the set of minimal decision rules and the classifier based on AR schemes.
Lecture notes in computer scienceRough Set Approach to Domain Knowledge Approximation
32 Citations2007Tuan Trung Nguyen, Andrzej Skowron
It is shown how human expert's domain knowledge expressed in natural language can be approximately translated by a machine learning recognition system.
Complex Patterns
31 Citations2003Andrzej Skowron, Piotr Synak
Approximate reasoning networks (AR networks) are proposed for approximation of reasoning schemes expressed in natural language that make it possible to induce classifiers for complex concepts by constructing them along schemes of reasoning extracted from domain knowledge.
Dominance-Based Rough Set Approach to Knowledge Discovery (I): General Perspective
29 Citations2004Salvatore Greco, Benedetto Matarazzo +1 more
A general perspective of the basic DRSA is given, explaining its use in the context of multicriteria classification, choice, and ranking, and a variant of DRSA that handles missing values in data sets is presented.
Lecture notes in computer scienceOn-Line Elimination of Non-relevant Parts of Complex Objects in Behavioral Pattern Identification
24 Citations2005Jan G. Bazan, Andrzej Skowron
Some rough set tools for perception modelling that have been developed in this project for a system for modelling networks of classifiers for compound concepts make it possible to recognize behavioral patterns of objects and their parts changing over time are discussed.
Fundamenta InformaticaeRough Mereology: A Rough Set Paradigm for Unifying Rough Set Theory and Fuzzy Set Theory
22 Citations2003Lech Polkowski
It is demonstrated that rough inclusions (which represent a hierarchy of tolerance relations) induce rough set theoretic approximations as well as partitions and equivalence relations in the sense of fuzzy set theory.
Lecture notes in computer scienceRough Sets and Higher Order Vagueness
21 Citations2005Andrzej Skowron, Roman W. Świniarski
A rough set approach to vague concept approximation within the adaptive learning framework is presented and the role of extensions of approximation spaces in searching for concept approximation is emphasized.
Lecture notes in computer scienceOntological Framework for Approximation
20 Citations2005Jarosław Stepaniuk, Andrzej Skowron
An ontological framework for approximation, i.e., to approximation of concepts and vague dependencies specified in a given ontology, is discussed and the rough–fuzzy approach for approximation is outlined.
Lecture notes in computer scienceRough Sets in Perception-Based Computing
20 Citations2005Andrzej Skowron
Systems that are able to perform complex and flexible actions (operations) in an autonomous manner are identified as complex dynamical systems, autonomous multiagent systems, or swarm intelligent systems.
Approximate Reasoning in Distributed Environments
17 Citations2004Andrzej Skowron
In the chapter, the idea of the rough-neural computing paradigm for inducing AR schemes based on rough sets and, in particular, on rough mereology is discussed.
Hyperplane Aggregation of Dominance Decision Rules
15 Citations2003Roman Pindur, Robert Susmaga +1 more
The objective of this paper is to introduce the generalized rules into the multiple criteria classification problems and to demonstrate that these problems can be successfully solved using the introduced rules.
Dominance-Based Rough Set Approach to Knowledge Discovery (II): Extensions and Applications
14 Citations2004Salvatore Greco, Benedetto Matarazzo +1 more
The chapter ends with an axiomatic characterization of three preference models inferred from preference ordered data: general utility function, outranking relation, and a set of decision rules resulting from DRSA, which appears that the decision rule model is the most general among the known preference models.
Lecture notes in computer scienceThe Paradox of the Heap of Grains in Respect to Roughness, Fuzziness and Negligibility
12 Citations1998Solomon Marcus
In a first step, roughness and fuzziness fail to account for the type of grad-uality (vagueness) involved in the concept of a heap, as it is conceived in the famous Eubulides’ paradox.
Oxford University Press eBooksData mining tasks and methods: Classification: multicriteria classification
6 Citations2002Salvatore Greco, Benedetto Matarazzo +1 more
This article proposes to use a dominance-based rough set approach (DRSA) for multicriteria classification, which differs from usual classification problems since it takes into account preference orders in the description of objects by condition and decision attributes.
Advances in soft computingFeedforward Concept Networks
4 Citations2006Dominik Ślȩzak, Marcin Szczuka +1 more
An approach to construction of hierarchical structures of data based concepts (granules), extending the idea of feedforward neural networks, is presented, referred to the foundations of granular and rough-neural computing.
…