1661 search results - page 52 / 333 » Decision Tree Fields |
137
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
142
click to vote
SAC
2006
ACM
16 years 3 days ago
2006
ACM
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
172
click to vote
ILP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
149
click to vote
CIKM
2001
Springer
15 years 9 months ago
2001
Springer
Scalable data mining in large databases is one of today's challenges to database technologies. Thus, substantial effort is dedicated to a tight coupling of database and data ...
162
click to vote
KDD
1995
ACM
15 years 9 months ago
1995
ACM
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...