Demo Data from EDBT 2026 / reviewers in the wild / expert
Xinyin Zhang
dblp:211/9943
· DBLP profile ↗
8ranked-venue papers
2as first author
7since 2021 · last 2025
0009-0007-9108-0534ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1
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.
| Databases, data mining, and information retrieval
2 papers |
Data mining · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 77% Algorithms and data structures · 23% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › predictive modeling › classification
multi-label classification |
0.8 | 1 | 2024 | AME-LSIFT: Attention-Aware Multi-Label Ensemble With Label Subset-SpecIfic FeaTures · IEEE Trans. Knowl. Data Eng. 2024 |
Data mining
clustering |
0.5 | 1 | 2021 | Chebyshev Accelerated Spectral Clustering · WSDM 2021 |
Data mining › clustering
spectral clustering |
0.5 | 1 | 2021 | Chebyshev Accelerated Spectral Clustering · WSDM 2021 |
Graph algorithms and graph theory
graph signal processing |
0.5 | 1 | 2021 | Chebyshev Accelerated Spectral Clustering · WSDM 2021 |
Machine learning › Deep learning architectures and training
attention mechanism |
0.2 | 1 | 2024 | AME-LSIFT: Attention-Aware Multi-Label Ensemble With Label Subset-SpecIfic FeaTures · IEEE Trans. Knowl. Data Eng. 2024 |
Algorithms and data structures › numerical linear algebra
dimensionality reduction |
0.1 | 1 | 2021 | Chebyshev Accelerated Spectral Clustering · WSDM 2021 |
Methods — techniques the papers use, named apart from their topics
neural network · 1.5c-means clustering · 1.5attention mechanism · 1.5graph signal filtering · 1.0chebyshev approximation · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Towards Efficient SpMV: A Multi-Aware Optimization Framework for Heterogeneous Architecture
Xinyin Zhang, Zenghui Ren, Yonghua Zhao |
ICA3PP (3) | 3 |
| 2024 | Enhanced Multimodal Sentiment Analysis via Tensor Decomposition and Hypergraph Convolutional NetworksabstractMultimodal sentiment analysis aims to accurately identify emotional tendencies and expressions from three modalities: text, audio and video, which is useful for opinion guidance and mental health analysis. Current studies have focused on fusing different sources of information from certain practical problems, focusing on the textual modality and ignoring the interaction and complementary information between modalities. In light of the aforementioned limitations, we propose a general model of hypergraph neural network. This model employs a tensor structure to fully obtain the interaction and complementary information during fusion, a low-rank decomposition of the tensor to achieve downscaling and a more accurate feature representation, and a hypergraph convolution and an attention mechanism to facilitate the capture of complex relationships in emotional expression. The experimental results on two benchmark datasets demonstrate the effectiveness of our model. Our approach outperforms existing methods by improving performance while reducing computation time, exhibiting strong generalization ability and high competitiveness. Xinyin Zhang, Yonghua Zhao, Dingye Zhang |
ICTAI | 1 |
| 2024 | Efficient Implementation of the LOBPCG Algorithm on a CPU-GPU Cluster
Yonghua Zhao, Rongfeng Huang, Dingye Zhang, Xinyin Zhang |
NPC (1) | 6 |
| 2024 | AME-LSIFT: Attention-Aware Multi-Label Ensemble With Label Subset-SpecIfic FeaTuresabstractMulti-label ensemble can achieve superior performance on multi-label learning problems by integrating a number of base classifiers. In existing multi-label ensemble methods, the base classifiers are usually trained with the same original features; it is difficult for each base classifier to capture label-relevant or label subset-relevant information. Meanwhile, the manually designed integrating strategies cannot automatically distinguish the importance of the base classifiers, which also lack flexibility and scalability. In order to resolve these problems, this paper proposes a new multi-label ensemble framework, named Attention-aware Multi-label Ensemble with Label Subset-specIfic FeaTures (AME-LSIFT). It utilizes$c$-means clustering to produce Label Subset-specIfic FeaTures (LSIFT), constructs a neural network based model for each label subset, and integrates the base models with a dynamic and automatic attention-aware mechanism. Moreover, an objective function that considers both the label subset accuracy and ensemble accuracy is developed for training the proposed AME-LSIFT. Experiments conducted on ten benchmark datasets demonstrate the superior performance of the proposed method compared with state-of-the-art approaches. Xinyin Zhang, Ran Wang 0001, Shuyue Chen, Yuheng Jia, Debby Dan Wang |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2022 | Projected Entangled Pair State Tensor Network for Colour Image and Video Completion
Rongfeng Huang, Shifang Liu, Xinyin Zhang, Yonghua Zhao |
ICONIP (6) | 3 |
| 2021 | A Batched Jacobi SVD Algorithm on GPUs and Its Application to Quantum Lattice Systems
Rongfeng Huang, Tianyu Yu 0005, Shifang Liu, Xinyin Zhang, Yonghua Zhao |
PDCAT | 4 |
| 2021 | Chebyshev Accelerated Spectral ClusteringabstractSpectral clustering is widely used in modern data analysis. Spectral clustering methods speed up the computation and keep useful information by reducing dimensionality. Recently, graph signal filtering (GSF) has been introduced to further speed up the dimensionality reduction process by avoiding solving eigenvectors. Tianyu Yu 0005, Yonghua Zhao, Rongfeng Huang, Shifang Liu, Xinyin Zhang |
WSDM | 5 |
| 2020 | Fast Approximate Spectral Clustering via Adaptive Filtering of Random Graph SignalsabstractSpectral clustering (SC) is an important data mining method in bioinformatics due to the collection of big datasets. Calculating the number of clusters and feature vectors are two main steps of SC, both of which are related to eigenproblem. We propose a novel SC method using an adaptive filter which accelerates the SC and completely sidestepping the eigensolver. Results: We are inspired by two theories of different disciplines. The first theory is Density of State (DOS), a concept of solid-state physics. DOS roughly represents the distribution of eigenvalues. We propose a more accurate DOS and integrate it to obtain the number of clusters. The second theory is Graph Signal Processing (GSP) in irregular graph. Based on existing dimension reduction method, we use GSP to compute the feature vectors. We use Chebyshev polynomials to compute DOS and GSP and let them share the polynomials. Both the computational complexity and storage complexity are low. Tianyu Yu 0005, Yonghua Zhao, Rongfeng Huang, Shifang Liu, Xinyin Zhang |
BIBM | 5 |