Sciweavers

493 search results - page 28 / 99
» A Multi-relational Decision Tree Learning Algorithm - Implem...
Sort
View
DATAMINE
1999
143views more  DATAMINE 1999»
13 years 8 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
GECCO
2009
Springer
188views Optimization» more  GECCO 2009»
14 years 18 days ago
Exploiting multiple classifier types with active learning
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
Zhenyu Lu, Josh Bongard
AAAI
2004
13 years 10 months ago
Using Performance Profile Trees to Improve Deliberation Control
Performance profile trees have recently been proposed as a theoretical basis for fully normative deliberation control. In this paper we conduct the first experimental study of the...
Kate Larson, Tuomas Sandholm
WSDM
2012
ACM
352views Data Mining» more  WSDM 2012»
12 years 4 months ago
Multi-relational matrix factorization using bayesian personalized ranking for social network data
A key element of the social networks on the internet such as Facebook and Flickr is that they encourage users to create connections between themselves, other users and objects. On...
Artus Krohn-Grimberghe, Lucas Drumond, Christoph F...
ICMLA
2010
13 years 6 months ago
Classification Models with Global Constraints for Ordinal Data
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
Jaime S. Cardoso, Ricardo Sousa