Shuaiqi Liu 0002

dblp:148/2749-2 · DBLP profile ↗
← Back
9ranked-venue papers in the field
3as first author
9since 2021 · last 2024
0000-0002-6754-1587ORCID · verified

Domains — venue-derived; a paper can count in several

Information Retrieval & Web Search · 5 (2 first)Big Data, Cloud & Distributed Data Systems · 2Database Systems & Data Management · 1 (1 first)Data Mining & Knowledge Discovery · 1
YearPublicationVenuePosition
2024 Toward Structure Fairness in Dynamic Graph Embedding: A Trend-aware Dual Debiasing Approach
abstract
Recent studies successfully learned static graph embeddings that are structurally fair by preventing the effectiveness disparity of high- and low-degree vertex groups in downstream graph mining tasks. However, achieving structure fairness in dynamic graph embedding remains an open problem. Neglecting degree changes in dynamic graphs will significantly impair embedding effectiveness without notably improving structure fairness. This is because the embedding performance of high-degree and low-to-high-degree vertices will significantly drop close to the generally poorer embedding performance of most slightly changed vertices in the long-tail part of the power-law distribution. We first identify biased structural evolutions in a dynamic graph based on the evolving trend of vertex degree and then propose FairDGE, the first structurally Fair Dynamic Graph Embedding algorithm. FairDGE learns biased structural evolutions by jointly embedding the connection changes among vertices and the long-short-term evolutionary trend of vertex degrees. Furthermore, a novel dual debiasing approach is devised to encode fair embeddings contrastively, customizing debiasing strategies for different biased structural evolutions. This innovative debiasing strategy breaks the effectiveness bottleneck of embeddings without notable fairness loss. Extensive experiments demonstrate that FairDGE achieves simultaneous improvement in the effectiveness and fairness of embeddings.
Yicong Li 0001, Yu Yang 0012, Jiannong Cao 0001, Shuaiqi Liu 0002, Guandong Xu
KDD4
2024 Joint unsupervised contrastive learning and robust GMM for text clustering
Shuaiqi Liu 0002
Inf. Process. Manag.3
2024 Low-resource court judgment summarization for common law systems
Shuaiqi Liu 0002, Jiannong Cao 0001, Yicong Li 0001, Ruosong Yang
Inf. Process. Manag.1
2024 Neural Abstractive Summarization for Long Text and Multiple Tables
abstract
Abstractive summarization aims to generate a concise summary covering the input document's salient information. Within a report document, the salient information can be scattered in the textual and non-textual content. However, existing document summarization datasets and methods usually focus on the text and filter out the non-textual content. Missing tabular data can limit produced summaries' informativeness, especially when summaries require covering quantitative descriptions of critical metrics in tables. Existing datasets and methods cannot meet the requirements of summarizing long text and dozens of tables in each report document. To deal with the scarcity of available datasets, we propose FINDSum, the first large-scale dataset for long text and multi-table summarization. Built on 21,125 annual reports from 3,794 companies, FINDSum has two subsets for summarizing each company's results of operations and liquidity. Besides, we present four types of summarization methods to jointly consider text and table content when summarizing reports. Additionally, we propose a set of evaluation metrics to assess the usage of numerical information in produced summaries. Our summarization methods significantly outperform advanced baselines, which verifies the necessity of incorporating textual and tabular data when summarizing report documents. We also conduct extensive comparative experiments to identify vital model components and configurations that can improve summarization results.
Shuaiqi Liu 0002, Jiannong Cao 0001, Zhongfen Deng, Wenting Zhao 0006, Ruosong Yang, Philip S. Yu
IEEE Trans. Knowl. Data Eng.1
2024 Personality-affected Emotion Generation in Dialog Systems
abstract
Generating appropriate emotions for responses is essential for dialogue systems to provide human-like interaction in various application scenarios. Most previous dialogue systems tried to achieve this goal by learning empathetic manners from anonymous conversational data. However, emotional responses generated by those methods may be inconsistent, which will decrease user engagement and service quality. Psychological findings suggest that the emotional expressions of humans are rooted in personality traits. Therefore, we propose a new task, Personality-affected Emotion Generation, to generate emotion based on the personality given to the dialogue system and further investigate a solution through the personality-affected mood transition. Specifically, we first construct a daily dialogue dataset, Personality EmotionLines Dataset ( PELD ), with emotion and personality annotations. Subsequently, we analyze the challenges in this task, i.e., (1) heterogeneously integrating personality and emotional factors and (2) extracting multi-granularity emotional information in the dialogue context. Finally, we propose to model the personality as the transition weight by simulating the mood transition process in the dialogue system and solve the challenges above. We conduct extensive experiments on PELD for evaluation. Results suggest that by adopting our method, the emotion generation performance is improved by 13% in macro-F1 and 5% in weighted-F1 from the BERT-base model.
Jiannong Cao 0001, Jiaxing Shen, Ruosong Yang, Shuaiqi Liu 0002, Maosong Sun 0001
ACM Trans. Inf. Syst.5
2023 JPAVE: A Generation and Classification-based Model for Joint Product Attribute Prediction and Value Extraction
abstract
Product attribute value extraction is an important task in e-Commerce which can help several downstream applications such as product search and recommendation. Most previous models handle this task using sequence labeling or question answering method which rely on the sequential position information of values in the product text and are vulnerable to data discrepancy between training and testing. This limits their generalization ability to real-world scenario in which each product can have multiple descriptions across various shopping platforms with different composition of text and style. They also have limited zero-shot ability to new values. In this paper, we propose a multi-task learning model with value generation/classification and attribute prediction called JPAVE to predict values without the necessity of position information of values in the text. Furthermore, the copy mechanism in value generator and the value attention module in value classifier help our model address the data discrepancy issue by only focusing on the relevant part of input text and ignoring other information which causes the discrepancy issue such as sentence structure in the text. Besides, two variants of our model are designed for open-world and closed-world scenarios. In addition, copy mechanism introduced in the first variant based on value generation can improve its zero-shot ability for identifying unseen values. Experimental results on a public dataset demonstrate the superiority of our model compared with strong baselines and its generalization ability of predicting new values.
Zhongfen Deng, Hao Peng 0001, Tao Zhang 0055, Shuaiqi Liu 0002, Wenting Zhao 0006, Yibo Wang 0001, Philip S. Yu
IEEE Big Data4
2023 Aspect-based Meeting Transcript Summarization: A Two-Stage Approach with Weak Supervision on Sentence Classification
abstract
Aspect-based meeting transcript summarization aims to produce multiple summaries, each focusing on one aspect of content in a meeting transcript. It is challenging as sentences related to different aspects can mingle together, and those relevant to a specific aspect can be scattered throughout the long transcript of a meeting. The traditional summarization methods produce one summary mixing information of all aspects, which cannot deal with the above challenges of aspect-based meeting transcript summarization. In this paper, we propose a two-stage method for aspect-based meeting transcript summarization. To select the input content related to specific aspects, we train a sentence classifier on a dataset constructed from the AMI corpus with pseudo-labeling. Then we merge the sentences selected for a specific aspect as the input for the summarizer to produce the aspect-based summary. Experimental results on the AMI corpus outperform many strong baselines, which verifies the effectiveness of our proposed method.
Zhongfen Deng, Seunghyun Yoon 0002, Trung Bui, Franck Dernoncourt, Quan Hung Tran, Shuaiqi Liu 0002, Wenting Zhao 0006, Tao Zhang 0055, Yibo Wang 0001, Philip S. Yu
IEEE Big Data6
2023 DesPrompt: Personality-descriptive prompt tuning for few-shot personality recognition
Jiannong Cao 0001, Yu Yang 0012, Haoli Wang, Ruosong Yang, Shuaiqi Liu 0002
Inf. Process. Manag.6
2022 Key phrase aware transformer for abstractive summarization
Shuaiqi Liu 0002, Jiannong Cao 0001, Ruosong Yang
Inf. Process. Manag.1