• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,586
Next 10 →

Optimizing Search Engines using Clickthrough Data

by Thorsten Joachims , 2002
"... This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches ..."
Abstract - Cited by 1314 (23 self) - Add to MetaCart
function of a meta-search engine to a particular group of users, outperforming Google in terms of retrieval quality after only a couple of hundred training examples.

The anatomy of a large-scale hypertextual web search engine.

by Sergey Brin , Lawrence Page - Comput. Netw. ISDN Syst., , 1998
"... Abstract In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a fu ..."
Abstract - Cited by 4673 (5 self) - Add to MetaCart
Abstract In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a

Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords

by Benjamin Edelman, Michael Ostrovsky, Michael Schwarz - AMERICAN ECONOMIC REVIEW , 2007
"... We investigate the “generalized second-price” (GSP) auction, a new mechanism used by search engines to sell online advertising. Although GSP looks similar to the Vickrey-Clarke-Groves (VCG) mechanism, its properties are very different. Unlike the VCG mechanism, GSP generally does not have an equilib ..."
Abstract - Cited by 555 (18 self) - Add to MetaCart
We investigate the “generalized second-price” (GSP) auction, a new mechanism used by search engines to sell online advertising. Although GSP looks similar to the Vickrey-Clarke-Groves (VCG) mechanism, its properties are very different. Unlike the VCG mechanism, GSP generally does not have

Learning to rank using gradient descent

by Chris Burges, Tal Shaked, Erin Renshaw, Matt Deeds, Nicole Hamilton, Greg Hullender - In ICML , 2005
"... We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data f ..."
Abstract - Cited by 534 (17 self) - Add to MetaCart
from a commercial internet search engine. 1.

Learning object categories from google’s image search

by R. Fergus, L. Fei-fei, P. Perona, A. Zisserman - In Proceedings of the International Conference on Computer Vision , 2005
"... Current approaches to object category recognition require datasets of training images to be manually prepared, with varying degrees of supervision. We present an approach that can learn an object category from just its name, by uti-lizing the raw output of image search engines available on the Inter ..."
Abstract - Cited by 316 (18 self) - Add to MetaCart
on the Internet. We develop a new model, TSI-pLSA, which extends pLSA (as applied to visual words) to include spa-tial information in a translation and scale invariant man-ner. Our approach can handle the high intra-class vari-ability and large proportion of unrelated images returned by search engines. We

Internet traffic engineering by optimizing OSPF weights

by Bernard Fortz - in Proc. IEEE INFOCOM , 2000
"... Abstract—Open Shortest Path First (OSPF) is the most commonly used intra-domain internet routing protocol. Traffic flow is routed along shortest paths, splitting flow at nodes where several outgoing links are on shortest paths to the destination. The weights of the links, and thereby the shortest pa ..."
Abstract - Cited by 403 (13 self) - Add to MetaCart
Abstract—Open Shortest Path First (OSPF) is the most commonly used intra-domain internet routing protocol. Traffic flow is routed along shortest paths, splitting flow at nodes where several outgoing links are on shortest paths to the destination. The weights of the links, and thereby the shortest

The Google similarity distance

by Rudi Cilibrasi, Paul M. B. Vitányi , 2005
"... Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of ‘society ’ is ‘database, ’ and the equivalent of ‘use ’ is ‘way to search the database. ’ We present a new theory of similarity between ..."
Abstract - Cited by 320 (9 self) - Add to MetaCart
words and phrases based on information distance and Kolmogorov complexity. To fix thoughts we use the world-wide-web as database, and Google as search engine. The method is also applicable to other search engines and databases. This theory is then applied to construct a method to automatically extract

Agglomerative Clustering of a Search Engine Query Log

by Doug Beeferman, Adam Berger - In Proceedings of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2000
"... This paper introduces a technique for mining a collection of user transactions with an Internet search engine to discover clusters of similar queries and similar URLs. The information we exploit is "clickthrough data": each record consists of a user's query to a search engine along wi ..."
Abstract - Cited by 330 (0 self) - Add to MetaCart
This paper introduces a technique for mining a collection of user transactions with an Internet search engine to discover clusters of similar queries and similar URLs. The information we exploit is "clickthrough data": each record consists of a user's query to a search engine along

Online Only Main Article Suture techniques in nasal tip sculpture: current concepts

by S Lo, J Rowe-jones
"... Objectives: The three-dimensional anatomy and conspicuous location of the nasal tip makes it one of the most challenging sites of facial plastic surgery. This article reviews literature on nasal tip sculpture using suture techniques, as well as the authors ’ own experience. Methods: A search was con ..."
Abstract - Add to MetaCart
was conducted using Pubmed, the Google internet search engine and the authors’

DBXplorer: A system for keyword-based search over relational databases

by Sanjay Agrawal - In ICDE , 2002
"... Internet search engines have popularized the keywordbased search paradigm. While traditional database management systems offer powerful query languages, they do not allow keyword-based search. In this paper, we discuss DBXplorer, a system that enables keywordbased search in relational databases. DBX ..."
Abstract - Cited by 306 (6 self) - Add to MetaCart
Internet search engines have popularized the keywordbased search paradigm. While traditional database management systems offer powerful query languages, they do not allow keyword-based search. In this paper, we discuss DBXplorer, a system that enables keywordbased search in relational databases
Next 10 →
Results 1 - 10 of 3,586
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University