Sciweavers

1326 search results - page 108 / 266
» Adaptable Similarity Search using Non-Relevant Information
Sort
View
PR
2006
141views more  PR 2006»
15 years 6 months ago
Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
The performance of many supervised and unsupervised learning algorithms is very sensitive to the choice of an appropriate distance metric. Previous work in metric learning and ada...
Hong Chang, Dit-Yan Yeung, William K. Cheung
WWW
2003
ACM
16 years 7 months ago
Adaptive ranking of web pages
In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation. It...
Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Ma...
CIKM
2008
Springer
15 years 8 months ago
Are click-through data adequate for learning web search rankings?
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
Zhicheng Dou, Ruihua Song, Xiaojie Yuan, Ji-Rong W...
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 6 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra
WWW
2010
ACM
16 years 1 months ago
Competing for users' attention: on the interplay between organic and sponsored search results
Queries on major Web search engines produce complex result pages, primarily composed of two types of information: organic results, that is, short descriptions and links to relevan...
Cristian Danescu-Niculescu-Mizil, Andrei Z. Broder...