An application of rough sets to Monk's problems solving

Authors:
Duoqian Miao;Lishan Hou
Affiliations:
Dpt. of Computer Science, Tongji University, National High Performance Computing Center, Shanghai, P. R. China;Dpt of Mathematics, Shanxi University, Taiyuan, P. R. China
Venue:
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Year:
2003

Citing 3
Cited 1

On estimating probabilities in tree pruning

EWSL-91 Proceedings of the European working session on learning on Machine learning
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Learning Logical Definitions from Relations

Machine Learning

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the main techniques of inductive machine learning are united to the knowledge reduction theory based on rough sets from the theoretical point of view. And then the Monk's problems are resolved again employing rough sets. As far as accuracy and conciseness are concerned, the learning algorithms based on rough sets have remarkable superiority to the previous methods.