Sciweavers

337 search results - page 53 / 68
» Efficient algorithms for ranking with SVMs
Sort
View
IRI
2007
IEEE
14 years 1 months ago
BESearch: A Supervised Learning Approach to Search for Molecular Event Participants
Biomedical researchers rely on keyword-based search engines to retrieve superficially relevant documents, from which they must filter out irrelevant information manually. Hence, t...
Richard Tzong-Han Tsai, Hong-Jie Dai, Hsi-Chuan Hu...
ICML
2006
IEEE
14 years 8 months ago
Full Bayesian network classifiers
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
Jiang Su, Harry Zhang
VLDB
2004
ACM
98views Database» more  VLDB 2004»
14 years 22 days ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
DCG
2002
66views more  DCG 2002»
13 years 7 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 2 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...