Sciweavers

250 search results - page 47 / 50
» Query routing for Web search engines: architecture and exper...
Sort
View
SPIRE
2005
Springer
14 years 1 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
ICML
1998
IEEE
14 years 8 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
Gu Xu, Shuang-Hong Yang, Hang Li
ICSOC
2010
Springer
13 years 6 months ago
A Requirement-Centric Approach to Web Service Modeling, Discovery, and Selection
Service-Oriented Computing (SOC) has gained considerable popularity for implementing Service-Based Applications (SBAs) in a flexible and effective manner. The basic idea of SOC i...
Maha Driss, Naouel Moha, Yassine Jamoussi, Jean-Ma...
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 8 months ago
Event detection from evolution of click-through data
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...