7581 search results - page 1293 / 1517 » Incompleteness in Data Mining |
131
click to vote
PKDD
2005
Springer
15 years 10 months ago
2005
Springer
Logistic Model Trees have been shown to be very accurate and compact classifiers [8]. Their greatest disadvantage is the computational complexity of inducing the logistic regressi...
147
click to vote
PKDD
2005
Springer
15 years 10 months ago
2005
Springer
Cost-sensitive decision tree and cost-sensitive naïve Bayes are both new cost-sensitive learning models proposed recently to minimize the total cost of test and misclassifications...
138
click to vote
PKDD
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
135
Voted
RSFDGRC
2005
Springer
15 years 10 months ago
2005
Springer
We present the Distributed Executor for RSES (DIXER) which is a supplementary software for the Rough Set Exploration System (RSES). It takes an advantage of grid computing paradigm...
138
Voted
RSFDGRC
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, a new variant of Bagging named DepenBag is proposed. This algorithm obtains bootstrap samples at first. Then, it employs a causal discoverer to induce from each sam...