Sciweavers

893 search results - page 23 / 179
» Relational link-based ranking
Sort
View
PODS
2005
ACM
86views Database» more  PODS 2005»
14 years 4 months ago
An incremental algorithm for computing ranked full disjunctions
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
Sara Cohen, Yehoshua Sagiv
BMCBI
2007
179views more  BMCBI 2007»
13 years 11 months ago
Gene selection with multiple ordering criteria
Background: A microarray study may select different differentially expressed gene sets because of different selection criteria. For example, the fold-change and p-value are two co...
James J. Chen, Chen-An Tsai, ShengLi Tzeng, Chun-H...
SIGIR
2005
ACM
14 years 4 months ago
Question answering passage retrieval using dependency relations
State-of-the-art question answering (QA) systems employ termdensity ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among ques...
Hang Cui, Renxu Sun, Keya Li, Min-Yen Kan, Tat-Sen...
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
15 years 15 days ago
Progressive Keyword Search in Relational Databases
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
ICML
2003
IEEE
14 years 11 months ago
Learning Distance Functions using Equivalence Relations
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
Aharon Bar-Hillel, Tomer Hertz, Noam Shental, Daph...