3395 search results - page 392 / 679 » Learning to efficiently rank |
170
click to vote
ITS
2000
Springer
15 years 10 months ago
2000
Springer
Graphical representations have long been associated with more efficient problem solving. More recently, researchers have begun looking at how representation may affect the informat...
169
click to vote
ESANN
2007
15 years 8 months ago
2007
A new efficient unsupervised feature selection method is proposed to handle transactional data. The proposed feature selection method introduces a new Data Distribution Factor (DDF...
125
click to vote
COLING
2010
15 years 1 months ago
2010
This paper proposes an efficient online method that trains a classifier with many conjunctive features. We employ kernel computation called kernel slicing, which explicitly consid...
176
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We describe an algorithm for constructing a set of acyclic conjunctive relational features by combining smaller conjunctive blocks. Unlike traditional level-wise approaches which ...
169
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The k q-flats algorithm is a generalization of the popular k-means algorithm where q dimensional best fit affine sets replace centroids as the cluster prototypes. In this work, a ...