[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Reflects downloads up to 15 Jan 2025Bibliometrics
Skip Table Of Content Section
research-article
Open Access
Contextual Path Retrieval: A Contextual Entity Relation Embedding-based Approach
Article No.: 1, Pages 1–38https://doi.org/10.1145/3502720

Contextual path retrieval (CPR) refers to the task of finding contextual path(s) between a pair of entities in a knowledge graph that explains the connection between them in a given context. For this novel retrieval task, we propose the Embedding-based ...

research-article
Generating Relevant and Informative Questions for Open-Domain Conversations
Article No.: 2, Pages 1–30https://doi.org/10.1145/3510612

Recent research has highlighted the importance of mixed-initiative interactions in conversational search. To enable mixed-initiative interactions, information retrieval systems should be able to ask diverse questions, such as information-seeking, ...

research-article
Interaction-aware Drug Package Recommendation via Policy Gradient
Article No.: 3, Pages 1–32https://doi.org/10.1145/3511020

Recent years have witnessed the rapid accumulation of massive electronic medical records, which highly support intelligent medical services such as drug recommendation. However, although there are multiple interaction types between drugs, e.g., synergism ...

research-article
Open Access
KR-GCN: Knowledge-Aware Reasoning with Graph Convolution Network for Explainable Recommendation
Article No.: 4, Pages 1–27https://doi.org/10.1145/3511019

Incorporating knowledge graphs (KGs) into recommender systems to provide explainable recommendation has attracted much attention recently. The multi-hop paths in KGs can provide auxiliary facts for improving recommendation performance as well as ...

research-article
Open Access
User Behavior Simulation for Search Result Re-ranking
Article No.: 5, Pages 1–35https://doi.org/10.1145/3511469

Result ranking is one of the major concerns for Web search technologies. Most existing methodologies rank search results in descending order of relevance. To model the interactions among search results, reinforcement learning (RL algorithms have been ...

research-article
Position-Enhanced and Time-aware Graph Convolutional Network for Sequential Recommendations
Article No.: 6, Pages 1–32https://doi.org/10.1145/3511700

The sequential recommendation (also known as the next-item recommendation), which aims to predict the following item to recommend in a session according to users’ historical behavior, plays a critical role in improving session-based recommender systems. ...

research-article
Hierarchical Sliding Inference Generator for Question-driven Abstractive Answer Summarization
Article No.: 7, Pages 1–27https://doi.org/10.1145/3511891

Text summarization on non-factoid question answering (NQA) aims at identifying the core information of redundant answer guidance using questions, which can dramatically improve answer readability and comprehensibility. Most existing approaches focus on ...

research-article
Reinforcement Routing on Proximity Graph for Efficient Recommendation
Article No.: 8, Pages 1–27https://doi.org/10.1145/3512767

We focus on Maximum Inner Product Search (MIPS), which is an essential problem in many machine learning communities. Given a query, MIPS finds the most similar items with the maximum inner products. Methods for Nearest Neighbor Search (NNS) which is ...

research-article
Follow the Timeline! Generating an Abstractive and Extractive Timeline Summary in Chronological Order
Article No.: 9, Pages 1–30https://doi.org/10.1145/3517221

Today, timestamped web documents related to a general news query flood the Internet, and timeline summarization targets this concisely by summarizing the evolution trajectory of events along the timeline. Unlike traditional document summarization, ...

research-article
Learning Relation Ties with a Force-Directed Graph in Distant Supervised Relation Extraction
Article No.: 10, Pages 1–23https://doi.org/10.1145/3520082

Relation ties, defined as the correlation and mutual exclusion between different relations, are critical for distant supervised relation extraction. Previous studies usually obtain this property by greedily learning the local connections between ...

research-article
Open Access
Sequential Recommendation with Multiple Contrast Signals
Article No.: 11, Pages 1–27https://doi.org/10.1145/3522673

Sequential recommendation has become a trending research topic for its capability to capture dynamic user intents based on historical interaction sequence. To train a sequential recommendation model, it is a common practice to optimize the next-item ...

research-article
Open Access
Revisiting Negative Sampling vs. Non-sampling in Implicit Recommendation
Article No.: 12, Pages 1–25https://doi.org/10.1145/3522672

Recommendation systems play an important role in alleviating the information overload issue. Generally, a recommendation model is trained to discern between positive (liked) and negative (disliked) instances for each user. However, under the open-world ...

research-article
Characterization and Prediction of Mobile Tasks
Article No.: 13, Pages 1–39https://doi.org/10.1145/3522711

Mobile devices have become an increasingly ubiquitous part of our everyday life. We use mobile services to perform a broad range of tasks (e.g., booking travel or conducting remote office work), leading to often lengthy interactions with several distinct ...

research-article
Toward Equivalent Transformation of User Preferences in Cross Domain Recommendation
Article No.: 14, Pages 1–31https://doi.org/10.1145/3522762

Cross domain recommendation (CDR) is one popular research topic in recommender systems. This article focuses on a popular scenario for CDR where different domains share the same set of users but no overlapping items. The majority of recent methods have ...

research-article
A Static and Dynamic Attention Framework for Multi Turn Dialogue Generation
Article No.: 15, Pages 1–30https://doi.org/10.1145/3522763

Recently, research on open domain dialogue systems have attracted extensive interests of academic and industrial researchers. The goal of an open domain dialogue system is to imitate humans in conversations. Previous works on single turn conversation ...

research-article
Users Meet Clarifying Questions: Toward a Better Understanding of User Interactions for Search Clarification
Article No.: 16, Pages 1–25https://doi.org/10.1145/3524110

The use of clarifying questions (CQs) is a fairly new and useful technique to aid systems in recognizing the intent, context, and preferences behind user queries. Yet, understanding the extent of the effect of CQs on user behavior and the ability to ...

research-article
Open Access
Knowledge-Enhanced Attributed Multi-Task Learning for Medicine Recommendation
Article No.: 17, Pages 1–24https://doi.org/10.1145/3527662

Medicine recommendation systems target to recommend a set of medicines given a set of symptoms which play a crucial role in assisting doctors in their daily clinics. Existing approaches are either rule-based or supervised. However, the former heavily ...

research-article
Public Access
The Influences of a Knowledge Representation Tool on Searchers with Varying Cognitive Abilities
Article No.: 18, Pages 1–35https://doi.org/10.1145/3527661

While current systems are effective in helping searchers resolve simple information needs (e.g., fact-finding), they provide less support for searchers working on complex information-seeking tasks. Complex search tasks involve a wide range of (meta)...

research-article
Curriculum Pre-training Heterogeneous Subgraph Transformer for Top-N Recommendation
Article No.: 19, Pages 1–28https://doi.org/10.1145/3528667

To characterize complex and heterogeneous side information in recommender systems, the heterogeneous information network (HIN) has shown superior performance and attracted much research attention. In HIN, the rich entities, relations, and paths can be ...

research-article
A Multi-channel Hierarchical Graph Attention Network for Open Event Extraction
Article No.: 20, Pages 1–27https://doi.org/10.1145/3528668

Event extraction is an essential task in natural language processing. Although extensively studied, existing work shares issues in three aspects, including (1) the limitations of using original syntactic dependency structure, (2) insufficient ...

research-article
Integrating Representation and Interaction for Context-Aware Document Ranking
Article No.: 21, Pages 1–23https://doi.org/10.1145/3529955

Recent studies show that historical behaviors (such as queries and their clicks) contained in a search session can benefit the ranking performance of subsequent queries in the session. Existing neural context-aware ranking models usually rank documents ...

research-article
Few-shot Aspect Category Sentiment Analysis via Meta-learning
Article No.: 22, Pages 1–31https://doi.org/10.1145/3529954

Existing aspect-based/category sentiment analysis methods have shown great success in detecting sentiment polarity toward a given aspect in a sentence with supervised learning, where the training and inference stages share the same pre-defined set of ...

research-article
perCLTV: A General System for Personalized Customer Lifetime Value Prediction in Online Games
Article No.: 23, Pages 1–29https://doi.org/10.1145/3530012

Online games make up the largest segment of the booming global game market in terms of revenue as well as players. Unlike games that sell games at one time for profit, online games make money from in-game purchases by a large number of engaged players. ...

survey
Personalized News Recommendation: Methods and Challenges
Article No.: 24, Pages 1–50https://doi.org/10.1145/3530257

Personalized news recommendation is important for users to find interesting news information and alleviate information overload. Although it has been extensively studied over decades and has achieved notable success in improving user experience, there are ...

research-article
Open Access
Reconciling the Quality vs Popularity Dichotomy in Online Cultural Markets
Article No.: 25, Pages 1–34https://doi.org/10.1145/3530790

We propose a simple model of an idealized online cultural market in which N items, endowed with a hidden quality metric, are recommended to users by a ranking algorithm possibly biased by the current items’ popularity. Our goal is to better understand the ...

Subjects

Comments

Please enable JavaScript to view thecomments powered by Disqus.