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.

Zhiming Mao

dblp:258/8430 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0002-7705-9575ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 67% Web and social media mining · 33%

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

TopicWeightPapersLastEvidence papers
Recommender systems › interactive recommendation
conversational recommendation
0.412020
Dynamic Online Conversation Recommendation · ACL 2020
Recommender systems › user interest modeling
dynamic user interest modeling
0.412020
Dynamic Online Conversation Recommendation · ACL 2020
Web and social media mining
social media user profiling
0.412020
Dynamic Online Conversation Recommendation · ACL 2020

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

neural architecture · 0.4cold-start modeling · 0.4
YearPublicationVenuePosition
2024 Visually Guided Generative Text-Layout Pre-training for Document Intelligence
abstract
Zhiming Mao, Haoli Bai, Lu Hou, Lifeng Shang, Xin Jiang, Qun Liu, Kam-Fai Wong. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.
Zhiming Mao, Haoli Bai, Lu Hou 0002, Lifeng Shang, Xin Jiang 0002, Qun Liu 0001, Kam-Fai Wong
NAACL-HLT1
2020 Dynamic Online Conversation Recommendation
abstract
Trending topics in social media content evolve over time, and it is therefore crucial to understand social media users and their interpersonal communications in a dynamic manner.In this research we study dynamic online conversation recommendation, to help users engage in conversations that satisfy their evolving interests.Different from works in conversation recommendation which assume static user interests, our model captures the temporal aspects of user interests.Moreover, our model can cater for cold start problem where conversations are new and unseen in training.We propose a neural architecture to analyze changes of user interactions and interests over time, whose result is used to predict which discussions the users are likely to enter.We conduct experiments on large-scale collections of Reddit conversations.Results on three subreddits show that our model significantly outperforms state-of-the-art models based on static assumption of user interests.We further evaluate performance in cold start, and observe consistently better performance by our model when considering various degrees of sparsity of user's chatting history and conversation contexts.Lastly, our analysis also confirms the change of user interests.This further justify the advantage and efficacy of our model.
Xingshan Zeng, Jing Li 0049, Lu Wang 0008, Zhiming Mao, Kam-Fai Wong
ACL4
2020 A simple kernel co-occurrence-based enhancement for pseudo-relevance feedback
abstract
Pseudo‐relevance feedback is a well‐studied query expansion technique in which it is assumed that the top‐ranked documents in an initial set of retrieval results are relevant and expansion terms are then extracted from those documents. When selecting expansion terms, most traditional models do not simultaneously consider term frequency and the co‐occurrence relationships between candidate terms and query terms. Intuitively, however, a term that has a higher co‐occurrence with a query term is more likely to be related to the query topic. In this article, we propose a kernel co‐occurrence‐based framework to enhance retrieval performance by integrating term co‐occurrence information into the Rocchio model and a relevance language model (RM3). Specifically, a kernel co‐occurrence‐based Rocchio method (KRoc) and a kernel co‐occurrence‐based RM3 method (KRM3) are proposed. In our framework, co‐occurrence information is incorporated into both the factor of the term discrimination power and the factor of the within‐document term weight to boost retrieval performance. The results of a series of experiments show that our proposed methods significantly outperform the corresponding strong baselines over all data sets in terms of the mean average precision and over most data sets in terms of P@10. A direct comparison of standard Text Retrieval Conference data sets indicates that our proposed methods are at least comparable to state‐of‐the‐art approaches.
Min Pan, Jimmy Huang 0001, Tingting He 0003, Zhiming Mao, Zhiwei Ying, Xinhui Tu
J. Assoc. Inf. Sci. Technol.4