Sciweavers

621 search results - page 28 / 125
» Learning to Distribute Queries into Web Search Nodes
Sort
View
ICDCSW
2006
IEEE
15 years 6 months ago
Improve Searching by Reinforcement Learning in Unstructured P2Ps
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
Xiuqi Li, Jie Wu
ICWSM
2008
15 years 1 months ago
Logsonomy: A Search Engine Folksonomy
In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hyper...
Robert Jäschke, Beate Krause, Andreas Hotho, ...
110
Voted
PDIS
1996
IEEE
15 years 4 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo
KDD
2007
ACM
169views Data Mining» more  KDD 2007»
16 years 25 days ago
Exploiting underrepresented query aspects for automatic query expansion
Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely ...
Daniel Crabtree, Peter Andreae, Xiaoying Gao
93
Voted
SPIRE
2010
Springer
14 years 10 months ago
Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval
The retrieval of similar documents in the Web from a given document is different in many aspects from information retrieval based on queries generated by regular search engine use...
Felipe Bravo-Marquez, Gaston L'Huillier, Sebasti&a...