Sciweavers

493 search results - page 20 / 99
» A Multi-relational Decision Tree Learning Algorithm - Implem...
Sort
View
SAC
2006
ACM
14 years 2 months ago
Induction of compact decision trees for personalized recommendation
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...
Daniel Nikovski, Veselin Kulev
JMLR
2010
230views more  JMLR 2010»
13 years 3 months ago
Learning Dissimilarities for Categorical Symbols
In this paper we learn a dissimilarity measure for categorical data, for effective classification of the data points. Each categorical feature (with values taken from a finite set...
Jierui Xie, Boleslaw K. Szymanski, Mohammed J. Zak...
ECAI
2000
Springer
14 years 1 months ago
Data Set Editing by Ordered Projection
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
Jesús S. Aguilar-Ruiz, José Crist&oa...
ICDIM
2007
IEEE
14 years 3 months ago
Pattern-based decision tree construction
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...
IDA
2007
Springer
14 years 2 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski