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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ying Sun 0005

dblp:10/5415-5 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
8since 2021 · last 2026
0000-0002-3925-0651ORCID · conflict

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

Artificial intelligence and machine learning · 8 · 4 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

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
2 papers
Graph learning · 67% Representation and self-supervised learning · 33%
Databases, data mining, and information retrieval
2 papers
Data mining · 67% Graph data management · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph anomaly detection
anomalous subgraph detection
1.522024
Implicit Anomaly Subgraph Detection (IASD) in Multi-Domain Attribute Networks · IJCAI 2024
Anomaly Subgraph Detection through High-Order Sampling Contrastive Learning · IJCAI 2024
Machine learning › Representation and self-supervised learning
contrastive learning
0.812024
Anomaly Subgraph Detection through High-Order Sampling Contrastive Learning · IJCAI 2024
Data mining
anomaly detection
0.522024
Implicit Anomaly Subgraph Detection (IASD) in Multi-Domain Attribute Networks · IJCAI 2024
Anomaly Subgraph Detection through High-Order Sampling Contrastive Learning · IJCAI 2024
Graph data management
attributed graph
0.212024
Implicit Anomaly Subgraph Detection (IASD) in Multi-Domain Attribute Networks · IJCAI 2024

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

multi-domain attribute networks · 1.5high-order sampling · 1.5contrastive learning · 1.5
YearPublicationVenuePosition
2026 Anomaly Subgraph Detection on Multiple Associated Attributed Networks
abstract
With the rapid development of artificial intelligence (AI) technology and large-scale dataset applications, anomaly subgraph detection is becoming an essential and widespread application. Most existing methods detect anomaly subgraphs depending on the observable anomalous attributes in target data. However, they may face challenges when the target data lacks such anomalous attributes. E.g., identifying suspicious gangs in the target transportation graph solely based on road traffic information, or detecting burst events in nonpublic data without explicit anomalous attributes. To address the detection of implicit anomaly subgraphs (IASs) in such target graphs, this article proposes a novel approach IAS detection (IASD) with multidimensional feature transfer. First, our approach is built upon transfer learning techniques and involves fusing features from multiple graphs. Second, we explore a feature extraction procedure based on a graph attention (GAT) network model to generate representations of anomaly features for large multidimensional attribute graphs. Third, we construct a two-layer graph by introducing an attributed graph referred to as a "source graph," where anomalies can be easily detected, and nodes of the source graph are partially aligned with the target graph. We validate the effectiveness and robustness of IASD through experiments on five real-world datasets, and implement four anomaly subgraph detection tasks in practical applications.
Ying Sun 0005, Yazheng Zhao, Wenjun Wang 0002, Jianxin Li 0002
IEEE Trans. Neural Networks Learn. Syst.2
2025 Temporal subgraph contrastive learning for anomaly detection on dynamic attributed graphs
Yang Yu 0030, Minglai Shao 0001, Ying Sun 0005, Wenjun Wang 0002
Appl. Intell.4
2024 Anomaly Subgraph Detection through High-Order Sampling Contrastive Learning
Ying Sun 0005, Wenjun Wang 0002, Chunlong Bao
IJCAI1
2024 Implicit Anomaly Subgraph Detection (IASD) in Multi-Domain Attribute Networks
Ying Sun 0005
IJCAI1
2024 Link prediction in bipartite networks via effective integration of explicit and implicit relations
Xue Chen 0005, Chaochao Liu, Xiaobo Li 0004, Ying Sun 0005, Wei Yu 0016, Pengfei Jiao
Neurocomputing4
2022 Multi-users interaction anomalous subgraph detection for event mining
Yang Yu 0030, Wenjun Wang 0002, Minglai Shao 0001, Ying Sun 0005, Yueheng Sun, Qiang Tian
Neurocomputing5
2022 AAAN: Anomaly Alignment in Attributed Networks
Ying Sun 0005, Wenjun Wang 0002, Chaochao Liu, Siddharth Bhatia 0001, Yang Yu 0030, Wei Yu 0016
Knowl. Based Syst.1
2021 PGraph: A Graph-based Structure for Interactive Event Exploration on Social Media
abstract
Event detection is a common research topic in visualization. Existing methods always follow an exploration mode, where machine learning algorithms identify events and then analyze them via a visualization system. The detection process does not integrate the expert's experience. In this paper, we propose a novel framework that organizes the original dataset as an integrated graph that allows for Interactive Event Detection (IED) on the graph. Specifically, we formulate the problem Interactive Event Detection as subgraph detection on the graph under expert's interactions. Further, we define a flexible structure called PGraph to model the dataset and then propose an efficient algorithm that returns a subgraph as an event. Our proposed method supports performing various IED tasks under the expert's interactions. We evaluate the utility of our approach by applying it in two scenarios. One uses a social media dataset to study hot events; the other urban burglary dataset is used to detect consecutive burglary cases. Case studies show that our algorithm could detect more global events considering the expert's experience. By quantitative performance experiments, our method outperforms traditional machine detection approaches, especially in the social media dataset; our method's accuracy is higher than baselines at least 10%.
Yang Yu 0030, Minglai Shao 0001, Hongyan Xu 0001, Ying Sun 0005, Wenjun Wang 0002, Bofei Ma
APSEC4
2020 Anomaly Subgraph Detection with Feature Transfer
abstract
Anomaly detection in multilayer graphs becomes more critical in many application scenarios, i.e., identifying crime hotspots in urban areas by discovering suspicious and illicit behaviors in social networks. However, it is a big challenge to identify anomalies in a layer graph due to the insufficient anomaly features. Most existing methods of anomaly detection determine whether a node is abnormal by looking at the observable anomalous feature values. However, these methods are not suitable for scenarios in which the abnormal features are scarce, e.g., geometric graphs or non-public data in social network services. In this paper, to detect anomaly in a graph with insufficient anomalous features, we propose a pioneering approach ASD-FT (Anomaly Subgraph Detection with Feature Transfer) based on a strategy of anomalous feature transfers between different layers of a multilayer graph. The proposed ASD-FT detects anomaly subgraphs from the graph of the target layer by analyzing the anomalous features in the graph of another layer. We demonstrate the effectiveness and robustness of our approach ASD-FT with extensive experiments on five real-world datasets.
Ying Sun 0005, Wenjun Wang 0002, Wei Yu 0016, Xue Chen 0005
CIKM1