DOCSLIB.ORG

A Survey on Personalized User Search Goals Using Multi Search Algorithm

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Survey on Personalized User Search Goals Using Multi Search Algorithm International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 3 Issue 7, July 2014 A SURVEY ON PERSONALIZED USER SEARCH GOALS USING MULTI SEARCH ALGORITHM M.SENTHAMARAI SELVI1 A.MARIMUTHU2 Research scholar, Department of computer science, Government Arts college,Coimbatore1 Associate Professor,Department of computer science,Government Arts college,Coimbatore2 Abstract- Every user has their own background conceivable that many users dislike the and a specific goal when searching of inconvenience of adapting to a new engine, may information on the web. A common problem of be unaware how to change the default settings in current web search is user search queries are their Web browser to point to a particular short and ambiguous and insufficient way to engine, or may even be unaware of other Web specify user needs exactly. Current web search search engines that exist and may provide better engine typically provide search result without service. Performance differences between Web considering user interest and context, we search engines may be attributable to ranking introduce an effective approach that captures algorithms and index size, among other factors. the user’s conceptual preferences in order to It is well understood in the Information Retrieval provide personalized query suggestions. In (IR) community that different search systems this work first we are integrating the concept perform well for some queries and poorly for of personalization and multi search to make the others [1,2], which suggests that excessive refined results more effective. Based on loyalty to a single engine may actually hinder personalized data we extracting user’s previous searchers.. The approach relies on a classifier to history and providing a database for user so suggest the top-performing engine for a given that further refinement matches the user goals. search query, based on features derived from the In order to search and clustering experience query and from the properties of search result SOC algorithm. pages, such as titles, snippets, and URLs of the top-ranked documents. Key terms- user search goals, personalized data, We seek to promote supported search multisearch results, feedback sessions. engine switching operations where users are encouraged to temporarily switch to a different I.INTRODUCTION search engine for a query on which it can In Web search engines, queries are provide better results than their default search submitted to represent the information needs of engine. Unsupported switching, whereby users users. However, sometimes queries may not navigate to other engines on their own accord, exactly represent users specific information is a phenomenon that may occur for a number needs as different users will have different of reasons: users may be dissatisfied with ideas while submitting the queries. For search results or the interface. We conjecture example, when the query “the sun” is submitted that by proactively encouraging users to try to search engine, some users want to locate the alternative engines for appropriate queries home page of a United Kingdom newspaper, (hence increasing the fraction of sessions that while some others want to learn the natural contain switching) we can promote more knowledge of the sun. Web search engines such effective user searching for a significant fraction as Google, Yahoo!, and Live Search provide of queries. Empirical results presented in this users with keyword access to Web content. They paper support this claim. And also our system are typically loyal to a single one even when it maintains the user behavior by registering into may not satisfy their needs, despite the fact that it, so we have user logs and user interest in the cost of switching engines is relatively low. the database of the every user who have been While most users appear to be content with their already registered. While registering. User experience on their engine of choice, it is performs Multitasking search activities in the ISSN: 2278 – 1323 All Rights Reserved © 2014 IJARCET 2456 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 3 Issue 7, July 2014 query streams issued to web search engines. car,” “car crash,” and “car audio.” Thus, the Obtained results show that the new algorithm different aspects of the query “car” are able to be performs similarly best clustering based learned through their method. However, the query approach. “used car” in the cluster can also have different .II. RELATED WORK aspects, which are difficult to be learned by their It is necessary and potential to capture method. Some other works introduce search goals different user search goals in information and missions to detect session boundary retrieval. Define a user search goals as the hierarchically [2]. However, their method only information on different aspects of a identifies whether a pair of queries belongs to the query[3],[4],[5].that user groups want to obtain. same goal or mission and does not care what the Information need is a user’s particular desire to goal is in detail. A prior utilization of user click- obtain information to satisfy needs. User search through logs is to obtain user implicit feedback to goals can be considered as the clusters of enlarge training data when learning ranking information needs for a query. First propose a functions in information retrieval. Thorsten novel approach to infer user search goals for a Joachims did many works on how to use implicit query by clustering a proposed feedback feedback to improve the retrieval quality [9], [7], sessions [1],[2].To demonstrate the proposed [12]. In [3] work, they considered feedback sessions evaluation criterion can help us to optimize the as user implicit feedback and propose a novel parameter in the clustering method when optimization method to combine both clicked and inferring user search goals. Demonstrate that un clicked URLs in feedback sessions to find out clustering feedback sessions is more efficient what users really require and what they do not care. than clustering search results or Thus, we can One application of user search goals is restructuring tell what the user search goals are in detail. web search results. There are also some related Propose a new criterion CAP to evaluate the works focusing on organizing the search results [6], performance of user search goal inference based [8], [7]. on restructuring web search results. Thus, the procedure to determine the number of user A. Time-Based. searches goals for a query previous work on Usually, time-based techniques have beenadopted session identification can be classified into: 1) for their simplicity in previous research work. time-based, 2) content-based, and 3) mixed- Two consecutive queries are part of the same heuristics. In recent years, many works have been session if they are issued at most within a 5- done to infer the so called user goals or intents of a minutes time window. According to this query [5]. But in fact, their works belong to query definition, they found that the average number of classification. Some works analyze the search queries per session in the data they analyzed. results returned by the search engine directly to Excite query log, ranging from 1 to 50 minutes utilize different query aspects [6], [7]. However, this observed that users often perform a sequence query aspects without user feedback have of queries with a similar information need, and limitations to improve search engine relevance. they referred to those sequences of reformulated Some works take user feedback into account and queries as query chains[6],[7].This paper analyze the different clicked URLs of a query in presented a method for automatically detecting user click-through logs directly, nevertheless the query chains in query and click-through logs number of different clicked URLs of a query may using 30 minutes threshold for determining if two be not big enough to get ideal results. Wang and consecutive queries belong to the same search Zhai clustered queries and learned aspects of these session. similar queries [8], which solves the problem in part B. Content-Based .However, their method does not work if we try to Some work suggested to exploit the discover user search goals of one single query in the lexical content of the query themselves for query cluster rather than a cluster of similar queries. determining a possible topic shift in the stream For example, in [12], the query “car” is clustered of issued queries. To this extent, several search with some other queries, such as “car rental,” “used patterns have been proposed by means of lexical ISSN: 2278 – 1323 All Rights Reserved © 2014 IJARCET 2457 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 3 Issue 7, July 2014 comparison, using these string similarity scores. analyzed as well. Therefore, this kind of methods However, approaches relying only on content cannot infer user search goals precisely. features of the so-called vocabulary mismatch IV.TECHNIQUES problem, namely the existence of topically related A. Multi Search Concept queries without any shared terms. Multi-search is a multi-tasking search engine C. Mixed Heuristics which includes many search engines and Showed that statistical information collected from metasearch engine characteristics with query logs could be used for finding out the additional capability of retrieval of search result probability that a search pattern actually implies
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.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • Web Query Classification and URL Ranking Based on Click Through Approach
    S.PREETHA et al, International Journal of Computer Science and Mobile Computing Vol.2 Issue. 10, October- 2013, pg. 138-144 Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 2, Issue. 10, October 2013, pg.138 – 144 RESEARCH ARTICLE Web Query Classification and URL Ranking Based On Click through Approach S.PREETHA1, K.N Vimal Shankar2 PG Scholar1, Asst. Professor2 Department of Computer Science & Engineering1, 2 V.S.B. Engineering College, Karur, India1, 2 [email protected], [email protected] Abstract― In a web based application; different users may have different search goals when they submit it to a search engine. For a broad-topic and ambiguous query it is difficult. Here we propose a novel approach to infer user search goals by analyzing search engine query logs. This is typically shown in cases such as these: Different users have different backgrounds and interests. However, effective personalization cannot be achieved without accurate user profiles. We propose a framework that enables large-scale evaluation of personalized search. The goal of personalized IR (information retrieval) is to return search results that better match the user intent. First, we propose a framework to discover different user search goals for a query by clustering the proposed feedback sessions. Feedback sessions are getting constructed from user click-through logs and can efficiently reflect the information needs of users. Second, we propose an approach to generate pseudo-documents to better represent the feedback sessions for clustering.
    [Show full text]
  • Classifying User Search Intents for Query Auto-Completion
    Classifying User Search Intents for Query Auto-Completion Jyun-Yu Jiang Pu-Jen Cheng Department of Computer Science Department of Computer Science University of California, Los Angeles National Taiwan University California 90095, USA Taipei 10617, Taiwan [email protected] [email protected] ABSTRACT completion is to accurately predict the user's intended query The function of query auto-completion1 in modern search with only few keystrokes (or even without any keystroke), engines is to help users formulate queries fast and precisely. thereby helping the user formulate a satisfactory query with Conventional context-aware methods primarily rank candi- less effort and less time. For instance, users can avoid mis- date queries2 according to term- and query- relationships to spelling and ambiguous queries with query completion ser- the context. However, most sessions are extremely short. vices. Hence, how to capture user's search intents for pre- How to capture search intents with such relationships be- cisely predicting the query one is typing is very important. The context information, such as previous queries and comes difficult when the context generally contains only few 3 queries. In this paper, we investigate the feasibility of dis- click-through data in the same session , is usually utilized covering search intents within short context for query auto- to capture user's search intents. It also has been exten- completion. The class distribution of the search session (i.e., sively studied in both query completion [1, 21, 35] and sug- gestion [18, 25, 37]. Previous work primarily focused on cal- issued queries and click behavior) is derived as search in- 2 tents.
    [Show full text]
  • 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
    [Show full text]
  • 1 Public Records Resources Online
    Public Records Resources Online How to Find Everything There Is to Know About "Mr./Ms. X" *Please see disclaimer at end of document* Summary of public records on Mr. / Ms. X . Starting with one or more Background Reports from the sources below can help provide an overview of where the person has lived and worked, as well as other pertinent information for searching, such as middle name or initial. They might also contain adverse filings and licensing information that you can later verify in other sources. Examples of vendors that provide background reports (for a fee): Westlaw/CLEAR (Thomson Reuters) $ Lexis/Accurint $ TLO $ His/her social security number is . These tools can help verify if an SSN is valid and related to a living person. SSN Validator Selective Service Online Verification He/she was born / died / naturalized . In addition to the Summary Reports in the first section of this guide, official death records may be found in resources on the federal, state, and local levels. The Genealogy Resources section of this guide might have other helpful resources for death records. Social Security Death Records The official federal record is the Social Security Death Index (SSDI). Only the subscription databases, such as Lexis, Westlaw, and TLO (all $) will have the most recent SSDI records, due to privacy restrictions. Try variations of spellings, or using only the last name and birth or death year and location if you're not finding an SSDI record. Ancestry Library $ Genealogy Bank SSDI Research Guide SSDI Databases Online State and Local Death, Burial, and Cemetery Records State and local death records will often provide more detailed information than an SSDI record, but they are not as easy to find.
    [Show full text]
  • Automatic Web Query Classification Using Labeled and Unlabeled Training Data Steven M
    Automatic Web Query Classification Using Labeled and Unlabeled Training Data Steven M. Beitzel, Eric C. Jensen, David D. Lewis, Abdur Chowdhury, Ophir Frieder, David Grossman Aleksandr Kolcz Information Retrieval Laboratory America Online, Inc. Illinois Institute of Technology [email protected] {steve,ej,ophir,dagr}@ir.iit.edu {cabdur,arkolcz}@aol.com ABSTRACT We examine three methods for classifying general web queries: Accurate topical categorization of user queries allows for exact match against a large set of manually classified queries, a increased effectiveness, efficiency, and revenue potential in weighted automatic classifier trained using supervised learning, general-purpose web search systems. Such categorization and a rule-based automatic classifier produced by mining becomes critical if the system is to return results not just from a selectional preferences from hundreds of millions of unlabeled general web collection but from topic-specific databases as well. queries. The key contribution of this work is the development Maintaining sufficient categorization recall is very difficult as of a query classification framework that leverages the strengths web queries are typically short, yielding few features per query. of all three individual approaches to achieve the most effective We examine three approaches to topical categorization of classification possible. Our combined approach outperforms general web queries: matching against a list of manually labeled each individual method, particularly improves recall, and allows queries, supervised learning of classifiers, and mining of us to effectively classify a much larger proportion of an selectional preference rules from large unlabeled query logs. operational web query stream. Each approach has its advantages in tackling the web query classification recall problem, and combining the three 2.
    [Show full text]
  • Semantic Matching in Search
    Foundations and Trends⃝R in Information Retrieval Vol. 7, No. 5 (2013) 343–469 ⃝c 2014 H. Li and J. Xu DOI: 10.1561/1500000035 Semantic Matching in Search Hang Li Huawei Technologies, Hong Kong [email protected] Jun Xu Huawei Technologies, Hong Kong [email protected] Contents 1 Introduction 3 1.1 Query Document Mismatch ................. 3 1.2 Semantic Matching in Search ................ 5 1.3 Matching and Ranking ................... 9 1.4 Semantic Matching in Other Tasks ............. 10 1.5 Machine Learning for Semantic Matching in Search .... 11 1.6 About This Survey ...................... 14 2 Semantic Matching in Search 16 2.1 Mathematical View ..................... 16 2.2 System View ......................... 19 3 Matching by Query Reformulation 23 3.1 Query Reformulation .................... 24 3.2 Methods of Query Reformulation .............. 25 3.3 Methods of Similar Query Mining .............. 32 3.4 Methods of Search Result Blending ............. 38 3.5 Methods of Query Expansion ................ 41 3.6 Experimental Results .................... 44 4 Matching with Term Dependency Model 45 4.1 Term Dependency ...................... 45 ii iii 4.2 Methods of Matching with Term Dependency ....... 47 4.3 Experimental Results .................... 53 5 Matching with Translation Model 54 5.1 Statistical Machine Translation ............... 54 5.2 Search as Translation .................... 56 5.3 Methods of Matching with Translation ........... 59 5.4 Experimental Results .................... 61 6 Matching with Topic Model 63 6.1 Topic Models ........................ 64 6.2 Methods of Matching with Topic Model .......... 70 6.3 Experimental Results .................... 74 7 Matching with Latent Space Model 75 7.1 General Framework of Matching .............. 76 7.2 Latent Space Models ...................
    [Show full text]
  • A New Algorithm for Inferring User Search Goals with Feedback Sessions
    International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 3 Issue 11, November 2014 A Survey on: A New Algorithm for Inferring User Search Goals with Feedback Sessions Swati S. Chiliveri, Pratiksha C.Dhande a few words to search engines. Because these queries are short Abstract— For a broad-topic and ambiguous query, different and ambiguous, how to interpret the queries in terms of a set users may have different search goals when they submit it to a of target categories has become a major research issue. search engine. The inference and analysis of user search goals can be very useful in improving search engine relevance and For example, when the query ―the sun‖ is submitted to a user experience. This paper provides search engine, some people want to locate the homepage of a an overview of the system architecture of proposed feedback United Kingdom newspaper, while some people want to session framework with their advantages. Also we have briefly discussed the literature survey on Automatic Identification of learn the natural knowledge of the sun. Therefore, it is User Goals in Web Search with their pros and cons. We have necessary and potential to capture different user search goals, presented working of various classification approaches such as user needs in information retrieval. We define user search SVM, Exact matching and Bridges etc. under the web query goals as the information on different aspects of a query that classification framework. Lastly, we have described the existing user groups want to obtain. Information need is a user’s web clustering engines such as MetaCrawler, Carrot 2, particular desire to obtain information to satisfy users need.
    [Show full text]