Name
Abstract | ||
|---|---|---|
In the paper two algorithms for reducts evaluation have been proposed. Presented methods use lazy algorithms to calculate the number of deterministic and inhibitory decision rules. Calculated values are used later to estimate the quality of the reducts. The two proposed algorithms have polynomial time complexity. The results obtained by both approaches were compared with performance of the two classifiers k -NN and Naive Bayesian Classifier. All algorithms were tested on several benchmark data sets from the UCI Repository of Machine Learning Databases [3]. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02962-2_15 | RSKT |
Keywords | Field | DocType |
reducts evaluation,uci repository,classifiers k,benchmark data set,lazy algorithms,calculated value,presented method,naive bayesian classifier,machine learning databases,inhibitory decision rule,proposed algorithm,machine learning,decision rule,feature selection,polynomial time | Decision rule,Data mining,Data set,Polynomial time complexity,Pattern recognition,Feature selection,Computer science,Algorithm,Artificial intelligence,Machine learning,Naive bayesian classifier | Conference |
Volume | ISSN | Citations |
5589 | 0302-9743 | 1 |
PageRank | References | Authors |
0.40 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pawel Delimata | 1 | 38 | 3.47 |
| Zbigniew Suraj | 2 | 501 | 59.96 |