Sciweavers

775 search results - page 31 / 155
» Algorithm Selection via Ranking
Sort
View
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
11 years 11 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
SIGIR
2009
ACM
14 years 3 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
JCDL
2010
ACM
187views Education» more  JCDL 2010»
13 years 11 months ago
Social network document ranking
In search engines, ranking algorithms measure the importance and relevance of documents mainly based on the contents and relationships between documents. User attributes are usual...
Liang Gou, Xiaolong Zhang, Hung-Hsuan Chen, Jung-H...
SIGIR
2010
ACM
14 years 24 days ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
13 years 10 months ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang