Sciweavers

588 search results - page 10 / 118
» Improving web search results using affinity graph
Sort
View
WEBI
2009
Springer
14 years 1 months ago
Full-Subtopic Retrieval with Keyphrase-Based Search Results Clustering
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...
Andrea Bernardini, Claudio Carpineto, Massimiliano...
ICIW
2009
IEEE
13 years 4 months ago
Using Propagation of Distrust to Find Untrustworthy Web Neighborhoods
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. Bu...
Panagiotis Takis Metaxas
WWW
2009
ACM
14 years 7 months ago
Query clustering using click-through graph
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
Jeonghee Yi, Farzin Maghoul
SIGIR
2012
ACM
11 years 9 months ago
Improving searcher models using mouse cursor activity
Web search components such as ranking and query suggestions analyze the user data provided in query and click logs. While this data is easy to collect and provides information abo...
Jeff Huang, Ryen W. White, Georg Buscher, Kuansan ...
ICWS
2007
IEEE
13 years 8 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
Umesh Bellur, Roshan Kulkarni