Name
Abstract | ||
|---|---|---|
In the paper, two families of lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on ordinary and inhibitory rules, but the direct generation of rules is not required. Instead of this, the considered algorithms extract efficiently for a new object some information on the set of rules which is next used by a decision-making procedure. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72530-5_35 | RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing |
Keywords | Field | DocType |
classification algorithms,polynomial time complexity,decision-making procedure,direct generation,decision tables,rough sets,inhibitory rule,information systems,rules.,lazy classification algorithm,new object,decision table,rough set,information system,polynomial time | Information system,Polynomial time complexity,Decision table,Computer science,Rough set,Artificial intelligence,Statistical classification,Machine learning,Dominance-based rough set approach | Conference |
Volume | ISSN | Citations |
4482 | 0302-9743 | 9 |
PageRank | References | Authors |
0.79 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pawel Delimata | 1 | 38 | 3.47 |
| Mikhail Ju. Moshkov | 2 | 335 | 60.44 |
| Andrzej Skowron | 3 | 5062 | 421.31 |
| Zbigniew Suraj | 4 | 501 | 59.96 |