Ensembles of Classifiers Based on Approximate Reducts

Authors:
Jakub Wróblewski
Affiliations:
Polish-Japanese Institute of Information Technology, Koszykowa 86, 02-008 Warsaw, Poland and Institute of Mathematics, Warsaw University, ul. Banacha 2, 02-097 Warsaw, Poland
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Year:
2001

Citing 10
Cited 24

Variable precision rough set model

Journal of Computer and System Sciences
Machine learning, neural and statistical classification

Machine learning, neural and statistical classification
Theoretical foundations of order-based genetic algorithms

Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Data mining methods for knowledge discovery

Data mining methods for knowledge discovery
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Feature Selection for Knowledge Discovery and Data Mining

Feature Selection for Knowledge Discovery and Data Mining
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Taming Large Rule Models in Rough Set Approaches

PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables

ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems

A New Version of Rough Set Exploration System

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Application of Temporal Descriptors to Musical Instrument Sound Recognition

Journal of Intelligent Information Systems
Feature Extraction for Dynamic Integration of Classifiers

Fundamenta Informaticae
Universal Attribute Reduction Problem

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Computational Intelligence Techniques Applied to Magnetic Resonance Spectroscopy Data of Human Brain Cancers

RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Universal Problem of Attribute Reduction

Transactions on Rough Sets IX
Greedy Algorithm for Attribute Reduction

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Rough set approximate entropy reducts with order based particle swarm optimization

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Greedy Algorithm for Construction of Partial Association Rules

Fundamenta Informaticae
Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts

Transactions on Computational Science V
On Construction of Partial Association Rules

RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Greedy Algorithms withWeights for Construction of Partial Association Rules

Fundamenta Informaticae
The model of fuzzy variable precision rough sets

IEEE Transactions on Fuzzy Systems
Roughfication of numeric decision tables: the case study of gene expression data

RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
On partial covers, reducts and decision rules with weights

Transactions on rough sets VI
Finding relevant attributes in high dimensional data: a distributed computing hybrid data mining strategy

Transactions on rough sets VI
On partial covers, reducts and decision rules

Transactions on rough sets VIII
Upper bounds on minimum cardinality of exact and approximate reducts

RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Lower bounds on minimal weight of partial reducts and partial decision rules

RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Using positive region to reduce the computational complexity of discernibility matrix method

IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Association reducts: complexity and heuristics

RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Pairwise cores in information systems

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Relevant attribute discovery in high dimensional data based on rough sets and unsupervised classification: application to leukemia gene expressions

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Data and knowledge visualization with virtual reality spaces, neural networks and rough sets: Application to cancer and geophysical prospecting data

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of improving rough set based expert systems by modifying a notion of reduct is discussed. The notion of approximate reduct is introduced, as well as some proposals of quality measure for such a reduct. The complete classifying system based on approximate reducts is presented and discussed. It is proved that the problem of finding optimal set of classifying agents based on approximate reducts is NP-hard; the genetic algorithm is applied to find the suboptimal set. Experimental results show that the classifying system is effective and relatively fast.