Shan Jin 0003

dblp:10/2477-3 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
6since 2021 · last 2026
0000-0003-2544-0531ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
3 papers
Graph learning · 87% Reinforcement learning · 13%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 60% Data mining · 40%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 67% Bioinformatics and computational biology · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
1.012026
Adaptive Multi-Interaction Web Semantic Graph Representation · WWW 2026
Machine learning › Graph learning
graph representation learning
1.012026
Adaptive Multi-Interaction Web Semantic Graph Representation · WWW 2026
Machine learning › Graph learning
link prediction
1.012026
Adaptive Multi-Interaction Web Semantic Graph Representation · WWW 2026
Recommender systems
explainable recommendation
1.012026
Explaining Synergistic Effects in Social Recommendations · WWW 2026
Recommender systems
social recommendation
1.012026
Explaining Synergistic Effects in Social Recommendations · WWW 2026
Machine learning › Graph learning › graph neural network
brain network analysis
0.812024
Long-range Brain Graph Transformer · NeurIPS 2024
Machine learning › Graph learning › graph neural network
graph transformer
0.812024
Long-range Brain Graph Transformer · NeurIPS 2024
Bioinformatics and computational biology › neuroscience › neuroinformatics
brain network analysis
0.812024
Long-range Brain Graph Transformer · NeurIPS 2024
Medical and health informatics › neuroimaging
neuroimaging analysis
0.812024
Long-range Brain Graph Transformer · NeurIPS 2024
Medical and health informatics › clinical diagnosis
neurological disease diagnosis
0.812024
Long-range Brain Graph Transformer · NeurIPS 2024
Data mining
clustering
0.712023
Deep Reinforcement Clustering · IEEE Trans. Multim. 2023
Data mining › clustering
deep clustering
0.712023
Deep Reinforcement Clustering · IEEE Trans. Multim. 2023

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

