Filters








84,537 Hits in 8.7 sec

Searching the World Wide Web: Challenges and Partial Solutions [chapter]

Ricardo A. Baeza-Yates
1998 Lecture Notes in Computer Science  
Finally, we present recent results that can help to partially solve the challenges posed. ¡ Distributed data: due to the intrinsic nature of the Web, data spans over many computers and platforms.  ...  In this article we analyze the problem of searching the WWW, giving some insight and models to understand its complexity. Then we survey the two main current techniques used to search the WWW.  ...  Acknowledgments We thanks the helpful comments of Gonzalo Navarro, in particular his contribution to Section 2.  ... 
doi:10.1007/3-540-49795-1_4 fatcat:dft4bf3lxvfvhhl7suqetnkuve

Diversifying web search results

Davood Rafiei, Krishna Bharat, Anand Shukla
2010 Proceedings of the 19th international conference on World wide web - WWW '10  
In this work, we model the problem as expectation maximization and study the challenges of estimating the model parameters and reaching an equilibrium.  ...  Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results.  ...  This research was partially supported by the Natural Sciences and Engineering Research Council.  ... 
doi:10.1145/1772690.1772770 dblp:conf/www/RafieiBS10 fatcat:62h4xdxqe5fotpdbyer2ovplhe

Searching for Flash Movies on the Web: A Content and Context Based Framework

Jun Yang, Qing Li, Liu Wenyin, Yueting Zhuang
2005 World wide web (Bussum)  
The phenomenal growth of online Flash movies in recent years has made Flash one of the most prevalent media formats on the Web.  ...  An experimental Flash search engine system has been implemented to demonstrate the feasibility of the suggested framework.  ...  This great variety poses a challenge on user interface design.  ... 
doi:10.1007/s11280-005-0905-x fatcat:pw2lj6wedbdkrbsoxnofe4v34y

Composite retrieval of heterogeneous web search

Horatiu Bota, Ke Zhou, Joemon M. Jose, Mounia Lalmas
2014 Proceedings of the 23rd international conference on World wide web - WWW '14  
For instance, many such search engines return to users both images and web documents as answers to the query "flower". Aggregated search has become a very popular paradigm.  ...  Compared with three baselines (traditional "general web only" ranking, federated search ranking and aggregated search), our evaluation results demonstrate significant performance improvement for a highly  ...  Acknowledgments This work was partially funded by the Linguistically Motivated Semantic Aggregation Engines (LiMoSINe 3 ) EU project.  ... 
doi:10.1145/2566486.2567985 dblp:conf/www/BotaZJL14 fatcat:iqwvvlbtb5dmxcupdjp25guvba

Exploiting web search to generate synonyms for entities

Surajit Chaudhuri, Venkatesh Ganti, Dong Xin
2009 Proceedings of the 18th international conference on World wide web - WWW '09  
In this paper, we exploit web search engines in order to define new similarity functions.  ...  Many solutions to these tasks assume the existence of reference entity tables.  ...  Copyright is held by the International World Wide Web Conference Committee (IW3C2). Distribution of these papers is limited to classroom use, and personal use by others. Consider another application.  ... 
doi:10.1145/1526709.1526731 dblp:conf/www/ChaudhuriGX09 fatcat:oajzxpby35eabg3gk43pz4dmjm

Open Data for Local Search

Eric Charton, Nizar Ghoula, Marie-Jean Meurs
2016 Proceedings of the 25th International Conference Companion on World Wide Web - WWW '16 Companion  
Available open data can be exploited to dramatically improve the design of local search engines and their content.  ...  Those issues come for example from the lack of information about local events and actors, or the specific form taken by the indexable data.  ...  For all of those reasons, the development of local search engines and related data architecture designs -including usage of open data -is an important topic of investigation for the World Wide Web community  ... 
doi:10.1145/2872518.2890487 dblp:conf/www/ChartonGM16 fatcat:wn2y7ehbtnhmpn5wnd62tvy7gm

Better Caching in Search Advertising Systems with Rapid Refresh Predictions

