Sciweavers

1025 search results - page 91 / 205
» Constraint Programming for Data Mining and Machine Learning
Sort
View
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 1 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 3 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
KDD
1999
ACM
185views Data Mining» more  KDD 1999»
15 years 7 months ago
User-Driven Navigation Pattern Discovery from Internet Data
Managers of electronic commerce sites need to learn as much as possible about their customers and those browsing their virtual premises, in order to maximise the return on marketin...
Matthias Baumgarten, Alex G. Büchner, Sarabjo...
111
Voted
ICDM
2010
IEEE
154views Data Mining» more  ICDM 2010»
15 years 1 months ago
Discrimination Aware Decision Tree Learning
Abstract--Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute , find a classifier with high predictive accu...
Faisal Kamiran, Toon Calders, Mykola Pechenizkiy
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
15 years 9 months ago
The Feature Importance Ranking Measure
Most accurate predictions are typically obtained by learning machines with complex feature spaces (as e.g. induced by kernels). Unfortunately, such decision rules are hardly access...
Alexander Zien, Nicole Krämer, Sören Son...