Yang Zhao 0041

dblp:50/2082-41 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2023
0000-0002-5253-2995ORCID · verified

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › text summarization
extractive summarization
0.712023
Opinion Summarization via Submodular Information Measures · IEEE Trans. Knowl. Data Eng. 2023
Information retrieval › text summarization
opinion summarization
0.712023
Opinion Summarization via Submodular Information Measures · IEEE Trans. Knowl. Data Eng. 2023
Information retrieval
text summarization
0.712023
Opinion Summarization via Submodular Information Measures · IEEE Trans. Knowl. Data Eng. 2023
Mathematical optimization
submodular optimization
0.212023
Opinion Summarization via Submodular Information Measures · IEEE Trans. Knowl. Data Eng. 2023

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

topic modeling · 1.3submodular information measures · 1.3
YearPublicationVenuePosition
2023 Opinion Summarization via Submodular Information Measures
abstract
This paper focuses on opinion summarization for constructing subjective and concise summaries representing essential opinions of online text reviews. As previous works rarely focus on the relationship between opinions, topics, and sentences, we propose a set of new requirements for Opinion-Topic-Sentence, which are essential for performing opinion summarization. We prove that Opinion-Topic-Sentence can be theoretically analyzed by submodular information measures. Thus, our proposed method can reduce redundant information, strengthen the relevance to given topics, and informatively represent the underlying emotional variations. While conventional methods require human-labeled topics for extractive summarization, we use unsupervised topic modeling methods to generate topic features. We propose four submodular functions and two optimization algorithms with proven performance bounds that can maximize opinion summarization's utility. An automatic evaluation metric, Topic-based Opinion Variance, is also derived to compensate for ROUGE-based metrics of opinion summarization evaluation. Four large, diversified, and representative corpora, OPOSUM, Opinosis, Yelp, and Amazon reviews, are used in our study. The results on these online review texts corroborate the efficacy of our proposed metric and framework.
Yang Zhao 0041, Tommy W. S. Chow
IEEE Trans. Knowl. Data Eng.1
2021 Opinion subset selection via submodular maximization
Yang Zhao 0041, Tommy W. S. Chow
Inf. Sci.1
2021 Monotone submodular subset for sentiment analysis of online reviews
Yang Zhao 0041, Tommy W. S. Chow
Neural Comput. Appl.1