Project Login
Registration No:
Password:
MAIL ALERTS SMS ALERTS
 
     
   
     

Organizing User Search Histories

Platform : java

IEEE Projects Years : 2012 - 13

Organizing User Search Histories

Abstract:

Users are increasingly pursuing complex task-oriented goals on the Web, such as making travel arrangements, managing finances or planning purchases. To this end, they usually break down the tasks into a few co-dependent steps and issue multiple queries around these steps repeatedly over long periods of time. To better support users in their long-term information quests on the Web, search engines keep track of their queries and clicks while searching online. In this paper, we study the problem of organizing a user’s historical queries into groups in a dynamic and automated fashion. Automatically identifying query groups is helpful for a number of different search engine components and applications, such as query suggestions, result ranking, query alterations, sessionization, and collaborative search. In our approach, we go beyond approaches that rely on textual similarity or time thresholds, and we propose a more robust approach that leverages search query logs. We experimentally study the performance of different techniques, and showcase their potential, especially when combined together.

 

Algorithm Used:

Page Rank Algorithms:

PageRank is a probability distribution used to represent the likelihood that a person randomly clicking on links will arrive at any particular page. PageRank can be calculated for collections of documents of any size. It is assumed in several research papers that the distribution is evenly divided among all documents in the collection at the beginning of the computational process. The PageRank computations require several passes, called "iterations", through the collection to adjust approximate PageRank values to more closely reflect the theoretical true value.

System Architecture:

 

Existing System:

However, this is impractical in our scenario for two reasons. First, it may have the undesirable effect of changing a user’s existing query groups, potentially undoing the user’s own manual efforts in organizing her history. Second, it involves a high computational cost, since we would have to repeat a large number of query group similarity computations for every new query.

 

 

Disadvantages:

 

  1. We motivate and propose a method to perform query grouping in a dynamic fashion. Our goal is to ensure good performance while avoiding disruption of existing user-defined query groups.

 

Proposed System:

  1. We investigate how signals from search logs such as query reformulations and clicks can be used together to determine the relevance among query groups. We study two potential ways of using clicks in order to enhance this process by fusing the query reformulation graph and the query click graph into a single graph that we refer to as the query fusion graph, and by expanding the query set when computing relevance to also include other queries with similar clicked URLs.

 

  1.  We show through comprehensive experimental evaluation the effectiveness and the robustness of our proposed search log-based method, especially when combined with approaches using other signals such as text similarity.

 

Advantages:

  1. We will focus on evaluating the effectiveness of the proposed algorithms in capturing query relevance.
  2. Relevance Measure
  3. Online query grouping process
  4.  Similarity function

 

Module Description:

  1. Query Group
  2. Search history
  3. Query Relevance and Search logs
  4. 4.      Dynamic Query Grouping

Query Group:

We need a relevance measure that is robust enough to identify similar query groups beyond the approaches that simply rely on the textual content of queries or time interval between them. Our approach makes use of search logs in order to determine the relevance between query groups more effectively. In fact, the search history of a large number of users contains signals regarding query relevance, such as which queries tend to be issued closely together (query reformulations), and which queries tend to lead to clicks on similar URLs (query clicks). Such signals are user-generated and are likely to be more robust, especially when considered at scale. We suggest measuring the relevance between query groups by exploiting the query logs and the click logs simultaneously.

 

 

 

Search History:

 

We study the problem of organizing a user’s search history into a set of query groups in an automated and dynamic fashion. Each query group is a collection of queries by the same user that are relevant to each other around a common informational need. These query groups are dynamically updated as the user issues new queries, and new query groups may be created over time.

 

 

 

Query Relevance and Search logs:

 

We now develop the machinery to define the query relevance based on Web search logs. Our measure of relevance is aimed at capturing two important properties of relevant queries, namely: (1) queries that frequently appear together as reformulations and (2) queries that have induced the users to click on similar sets of pages. We start our discussion by introducing three search behavior graphs that capture the aforementioned properties. Following that, we show how we can use these graphs to compute query relevance and how we can incorporate the clicks following a user’s query in order to enhance our relevance metric.

 

Dynamic Query Grouping:

One approach to the identification of query groups is to first treat every query in a user’s history as a singleton query group, and then merge these singleton query groups in an iterative fashion (in a k-means or agglomerative way. However, this is impractical in our scenario for two reasons. First, existing query groups, potentially doing the user’s own manual efforts in organizing her history. Second, it involves a high computational cost, since we would have to repeat a large number of query group similarity computations for every new query.

System Configuration:-

H/W System Configuration:-

        Processor               -    Pentium –IV

RAM                                 -    512 MB

Hard Disk                          -   80 GB

 

 S/W System Configuration:-

v   Operating System            :Windows 2000/XP

v   Application  Server    :      Tomcat5.0/6.X                                                            

v   Front End                          :   HTML, Java, JSP,AJAX

v    Scripts                                :   JavaScript.

v   Server side Script             :   Java Server Pages.

v   Database Connectivity      :   Mysql.

 

 

 



NOW GET PROJECTS ! GET TRAINED ! GET PLACED !

IEEE, NON-IEEE, REAL TIME LIVE ACADEMIC PROJECTS,

PROJECTS WITH COMPLETE COURSES,SOFT SKILLS & PLACEMENTS

ALLOVER INDIA & WORLD WIDE,

HOSTEL FACILITY AVAILABLE FOR GIRLS & BOYS SEPARATELY,

CALL: 08985129129 ,  E-Mail Id: support@ascentit.in

REGISTER FOR PROJECTS NOW ! GET DISCOUNT
   
1