775 research outputs found

    Client Side Privacy Protection Using Personalized Web Search

    Get PDF
    AbstractWe are providing a Client-side privacy protection for personalized web search.. Any PWS captures user profiles in a hierarchical taxonomy. The system is performing online generalization on user profiles to protect the personal privacy without compromising the search quality and attempt to improve the search quality with the personalization utility of the user profile. On other side they need to hide the privacy contents existing in the user profile to place the privacy risk under control. User privacy can be provided in form of protection like without compromising the personalized search quality. In general we are working for a trade off between the search quality and the level of privacy protection achieved from generalization

    Web Mining for Web Personalization

    Get PDF
    Web personalization is the process of customizing a Web site to the needs of specific users, taking advantage of the knowledge acquired from the analysis of the user\u27s navigational behavior (usage data) in correlation with other information collected in the Web context, namely, structure, content, and user profile data. Due to the explosive growth of the Web, the domain of Web personalization has gained great momentum both in the research and commercial areas. In this article we present a survey of the use of Web mining for Web personalization. More specifically, we introduce the modules that comprise a Web personalization system, emphasizing the Web usage mining module. A review of the most common methods that are used as well as technical issues that occur is given, along with a brief overview of the most popular tools and applications available from software vendors. Moreover, the most important research initiatives in the Web usage mining and personalization areas are presented

    Analyzing Privacy Protection in Personalized Web Search

    Get PDF
    Personalized Web Search (PWS) is very effective in improving the quality of search services on the internet. The information on internet has increased day by day and user demand for the accurate result, for the accurate result the user has option to PWS. PWS works on the basis of information that user provide to search provider, the current result based on that information. This paper model makes use of hierarchical user profiles, it simultaneously maintaining privacy protection required by the user. Greedy DP (Discriminating Power) & Greedy IL (Information Loss) are used for runtime generalization and it have online prediction that query requires personalization or not

    A Survey on Web Usage Mining, Applications and Tools

    Get PDF
    World Wide Web is a vast collection of unstructured web documents like text, images, audio, video or Multimedia content.  As web is growing rapidly with millions of documents, mining the data from the web is a difficult task. To mine various patterns from the web is known as Web mining. Web mining is further classified as content mining, structure mining and web usage mining. Web usage mining is the data mining technique to mine the knowledge of usage of web data from World Wide Web. Web usage mining extracts useful information from various web logs i.e. users usage history. This is useful for better understanding and serve the people for better web applications. Web usage mining not only useful for the people who access the documents from the World Wide Web, but also it useful for many applications like e-commerce to do personalized marketing, e-services, the government agencies to classify threats and fight against terrorism, fraud detection, to identify criminal activities, the companies can establish better customer relationship and can improve their businesses by analyzing the people buying strategies etc. This paper is going to explain in detail about web usage mining and how it is helpful. Web Usage Mining has seen rapid increase towards research and people communities

    Providing Customized Requirements for Privacy Preserving In Web Search Engines

    Get PDF
    Web search tools are generally used to get information from web servers. These web crawlers use client profiles and as of late sought information to give indexed lists, so here there is no security insurance for client information. We give an framework that can assist clients with customizing their protection necessities. The protections prerequisites gave by client are utilized here for querying the Web server with the hunt keys given by client. In this methodology we can ready to conceal the protection information of client from web search servers. The procedure of modifying protection necessities will happen in offline and will be utilized dynamically .The calculations utilized here will give speculation inquiries expected to look by safeguarding security prerequisites gave. The Experimental results will prove that this Framework will ensure privacy of client

    A COLLABORATIVE FILTERING APPROACH TO PREDICT WEB PAGES OF INTEREST FROMNAVIGATION PATTERNS OF PAST USERS WITHIN AN ACADEMIC WEBSITE

    Get PDF
    This dissertation is a simulation study of factors and techniques involved in designing hyperlink recommender systems that recommend to users, web pages that past users with similar navigation behaviors found interesting. The methodology involves identification of pertinent factors or techniques, and for each one, addresses the following questions: (a) room for improvement; (b) better approach, if any; and (c) performance characteristics of the technique in environments that hyperlink recommender systems operate in. The following four problems are addressed:Web Page Classification. A new metric (PageRank Ă— Inverse Links-to-Word count ratio) is proposed for classifying web pages as content or navigation, to help in the discovery of user navigation behaviors from web user access logs. Results of a small user study suggest that this metric leads to desirable results.Data Mining. A new apriori algorithm for mining association rules from large databases is proposed. The new algorithm addresses the problem of scaling of the classical apriori algorithm by eliminating an expensive joinstep, and applying the apriori property to every row of the database. In this study, association rules show the correlation relationships between user navigation behaviors and web pages they find interesting. The new algorithm has better space complexity than the classical one, and better time efficiency under some conditionsand comparable time efficiency under other conditions.Prediction Models for User Interests. We demonstrate that association rules that show the correlation relationships between user navigation patterns and web pages they find interesting can be transformed intocollaborative filtering data. We investigate collaborative filtering prediction models based on two approaches for computing prediction scores: using simple averages and weighted averages. Our findings suggest that theweighted averages scheme more accurately computes predictions of user interests than the simple averages scheme does.Clustering. Clustering techniques are frequently applied in the design of personalization systems. We studied the performance of the CLARANS clustering algorithm in high dimensional space in relation to the PAM and CLARA clustering algorithms. While CLARA had the best time performance, CLARANS resulted in clusterswith the lowest intra-cluster dissimilarities, and so was most effective in this regard
    • …
    corecore