Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Weiting An

dblp:239/4060 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Information extraction and text analysis · 87% Question answering and dialogue systems · 13%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
dialogue analysis
0.412019
Learning to Align Question and Answer Utterances in Customer Service Conversation with Recurrent Pointer Networks · AAAI 2019
Recommender systems › set recommendation
bundle recommendation
0.412019
Personalized Bundle List Recommendation · WWW 2019
Recommender systems
diversified recommendation
0.412019
Personalized Bundle List Recommendation · WWW 2019
Natural language and speech › Question answering and dialogue systems › task-oriented dialogue
customer service dialogue
0.112019
Learning to Align Question and Answer Utterances in Customer Service Conversation with Recurrent Pointer Networks · AAAI 2019

Methods — techniques the papers use, named apart from their topics

recurrent pointer network · 0.4end-to-end model · 0.4encoder-decoder · 0.4determinantal point process · 0.4beam search · 0.4
YearPublicationVenuePosition
2019 Learning to Align Question and Answer Utterances in Customer Service Conversation with Recurrent Pointer Networks
abstract
Customers ask questions, and customer service staffs answer those questions. It is the basic service manner of customer service (CS). The progress of CS is a typical multi-round conversation. However, there are no explicit corresponding relations among conversational utterances. This paper focuses on obtaining explicit alignments of question and answer utterances in CS. It not only is an important task of dialogue analysis, but also able to obtain lots of valuable train data for learning dialogue systems. In this work, we propose end-to-end models for aligning question (Q) and answer (A) utterances in CS conversation with recurrent pointer networks (RPN). On the one hand, RPN-based alignment models are able to model the conversational contexts and the mutual influence of different Q-A alignments. On the other hand, they are able to address the issue of empty and multiple alignments for some utterances in a unified manner. We construct a dataset from an in-house online CS. The experimental results demonstrate that the proposed models are effective to learn the alignments of question and answer utterances.
Shizhu He, Kang Liu 0001, Weiting An
AAAI3
2019 Personalized Bundle List Recommendation
abstract
Product bundling, offering a combination of items to customers, is one of the marketing strategies commonly used in online e-commerce and offline retailers. A high-quality bundle generalizes frequent items of interest, and diversity across bundles boosts the user-experience and eventually increases transaction volume. In this paper, we formalize the personalized bundle list recommendation as a structured prediction problem and propose a bundle generation network (BGN), which decomposes the problem into quality/diversity parts by the determinantal point processes (DPPs). BGN uses a typical encoder-decoder framework with a proposed feature-aware softmax to alleviate the inadequate representation of traditional softmax, and integrates the masked beam search and DPP selection to produce high-quality and diversified bundle list with an appropriate bundle size. We conduct extensive experiments on three public datasets and one industrial dataset, including two generated from co-purchase records and the other two extracted from real-world online bundle services. BGN significantly outperforms the state-of-the-art methods in terms of quality, diversity and response time over all datasets. In particular, BGN improves the precision of the best competitors by 16% on average while maintaining the highest diversity on four datasets, and yields a 3.85x improvement of response time over the best competitors in the bundle list recommendation problem.
Jinze Bai, Junshuai Song, Xiaoru Qu, Weiting An, Zhao Li 0007, Jun Gao 0003
WWW5