4591 search results - page 251 / 919 » Learning from Dyadic Data |
149
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
155
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
This paper is concerned with actively predicting search intent from user browsing behavior data. In recent years, great attention has been paid to predicting user search intent. H...
115
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Dimensionality reduction is the problem of finding a low-dimensional representation of highdimensional input data. This paper examines the case where additional information is kno...
162
click to vote
DMIN
2007
15 years 6 months ago
2007
— One way to handle data mining problems where class prior probabilities and/or misclassification costs between classes are highly unequal is to resample the data until a new, d...
146
click to vote
ICANN
2010
Springer
15 years 4 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...