Sciweavers

613 search results - page 82 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
FQAS
2009
Springer
142views Database» more  FQAS 2009»
15 years 4 months ago
On the Selection of the Best Retrieval Result Per Query - An Alternative Approach to Data Fusion
Some recent works have shown that the “perfect” selection of the best IR system per query could lead to a significant improvement on the retrieval performance. Motivated by thi...
Antonio Juárez-González, Manuel Mont...
BMCBI
2010
110views more  BMCBI 2010»
14 years 12 months ago
Concept-based query expansion for retrieving gene related publications from MEDLINE
Background: Advances in biotechnology and in high-throughput methods for gene analysis have contributed to an exponential increase in the number of scientific publications in thes...
Sérgio Matos, Joel Arrais, João Maia...
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 8 days ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
LREC
2010
199views Education» more  LREC 2010»
15 years 1 months ago
Building a Cross-lingual Relatedness Thesaurus using a Graph Similarity Measure
The Internet is an ever growing source of information stored in documents of different languages. Hence, cross-lingual resources are needed for more and more NLP applications. Thi...
Lukas Michelbacher, Florian Laws, Beate Dorow, Ulr...
VLDB
2004
ACM
93views Database» more  VLDB 2004»
15 years 5 months ago
Indexing Temporal XML Documents
Different models have been proposed recently for representing temporal data, tracking historical information, and recovering the state of the document as of any given time, in XM...
Alberto O. Mendelzon, Flavio Rizzolo, Alejandro A....