Ontology Based Personalized Search Engine

An ontology is a representation of knowledge as hierarchies of concepts within domain, using a shared vocabulary to denote the types, properties and inter-relationships of those concepts [1][2]. Ontologies are often equated with classification of hierarchies of classes, class definitions, and the relations, but ontologies need not be limited to these forms. Ontologies are also not limited to conservative definitions, i.e., in the traditional logic sense that only introduce terminology and do not add any knowledge about the world (Enderton, 1972). To specify a conceptualization, axioms need to be proposed that constrain interpretation of defined terms [3]. Ontologies are frameworks for organizing information and are collections of URIs. It is a systematic arrangement of all important categories of objects and concepts within a particular field and relationship between them. Search engines are commonly used for information retrieval from web. The ontology based personalized search engine (OPSE) captures the user’s priorities in the form of concepts by mining through the data which has been previously clicked by them. Search results need to be provided according to user profile and user interest so that highly relevant search data is provided to the user. In order to do this, user profiles need to be maintained. Location information is important for searching data; OPSE needs to classify concepts into content concepts and location concepts. User locations (gathered during user registration) are used to supplement the location concepts in OPSE. Ontology based user profiles are used to organize user preferences and adapt personalized ranking function in order for relevant documents to be retrieved according to a suitable ranking. A client-server architecture is used for design of ontology based personalized search engine. The design involves in collecting and storing client clickthrough data. Functionalities such as re-ranking and concept extraction can be performed at the server side of personalized search engine. As an additional requirement, we can address the privacy issue by restricting the information in the user profile exposed to the personalized mobile search engine server with some privacy parameters. The Prototype of OPSE will be developed on the web platform. Ontology based personalized search engines can significantly improve the precision of results

Privacy Protection in Web Search

This paper presents web search has demonstrated in improving the quality of various search services on the internet, user reluctance to disclose the private information during search has become major barrier for the wide proliferation of password. Protection in password authentication model user preferences as hierarchical user profiles, a password framework know as user profile search that can adaptively generalize profile by search query while respecting user specified privacy requirements. Our work provides utility of personalization and the privacy risk of exposing the generalized profile using Greedy algorithm is a method for deciding whether personalizing a query is efficient

A Survey of Semantic Metadata Management Models for the Social Web

12Social systems are a new generation of Web 2.0 applications, characterized by their primarily user-driven content and the ability to mediate personal and social information across communities, such as teams, communities, and organizations. The recent growth and adaptation of social systems for personal and social information management has created new opportunities for users to be producers as well as consumers of information. This paper aims at studying the different models that have been proposed to better connect resources, annotations and users and their usage in the social Web. The paper aims to answer questions like: \textit{What are the existing models that allow to semantically describe resources, users and tags in the social Web? What are the characteristics of such models? What are the differences between those models?} The final objective is to provide an understandable study and comparison of some of the existing models to help researchers, and developers, to make their decision whenever there is a need to use a semantic meta-data model in the social Web. More concretely, this work aims to be a reference guide for different professionals in order to accelerate the adoption of such technologies in the Social Web

Personalized Web Search via Query Expansion based on User’s Local Hierarchically-Organized Files

Users of Web search engines generally express information needs with short and ambiguous queries, leading to irrelevant results. Personalized search methods improve users’ experience by automatically reformulating queries before sending them to the search engine or rearranging received results, according to their specific interests. A user profile is often built from previous queries, clicked results or in general from the user’s browsing history; different topics must be distinguished in order to obtain an accurate profile. It is quite common that a set of user files, locally stored in sub-directory, are organized by the user into a coherent taxonomy corresponding to own topics of interest, but only a few methods leverage on this potentially useful source of knowledge. We propose a novel method where a user profile is built from those files, specifically considering their consistent arrangement in directories. A bag of keywords is extracted for each directory from text documents with in it. We can infer the topic of each query and expand it by adding the corresponding keywords, in order to obtain a more targeted formulation. Experiments are carried out using benchmark data through a repeatable systematic process, in order to evaluate objectively how much our method can improve relevance of query results when applied upon a third-party search engin

WebTailor: Internet Service for Salient and Automatic User Interest Profiles

