Sciweavers

3241 search results - page 75 / 649
» Challenges for Dataset Search
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 1 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
ADC
2003
Springer
153views Database» more  ADC 2003»
15 years 4 months ago
Automated Discovery of Search Interfaces on the Web
Web search engines work well for finding crawlable pages, but not for finding datasets hidden behind Web search forms. We describe a novel technique for detecting search forms, ...
Jared Cope, Nick Craswell, David Hawking
BMCBI
2010
178views more  BMCBI 2010»
14 years 11 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
PVLDB
2008
82views more  PVLDB 2008»
14 years 10 months ago
Mining non-redundant high order correlations in binary data
Many approaches have been proposed to find correlations in binary data. Usually, these methods focus on pair-wise correlations. In biology applications, it is important to find co...
Xiang Zhang, Feng Pan, Wei Wang 0010, Andrew B. No...
AAAI
2007
15 years 1 months ago
Modeling Contextual Factors of Click Rates
In this paper, we develop and evaluate several probabilistic models of user click-through behavior that are appropriate for modeling the click-through rates of items that are pres...
Hila Becker, Christopher Meek, David Maxwell Chick...