1
|
Zou J, Huang JX, Ren Z, Kanoulas E. Learning to Ask: Conversational Product Search via Representation Learning. ACM T INFORM SYST 2022. [DOI: 10.1145/3555371] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/01/2022]
Abstract
Online shopping platforms, such as Amazon and AliExpress, are increasingly prevalent in the society, helping customers purchase products conveniently. With recent progress on natural language processing, researchers and practitioners shift their focus from traditional product search to conversational product search. Conversational product search enables user-machine conversations and through them collects explicit user feedback that allows to actively clarify the users’ product preferences. Therefore, prospective research on an intelligent shopping assistant via conversations is indispensable. Existing publications on conversational product search either model conversations independently from users, queries, and products or lead to a vocabulary mismatch. In this work, we propose a new conversational product search model, ConvPS, to assist users to locate desirable items. The model is first trained to jointly learn the semantic representations of user, query, item, and conversation via a unified generative framework. After learning these representations, they are integrated to retrieve the target items in the latent semantic space. Meanwhile, we propose a set of greedy and explore-exploit strategies to learn to ask the user a sequence of high-performance questions for conversations. Our proposed ConvPS model can naturally integrate the representation learning of the user, query, item, and conversation into a unified generative framework, which provides a promising avenue for constructing accurate and robust conversational product search systems that are flexible and adaptive. Experimental results demonstrate that our ConvPS model significantly outperforms state-of-the-art baselines.
Collapse
Affiliation(s)
- Jie Zou
- University of Amsterdam, The Netherlands
| | | | | | | |
Collapse
|
2
|
He C, Micallef L, Serim B, Vuong T, Ruotsalo T, Jacucci G. Interactive visual facets to support fluid exploratory search. J Vis (Tokyo) 2022. [DOI: 10.1007/s12650-022-00865-4] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
Abstract
Abstract
Exploratory search starts with ill-defined goals and involves browsing, learning, and formulating new targets for search. To fluidly support such dynamic search behaviours, we focus on devising interactive visual facets (IVF), visualising information facets to support user comprehension and control of the information space. We reviewed existing faceted search interfaces and derived two design requirements (DR) that have not been fully addressed to support fluid interactions in exploratory search. We then exemplified the requirements through devising an IVF tool, which coordinates a linear and a categorical facet representing the distribution and summarisation of items, respectively, and providing context for faceted exploration (DR1). To support rapid transitions between search criteria (DR2), the tool introduces a novel design concept of using facets to select items without filtering the item space. Particularly, we propose a filter-swipe technique that enables users to drag a categorical facet value sequentially over linear facet bars to view the items in the intersection of the two facets along with the categorical facet dynamically summarising the items in the intersection. Three applications with various datasets demonstrate how the features support information discovery with ease. A comparison with a baseline system provided evidence that the task performance of the IVF tool was comparable to the typical query search interface. Another study of 11 participants with realistic email search tasks shows that dynamic suggestions through the timeline navigation can help discover useful suggestions for search; the novel design concept was favoured over using facet values as filters. Based on these practices, we derive IVF design implications for fluid, exploratory searches.
Graphical abstract
Collapse
|
3
|
Hoeber O, Shukla S. A study of visually linked keywords to support exploratory browsing in academic search. J Assoc Inf Sci Technol 2022. [DOI: 10.1002/asi.24623] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/10/2022]
Affiliation(s)
- Orland Hoeber
- Department of Computer Science University of Regina Regina Saskatchewan Canada
| | - Soumya Shukla
- Department of Computer Science University of Regina Regina Saskatchewan Canada
| |
Collapse
|
4
|
Understanding Query Combination Behavior in Exploratory Searches. APPLIED SCIENCES-BASEL 2022. [DOI: 10.3390/app12020706] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/10/2022]
Abstract
In exploratory search, users sometimes combine two or more issued queries into new queries. We present such a kind of search behavior as query combination behavior. We find that the queries after combination usually can better meet users’ information needs. We also observe that users combine queries for different motivations, which leads to different types of query combination behaviors. Previous work on understanding user exploratory search behaviors has focused on how people reformulate queries, but not on how and why they combine queries. Being able to answer these questions is important for exploring how users search and learn during information retrieval processes and further developing support to assist searchers. In this paper, we first describe a two-layer hierarchical structure for understanding the space of query combination behavior types. We manually classify query combination behavior sessions from AOL and Sogou search engines and explain the relationship from combining queries to success. We then characterize some key aspects of this behavior and propose a classifier that can automatically classify types of query combination behavior using behavioral features. Finally, we summarize our findings and show how search engines can better assist searchers.
Collapse
|
5
|
Vuong T, Andolina S, Jacucci G, Ruotsalo T. Spoken Conversational Context Improves Query Auto-completion in Web Search. ACM T INFORM SYST 2021. [DOI: 10.1145/3447875] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]
Abstract
Web searches often originate from conversations in which people engage before they perform a search. Therefore, conversations can be a valuable source of context with which to support the search process. We investigate whether spoken input from conversations can be used as a context to improve query auto-completion. We model the temporal dynamics of the spoken conversational context preceding queries and use these models to re-rank the query auto-completion suggestions. Data were collected from a controlled experiment and comprised conversations among 12 participant pairs conversing about movies or traveling. Search query logs during the conversations were recorded and temporally associated with the conversations. We compared the effects of spoken conversational input in four conditions: a control condition without contextualization; an experimental condition with the model using search query logs; an experimental condition with the model using spoken conversational input; and an experimental condition with the model using both search query logs and spoken conversational input. We show the advantage of combining the spoken conversational context with the Web-search context for improved retrieval performance. Our results suggest that spoken conversations provide a rich context for supporting information searches beyond current user-modeling approaches.
Collapse
Affiliation(s)
| | | | | | - Tuukka Ruotsalo
- University of Helsinki, Finland and University of Copenhagen, Denmark
| |
Collapse
|
6
|
Khan AR, Rashid U, Saleem K, Ahmed A. An architecture for non-linear discovery of aggregated multimedia document web search results. PeerJ Comput Sci 2021; 7:e449. [PMID: 33981832 PMCID: PMC8080422 DOI: 10.7717/peerj-cs.449] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/01/2020] [Accepted: 03/01/2021] [Indexed: 06/12/2023]
Abstract
The recent proliferation of multimedia information on the web enhances user information need from simple textual lookup to multi-modal exploration activities. The current search engines act as major gateways to access the immense amount of multimedia data. However, access to the multimedia content is provided by aggregating disjoint multimedia search verticals. The aggregation of the multimedia search results cannot consider relationships in them and are partially blended. Additionally, the search results' presentation is via linear lists, which cannot support the users' non-linear navigation patterns to explore the multimedia search results. Contrarily, users' are demanding more services from search engines. It includes adequate access to navigate, explore, and discover multimedia information. Our discovery approach allow users to explore and discover multimedia information by semantically aggregating disjoint verticals using sentence embeddings and transforming snippets into conceptually similar multimedia document groups. The proposed aggregation approach retains the relationship in the retrieved multimedia search results. A non-linear graph is instantiated to augment the users' non-linear information navigation and exploration patterns, which leads to discovering new and interesting search results at various aggregated granularity levels. Our method's empirical evaluation results achieve 99% accuracy in the aggregation of disjoint search results at different aggregated search granularity levels. Our approach provides a standard baseline for the exploration of multimedia aggregation search results.
Collapse
|
7
|
Gusenbauer M, Haddaway NR. What every researcher should know about searching - clarified concepts, search advice, and an agenda to improve finding in academia. Res Synth Methods 2020; 12:136-147. [PMID: 33031639 PMCID: PMC7984042 DOI: 10.1002/jrsm.1457] [Citation(s) in RCA: 15] [Impact Index Per Article: 3.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/03/2020] [Accepted: 09/04/2020] [Indexed: 11/07/2022]
Abstract
We researchers have taken searching for information for granted for far too long. The COVID-19 pandemic shows us the boundaries of academic searching capabilities, both in terms of our know-how and of the systems we have. With hundreds of studies published daily on COVID-19, for example, we struggle to find, stay up-to-date, and synthesize information-all hampering evidence-informed decision making. This COVID-19 information crisis is indicative of the broader problem of information overloaded academic research. To improve our finding capabilities, we urgently need to improve how we search and the systems we use. We respond to Klopfenstein and Dampier (Res Syn Meth. 2020) who commented on our 2020 paper and proposed a way of improving PubMed's and Google Scholar's search functionalities. Our response puts their commentary in a larger frame and suggests how we can improve academic searching altogether. We urge that researchers need to understand that search skills require dedicated education and training. Better and more efficient searching requires an initial understanding of the different goals that define the way searching needs to be conducted. We explain the main types of searching that we academics routinely engage in; distinguishing lookup, exploratory, and systematic searching. These three types must be conducted using different search methods (heuristics) and using search systems with specific capabilities. To improve academic searching, we introduce the "Search Triangle" model emphasizing the importance of matching goals, heuristics, and systems. Further, we suggest an urgently needed agenda toward search literacy as the norm in academic research and fit-for-purpose search systems.
Collapse
Affiliation(s)
- Michael Gusenbauer
- Department of Strategic Management, Marketing and Tourism, University of Innsbruck, Innsbruck, Austria.,Chair for Strategy and Organization, Technical University of Munich, Munich, Germany
| | - Neal R Haddaway
- Mercator Research Institute on Global Commons and Climate Change, Berlin, Germany.,Stockholm Environmental Institute, Stockholm, Sweden.,Africa Centre for Evidence, University of Johannesburg, Johannesburg, South Africa
| |
Collapse
|
8
|
Abstract
While continuous active learning algorithms have proven effective in finding most of the relevant documents in a collection, the cost for locating the last few remains high for applications such as Technology-assisted Reviews (TAR). To locate these last few but significant documents efficiently, Zou et al. [2018] have proposed a novel interactive algorithm. The algorithm is based on constructing questions about the presence or absence of entities in the missing relevant documents. The hypothesis made is that entities play a central role in documents carrying key information and that the users are able to answer questions about the presence or absence of an entity in the missing relevance documents. Based on this, a Sequential Bayesian Search-based approach that selects the optimal sequence of questions to ask was devised. In this work, we extend Zou et al. [2018] by (a) investigating the noise tolerance of the proposed algorithm; (b) proposing an alternative objective function to optimize, which accounts for user “erroneous” answers; (c) proposing a method that sequentially decides the best point to stop asking questions to the user; and (d) conducting a small user study to validate some of the assumptions made by Zou et al. [2018]. Furthermore, all experiments are extended to demonstrate the effectiveness of the proposed algorithms not only in the phase of abstract appraisal (i.e., finding the abstracts of potentially relevant documents in a collection) but also finding the documents to be included in the review (i.e., finding the subset of those relevant abstracts for which the article remains relevant). The experimental results demonstrate that the proposed algorithms can greatly improve performance, requiring reviewing fewer irrelevant documents to find the last relevant ones compared to state-of-the-art methods, even in the case of noisy answers. Further, they show that our algorithm learns to stop asking questions at the right time. Last, we conduct a small user study involving an expert reviewer. The user study validates some of the assumptions made in this work regarding the user’s willingness to answer the system questions and the extent of it, as well as the ability of the user to answer these questions.
Collapse
Affiliation(s)
- Jie Zou
- University of Amsterdam, Amsterdam, The Netherlands
| | | |
Collapse
|
9
|
Ruotsalo T, Jacucci G, Kaski S. Interactive faceted query suggestion for exploratory search: Whole‐session effectiveness and interaction engagement. J Assoc Inf Sci Technol 2019. [DOI: 10.1002/asi.24304] [Citation(s) in RCA: 6] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
Affiliation(s)
- Tuukka Ruotsalo
- Helsinki Institute for Information Technology HIITDepartment of Computer Science, University of Helsinki Finland
| | - Giulio Jacucci
- Helsinki Institute for Information Technology HIITDepartment of Computer Science, University of Helsinki Finland
| | - Samuel Kaski
- Helsinki Institute for Information Technology HIIT, Department of Computer ScienceAalto University Finland
| |
Collapse
|