Sciweavers

7150 search results - page 1238 / 1430
» Graph-Based Data Mining
Sort
View
WSDM
2010
ACM
315views Data Mining» more  WSDM 2010»
14 years 6 months ago
SBotMiner: Large Scale Search Bot Detection
In this paper, we study search bot traffic from search engine query logs at a large scale. Although bots that generate search traffic aggressively can be easily detected, a large ...
Fang Yu, Yinglian Xie, Qifa Ke
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
14 years 6 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
14 years 3 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 3 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 3 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
« Prev « First page 1238 / 1430 Last » Next »