Identification of User Search Goals in Web Search Engine

(1)

ISSN: 2319-8753

I

nternational

J

ournal of

I

nnovative

R

esearch in

S

cience,

E

ngineering and

T

echnology

(An ISO 3297: 2007 Certified Organization)

Vol. 3, Issue 11, November 2014

Identification of User Search Goals in Web

Search Engine

K.Chandra Sekhar

1

, N.Balakrishna

2

P.G. Student, Department of Computer Science & Engineering, MITS Engineering College, Madanapalle, A.P, India1

Asst Professor, Department of Computer Science & Engineering, MITS Engineering College, Madanapalle, A.P, India2

________________________________________________________________________________________________

ABSTRACT: Nowadays Internet is widely used by users to satisfy various information needs. However, ambiguous query/topic submitted to search engine doesn’t satisfy user information needs, because different users may have different information needs on diverse aspects upon submission of same query/topic to search engine. So discovering different user search goals becomes complicated Analyzing user search goal is essential to provide best result for which the user looks for in the internet. Feedback sessions have been clustered to learn several customers explore objectives for a query. Number one, we propose a framework to solving the all existing problems very effectively. Number two, we propose a novel approach to solving the existing problems and develop pseudo documents very good way to represent that documents. Last one, we propose a new factor “Classified Average Precision (CAP)” to solving the existing problems and this method mainly use of the performance is very effective that’s why this method using in this project.

KEYWORDS - User search goals, implicit feedback sessions, pseudo-documents, restructuring search

results, k-means clusteri, Keyword search.

________________________________________________________________________________________________

I. INTRODUCTION

(2)

ISSN: 2319-8753

I

nternational

J

ournal of

I

nnovative

R

esearch in

S

cience,

E

ngineering and

T

echnology

many unuseful and noisy search results that are not clicked by user may be analyzed. This may degrade the search goals discovery. X. Wang and C-X. Zhai [2] learns interesting aspects of similar query/topic from web search logs which consists clicked web pages URLs and organize search results accordingly. Their approach may results in limitation, as the different clicked URLs for a query/topic may be small in number. There are many works [11], [12] which classify queries into some predefined specific classes and try to find out query intents and user goals. However, different queries have different search goals and finding precise, suitable predefined search goal classes may be difficult and sometimes impossible to categorize.

Clustering search results is an efficient method to systematize search results, which allows a user to find the way into applicable documents quickly. In this paper, our aim is to discover different client explore goals for a uncertainty and depict each search goal with a number of keywords automatically. To discover the user information automatically at different point of view with user given query and collects the similar search goal result with URL first we collect similar comment sessions to pseudo-documents which reflects client information needs. At last, k means clustering algorithm can be used to cluster these pseudo-documents for inferring user search goals and depicting them with some meaningful keywords. Then these search goals can be used to restructure the web search results. The rest of the paper is organized as follows: Section II contains literature survey about related work. Section III contains description of the proposed system. Finally paper is concluded in the Section IV.

II. LITRATURE SURVEY

Since many years, research in web log mining has been subject of interest. Many previous works has been investigated on problem of analyzing user query logs [5], [9], [10], [12], [13]. The information in query logs has been used in many different ways, such as to infer search query intents or user goals, to classify queries, to provide context during search, to facilitate personalization, to suggest query substitutes and to identify frequently asked questions (FAQs). Preceding studies encompass mainly focused on manual query-log investigation to recognize Web query goals. U. Lee et al. [11] studied the “goal" at the back based on a user's Web query, so that this goal can be used to get better the excellence of a search engine's results. Their proposed method identifies the user goal automatically with no any explicit feedback from the user.

User may issue number of queries to search engine in order to achieve information need/tasks at a variety of granularities. R. Jones and K.L. Klinkner [15] proposed a method to detect search goal and mission boundaries for automatic segmenting query logs into hierarchical structure. Their method identifies whether a pair of queries belongs to the same goal or mission and does not consider search goal in detail.

Zamir et al. [17] used Suffix Tree Clustering (STC) to identify set of documents having common phrases and then create cluster based on these phrases or contents. They used documents snippets instead whole document for clustering web documents. However, generating meaningful labels for clusters is most challenging in document clustering. So, to overcome this difficulty, in [3], a supervised learning method is used to extract possible phrases from search result snippets or contents and these phrases are then used to cluster web search results.

(3)

ISSN: 2319-8753

I

nternational

J

ournal of

I

nnovative

R

esearch in

S

cience,

E

ngineering and

T

echnology