transformer · 1.5biased random walk · 1.5markov decision process · 1.3deep reinforcement learning · 1.3cauchy distribution · 1.3multi-interaction aggregation · 1.0graph information gain · 1.0graph convolution network · 1.0conditional entropy optimization · 1.0adaptive relation-specific decoder · 1.0
YearPublicationVenuePosition
2026 Adaptive Multi-Interaction Web Semantic Graph Representation
abstract
Effective representations of complex web semantic graphs are essential for various web applications, including link prediction, recommendation systems, and social network analysis. However, existing methods assume that multi-interactions (or multi-relationships) between two connected nodes are independent, while these relationships inherently exhibit characteristics of mutual promotion or mutual inhibition. Moreover, these semantic characteristics across different relationships cannot be easily captured by a simple linear combination. To tackle this challenge, we propose an Adaptive Multi-Interaction (AMI) web semantic graph representation method. Specifically, AMI consists of three modules, including a multi-interaction aggregation module, a global pattern aggregation module, and an adaptive relation-specific decoder module. Firstly, we construct a learnable multi-interaction behavior pattern matrix that captures the mutual promotion and mutual inhibition effects between two connected nodes. Secondly, the global pattern aggregation module is designed to efficiently capture global homogeneous interaction patterns through graph convolution networks. Finally, the adaptive relation-specific decoder module employs a hybrid scoring strategy to adaptively decode node embeddings based on their distinct relationships. Extensive experiments on benchmark web datasets for link prediction tasks demonstrate that AMI outperforms state-of-the-art baselines. Our codes are available at https://github.com/AI-stronger123/AMI.
Feng Ding 0016, Ruolin Li, Junxiang Zhang, Shan Jin 0003, Yicong Li 0006, Xin Ye 0004
WWW6
2026 Explaining Synergistic Effects in Social Recommendations
abstract
In social recommenders, the inherent nonlinearity and opacity of synergistic effects across multiple social networks hinders users from understanding how diverse information is leveraged for recommendations, consequently diminishing explainability. However, existing explainers can only identify the topological information in social networks that significantly influences recommendations, failing to further explain the synergistic effects among this information. Inspired by existing findings that synergistic effects enhance mutual information between inputs and predictions to generate information gain, we extend this discovery to graph data. We quantify graph information gain to identify subgraphs embodying synergistic effects. Based on the theoretical insights, we propose SemExplainer, which explains synergistic effects by identifying subgraphs that embody them. SemExplainer first extracts explanatory subgraphs from multi-view social networks to generate preliminary importance explanations for recommendations. A conditional entropy optimization strategy to maximize information gain is developed, thereby further identifying subgraphs that embody synergistic effects from explanatory subgraphs. Finally, SemExplainer searches for paths from users to recommended items within the synergistic subgraphs to generate explanations for the recommendations. Extensive experiments on three datasets demonstrate the superiority of SemExplainer over baseline methods, providing superior explanations of synergistic effects. The implementation is available at https://github.com/yushuowiki/SemExplainer.
Yicong Li 0006, Shan Jin 0003, Shuo Wang 0040, Jiaying Liu 0006, Shuo Yu 0001, Qiang Zhang 0008, Kuanjiu Zhou, Feng Xia 0001
WWW2
2024 Incorporating Contextual Cues for Image Recognition: A Multi-Modal Semantic Fusion Model Sensitive to Key Information
abstract
Multi-modal data feature fusion can effectively improve the accuracy of primary modal pattern recognition and address the issue of missing data through multi-modal collaboration. To some extent, supplementing multi-view information can alleviate the conflict between medical images’ reliance on professional annotations and the limited number of annotations. However, there are still several challenges in engineering multimodal feature perception and fusion for medical images, including imbalanced patterns that make it challenging to establish a weighted allocation criterion suitable for different tasks, misleading factors not positively correlated with knowledge richness, and complexities associated with integrating modalities having diverse formats for text and time series data into overall feature engineering and similarity. This paper introduces a multi-modal semantic fusion model that is sensitive to key information represented by contextual cues. Furthermore, it incorporates a dynamic feature engineering scheme capable of acquiring and integrating important insights from three perspectives with an optimized structure. Additionally, it presents a novel similarity evaluation criteria and fusion mode that adaptively adjust weights based on their contributions, facilitating the measurement of target object category likelihoods across various modalities for weighted analyses. The system combines LSTM and CNN models to builda sequence and local information sensitive structure designed to integrate heterogeneous features while embedding the multimodal similarity fusion. Emphasizing small yet compelling pieces of information such as contextual cues that prompt medical representation assignment to the target category, our system places significant importance on specificity removal and accuracy enhancement, exemplified by introducing contextual information demonstrating our sensitivity to contextual cues despite our non-specifically structured approach.
Zhikui Chen, Shan Jin 0003
BIBM4
2024 Long-range Brain Graph Transformer
abstract
Understanding communication and information processing among brain regions of interest (ROIs) is highly dependent on long-range connectivity, which plays a crucial role in facilitating diverse functional neural integration across the entire brain. However, previous studies generally focused on the short-range dependencies within brain networks while neglecting the long-range dependencies, limiting an integrated understanding of brain-wide communication. To address this limitation, we propose Adaptive Long-range aware TransformER (ALTER), a brain graph transformer to capture long-range dependencies between brain ROIs utilizing biased random walk. Specifically, we present a novel long-range aware strategy to explicitly capture long-range dependencies between brain ROIs. By guiding the walker towards the next hop with higher correlation value, our strategy simulates the real-world brain-wide communication. Furthermore, by employing the transformer framework, ALERT adaptively integrates both short- and long-range dependencies between brain ROIs, enabling an integrated understanding of multi-level communication across the entire brain. Extensive experiments on ABIDE and ADNI datasets demonstrate that ALTER consistently outperforms generalized state-of-the-art graph learning methods (including SAN, Graphormer, GraphTrans, and LRGNN) and other graph learning based brain network analysis methods (including FBNETGEN, BrainNetGNN, BrainGNN, and BrainNETTF) in neurological disease diagnosis.
Shuo Yu 0001, Shan Jin 0003, Tabinda Sarwar, Feng Xia 0001
NeurIPS2
2023 IMA: Implicit Matching and Alignment for Multimodal Named Entity Recognition
abstract
Due to the limitation of insufficient textual information, Multimodal Named Entity Recognition (MNER), which introduces associated images to assist in the knowledge extraction of key entities, has increasingly received extensive attention from researchers. Existing MNER methods have made good progress based on the attention mechanism. However, there are still two shortcomings. One is that the text and its corresponding image are not perfectly matched, and the introduction of mismatched image information may lead to incorrect prediction by the model. Secondly, the text representation and image representation obtained by the pre-training encoder often have huge semantic differences, while existing methods usually lack the exploration of image representations that have a semantically consistent relationship with the textual representation. To address these two issues, we propose an implicit matching and alignment framework for the MNER task. Specifically, we propose a robust implicit alignment mechanism that synergistically aligns textual representations and image representations from both local and global perspectives based on contrastive learning to promote consistency in the representation of text and associated images in order to solve the problem of cross-modal mismatch. Meanwhile, we design a distribution matching module to promote the retention of distributional consistency information in image representations with high similarity to textual representations to address the problem of semantic divide. Extensive experiments on two datasets demonstrate the effectiveness of our proposed method.
Tianyu An, Qingdong Meng, Shan Jin 0003
ICPADS5
2023 Deep Reinforcement Clustering
abstract
Deep clustering has attracted plentiful attention in various domains owning to the superior performance. However, the previous deep clustering methods are guided by pre-specified clustering strategies that lack sustained explorations of data structures, degrading recognition of intrinsic patterns hidden in data. To address this challenge, deep reinforcement clustering (DRC) is proposed to learn an adaptive partition policy for pattern mining, which can fully explore structure knowledge of data in an adaptive manner. DRC is defined as a Markov decision process of data partitions, which chooses the optimal cluster prototype for data via maximizing the cumulative reward in state transition of environment. To implement the definition, a Bernoulli action prototype is devised to capture decision distributions in the transition of states, where the heavy-tailed Cauchy distribution precisely measures the structure divergences of data. Furthermore, a reward maximizing policy is designed to guide sustained explorations of data structures, which ensures intra-cluster compactness and inter-cluster separation of data partitions. Finally, extensive experiments are conducted on eight benchmark datasets, and the results demonstrate that DRC outperforms the state-of-the-art baseline methods.
Peng Li 0027, Jing Gao 0007, Jianing Zhang 0001, Shan Jin 0003, Zhikui Chen
IEEE Trans. Multim.4
2020 A Deep Fusion Gaussian Mixture Model for Multiview Land Data Clustering
abstract
With the rapid industrialization and urbanization, pattern mining of soil contamination of heavy metals is attracting increasing attention to control soil contamination. However, the correlation over various heavy metals and the high-dimension representation of heavy metal data pose vast challenges on the accurate mining of patterns over heavy metals of soil contamination. To solve those challenges, a multiview Gaussian mixture model is proposed in this paper, to naturally capture complicated relationships over multiviews on the basis of deep fusion features of data. Specifically, a deep fusion feature architecture containing modality-specific and modality-common stacked autoencoders is designed to distill fusion representations from the information of all views. Then, the Gaussian mixture model is extended on the fusion representations to naturally recognize the accurate patterns of the intra- and inter-views. Finally, extensive experiments are conducted on the representative datasets to evaluate the performance of the multiview Gaussian mixture model. Results show the outperformance of the proposed methods.
Peng Li 0027, Zhikui Chen, Jing Gao 0007, Jianing Zhang 0001, Shan Jin 0003, Feng Xia 0001
Wirel. Commun. Mob. Comput.5