Sciweavers

4972 search results - page 624 / 995
» Ranking on graph data
Sort
View
CIKM
2011
Springer
14 years 6 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
CVPR
2006
IEEE
16 years 8 months ago
Semi-Supervised Classification Using Linear Neighborhood Propagation
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
Fei Wang, Changshui Zhang, Helen C. Shen, Jingdong...
KDD
2005
ACM
182views Data Mining» more  KDD 2005»
16 years 7 months ago
Making holistic schema matching robust: an ensemble approach
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
Bin He, Kevin Chen-Chuan Chang
SIGMOD
2007
ACM
413views Database» more  SIGMOD 2007»
16 years 7 months ago
Effective keyword-based selection of relational databases
The wide popularity of free-and-easy keyword based searches over World Wide Web has fueled the demand for incorporating keyword-based search over structured databases. However, mo...
Bei Yu, Guoliang Li, Karen R. Sollins, Anthony K. ...
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
16 years 8 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...