Publications

Journal Articles


TriagedMSA: Triaging Sentimental Disagreement in Multimodal Sentiment Analysis

Published in IEEE Transactions on Affective Computing, 2025

Existing multimodal sentiment analysis models are effective at capturing sentiment commonalities across different modalities and discerning emotions. However, these models still face significant challenges when analyzing samples with sentiment polarity differences across modalities. Neural networks struggle to process such divergent sentiment samples, particularly when they are scarce within datasets. While larger datasets could help address this limitation, collecting and annotating them is resource-intensive. To overcome this challenge, we propose TriagedMSA, a multimodal sentiment analysis model with triage capability. Our model introduces the Sentiment Disagreement Triage Network, which identifies sentiment disagreement between modalities within a sample. This triage mechanism reduces mutual influence by learning to distinguish between samples of sentiment agreement and disagreement. To process these two sample types, we develop the Sentiment Selection Attention Network and the Sentiment Commonality Attention Network, both of which enhance modality interaction learning. Furthermore, we propose the Adaptive Polarity Detection (APD) algorithm, which ensures the generalizability of our model across different datasets, regardless of whether unimodal labels are available. The APD algorithm adaptively determines sentiment polarity disagreement or agreement between modalities. We conduct experiments on three multimodal sentiment analysis datasets: CMU-MOSI, CMU-MOSEI and CH-SIMS.v2. The results demonstrate that our proposed methodology outperforms existing state-of-the-art approaches.

Recommended citation: [TriagedMSA: Triaging Sentimental Disagreement in Multimodal Sentiment Analysis](https://ieeexplore.ieee.org/abstract/document/10819657) (Y. Luo et al.)
Download Paper

Conference Papers


TimelineKGQA: A Comprehensive Question-Answer Pair Generator for Temporal Knowledge Graphs

Published in WWW 25: Companion Proceedings of the ACM on Web Conference 2025, 2025

TimelineKGQA, a universal temporal QA generator applicable to any TKGs

Recommended citation: Qiang Sun, Sirui Li, Du Huynh, Mark Reynolds, and Wei Liu. 2025. TimelineKGQA: A Comprehensive Question-Answer Pair Generator for Temporal Knowledge Graphs. In Companion Proceedings of the ACM on Web Conference 2025 (WWW 25). Association for Computing Machinery, New York, NY, USA, 797–800. https://doi.org/10.1145/3701716.3715308
Download Paper | Download Slides

Docs2KG: A Human-LLM Collaborative Approach to Unified Knowledge Graph Construction from Heterogeneous Documents

Published in WWW 25: Companion Proceedings of the ACM on Web Conference 2025, 2025

Uncovering Knowledge from Chaos

Recommended citation: Qiang Sun, Yuanyi Luo, Wenxiao Zhang, Sirui Li, Jichunyang Li, Kai Niu, Xiangrui Kong, and Wei Liu. 2025. Docs2KG: A Human-LLM Collaborative Approach to Unified Knowledge Graph Construction from Heterogeneous Documents. In Companion Proceedings of the ACM on Web Conference 2025 (WWW 25). Association for Computing Machinery, New York, NY, USA, 801–804. https://doi.org/10.1145/3701716.3715309
Download Paper | Download Slides

Are Graph Embeddings the Panacea?

Published in Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2024

An Empirical Survey from the Data Fitness Perspective

Recommended citation: Sun, Q., Huynh, D.Q., Reynolds, M., Liu, W. (2024). Are Graph Embeddings the Panacea?. In: Yang, DN., Xie, X., Tseng, V.S., Pei, J., Huang, JW., Lin, J.CW. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2024. Lecture Notes in Computer Science(), vol 14646. Springer, Singapore. https://doi.org/10.1007/978-981-97-2253-2_32
Download Paper | Download Slides

Graph Embeddings for Non-IID Data Feature Representation Learning

Published in Australasian Conference on Data Mining, 2022

Best Research Paper Award at AusDM 2022

Recommended citation: Sun, Q., Liu, W., Huynh, D., Reynolds, M. (2022). Graph Embeddings for Non-IID Data Feature Representation Learning. In: Park, L.A.F., et al. Data Mining. AusDM 2022. Communications in Computer and Information Science, vol 1741. Springer, Singapore. https://doi.org/10.1007/978-981-19-8746-5_4
Download Paper | Download Slides