Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

On combined classifiers, rule induction and roughs

Authors

[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee

Year of publication

2007

Chapter type

chapter in monograph

Publication language

english

Abstract

EN Problems of using elements of rough sets theory and rule induction to create efficient classifiers are discussed. In the last decade many researches attempted to increase a classification accuracy by combining several classifiers into integrated systems. The main aim of this paper is to summarize the author’s own experience with applying one of his rule induction algorithm, called MODLEM, in the framework of different combined classifiers, namely, the bagging, n2–classifier and the combiner aggregation. We also discuss how rough approximations are applied in rule induction. The results of carried out experiments have shown that the MODLEM algorithm can be efficiently used within the framework of considered combined classifiers.

Pages (from - to)

329 - 350

DOI

10.1007/978-3-540-71200-8_18

URL

https://link.springer.com/chapter/10.1007/978-3-540-71200-8_18

Book

Transactions on Rough Sets VI. Commemorating the Life and Work of Zdzisław Pawlak, Part I

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.