Website personalization systems seek to give users unique, tailored content and experiences on the Internet. A key feature of these systems is a user profile that represents each user in a way that distinguishes them from others. In current personalization systems, the data used to create these profiles is extremely limited, which leads to a host of problems and ineffectual personalization. The main goal of this thesis is to improve these personalization systems by addressing their lack of data and its poor quality, breadth, and depth. This is accomplished by analyzing and classifying the content of each user\u27s Internet browsing activity, rather than just their activity on a single website, to autonomously build persistent, ontology-based user profiles. Furthermore, these profiles are built and stored on a remote server, which allows them to be easily made available to approved websites in the interest of providing the data to enable accurate, relevant, and up-to-date personalization

The Potential of Bookmark Based User Profiles

Driven by the explosive growth of information available online, the World-Wide-Web is currently witnessing a trend towards personalized information access. As part of this trend, numerous personalized news services are emerging. The goal of this project is to develop a prototype algorithm for using bookmarks to develop a personal profile. Ultimately, we imagine this might be used to construct a personalized RSS reader for reading news online. A reader returns a large number of news stories. To increase user satisfaction it is useful to rank them to bring the most interesting to the fore. This ranking is done by implementing a personalized profile. One way to create such a profile might be to extract it from user's bookmarks. In this paper, we describe a process for learning user interest from bookmarks and present an evaluation of its effectiveness. The goal is to utilize a user profile based on bookmarks to personalize results by filtering and re-ranking the entries returned from a set of user defined feeds

Multivariate Fairness for Paper Selection

Peer review is the process by which publishers select the best publications for inclusion in a journal or a conference. Bias in the peer review process can impact which papers are selected for inclusion in conferences and journals. Although often implicit, race, gender and other demographics can prevent members of underrepresented groups from presenting at major conferences. To try to avoid bias, many conferences use a double-blind review process to increase fairness during reviewing. However, recent studies argue that the bias has not been removed completely. Our research focuses on developing fair algorithms that correct for these biases and select papers from a more demographically diverse group of authors. To address this, we present fair algorithms that explicitly incorporate author diversity in paper recommendation using multidimensional author profiles that include five demographic features, i.e., gender, ethnicity, career stage, university rank, and geolocation. The Overall Diversity method ranks papers based on an overall diversity score whereas the Multifaceted Diversity method selects papers that fill the highest-priority demographic feature first. We evaluate these algorithms with Boolean and continuous-valued features by recommending papers for SIGCHI 2017 from a pool of SIGCHI 2017, DIS 2017 and IUI 2017 papers and compare the resulting set of papers with the papers accepted by the conference. Both methods increase diversity with small decreases in utility using profiles with either Boolean or continuous feature values. Our best method, Multifaceted Diversity, recommends a set of papers that match demographic parity, selecting authors who are 42.50% more diverse with a 2.45% gain in utility. This approach could be applied when selecting conference papers, journal papers, grant proposals, or other tasks within academia

Multivariate Fairness for Paper Selection

Peer review is the process by which publishers select the best publications for inclusion in a journal or a conference. Bias in the peer review process can impact which papers are selected for inclusion in conferences and journals. Although often implicit, race, gender and other demographics can prevent members of underrepresented groups from presenting at major conferences. To try to avoid bias, many conferences use a double-blind review process to increase fairness during reviewing. However, recent studies argue that the bias has not been removed completely. Our research focuses on developing fair algorithms that correct for these biases and select papers from a more demographically diverse group of authors. To address this, we present fair algorithms that explicitly incorporate author diversity in paper recommendation using multidimensional author profiles that include five demographic features, i.e., gender, ethnicity, career stage, university rank, and geolocation. The Overall Diversity method ranks papers based on an overall diversity score whereas the Multifaceted Diversity method selects papers that fill the highest-priority demographic feature first. We evaluate these algorithms with Boolean and continuous-valued features by recommending papers for SIGCHI 2017 from a pool of SIGCHI 2017, DIS 2017 and IUI 2017 papers and compare the resulting set of papers with the papers accepted by the conference. Both methods increase diversity with small decreases in utility using profiles with either Boolean or continuous feature values. Our best method, Multifaceted Diversity, recommends a set of papers that match demographic parity, selecting authors who are 42.50% more diverse with a 2.45% gain in utility. This approach could be applied when selecting conference papers, journal papers, grant proposals, or other tasks within academia