Conglong Li, David G. Andersen, Qiang Fu, Sameh Elnikety, Yuxiong He
2018 Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18  
To maximize profit and connect users to relevant products and services, search advertising systems use sophisticated machine learning algorithms to estimate the revenue expectations of thousands of matching  ...  Simulations conducted on the logs from a major commercial search advertising system show that our proposed cache design reduces the negative revenue impact (0.07×), and improves the cost savings (1.41×  ...  This work was partially supported by the National Science Foundation (CCF-1535821).  ... 
doi:10.1145/3178876.3186176 dblp:conf/www/LiAFEH18 fatcat:g4oaa7wq2jbavggqavc5q23n7q

Efficient interactive fuzzy keyword search

Shengyue Ji, Guoliang Li, Chen Li, Jianhua Feng
2009 Proceedings of the 18th international conference on World wide web - WWW '09  
In this paper, we study a new information-access paradigm, called "interactive, fuzzy search," in which the system searches the underlying data "on the fly" as the user types in query keywords.  ...  One of them has been deployed to support interactive search on the UC Irvine people directory, which has been used regularly and well received by users due to its friendly interface and high efficiency  ...  We materialized the union lists of all the query keywords and their prefixes, and computed an intersection by using the record IDs of the shortest list to probe the other union lists.  ... 
doi:10.1145/1526709.1526760 dblp:conf/www/JiLLF09 fatcat:vfiuzxbukrhcpegsdicc3yyuhy

The SemSets model for ad-hoc semantic list search

Marek Ciglan, Kjetil Nørvåg, Ladislav Hluchý
2012 Proceedings of the 21st international conference on World Wide Web - WWW '12  
The amount of semantic data on the web has been growing rapidly in recent years.  ...  One of the key challenges triggered by this growth is the ad-hoc querying, i.e., the ability to retrieve answers from semantic resources using natural language queries.  ...  MAP P@5 P@10 P@15 P@20 P@30 0.2795 0.3560 0.3660 0.3187 0.2890 0.2133 http://www.linkeddata.org/ Copyright is held by the International World Wide Web Conference Committee (IW3C2).  ... 
doi:10.1145/2187836.2187855 dblp:conf/www/CiglanNH12 fatcat:gfbgf747vrd25jvfylbipm6yfu

Fast topic discovery from web search streams

Di Jiang, Kenneth Wai-Ting Leung, Wilfred Ng
2014 Proceedings of the 23rd international conference on World wide web - WWW '14  
Recently latent topics in web search data have been found to be critical for a wide range of search engine applications such as search personalization and search history warehousing.  ...  However, the existing methods usually discover latent topics from web search data in an offline and retrospective fashion.  ...  Researchers have found that latent topics in web search data are effective for improving the performance of a wide spectrum of search engine Copyright is held by the International World Wide Web Conference  ... 
doi:10.1145/2566486.2567965 dblp:conf/www/JiangLN14 fatcat:7c2dghxysra4nc5eaokhbgyxgi

Compressed data structures for annotated web search

Soumen Chakrabarti, Sasidhar Kasturi, Bharath Balakrishnan, Ganesh Ramakrishnan, Rohit Saraf
2012 Proceedings of the 21st international conference on World Wide Web - WWW '12  
Entity relationship search at Web scale depends on adding dozens of entity annotations to each of billions of crawled pages and indexing the annotations at rates comparable to regular text indexing.  ...  The above targets raise many challenges, major ones being the design of highly compressed data structures in RAM for spotting and disambiguating entity mentions, and highly compressed disk-based annotation  ...  Thanks to Natassa Ailamaki for vertical database references and Sebastiano Vigna for much help with MG4J.  ... 
doi:10.1145/2187836.2187854 dblp:conf/www/ChakrabartiKBRS12 fatcat:fvsoblhbtzf2lhfmrhmvzky6c4

Towards natural question guided search

Alexander Kotov, ChengXiang Zhai
2010 Proceedings of the 19th international conference on World wide web - WWW '10  
Web search is generally motivated by an information need.  ...  Implementation of the proposed strategy raises new challenges in content indexing, question generation, ranking and feedback.  ...  Copyright is held by the International World Wide Web Conference Committee (IW3C2). Distribution of these papers is limited to classroom use, and personal use by others.  ... 
doi:10.1145/1772690.1772746 dblp:conf/www/KotovZ10 fatcat:wf4hq2jgibb6tnsjqv6ojv7vza

Extraction and search of chemical formulae in text documents on the web

Bingjun Sun, Qingzhao Tan, Prasenjit Mitra, C. Lee Giles
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
Often scientists seek to search for articles on the Web related to a particular chemical.  ...  Furthermore, query models are introduced for formula search, and for each a scoring scheme based on features of partial formulae is proposed to measure the relevance of chemical formulae and queries.  ...  INTRODUCTION Increasingly, more scientific documents are being published on the World-Wide-Web. Scientists, especially chemists, often want to search for articles related to particular chemicals.  ... 
doi:10.1145/1242572.1242607 dblp:conf/www/SunTMG07 fatcat:m5yb6iogffhmfnghpv5opzw5qm

A personalized search engine based on web-snippet hierarchical clustering

Paolo Ferragina, Antonio Gulli
2005 Special interest tracks and posters of the 14th international conference on World Wide Web - WWW '05  
We extensively test SnakeT against all available web-snippet clustering engines, and show that it achieves efficiency and efficacy performance close to the best known engine Vivisimo.com.  ...  SnakeT is the first complete and open-source system in the literature that offers both hierarchical clustering and folder labeling with variable-length sentences.  ...  However search engines do not provide a cheap access to the web graph thus making the link retrieval efficient if limited to a local (partial) copy available at the clustering engine site.  ... 
doi:10.1145/1062745.1062760 dblp:conf/www/FerraginaG05 fatcat:4ja4gpvmqneufd66pius75oidm

Parallel boosted regression trees for web search ranking

Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal, Jennifer Paykin
2011 Proceedings of the 20th international conference on World wide web - WWW '11  
We present experimental results on both shared memory machines and clusters for two large scale web search ranking data sets.  ...  Our technique parallelizes the construction of the individual regression trees and operates using the master-worker paradigm as follows. The data are partitioned among the workers.  ...  ACKNOWLEDGEMENTS We would like to thank Ananth Mohan for sharing his exact implementation of Gradient Boosted Regression Trees and Yahoo Labs for providing resources for this research.  ... 
doi:10.1145/1963405.1963461 dblp:conf/www/TyreeWAP11 fatcat:32w5v4mekjduni2dmliat4elxm
« Previous Showing results 1 — 15 out of 84,537 results