2750 search results - page 305 / 550 » Learning Efficient Parsing |
131
click to vote
ITS
2000
Springer
15 years 7 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...
129
click to vote
ESANN
2007
15 years 5 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...
135
Voted
ICML
2009
IEEE
16 years 4 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 ...
119
click to vote
ICML
2009
IEEE
16 years 4 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 ...
111
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...