Two Families of Classification Algorithms-Reference-Cited by-同舟云学术

Two Families of Classification Algorithms

Published:2007 Issue: Volume: Page:297-304
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Delimata Pawel,Moshkov Mikhail,Skowron Andrzej,Suraj Zbigniew

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-72530-5_35

Reference9 articles.

1. Aha, D.W. (ed.): Lazy Learning. Kluwer Academic Publishers, Dordrecht (1997)

2. Lecture Notes in Artificial Intelligence;J.G. Bazan,1998

3. Bazan, J.G.: A comparison of dynamic and non-dynamic rough set methods for extracting laws from decision table. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, pp. 321–365. Physica-Verlag, Heidelberg (1998)

4. Bazan, J.G.: Methods of approximate reasoning for synthesis of decision algorithms (in Polish). Ph.D. Thesis. Warsaw University (1998)

5. Data Mining Exploration System Homepage (Software), http://www.univ.rzeszow.pl/rspn

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Introduction;Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions;2019-03-14

2. Optimization of Inhibitory Decision Rules Relative to Coverage – Comparative Study;Beyond Databases, Architectures and Structures;2015

3. Comparison of Heuristics for Inhibitory Rule Optimization;Procedia Computer Science;2014

4. Optimization of Approximate Inhibitory Rules Relative to Number of Misclassifications;Procedia Computer Science;2013

5. Sequential Optimization of Approximate Inhibitory Rules Relative to the Length, Coverage and Number of Misclassifications;Rough Sets and Knowledge Technology;2013