Mobile Search Engine Using Clustering and Query Expansion
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
DEWS: a Decentralized Engine for Web Search
DEWS: A Decentralized Engine for Web Search Reaz Ahmed, Rakibul Haque, Md. Faizul Bari, Raouf Boutaba David R. Cheriton School of Computer Science, University of Waterloo [r5ahmed|m9haque|mfbari|rboutaba]@uwaterloo.ca Bertrand Mathieu Orange Labs, Lannion, France [email protected] (Technical Report: CS-2012-17) Abstract The way we explore the Web is largely governed by centrally controlled, clustered search engines, which is not healthy for our freedom in the Internet. A better solution is to enable the Web to index itself in a decentralized manner. In this work we propose a decentralized Web search mechanism, named DEWS, which will enable the existing webservers to collaborate with each other to form a distributed index of the Web. DEWS can rank the search results based on query keyword relevance and relative importance of websites. DEWS also supports approximate matching of query keywords and incremental retrieval of search results in a decentralized manner. We use the standard LETOR 3.0 dataset to validate the DEWS protocol. Simulation results show that the ranking accuracy of DEWS is very close to the centralized case, while network overhead for collaborative search and indexing is logarithmic on network size. Simulation results also show that DEWS is resilient to changes in the available pool of indexing webservers and works efficiently even in presence of heavy query load. 1 Introduction Internet is the largest repository of documents that man kind has ever created. Voluntary contributions from millions of Internet users around the globe, and decentralized, autonomous hosting infrastructure are the sole factors propelling the continuous growth of the Internet. -
A Query Suggestion Method Combining TF-IDF and Jaccard Coefficient for Interactive Web Search
www.sciedu.ca/air Artificial Intelligence Research 2015, Vol. 4, No. 2 ORIGINAL RESEARCH A query suggestion method combining TF-IDF and Jaccard Coefficient for interactive web search Suthira Plansangket ,∗ John Q Gan School of Computer Science and Electronic Engineering, University of Essex, United Kingdom Received: May 10, 2015 Accepted: July 27, 2015 Online Published: August 6, 2015 DOI: 10.5430/air.v4n2p119 URL: http://dx.doi.org/10.5430/air.v4n2p119 Abstract This paper proposes a query suggestion method combining two ranked retrieval methods: TF-IDF and Jaccard coefficient. Four performance criteria plus user evaluation have been adopted to evaluate this combined method in terms of ranking and relevance from different perspectives. Two experiments have been conducted using carefully designed eighty test queries which are related to eight topics. One experiment aims to evaluate the quality of the query suggestions generated by the proposed method, and the other aims to evaluate the improvement of the relevance of retuned documents in interactive web search by using the query suggestions so as to evaluate the effectiveness of the developed method. The experimental results show that the method developed in this paper is the best method for query suggestion among the methods evaluated, significantly outperforming the most popularly used TF-IDF method. In addition, the query suggestions generated by the proposed method significantly improve the relevance of returned documents in interactive web search in terms of increasing the precision or the number of highly relevant documents. Key Words: Query suggestion, Query expansion, Information retrieval, Search engine, Performance evaluation 1 Introduction a cold-start problem. -
Concept-Based Interactive Query Expansion ∗
Concept-Based Interactive Query Expansion ∗ Bruno M. Fonseca12 Paulo Golgher2 Bruno Pôssas12 [email protected] [email protected] [email protected] Berthier Ribeiro-Neto1 2 Nivio Ziviani1 [email protected] [email protected] ABSTRACT back, web searching. Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for 1. INTRODUCTION Web ranking algorithms. In fact, there are still many situations in The Web is an innovation that has modified the way we learn, which the users are presented with imprecise or very poor results. work and live. The novelty lies not only on the freedom to publish, One of the key difficulties is the fact that users usually submit very but also in the almost universal communication facilities. It marks short and ambiguous queries, and they do not fully specify their in- formation needs. That is, it is necessary to improve the query for- the beginning of a new era, of a new society, started by what we mation process if better answers are to be provided. In this work we may call the information revolution. In these new times, the volume of information that can be ac- propose a novel concept-based query expansion technique, which cessed at low cost and high convenience is mind boggling. To illus- allows disambiguating queries submitted to search engines. The trate, Google1 advertised indexing more than 8 billion Web pages concepts are extracted by analyzing and locating cycles in a special type of query relations graph. This is a directed graph built from in 2004. -
Towards the Ontology Web Search Engine
TOWARDS THE ONTOLOGY WEB SEARCH ENGINE Olegs Verhodubs [email protected] Abstract. The project of the Ontology Web Search Engine is presented in this paper. The main purpose of this paper is to develop such a project that can be easily implemented. Ontology Web Search Engine is software to look for and index ontologies in the Web. OWL (Web Ontology Languages) ontologies are meant, and they are necessary for the functioning of the SWES (Semantic Web Expert System). SWES is an expert system that will use found ontologies from the Web, generating rules from them, and will supplement its knowledge base with these generated rules. It is expected that the SWES will serve as a universal expert system for the average user. Keywords: Ontology Web Search Engine, Search Engine, Crawler, Indexer, Semantic Web I. INTRODUCTION The technological development of the Web during the last few decades has provided us with more information than we can comprehend or manage effectively [1]. Typical uses of the Web involve seeking and making use of information, searching for and getting in touch with other people, reviewing catalogs of online stores and ordering products by filling out forms, and viewing adult material. Keyword-based search engines such as YAHOO, GOOGLE and others are the main tools for using the Web, and they provide with links to relevant pages in the Web. Despite improvements in search engine technology, the difficulties remain essentially the same [2]. Firstly, relevant pages, retrieved by search engines, are useless, if they are distributed among a large number of mildly relevant or irrelevant pages. -
Merging Multiple Search Results Approach for Meta-Search Engines
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by D-Scholarship@Pitt MERGING MULTIPLE SEARCH RESULTS APPROACH FOR META-SEARCH ENGINES By Khaled Abd-El-Fatah Mohamed B.S-------- Cairo University, Egypt, 1995 M.A-------Cairo University, Egypt, 1999 M.A------- University of Pittsburgh 2001 Submitted to the Graduate Faculty of School of Information Sciences in Partial Fulfillment of the requirements for the degree of Doctor of Philosophy University of Pittsburgh 2004 UNIVERSITY OF PITTSBURGH INFORMATION SCIENCES This dissertation was presented by Khaled Abd-El-Fatah Mohamed It was defended on Janauary 29, 2004 and approved by Chris Tomer, PhD, Associate Professor, DLIS Jose-Marie Griffiths, PhD, Professor, DLIS Don King, Research Professor, DLIS Amy Knapp, PhD, ULS Dissertation Director: Chris Tomer, PhD, Associate Professor MERGING MULTIPLE SEARCH RESULTS APPROACH FOR META-SEARCH ENGINES Khaled A. Mohamed, PhD University of Pittsburgh, 2004 Meta Search Engines are finding tools developed for enhancing the search performance by submitting user queries to multiple search engines and combining the search results in a unified ranked list. They utilized data fusion technique, which requires three major steps: databases selection, the results combination, and the results merging. This study tries to build a framework that can be used for merging the search results retrieved from any set of search engines. This framework based on answering three major questions: 1. How meta-search developers could define the optimal rank order for the selected engines. 2. How meta-search developers could choose the best search engines combination. 3. What is the optimal heuristic merging function that could be used for aggregating the rank order of the retrieved documents form incomparable search engines. -
Organizing User Search Histories
Global Journal of Computer Science and Technology Network, Web & Security Volume 13 Issue 13 Version 1.0 Year 2013 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 0975-4172 & Print ISSN: 0975-4350 Organizing user Search Histories By Ravi Kumar Yandluri Gokaraju Rangaraju Institute of Engineering & Technology, India Abstract - Internet userscontinuously make queries over web to obtain required information. They need information about various tasks and sub tasks for which they use search engines. Over a period of time they make plenty of related queries. Search engines save these queries and maintain user’s search histories. Users can view their search histories in chronological order. However, the search histories are not organized into related groups. In fact there is no organization made except the chronological order. Recently Hwang et al. studied the problem of organizing historical search information of users into groups dynamically. This automatic grouping of user search histories can help search engines also in various applications such as collaborative search, sessionization, query alterations, result ranking and query suggestions. They proposed various techniques to achieve this. In this paper we implemented those techniques practically using a prototype web application built in Java technologies. The experimental results revealed that the proposed application is useful to organize search histories. Indexterms : search engine, search history, click graph, query grouping. GJCST-E Classification : H.3.5 Organizing user Search Histories Strictly as per the compliance and regulations of: © 2013. Ravi Kumar Yandluri. This is a research/review paper, distributed under the terms of the Creative Commons Attribution- Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/), permitting all non-commercial use, distribution, and reproduction inany medium, provided the original work is properly cited. -
A Community-Based Approach to Personalizing Web Search
COVER FEATURE A Community-Based Approach to Personalizing Web Search Barry Smyth University College Dublin Researchers can leverage the latent knowledge created within search communities by recording users’search activities—the queries they submit and results they select—at the community level.They can use this data to build a relevance model that guides the promotion of community-relevant results during regular Web search. ver the past few years, current Web search through rates should be preferred during ranking. engines have become the dominant tool for Unfortunately, Direct Hit’s so-called popularity engine accessing information online. However, even did not play a central role on the modern search stage today’s most successful search engines struggle (although the technology does live on as part of the O to provide high-quality search results: Approx- Teoma search engine) largely because the technology imately 50 percent of Web search sessions fail to find proved inept at identifying new sites or less well- any relevant results for the searcher. traveled ones, even though they may have had more The earliest Web search engines adopted an informa- contextual relevance to a given search. tion-retrieval view of search, using sophisticated term- Despite Direct Hit’s fate, the notion that searchers based matching techniques to identify relevant docu- themselves could influence the ranking of results by virtue ments from repeated occurrences of salient query terms. of their search activities remained a powerful one. It res- Although such techniques proved useful for identifying onates well with the ideas that underpin the social web, a set of potentially relevant results, they offered little a phrase often used to highlight the importance of a suite insight into how such results could be usefully ranked. -
Xu: an Automated Query Expansion and Optimization Tool
Xu: An Automated Query Expansion and Optimization Tool Morgan Gallant Haruna Isah Farhana Zulkernine Shahzad Khan School of Computing School of Computing School of Computing Gnowit Inc. Queen’s University Queen’s University Queen’s University Ottawa, ON, Canada Kingston, ON, Canada Kingston, ON, Canada Kingston, ON, Canada [email protected] [email protected] [email protected] [email protected] Abstract— The exponential growth of information on the A core issue in IR and search applications is the evaluation Internet is a big challenge for information retrieval systems of search results. The emphasis is on users and their towards generating relevant results. Novel approaches are information needs. The users of an IR system such as a search required to reformat or expand user queries to generate a engine, are the ultimate judges of the quality of the results [2]. satisfactory response and increase recall and precision. Query There are many reasons why a search result may not meet user expansion (QE) is a technique to broaden users’ queries by expectations. Sometimes the query expression may be too introducing additional tokens or phrases based on some short to dictate what the user is looking for or may not be well semantic similarity metrics. The tradeoff is the added formulated [5]. In most cases, the user's original query is not computational complexity to find semantically similar words sufficient to retrieve the information that the user is looking and a possible increase in noise in information retrieval. Despite several research efforts on this topic, QE has not yet been for [6]. -
Do Metadata Models Meet IQ Requirements?
Do Metadata Mo dels meet IQ Requirements Claudia Rolker Felix Naumann Humb oldtUniversitat zu Berlin Forschungszentrum Informatik FZI Unter den Linden HaidundNeuStr D Berlin D Karlsruhe Germany Germany naumanndbisinformatikhub erli nde rolkerfzide Abstract Research has recognized the imp ortance of analyzing information quality IQ for many dierent applications The success of data integration greatly dep ends on the quality of the individual data In statistical applications p o or data quality often leads to wrong conclusions High information quality is literally a vital prop erty of hospital information systems Po or data quality of sto ck price information services can lead to economically wrong decisions Several pro jects have analyzed this need for IQ metadata and have prop osed a set of IQ criteria or attributes which can b e used to prop erly assess information quality In this pap er we survey and compare these approaches In a second step we take a lo ok at existing prominent prop osals of metadata mo dels esp ecially those on the Internet Then we match these mo dels to the requirements of information quality mo deling Finally we prop ose a quality assurance pro cedure for the assurance of metadata mo dels Intro duction The quality of information is b ecoming increasingly imp ortant not only b ecause of the rapid growth of the Internet and its implication for the information industry Also the anarchic nature of the Internet has made industry and researchers aware of this issue As awareness of quality issues amongst information -
Query Expansion with Locally-Trained Word Embeddings
Query Expansion with Locally-Trained Word Embeddings Fernando Diaz Bhaskar Mitra Nick Craswell Microsoft Microsoft Microsoft [email protected] [email protected] [email protected] Abstract trained using local windows, risks captur- ing only coarse representations of those top- Continuous space word embeddings ics dominant in the corpus. While a par- have received a great deal of atten- ticular embedding may be appropriate for a tion in the natural language processing specific word within a sentence-length con- and machine learning communities for text globally, it may be entirely inappropri- their ability to model term similarity ate within a specific topic. Gale et al. re- and other relationships. We study the fer to this as the ‘one sense per discourse’ use of term relatedness in the context property (Gale et al., 1992). Previous work of query expansion for ad hoc informa- by Yarowsky demonstrates that this property tion retrieval. We demonstrate that can be successfully combined with informa- word embeddings such as word2vec and tion from nearby terms for word sense dis- GloVe, when trained globally, under- ambiguation (Yarowsky, 1995). Our work ex- perform corpus and query specific em- tends this approach to word2vec-style training beddings for retrieval tasks. These re- in the context word similarity. sults suggest that other tasks benefit- For many tasks that require topic-specific ing from global embeddings may also linguistic analysis, we argue that topic-specific benefit from local embeddings. representations should outperform global rep- resentations. Indeed, it is difficult to imagine 1 Introduction a natural language processing task that would Continuous space embeddings such as not benefit from an understanding of the local word2vec (Mikolov et al., 2013b) or GloVe topical structure. -
A New Query Expansion Method Based on Query Logs Mining1
International Journal on Asian Language Processing, 19 (1): 1-12 1 A new query expansion method based on query logs mining 1 Zhu Kunpeng, Wang Xiaolong, Liu Yuanchao School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China Email:{kpzhu, wangxl, ycliu}@insun.hit.edu.cn Abstract: Query expansion has long been suggested as an effective way to improve the performance of information retrieval systems by adding additional relevant terms to the original queries. However, most previous research has been limited in extracting new terms from a subset of relevant documents, but has not exploited the information about user interactions. In this paper, we proposed a method for automatic query expansion based on user interactions recorded in query logs. The central idea is to extract correlations among queries by analyzing the common documents the users selected for them, and the expanded terms only come from the associated queries more than the relevant documents. In particular, we argue that queries should be dealt with in different ways according to their ambiguity degrees, which can be calculated from the log information. We verify this method in a large scale query logs collection and the experimental results show that the method makes good use of the knowledge of user interactions, and it can remarkably improve search performance. Keywords: Query expansion, log mining, information retrieval, search engine, 1. Introduction With the rapid growth of information on the World Wide Web, more and more users need search engine technology to help them exploit such an extremely valuable resource. Although many search engine systems have been successfully deployed, the current search systems are still far from optimal because of using simple keywords to search and rank relevant documents. -
Query Expansion Techniques
Query Expansion techniques Ashish Kankaria Indian Institute of Technology Bombay, Mumbai [email protected] 1. NEED OF QUERY EXPANSION • Creating a dictionary of expansion terms for each terms, The Information Retrieval system described above works and then looking up in the dictionary for expansion very well if the user is able to convey his information need in form of query. But query is seldom complete. The query 2. EXTERNAL RESOURCE BASED QUERY provided by the user is often unstructured and incomplete. An incomplete query hinders a search engine from satisfy- EXPANSION ing the user’s information need. In practice we need some In these approaches, the query is expanded using some ex- representation which can correctly and more importantly ternal resource like WordNet, lexical dictionaries or the- completely express the user’s information need. saurus.These dictionaries are built manually which contain mappings of the terms to their relevant terms. There tech- Figure 1 explains the need of query expansion. Consider niques involve look up in such resources and adding the re- an input query “Sachin Tendulkar”. As a search engine de- lated terms to query. Following are some of external re- veloper we would expect that user wants documents related source based query expansion techniques. [5] to cricketer Sachin Tendulkar. Consider our corpus has 2 documents. First document is an informative page about 2.1 Thesaurus based expansion Sachin Tendulkar which contains the query terms where as A thesaurus is a data structure that lists words grouped to- second document is an blog on Tendulkar which has various gether according to similarity of meaning (containing syn- adjectives related to Sachin Tendulkar like master blaster or onyms and sometimes antonyms), in contrast to a dictio- God of cricket but does not have query terms.