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.

Ying Liu 0052

dblp:91/112-52 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2026
0000-0002-3117-9926ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Artificial intelligence
1 paper
Trustworthy machine learning · 70% Representation and self-supervised learning · 30%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
multi-view learning
0.812024
Dynamic Evidence Decoupling for Trusted Multi-view Learning · ACM Multimedia 2024
Machine learning › Trustworthy machine learning › multimodal trustworthiness
trusted multi-view learning
0.812024
Dynamic Evidence Decoupling for Trusted Multi-view Learning · ACM Multimedia 2024
Machine learning › Trustworthy machine learning
uncertainty estimation
0.812024
Dynamic Evidence Decoupling for Trusted Multi-view Learning · ACM Multimedia 2024
Machine learning › Trustworthy machine learning › uncertainty estimation › neural network uncertainty
evidential deep learning
0.212024
Dynamic Evidence Decoupling for Trusted Multi-view Learning · ACM Multimedia 2024

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

evidential deep neural network · 0.8dynamic evidence decoupling · 0.8
YearPublicationVenuePosition
2026 Multi-modal fusion approaches for stock market prediction: A comprehensive survey
abstract
Multi-modal fusion effectively integrates diverse data sources, i.e., prices and financial news, to capture complementary information, significantly enhancing stock market prediction. This survey presents a comprehensive survey of multi-modal fusion approaches in stock prediction, proposing a generalized pipeline and a novel hierarchical taxonomy. First, we identify five typical data modalities, detail their feature extraction methods, and summarize publicly available datasets. Second, we review existing fusion methods under a unified taxonomy comprising two main paradigms: Intra-stock Multi-modal Fusion (covering early feature-level to late decision-level integration) and Inter-stock Multi-modal Fusion (capturing inter-stock relational modalities via graph-based modeling). We comprehensively compare their working mechanisms, strengths, and limitations. Finally, we highlight persistent challenges and promising directions for future researches.
Ying Liu 0052, Yiwei Lin, Qingxia Jenny Wang, Jie Zhao 0013, Ziyu Guan, Wei Zhao 0019, Guandong Xu
Pattern Recognit.1
2024 TruthSR: Trustworthy Sequential Recommender Systems via User-generated Multimodal Content
Meng Yan 0013, Ying Liu 0052, Xiyue Gao, Ziyu Guan, Wei Zhao 0019
DASFAA (3)3
2024 Dynamic Evidence Decoupling for Trusted Multi-view Learning
abstract
Multi-view learning methods often focus on improving decision accuracy, while neglecting the decision uncertainty, limiting their suitability for safety-critical applications. To mitigate this, researchers propose trusted multi-view learning methods that estimate classification probabilities and uncertainty by learning the class distributions for each instance. However, these methods assume that the data from each view can effectively differentiate all categories, ignoring the semantic vagueness phenomenon in real-world multi-view data. Our findings demonstrate that this phenomenon significantly suppresses the learning of view-specific evidence in existing methods. We propose a Consistent and Complementary-aware trusted Multi-view Learning (CCML) method to solve this problem. We first construct view opinions using evidential deep neural networks, which consist of belief mass vectors and uncertainty estimates. Next, we dynamically decouple the consistent and complementary evidence. The consistent evidence is derived from the shared portions across all views, while the complementary evidence is obtained by averaging the differing portions across all views. We ensure that the opinion constructed from the consistent evidence strictly aligns with the ground-truth category. For the opinion constructed from the complementary evidence, we allow it for potential vagueness in the evidence. We compare CCML with state-of-the-art baselines on one synthetic and six real-world datasets. The results validate the effectiveness of the dynamic evidence decoupling strategy and show that CCML significantly outperforms baselines on accuracy and reliability. The code is released at https://github.com/Lihong-Liu/CCML.
Ying Liu 0052, Lihong Liu, Ziyu Guan, Wei Zhao 0019
ACM Multimedia1
2024 TABLE: Time-aware Balanced Multi-view Learning for stock ranking
Ying Liu 0052, Long Chen 0007, Meng Yan 0013, Wei Zhao 0019, Ziyu Guan
Knowl. Based Syst.1
2021 Multiview Concept Learning Via Deep Matrix Factorization
abstract
Multiview representation learning (MVRL) leverages information from multiple views to obtain a common representation summarizing the consistency and complementarity in multiview data. Most previous matrix factorization-based MVRL methods are shallow models that neglect the complex hierarchical information. The recently proposed deep multiview factorization models cannot explicitly capture consistency and complementarity in multiview data. We present the deep multiview concept learning (DMCL) method, which hierarchically factorizes the multiview data, and tries to explicitly model consistent and complementary information and capture semantic structures at the highest abstraction level. We explore two variants of the DMCL framework, DMCL-L and DMCL-N, with respectively linear/nonlinear transformations between adjacent layers. We propose two block coordinate descent-based optimization methods for DMCL-L and DMCL-N. We verify the effectiveness of DMCL on three real-world data sets for both clustering and classification tasks.
Wei Zhao 0019, Ziyu Guan, Ying Liu 0052
IEEE Trans. Neural Networks Learn. Syst.4