1413 search results - page 58 / 283 » Efficient Learning of Semi-structured Data from Queries |
149
Voted
NIPS
1990
15 years 4 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
143
Voted
EMNLP
2010
15 years 1 months ago
2010
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
282
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
169
click to vote
EMNLP
2010
15 years 1 months ago
2010
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
127
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...