EDBT 2026 Demo / reviewers in the wild / expert
Jinhuan Liu
dblp:207/2030
· DBLP profile ↗
17ranked-venue papers
6as first author
12since 2021 · last 2026
0000-0002-1151-6040ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 10 · 5 first-author · 7 since 2021Databases, data management, data science and information retrieval · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Granular-Ball-Based Ensemble Learning Method for Software Defect Prediction
Fanli Sun, Jinhuan Liu, Chuanyu Huang, Junwei Du |
KSEM (7) | 2 |
| 2026 | Dual-space relation-aware entity representation learning for personalized compatibility modeling
Jinhuan Liu, Xuemeng Song, Yanwei Yu, Junwei Du |
Expert Syst. Appl. | 1 |
| 2026 | An ensemble method using neighborhood granular combination entropy for software defect prediction
Feng Jiang 0019, Xu Yu 0001, Qiang Hu 0002, Jinhuan Liu, Junwei Du |
Inf. Process. Manag. | 4 |
| 2026 | Multimodal Recommendation via Modality-Shared Encoding and Multi-Dimensional Loss OptimizationabstractMultimodal embeddings of items and users, along with the loss function in the prediction model, are crucial for multimodal recommendation. Previous studies focused on feature extraction and fusion across modalities but lacked collaborative optimization of modal features across different association graphs. While prediction models address data alignment and user preference enhancement, they overlook preference consistency and varying contributions of different modalities to recommendations. In light of these issues, this paper proposes a multimodal recommendation method that combines Modality Shared Encoding with Multidimensional Loss optimization (MSE-ML). We introduce a multi-view feature joint encoding module, leveraging modality sharing mechanism to enable collaborative optimization of item embeddings across the user item graph and multiple modality-aware item association graphs. Additionally, we design a multidimensional loss optimization strategy that simultaneously promotes modality alignment, preserves preference consistency, and enhance the contribution of weak modality. Experimental results on publicly available datasets show that MSE-ML outperforms state-of-the-art approaches in terms of recommendation quality. Qiang Hu 0002, Jinhuan Liu, Junwei Du |
IEEE Trans. Multim. | 4 |
| 2025 | PFedDyFilter: Personalized Federated Learning via Dynamic Filters
Zhongxiang Shi, Jinhuan Liu, Chuanyu Huang, Junwei Du |
ICA3PP (6) | 2 |
| 2025 | A neighborhood rough sets-based ensemble method, with application to software fault prediction
Jinhuan Liu, Junwei Du |
Expert Syst. Appl. | 4 |
| 2025 | Hierarchical fine-grained multi-behavior recommendation with behavior-aware contrastive learning
Kaiyao Zhu, Jinhuan Liu, Xuemeng Song, Jianhua Yin 0001, Shuhan Qi, Junwei Du |
Neural Networks | 2 |
| 2024 | Behavior Pattern Mining-based Multi-Behavior RecommendationabstractMulti-behavior recommendation systems enhance effectiveness by leveraging auxiliary behaviors (such as page views and favorites) to address the limitations of traditional models that depend solely on sparse target behaviors like purchases. Existing approaches to multi-behavior recommendations typically follow one of two strategies: some derive initial node representations from individual behavior subgraphs before integrating them for a comprehensive profile, while others interpret multi-behavior data as a heterogeneous graph, applying graph neural networks to achieve a unified node representation. However, these methods do not adequately explore the intricate patterns of behavior among users and items. To bridge this gap, we introduce a novel algorithm called Behavior Pattern mining-based Multi-behavior Recommendation (BPMR). Our method extensively investigates the diverse interaction patterns between users and items, utilizing these patterns as features for making recommendations. We employ a Bayesian approach to streamline the recommendation process, effectively circumventing the challenges posed by graph neural network algorithms, such as the inability to accurately capture user preferences due to over-smoothing. Our experimental evaluation on three realworld datasets demonstrates that BPMR significantly outperforms existing state-of-the-art algorithms, showing an average improvement of 268.29% in Recall@10 and 248.02% in NDCG@10 metrics. The code of our BPMR is openly accessible for use and further research at https://github.com/rookitkitlee/BPMR. Zhiyong Cheng 0001, Xu Yu 0001, Jinhuan Liu, Guanfeng Liu 0001, Junwei Du |
SIGIR | 4 |
| 2024 | Intent Distribution based Bipartite Graph Representation LearningabstractBipartite graph representation learning embeds users and items into a low-dimensional latent space based on observed interactions. Previous studies mainly fall into two categories: one reconstructs the structural relations of the graph through the representations of nodes, while the other aggregates neighboring node information using graph neural networks. However, existing methods only explore the local structural information of nodes during the learning process. This makes it difficult to represent the macroscopic structural information and leaves it easily affected by data sparsity and noise. To address this issue, we propose the Intent Distribution based Bipartite graph Representation learning (IDBR) model, which explicitly integrates node intent distribution information into the representation learning process. Specifically, we obtain node intent distributions through clustering and design an intent distribution based graph convolution neural network to generate node representations. Compared to traditional methods, we expand the scope of node representations, enabling us to obtain more comprehensive representations of global intent. When constructing the intent distributions, we effectively alleviated the issues of data sparsity and noise. Additionally, we enrich the representations of nodes by integrating potential neighboring nodes from both structural and semantic dimensions. Experiments on the link prediction and recommendation tasks illustrate that the proposed approach outperforms existing state-of-the-art methods. The code of IDBR is available at https://github.com/rookitkitlee/IDBR. Guanfeng Liu 0001, Jinhuan Liu, Feng Jiang 0019, Junwei Du |
SIGIR | 4 |
| 2024 | Unifying heterogeneous and homogeneous relations for personalized compatibility modeling
Jinhuan Liu, Xuemeng Song, Zhaochun Ren |
Knowl. Based Syst. | 1 |
| 2023 | A Developer Recommendation Method Based on Disentangled Graph Convolutional Network
Junwei Du, Jinhuan Liu, Lei Guo 0008, Xu Yu 0001, Daobo Sun, Haohao Yu |
ICONIP (5) | 4 |
| 2023 | Multi-Head Attention and Knowledge Graph Based Dual Target Graph Collaborative Filtering Network
Xu Yu 0001, Qinglong Peng, Feng Jiang 0019, Junwei Du, Hongtao Liang, Jinhuan Liu |
Neural Process. Lett. | 6 |
| 2020 | Auxiliary Template-Enhanced Generative Compatibility ModelingabstractIn recent years, there has been a growing interest in the fashion analysis (e.g., clothing matching) due to the huge economic value of the fashion industry. The essential problem is to model the compatibility between the complementary fashion items, such as the top and bottom in clothing matching. The majority of existing work on fashion analysis has focused on measuring the item-item compatibility in a latent space with deep learning methods. In this work, we aim to improve the compatibility modeling by sketching a compatible template for a given item as an auxiliary link between fashion items. Specifically, we propose an end-to-end Auxiliary Template-enhanced Generative Compatibility Modeling (AT-GCM) scheme, which introduces an auxiliary complementary template generation network equipped with the pixel-wise consistency and compatible template regularization. Extensive experiments on two real-world datasets demonstrate the superiority of the proposed approach. Jinhuan Liu, Xuemeng Song, Zhaochun Ren, Liqiang Nie, Zhaopeng Tu, Jun Ma 0001 |
IJCAI | 1 |
| 2020 | MGCM: Multi-modal generative compatibility modeling for clothing matching
Jinhuan Liu, Xuemeng Song, Zhumin Chen, Jun Ma 0001 |
Neurocomputing | 1 |
| 2020 | An End-to-End Attention-Based Neural Model for Complementary Clothing MatchingabstractIn modern society, people tend to prefer fashionable and decent outfits that can meet more than basic physiological needs. In fact, a proper outfit usually relies on good matching among complementary fashion items (e.g., the top, bottom, and shoes) that compose it, which thus propels us to investigate the automatic complementary clothing matching scheme. However, this is non-trivial due to the following challenges. First, the main challenge lies in how to accurately model the compatibility between complementary fashion items (e.g., the top and bottom) that come from the heterogeneous spaces with multi-modalities (e.g., the visual modality and textual modality). Second, since different features (e.g., the color, style, and pattern) of fashion items may contribute differently to compatibility modeling, how to encode the confidence of different pairwise features presents a tough challenge. Third, how to jointly learn the latent representation of multi-modal data and the compatibility between complementary fashion items contributes to the last challenge. Toward this end, in this work, we present an end-to-end attention-based neural framework for the compatibility modeling, where we introduce a feature-level attention model to adaptively learn the confidence for different pairwise features. Extensive experiments on a public available real-world dataset show the superiority of our model over state-of-the-art methods. Jinhuan Liu, Xuemeng Song, Liqiang Nie, Tian Gan 0002, Jun Ma 0001 |
ACM Trans. Multim. Comput. Commun. Appl. | 1 |
| 2019 | Neural fashion experts: I know how to make the complementary clothing matching
Jinhuan Liu, Xuemeng Song, Zhumin Chen, Jun Ma 0001 |
Neurocomputing | 1 |
| 2017 | NeuroStylist: Neural Compatibility Modeling for Clothing MatchingabstractNowadays, as a beauty-enhancing product, clothing plays an important role in human's social life. In fact, the key to a proper outfit usually lies in the harmonious clothing matching. Nevertheless, not everyone is good at clothing matching. Fortunately, with the proliferation of fashion-oriented online communities, fashion experts can publicly share their fashion tips by showcasing their outfit compositions, where each fashion item (e.g., a top or bottom) usually has an image and context metadata (e.g., title and category). Such rich fashion data offer us a new opportunity to investigate the code in clothing matching. However, challenges co-exist with opportunities. The first challenge lies in the complicated factors, such as color, material and shape, that affect the compatibility of fashion items. Second, as each fashion item involves multiple modalities (i.e., image and text), how to cope with the heterogeneous multi-modal data also poses a great challenge. Third, our pilot study shows that the composition relation between fashion items is rather sparse, which makes traditional matrix factorization methods not applicable. Towards this end, in this work, we propose a content-based neural scheme to model the compatibility between fashion items based on the Bayesian personalized ranking (BPR) framework. The scheme is able to jointly model the coherent relation between modalities of items and their implicit matching preference. Experiments verify the effectiveness of our scheme, and we deliver deep insights that can benefit future research. Xuemeng Song, Fuli Feng, Jinhuan Liu, Zekun Li 0001, Liqiang Nie, Jun Ma 0001 |
ACM Multimedia | 3 |