Generalized probabilistic approximations
Published 1 June 2013
Jerzy W. Grzyrnala-Busse
Citations12
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
Generalized probabilistic approximations, defined using both rough set theory and probability theory, are studied using an approximation space (U, R), where R is an arbitrary binary relation.
Abstract
Generalized probabilistic approximations, defined using both rough set theory and probability theory, are studied using an approximation space (U, R), where R is an arbitrary binary relation. Generalized probabilistic approximations are applicable in mining inconsistent data (data with conflicting cases) and data with missing attribute values.
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.
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.
Lecture notes in computer scienceRough Sets and Current Trends in Computing
1,099 Citations2008Carbonell, Jaime G, Wojciech Ziarko +3 more
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.
IEEE Transactions on Knowledge and Data EngineeringA generalized definition of rough approximations based on similarity
958 Citations2000Roman Słowiński, Daniel Vanderpooten
New definitions of lower and upper approximations are proposed, which are basic concepts of the rough set theory and are shown to be more general, in the sense that they are the only ones which can be used for any type of indiscernibility or similarity relation.
Information SciencesRules in incomplete information systems
637 Citations1999Marzena Kryszkiewicz
A new method of computing all optimal certain rules from an incomplete information system is presented and proved that does not require changing the size of the original incomplete system.
International Journal of Man-Machine StudiesA decision theoretic framework for approximating concepts
612 Citations1992Yiyu Yao, S. K. M. Wong
This paper shows that if a given concept is approximated by one set, the same result given by the α-cut in the fuzzy set theory is obtained, and can derive both the algebraic and probabilistic rough set approximations.
International Journal of Man-Machine StudiesRough sets: probabilistic versus deterministic approach
469 Citations1988Zdzisław Pawlak, S. K. M. Wong +1 more
W: B. Gains and J. Boose, editors, Machine Learning and Uncertain Reasoning 3, pages 227-242, 1990.
Fundamenta InformaticaeA New Version of the Rule Induction System LERS
462 Citations1997Jerzy W. Grzymala‐Busse
A new version of the rule induction system LERS is described and compared with the old version and the new LERS system performance is fully comparable with performance of the other two systems.
Lecture notes in computer scienceDecision-Theoretic Rough Set Models
452 Citations2007Yiyu Yao
It is shown that the decision-theoretic models need to consider additional issues in probabilistic rough set models.
Computational IntelligenceIncomplete Information Tables and Rough Classification
348 Citations2001Jerzy Stefanowski, Alexis Tsoukiàs
This paper introduces two generalisations of the rough sets theory that introduce the use of a non symmetric similarity relation in order to formalise the idea of absent value semantics and shows that for the valued tolerance approach it is possible to obtain more informative approximations and decision rules.
Lecture notes in computer scienceOn the Extension of Rough Sets under Incomplete Information
261 Citations1999Jerzy Stefanowski, Alexis Tsoukiàs
Two generalizations of rough set theory are introduced, based on non symmetric similarity relations, while the second one uses valued tolerance relation, which provides more informative results than the previously known approach employing simple tolerance relation.
Lecture notes in computer scienceTransactions on Rough Sets I
238 Citations2004James F. Peters
Rough Sets - Applications and Theory, Musical Phrase Representation and Recognition by Means of Neural Networks and Rough Sets, and Relational Learning.
International Journal of Approximate ReasoningProbabilistic approach to rough sets
237 Citations2007Wojciech Ziarko
The article introduces the basic ideas and investigates the probabilistic version of rough set theory, which relies on both classification knowledge and Probabilistic knowledge in analysis of rules and attributes.
Lecture notes in computer scienceData with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction
235 Citations2004Jerzy W. Grzymala‐Busse
This paper shows how to induce certain and possible rules for incomplete decision tables using MLEM2, an outgrow of the rule induction algorithm LEM2, again, using blocks of attribute-value pairs.
Topological and Fuzzy Rough Sets
204 Citations1992Tsau Young Lin
It is shown that even though approximation is a compromised solution, the three theories allow one to draw an exact solution whenever there are adequate approximations, which implies that these three approaches are good approximation theories.
Studies in computational intelligenceRough Set Strategies to Data with Missing Attribute Values
162 Citations2005Jerzy W. Grzymala‐Busse
It is shown how to compute characteristic relations using an idea of block of attribute-value pairs, used in some rule induction algorithms, such as LEM2, and the set of all characteristic relations for a class of congruent incompletely specified decision tables, defined in the paper, is a lattice.
Lecture notes in computer scienceCharacteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation
154 Citations2005Jerzy W. Grzymala‐Busse
This paper shows that attribute-value pair blocks, used for many years in rule induction, may be used as well for computing indiscernibility relations for completely specified decision tables, and shows that, for a given incomplete data set, the set of all characteristic relations for theSet of all congruent decision tables is a lattice.
Computational IntelligencePRIMEROSE: PROBABILISTIC RULE INDUCTION METHOD BASED ON ROUGH SETS AND RESAMPLING METHODS
81 Citations1995Shusaku Tsumoto, Hiroshi Tanaka
A new approach to knowledge acquisition is introduced, which induces probabilistic rules based on rough set theory (PRIMEROSE) and a program is developed that extracts rules for an expert system from a clinical database, showing that the derived rules almost correspond to those of the medical experts.
Lecture notes in computer scienceCharacteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation
73 Citations2004Jerzy W. Grzymala‐Busse
IGI Global eBooksData Mining Based on Rough Sets
68 Citations2003Jerzy W. Grzymala‐Busse, Wojciech Ziarko
The chapter is focused on the data mining aspect of the applications of rough set theory, and the theoretical part is minimized to emphasize the practical application side of the rough set approach in the context of data analysis and model-building applications.
Lecture notes in computer scienceGeneralized Parameterized Approximations
58 Citations2011Jerzy W. Grzymala‐Busse
The main objective is to study, for a given subset of the universe U, all such parameterized approximations, i.e., for all parameter values, for an approximation space (U,R), where R is an equivalence relation.
Experiments on probabilistic approximations
49 Citations2011Patrick G. Clark, Jerzy W. Grzymala‐Busse
This paper compares the quality of probabilistic approximations that are generalizations of ordinary lower and upper approximation known from rough set theory and shows that the number of distinct probabilists is quite limited.
Fundamenta InformaticaeA Local Version of the MLEM2 Algorithm for Rule Induction
38 Citations2010Jerzy W. Grzymala‐Busse, Wojciech Rząsa
The newest version of the MLEM2 algorithm for rule induction, a basic component of the LERS data mining system, is presented, based on local lower and upper approximations, and in its current form for the first time.
Transactions on rough setsDefinability and Other Properties of Approximations for Generalized Indiscernibility Relations
32 Citations2010Jerzy W. Grzymala‐Busse, Wojciech Rząsa
A generalization of the indiscernibility relation, i.e., a relation R that is not necessarily reflexive, symmetric, or transitive, is considered, on the basis of granules, defined by R, to study definability and coalescence of approximations.
Transactions on rough setsTransactions on Rough Sets XI
27 Citations2010James F. Peters, Andrzej Skowron
This is a book that will show you even new to old thing, and when you are really dying of transactions on rough sets xi, just pick this book; it will be right for you.
Experiments on rule induction from incomplete data using three probabilistic approximations
21 Citations2012Patrick G. Clark, Jerzy W. Grzymala‐Busse
It is concluded that the best approach (choice of the interpretation of missing attribute values and selection of the best type of approximation) depends on a data set.
Lecture notes in computer scienceAn Empirical Comparison of Rule Sets Induced by LERS and Probabilistic Rough Classification
11 Citations2010Jerzy W. Grzymala‐Busse, Shantan R. Marepally +1 more
The performance of LERS (possible rules) is significantly better than the best rule sets induced by PRC with any threshold (two-tailed test, 5% significance level).
Lecture notes in computer scienceLocal Probabilistic Approximations for Incomplete Data
11 Citations2012Patrick G. Clark, Jerzy W. Grzymala‐Busse +1 more
The main objective of this paper is to test whether proper local probabilistic approximations (different from local lower and upper approximation) are better than ordinary localLower and Upper approxims, and to show that all depends on a data set.
Lecture notes in computer scienceHow Good Are Probabilistic Approximations for Rule Induction from Data with Missing Attribute Values?
6 Citations2012Patrick G. Clark, Jerzy W. Grzymala‐Busse +1 more
The main objective of this research was to test whether the probabilistic approximations should be used in rule induction from incomplete data.