The Rough Set Exploration System
Lecture notes in computer sciencePublished 1 January 2005
Jan G. Bazan, Marcin Szczuka
Citations214
SJR quartileQ2
SJR score0.35
SNIP0.55
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
This article gives an overview of the Rough Set Exploration System (RSES), a freely available software system toolset for data exploration, classification support and knowledge discovery.
Abstract
This article gives an overview of the Rough Set Exploration System (RSES). RSES is a freely available software system toolset for data exploration, classification support and knowledge discovery. The main functionalities of this software system are presented along with a brief explanation of the algorithmic methods used by RSES. Many of the RSES methods have originated from rough set theory introduced by Zdzisław Pawlak during the early 1980s.
Keywords
Computer Science
Pattern classification and scene analysis
12,643 Citations1973Richard O. Duda, Peter E. Hart
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
Rough Sets
2,984 Citations1991Zdzisław Pawlak
TechnometricsMachine Learning, Neural and Statistical Classification
2,188 Citations1995Bill Fulkerson, D. Michie +2 more
The Discernibility Matrices and Functions in Information Systems
1,646 Citations1992Andrzej Skowron, Cecylia Rauszer
Two notions related to any information system, namely the discernibility matrix and discernibility function, are introduced and several algorithms for solving problems related among other things to the rough definability, reducts, core and dependencies generation are obtained.
Lecture notes in computer scienceRough Sets and Current Trends in Computing
1,099 Citations2008Carbonell, Jaime G, Wojciech Ziarko +3 more
Institutional Research Information System (Università degli Studi di Trento)Advances in the Dempster-Shafer theory of evidence
1,021 Citations1994Ronald R. Yager, Janusz Kacprzyk +1 more
The Dempster-Shafer Theory of Evidence is applied as a guide for the management of uncertainty in knowledge-based systems.
Fuzzy Sets and SystemsIntelligent decision support. Handbook of applications and advances of the rough sets theory
805 Citations1993
Lecture notes in computer scienceFoundations of Intelligent Systems
720 Citations2005Mohand-Saïd Hacid, Neil V. Murray +1 more
A Machine Text-Inspired Machine Learning Approach for Identification of Transmembrane Helix Boundaries and a Logic Approach for LTL System Modification.
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.
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.
Lecture notes in computer scienceA Comparison of Several Approaches to Missing Attribute Values in Data Mining
381 Citations2001Jerzy W. Grzymala‐Busse, Ming Hu
Using the Wilcoxon matched-pairs signed rank test, it is concluded that the C4.5 approach and the method of ignoring examples with missing attribute values are the best methods among all nine approaches.
ACM SIGART BulletinBook review: Machine Learning, Neural and Statistical Classification Edited by D. Michie, D.J. Spiegelhalter and C.C. Taylor (Ellis Horwood Limited, 1994)
371 Citations1996Huan Liu
This well-edited book provides an up-to-date review of different approaches to classification, compares their performance on a wide range of challenging datasets, and draws conclusions on their applicability to realistic industrial problems.
Rough membership functions
329 Citations1994Zdzisław Pawlak, Andrzej Skowron
Studies in fuzziness and soft computingIncomplete Information: Rough Set Analysis
313 Citations1998Ewa Orłowska
This book discusses Rough Sets, Rough Set-Based Deduction Methods, and Similarity-Based Reasoning, a Logic for Reasoning about Similarity Information Systems, Similarity Relations and Modal Logics.
CERN Document Server (European Organization for Nuclear Research)Rough Sets and Data Mining: Analysis of Imprecise Data
313 Citations1996Tzu‐Yu Lin, N. Cercone
Rough Sets and Data Mining: Analysis of Imprecise Data is an edited collection of research chapters on the most recent developments in rough set theory and data mining that focus on discovering dependencies among data, and reasoning about vague, uncertain and imprecise information.
Machine LearningUnifying Instance-Based and Rule-Based Induction
218 Citations1996Pedro Domingos
In an extensive empirical study, RISE consistently achieves higher accuracies than state-of-the-art representatives of both its parent approaches, as well as a decision tree learner (C4.5).
Lecture notes in computer scienceDynamic reducts as a tool for extracting laws from decisions tables
207 Citations1994Jan G. Bazan, Andrzej Skowron +1 more
The results are showing that dynamic reducts can help to extract laws from decision tables, e.g. market data, medical data, textures and handwritten digits.
Lecture notes in computer scienceInnovations in Applied Artificial Intelligence
194 Citations2005Moonis Ali, Floriana Esposito
This book aims to provide a history of spoken language communication with machines in the developing world and some of the techniques used to achieve this goal have been described.
Studies in fuzziness and soft computingGenetic Algorithms in Decomposition and Classification Problems
86 Citations1998Jakub Wróblewski
Some combinatorical problems concerned with using rough set theory in knowledge discovery and data analysis can be successfully solved using genetic algorithms (GA) — a sophisticated, adaptive search method based on the Darwinian principle of natural selection.
Lecture notes in computer scienceRough sets and decision tables
82 Citations1985Zdzisław Pawlak
This paper presents a meta-analyses of the models used for estimating the response of the immune system to TSPs.
Lecture notes in computer scienceCovering with Reducts - A Fast Algorithm for Rule Generation
66 Citations1998Jakub Wróblewski
A new, efficient algorithm for finding local reducts for each object in data table is described, as well as its parallelization and some optimization notes, and some experimental results generated on large data tables are presented.
Fundamenta InformaticaeRIONA: A New Classification System Combining Rule Induction and Instance-Based Learning
60 Citations2002Grzegorz Góra, Arkadiusz Wojna
A method combining two widely-used empirical approaches to learning from examples: rule induction and instance-based learning is described, which results in a significant acceleration of the algorithm using all minimal rules.
Studies in fuzziness and soft computingDiscovery of Data Patterns with Applications to Decomposition and Classification Problems
57 Citations1998Sinh Hoa Nguyen, Andrzej Skowron +1 more
This work studies problems of extracting several kinds of patterns from data, the simplest of which are called templates and also more sophisticated relational patterns extracted automatically from data.
Lecture notes in computer scienceIn Pursuit of Patterns in Data Reasoning from Data - The Rough Set Way
54 Citations2002Zdzisław Pawlak
This paper shows interesting relationship between Bayes' theorem, rough sets and flow graphs, and three methods of flow graphs application in drawing conclusions from data are presented and examined.
Lecture notes in computer scienceRough Sets and Decision Algorithms
46 Citations2001Zdzisław Pawlak
It is shown that every decision algorithm reveals some well known probabilistic properties, in particular it satisfies the Total Probability Theorem and the Bayes' Theorem, which give a new method of drawing conclusions from data, without referring to prior and posterior probabilities.
Synthesis of Decision Systems from Data Tables
44 Citations1997Andrzej Skowron, Lech Polkowski
This work proposes to build strategies for approximate reasoning in distributed systems on the basis of rough set methods and Boolean reasoning techniques based on rough mereology, the recently developed extension of mereology of Lesniewski.
Studies in fuzziness and soft computingSynthesis of Decision Rules for Object Classification
35 Citations1998Jan G. Bazan, Hung Son Nguyen +3 more
An exemplary system for recognizing handwritten digits based on Boolean reasoning, rough set methods and feature discovery by applying multi-modal logic is presented.
Lecture notes in computer scienceSearching for the Complex Decision Reducts: The Case Study of the Survival Analysis
31 Citations2003Jan G. Bazan, Andrzej Skowron +2 more
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed and the post-surgery survival analysis problem for the head and neck cancer cases is considered.
Lecture notes in computer scienceClassification Algorithms Based on Linear Combinations of Features
30 Citations1999Dominik Ślȩzak, Jakub Wróblewski
It is shown that properly derived combinations of attributes, treated as new elements of the conditions' set, may significantly improve the performance of well known classification algorithms, such as k-NN and rough set based approaches.
Fundamenta InformaticaeLTF-C: Architecture, Training Algorithm and Applications of New Neural Classifier
24 Citations2003Marcin Wojnarski
This paper presents a new model of an artificial neural network solving classification problems, called Local Transfer Function Classifier (LTF-C), which is very similar to this of the Radial Basis Function neural network (RBF), however it utilizes an entirely different learning algorithm.
Software Quality JournalTowards a Software Change Classification System: A Rough Set Approach
19 Citations2003James F. Peters, Sheela Ramanna
Two methods that can be used to design a practical software change classification system based on data mining methods from rough set theory based on two CI technologies are presented.
Bulletin of the European Association for Theoretical Computer ScienceDecision tables: A rough set approach
17 Citations1987Zdzisław Pawlak
This paper presents a meta-analyses of the response of the immune system to the attacks of electrons and shows clear trends in the number of attacks and severity of attacks.
Lecture notes in computer scienceProcessing of Musical Data Employing Rough Sets and Artificial Neural Networks
15 Citations2004Bożena Kostek, Piotr Szczuko +1 more
Center-Based Indexing in Vector and Metric Spaces
13 Citations2002Arkadiusz Wojna
The experiments show that the iterative k-means splitting procedure accelerates significantly k-nn searching over the one-step procedure used in other indexing structures such as GNAT, SS-tree and M- tree and that the relevant representation of a tree node is an important issue for the performance of the search process.
Oxford University Press eBooksCase studies: Public domain, multiple mining tasks systems: ROSETTA rough sets
12 Citations2002Jan Komorowski, Aleksander Øhrn +1 more
The ROSETTA system is probably one of the most complete software environments for rough set operations and supports the overall KDD process: from browsing and preprocessing of the data, to reduct computation and rule synthesis, to validation and analysis of the generated rules.
Lecture notes in computer scienceGene Discovery in Leukemia Revisited: A Computational Intelligence Perspective
11 Citations2004Julio J. Valdés, Alan J. Barton
It was found that subtle differences between very similar genes belonging to the same cluster, as well as the number of clusters constructed, affect the discovery of relevant genes.
Lecture notes in computer scienceClassification of Swallowing Sound Signals: A Rough Set Approach
10 Citations2004Lisa Lazareck, Sheela Ramanna
An approach to classifying swallowing sound signals to detect those patients at risk of aspiration, or choking using rough set methods and both discretization and non-discretization have been used to achieve attribute reduction and decision rule derivation.
Lecture notes in computer scienceTowards the Classification of Musical Works: A Rough Set Approach
4 Citations2002Monika P. Hippe
The contribution of this paper is the identification of a set of attributes that can be used to classify musical works with a considerable accuracy.