Sciweavers

447 search results - page 41 / 90
» Re-ranking search results using document-passage graphs
Sort
View
ICDM
2006
IEEE
139views Data Mining» more  ICDM 2006»
15 years 3 months ago
Detecting Link Spam Using Temporal Information
How to effectively protect against spam on search ranking results is an important issue for contemporary web search engines. This paper addresses the problem of combating one majo...
Guoyang Shen, Bin Gao, Tie-Yan Liu, Guang Feng, Sh...
CAEPIA
2007
Springer
15 years 1 months ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
15 years 11 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
SIGIR
2012
ACM
13 years 5 days ago
Fighting against web spam: a novel propagation method based on click-through data
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...
Chao Wei, Yiqun Liu, Min Zhang, Shaoping Ma, Liyun...
WWW
2007
ACM
15 years 10 months ago
Web projections: learning from contextual subgraphs of the web
Graphical relationships among web pages have been leveraged as sources of information in methods for ranking search results. To date, specific graphical properties have been used ...
Jure Leskovec, Susan T. Dumais, Eric Horvitz