Sciweavers

2504 search results - page 49 / 501
» Methods for comparing rankings of search engine results
Sort
View
SDM
2007
SIAM
169views Data Mining» more  SDM 2007»
14 years 6 days ago
Rank Aggregation for Similar Items
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...
D. Sculley
AUSDM
2006
Springer
202views Data Mining» more  AUSDM 2006»
14 years 2 months ago
A Comparative Study of Classification Methods For Microarray Data Analysis
In response to the rapid development of DNA Microarray technology, many classification methods have been used for Microarray classification. SVMs, decision trees, Bagging, Boostin...
Hong Hu, Jiuyong Li, Ashley W. Plank, Hua Wang, Gr...
WEBI
2009
Springer
14 years 3 months ago
Estimating Ad Clickthrough Rate through Query Intent Analysis
Clickthrough rate and cost-per-click are known to be among the factors that impact the rank of an ad shown on a search result page. Hence, search engines can benefit from estimat...
Azin Ashkan, Charles L. A. Clarke, Eugene Agichtei...
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
14 years 5 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
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...