clickthrough data in www search. The author proposes strategy to automatically generate training examples for learning retrieval functions from observed user behavior. The user study is intended to examine how users interrelate with the list of ranked results from the Google search engine and how their behavior can be interpreted as significance judgments. Implicit feedback can be used for evaluating quality of retrieval functions [7]. Preceding studies encompass mainly focused on manual query-log investigation to recognize Web query goals. U. Lee et al. [11] studied the “goal" at the back based on a user's Web query, so that this goal can be used to get better the excellence of a search engine's results. Their proposed method identifies the user goal automatically with no any explicit feedback from the user. User may issue number of queries to search engine in order to achieve information need/tasks at a variety of granularities. R. Jones and K.L. Klinkner [15] proposed a method to detect search goal and mission borders for automatic segmenting query logs into hierarchical structure. Their scheme identifies whether a match up of queries belongs to the same goal or work and does not consider search goal in detail. Zamir et al. [17] used Suffix Tree Clustering (STC) to identify set of documents having common phrases and then create cluster based on these phrases or contents. They used documents snippets instead whole document for clustering web documents. However, generating meaningful labels for clusters is most challenging in document clustering. So, to conquer this complexity, in [3], a supervise learning method is used to extract possible phrases from search result leftovers or contents and these phrases are then used to cluster web search results. ks sessions from user click-through logs of different search engines.

Fig1: System Model

III. EXISTING METHODOLOGY

We describe explore objectives as the data on sever alphas of a request that customer clusters want to achieve. Data must is a customer’s specific aspiration to achieve information to fulfill his/her requirement. Customer explore objectives can be measured as the groups of data wants for a request. The interpretation and study of customer explore objectives can have a lot of rewards in improving exploration device applicability and user practice.

Drawbacks

 The Customer does not identifying the correct and suitable explore objective classes why the many queries it will be displayed that’s why finding the correct thing it’s very difficult.

(4)

ISSN: 2319-8753

I

nternational

J

ournal of

I

nnovative

R

esearch in

S

cience,

E

ngineering and

T

echnology

exploration results that are not ticked by every customer may be evaluated as well. For that reason, this kind of approaches cannot understand user exploration objectives accurately.

 First classifies whether a couple of requests goes to the equal objective or task and does not caution whatever the objective is in detail.

IV. CONTRIBUTION

In this paper, we aim at learning the sum of various customer exploration objectives for a query and representing every objective with a number of keywords routinely. We first propose a novel methodology to infer customer exploration objectives for a request by grouping our future response periods. Then, we propose a novel optimization technique to record response periods to pseudo-documents which can well reproduce customer data requests. At last, we cluster these pseudo documents to conclude customer exploration objectives and represent them by various keywords.

Benefits

 We propose a framework to understand dissimilar customer exploration objectives for a query by grouping response periods. We show that clustering response periods is additional effective than clustering exploration consequences or connected URLs straightly. Furthermore, the deliveries of dissimilar customer exploration objectives can be achieve appropriately after wards response periods are grouped.

 We propose a novel optimization technique to link the developed URLs in a response period to form a virtual-manuscript, which can efficiently replicate the data need of a customer. Thus, we can say whatever the customer exploration objectives are in feature.

 We propose a new factor CAP to assess the presentation of customer exploration objectives interpretation built on rearrangement network exploration results. Thus, we can define the sum of customer exploration objectives for a query.

(5)

ISSN: 2319-8753

I

nternational

J

ournal of

I

nnovative

R

esearch in

S

cience,

E

ngineering and

T

echnology

V. IMPLEMENTATION APPROCHES

Feedback Sessions

The concluding customer explore objectives for a specific question. For that reason, the particular period having only single request is presented, which differentiates from the predictable period. Temporarily, the response period in this paper is built on a particular period, even though it can be comprehensive to the complete period. The proposed response period contains

Fig3: User Search Interface Feedback Sessions

of equally connected also unconnected URLs also finishes by the previous URL that was connected in a particular period. It is interested that earlier the latter connect, wholly the URLs must be perused then estimated through customers. Then, furthermore the connected URLs, the unconnected ones before the past connect must be a share of the customer responses.

(6)

ISSN: 2319-8753

I

nternational

J

ournal of

I

nnovative

R

esearch in

S

cience,

E

ngineering and

T

echnology

Pseudo-Documents

