Results 1 - 10
of
17
From queries to cards: Re-ranking proactive card recommendations based on reactive search history.
- In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval,
, 2015
"... The growing accessibility of mobile devices has substantially reformed the way users access information. While the reactive search by query remains as common as before, recent years have witnessed the emergence of various proactive systems such as Google Now and Microsoft Cortana. In these systems, ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
The growing accessibility of mobile devices has substantially reformed the way users access information. While the reactive search by query remains as common as before, recent years have witnessed the emergence of various proactive systems such as Google Now and Microsoft Cortana. In these systems, relevant content is presented to users based on their context without a query. Interestingly, despite the increasing popularity of such services, there is very little known about how users interact with them. In this paper, we present the first study on user interactions with information cards. We demonstrate that the usage patterns of these cards vary depending on time and location. We also show that while overall different topics are clicked by users on proactive and reactive platforms, the topics of the clicked documents by the same user tend to be consistent cross-platform. Furthermore, we propose a supervised framework for re-ranking proactive cards based on the user's context and past history. To train our models, we use the viewport duration and clicks to infer pseudo-relevance labels for the cards. Our results suggest that the quality of card ranking can be significantly improved particularly when the user's reactive search history is matched against the proactive data about the cards.
Identifying Web Search Query Reformulation using Concept based Matching
"... Web search users frequently modify their queries in hope of receiving better results. This process is referred to as “Query Refor-mulation”. Previous research has mainly fo-cused on proposing query reformulations in the form of suggested queries for users. Some research has studied the problem of pr ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Web search users frequently modify their queries in hope of receiving better results. This process is referred to as “Query Refor-mulation”. Previous research has mainly fo-cused on proposing query reformulations in the form of suggested queries for users. Some research has studied the problem of predicting whether the current query is a reformulation of the previous query or not. However, this work has been limited to bag-of-words models where the main signals being used are word overlap, character level edit distance and word level edit distance. In this work, we show that relying solely on surface level text sim-ilarity results in many false positives where queries with different intents yet similar top-ics are mistakenly predicted as query reformu-lations. We propose a new representation for Web search queries based on identifying the concepts in queries and show that we can sig-nificantly improve query reformulation perfor-mance using features of query concepts. 1
Improving Search Personalisation with Dynamic Group Formation
"... and other research outputs Improving search personalisation with dynamic group formation ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
(Show Context)
and other research outputs Improving search personalisation with dynamic group formation
Cohort Modeling for Enhanced Personalized Search
"... Web search engines utilize behavioral signals to develop search ex-periences tailored to individual users. To be effective, such person-alization relies on access to sufficient information about each user’s interests and intentions. For new users or new queries, profile in-formation may be sparse or ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
(Show Context)
Web search engines utilize behavioral signals to develop search ex-periences tailored to individual users. To be effective, such person-alization relies on access to sufficient information about each user’s interests and intentions. For new users or new queries, profile in-formation may be sparse or non-existent. To handle these cases, and perhaps also improve personalization for those with profiles, search engines can employ signals from users who are similar along one or more dimensions, i.e., those in the same cohort. In this paper we describe a characterization and evaluation of the use of such cohort modeling to enhance search personalization. We experiment with three pre-defined cohorts—topic, location, and top-level domain preference—independently and in combination, and also evaluate methods to learn cohorts dynamically. We show via extensive ex-perimentation with large-scale logs from a commercial search en-gine that leveraging cohort behavior can yield significant relevance gains when combined with a production search engine ranking al-gorithm that uses similar classes of personalization signal but at the individual searcher level. Additional experiments show that our gains can be extended when we dynamically learn cohorts and tar-get easily-identifiable classes of ambiguous or unseen queries.
Temporal Latent Topic User Profiles for Search
"... and other research outputs Temporal latent topic user profiles for search personal-isation ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
and other research outputs Temporal latent topic user profiles for search personal-isation
Improving User Topic Interest Profiles by Behavior Factorization
"... Many recommenders aim to provide relevant recommendations to users by building personal topic interest profiles and then using these profiles to find interesting contents for the user. In social me-dia, recommender systems build user profiles by directly combin-ing users ’ topic interest signals fro ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Many recommenders aim to provide relevant recommendations to users by building personal topic interest profiles and then using these profiles to find interesting contents for the user. In social me-dia, recommender systems build user profiles by directly combin-ing users ’ topic interest signals from a wide variety of consumption and publishing behaviors, such as social media posts they authored, commented on, +1’d or liked. Here we propose to separately model users ’ topical interests that come from these various behavioral sig-nals in order to construct better user profiles. Intuitively, since publishing a post requires more effort, the topic interests coming from publishing signals should be more accurate of a user’s central interest than, say, a simple gesture such as a +1. By separating a single user’s interest profile into several behavioral profiles, we obtain better and cleaner topic interest signals, as well as enabling topic prediction for different types of behavior, such as topics that the user might +1 or comment on, but might never write a post on that topic. To do this at large scales in Google+, we employed matrix fac-torization techniques to model each user’s behaviors as a separate example entry in the input user-by-topic matrix. Using this tech-nique, which we call "behavioral factorization", we implemented and built a topic recommender predicting user’s topical interests us-ing their actions within Google+. We experimentally showed that we obtained better and cleaner signals than baseline methods, and are able to more accurately predict topic interests as well as achieve better coverage.
Online behavioral genome sequencing from usage logs: decoding the search behaviors
- In WWW’14
"... ABSTRACT We present a system to analyze user interests by analyzing their online behaviors from large-scale usage logs. We surmise that user interests can be characterized by a large collection of features we call the behavioral genes that can be deduced from both their explicit and implicit online ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
ABSTRACT We present a system to analyze user interests by analyzing their online behaviors from large-scale usage logs. We surmise that user interests can be characterized by a large collection of features we call the behavioral genes that can be deduced from both their explicit and implicit online behaviors. It is the goal of this research to sequence the entire behavioral genome for online population, namely, to identify the pertinent behavioral genes and uncover their relationships in explaining and predicting user behaviors, so that high quality user profiles can be created and the online services can be better customized using these profiles. Within the scope of this paper, we demonstrate the work using the partial genome derived from web search logs. Our demo system is supported by an open access web service we are releasing and sharing with the research community. The main functions of the web service are: (1) calculating query similarities based on their lexical, temporal and semantic scores, (2) clustering a group of user queries into tasks with the same search and browse intent, and (3) inferring user topical interests by providing a probability distribution over a search taxonomy.
An Optimization Framework for Weighting Implicit Relevance Labels for Personalized Web Search
"... Implicit feedback from users of a web search engine is an essential source providing consistent personal relevance la-bels from the actual population of users. However, previ-ous studies on personalized search employ this source in a rather straightforward manner. Basically, documents that were clic ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Implicit feedback from users of a web search engine is an essential source providing consistent personal relevance la-bels from the actual population of users. However, previ-ous studies on personalized search employ this source in a rather straightforward manner. Basically, documents that were clicked on get maximal gain, and the rest of the docu-ments are assigned the zero gain. As we demonstrate in our paper, a ranking algorithm trained using these gains directly as the ground truth relevance labels leads to a suboptimal personalized ranking. In this paper we develop a framework for automatic reweighting of these labels. Our approach is based on more subtle aspects of user interaction with the result page. We propose an efficient methodology for deriving confidence lev-els for relevance labels that relies directly on the objec-tive ranking measure. All our algorithms are evaluated on a large-scale query log provided by a major commercial search engine. The results of the experiments prove that the current state-of-the-art personalization approaches could be significantly improved by enriching relevance grades with weights extracted from post-impression user behavior.
Z.: Understanding and Supporting Cross-Device Web Search for Exploratory Tasks with Mobile Touch Interactions
"... Mobile devices enable people to look for information at the moment when their information needs are triggered. While experiencing complex information needs that require multiple search sessions, users may utilize desktop computers to fulfill information needs started on mobile devices. Under the con ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Mobile devices enable people to look for information at the moment when their information needs are triggered. While experiencing complex information needs that require multiple search sessions, users may utilize desktop computers to fulfill information needs started on mobile devices. Under the context of mobile-to-desktop web search, this article analyzes users ’ behavioral patterns and compares them to the patterns in desktop-to-desktop web search. Then, we examine several approaches of using Mobile Touch Interactions (MTIs) to infer relevant content so that such content can be used for supporting subsequent search queries on desktop computers. The experimental data used in this article was collected through a user study involving 24 participants and six properly designed cross-device web search tasks. Our experimental results show that (1) users ’ mobile-to-desktop search behaviors do significantly differ from desktop-to-desktop search behaviors in terms of information exploration, sense-making and repeated behaviors. (2) MTIs can be employed to predict the relevance of click-through documents, but applying document-level relevant content based on the predicted relevance does not improve search performance. (3) MTIs can also be used to identify the relevant text chunks at a fine-grained subdocument level. Such relevant information can achieve better search performance than the document-level relevant content. In addition, such subdocument relevant information can be combined with document-level relevance to further improve the search performance. However, the
Rijke. Personalized document re-ranking based on bayesian probabilistic matrix factorization
- In SIGIR ’14
, 2014
"... A query considered in isolation provides limited information about the searcher’s interest. Previous work has considered various types of user behavior, e.g., clicks and dwell time, to obtain a better un-derstanding of the user’s intent. We consider the searcher’s search and page view history. Using ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
A query considered in isolation provides limited information about the searcher’s interest. Previous work has considered various types of user behavior, e.g., clicks and dwell time, to obtain a better un-derstanding of the user’s intent. We consider the searcher’s search and page view history. Using search logs from a commercial search engine, we (i) investigate the impact of features derived from user behavior on reranking a generic ranked list; (ii) optimally inte-grate the contributions of user behavior and candidate documents by learning their relative importance per query based on similar users. We use dwell time on clicked URLs when estimating the rel-evance of documents for a query, and perform Bayesian Probabilis-tic Matrix Factorization as smoothing to predict the relevance. Con-sidering user behavior achieves better rankings than non-personal-ized rankings. Aggregation of user behavior and query-document features with a user-dependent adaptive weight outperforms com-binations with a fixed uniform value.