Order based genetic algorithms for the search of approximate entropy reducts

Authors:
Dominik Şlęzak;Jakub Wróblewski
Affiliations:
Department of Computer Science University of Regina, Regina, Canada and Polish-Japanese Institute of Information Technology, Warsaw, Poland;Polish-Japanese Institute of Information Technology, Warsaw, Poland
Venue:
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Year:
2003

Citing 5
Cited 25

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Theoretical foundations of order-based genetic algorithms

Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Uncertainly measures of rough set prediction

Artificial Intelligence
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
The Case against Accuracy Estimation for Comparing Induction Algorithms

ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning

Approximate entropy reducts

Fundamenta Informaticae
Feature selection based on rough sets and particle swarm optimization

Pattern Recognition Letters
On Construction of Partial Reducts and Irreducible Partial Decision Rules

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
An efficient ant colony optimization approach to attribute reduction in rough set theory

Pattern Recognition Letters
Rough Sets in Hybrid Soft Computing Systems

ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Degrees of conditional (in)dependence: A framework for approximate Bayesian networks and examples related to the rough set-based feature selection

Information Sciences: an International Journal
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
On partial covers, reducts and decision rules with weights

Transactions on rough sets VI
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
A new knowledge reduction algorithm based on decision power in rough set

Transactions on rough sets XII
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
A rough set-based magnetic resonance imaging partial volume detection system

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Association reducts: complexity and heuristics

RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Finding minimal rough set reducts with particle swarm optimization

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
A comparative evaluation of rough sets and probabilistic network algorithms on learning pseudo-independent domains

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
A hybrid approach to MR imaging segmentation using unsupervised clustering and approximate reducts

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Association reducts: a framework for mining multi-attribute dependencies

ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Greedy Algorithm for Attribute Reduction

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On Construction of Partial Reducts and Irreducible Partial Decision Rules

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Approximate Entropy Reducts

Fundamenta Informaticae
Dynamic Programming Approach for Partial Decision Rule Optimization

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Dynamic programming approach to optimization of approximate decision rules

Information Sciences: an International Journal
Classifiers Based on Optimal Decision Rules

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Relationships Between Length and Coverage of Decision Rules

Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use entropy to extend the rough set based notion of a reduct. We show that the order based genetic algorithms, applied to the search of classical decision reducts, can be used in exactly the same way in case of extracting optimal approximate entropy reducts from data.