The Universal Resource Locators through added printed contents by mining the headings then scrapes of the give back URLs performing in the response period. Now this technique, each URL in a response period is characterized by a minority prescript passage that contains of its heading and bit. Formerly, several documented procedures are applied to individuals script passages, such as changing all the letters to lowercases, restricting then eliminating end arguments. Towards achieve the feature illustration of a response period, we propose an optimization technique to association together connected and unconnected URLs in the response period.

Level - 1

Fig5 : In the first level user want to create/register account and use that account regularly.

Level -2

Fig6 : In the second level the admin put the urls and indexing the data into database.

user

Register

Data Base

Login

User

Admin

URL Data

Indexing

(7)

ISSN: 2319-8753

I

nternational

J

ournal of

I

nnovative

R

esearch in

S

cience,

E

ngineering and

T

echnology

Level – 3

Fig 7: In this theird level the user directly use the urls and search the required data, gather the documents.

Here user communicates through the server.

Level – 4

Fig8 (a): click sequence to the log files

Fig8(b): In the final level user want to get the information about searched data. User want to create log files and get the result. Finally displays the click sequence based on user search results.

User

Search

Server

Response

User

User Click

Log file

User

Search

Server

Log file

(8)

ISSN: 2319-8753

I

nternational

J

ournal of

I

nnovative

R

esearch in

S

cience,

E

ngineering and

T

echnology

Building pseudo-documents

As URLs alone are not informative enough to tell intended meaning of a submitted query. To obtain rich information, we enrich each URL with additional text content by extracting the titles and snippets of URLs appearing in feedback session. Thus, each URL in feedback session is represented by small textual content which contains its title and snippet. Then some text preprocessing is done on those textual contents, such as transforming all letters to lowercase, eliminating stop words (frequent words) and word stemming by using porter algorithm [16]. Lastly, TF-IDF [1] vector of URL’s titles and snippets are formed respectively as, Each feedback session is represented by . This is nothing but pseudo-document which is used for discovering user intents or search goals. These pseudo-documents contain what user requires and what do not, which is used to learn interesting aspects of a query.

Evaluation Search Result

If customer exploration objectives are conditional appropriately, the search results can also be updated correctly, since rearrangement web search results is one application of inferring customer explore objectives Therefore, we propose an evaluation method based on restructuring web search results to evaluate whether customer exploration objectives are inferred properly or not. In this section, we propose this novel factor “Classified Average Precision” to evaluate the restructure results. Based on the proposed criterion, we also describe the method to select the best cluster number.

Algorithm

Actually our proposed algorithm is k-means clustering algorithm Steps

 First step is to declare k= # of clusters; one mean of cluster  second step is taking the interval data

 third step is initialize mean values  final step take iterate values

 assign each point to nearest mean  move mean to center of it’s cluster.

VI. CONCLUSION AND FUTURE WORK

(9)

ISSN: 2319-8753

I

nternational

J

ournal of

I

nnovative

R

esearch in

S

cience,

E

ngineering and

T

echnology

REFERENCES

[1] R. Baeza-Yates and B. Ribeiro-Neto, “Modern Information Retrieval”. ACM Press, 1999.

[2] X. Wang and C.-X Zhai, “Learn from Web Search Logs to Organize Search Results,” Proc. 30th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’07), pp. 87-94, 2007.

[3] H.-J Zeng, Q.-C He, Z. Chen, W.-Y Ma, and J. Ma, “Learning to Cluster Web Search Results,” Proc. 27th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’04), pp. 210-217, 2004.

[4] H. Chen and S. Dumais, “Bringing Order to the Web: Automatically Categorizing Search Results,” Proc. SIGCHI Conf. Human Factors in Computing Systems (SIGCHI’00), pp. 145-152, 2000.

[5] T. Joachims, “Optimizing Search Engines Using Clickthrough Data,” Proc. Eighth ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (SIGKDD ’02), pp. 133-142, 2002.

[6] T. Joachims, L. Granka, B. Pang, H. Hembrooke, and G. Gay, “Accurately Interpreting Clickthrough Data as Implicit Feedback,” Proc. 28th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’05), pp. 154-161, 2005.

[7] T. Joachims, “Evaluating Retrieval Performance Using Click-through Data”, Text Mining, J. Franke, G. Nakhaeizadeh, and I. Renz, eds., pp. 79-96, Physica/Springer Verlag, 2003.

[8] Zheng Lu, Hongyuan Zha, Xiaokang Yang, Weiyao Lin, Zhaohui Zheng, “A New Algorithm for Inferring User Search Goals with Feedback Sessions”, IEEE Transactions on Knowledge and Data Engineering, Vol. 25, No. 3, pp.502-513,2013.