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

Kunfeng Chen

dblp:276/3621 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2026
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 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.

Network and information security
2 papers
Network security · 51% Privacy and data protection · 44% Usable security · 5%

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

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention › intrusion detection › attack detection
advanced persistent threat detection
1.012026
Along Came a Spider: Enabling Effective Cross-Domain Threat Detection via Collaborative Graph Learning · IEEE Trans. Mob. Comput. 2026
Network security › intrusion detection and prevention
intrusion detection
1.012026
Along Came a Spider: Enabling Effective Cross-Domain Threat Detection via Collaborative Graph Learning · IEEE Trans. Mob. Comput. 2026
Network security › intrusion detection and prevention › intrusion detection › intrusion detection system › host-based intrusion detection
provenance-based intrusion detection
1.012026
Along Came a Spider: Enabling Effective Cross-Domain Threat Detection via Collaborative Graph Learning · IEEE Trans. Mob. Comput. 2026
Privacy and data protection
anonymization
0.912025
Artificial Impostors: An Efficient and Scalable Scheme for Location Privacy Preservation · IEEE Trans. Serv. Comput. 2025
Privacy and data protection
location privacy
0.912025
Artificial Impostors: An Efficient and Scalable Scheme for Location Privacy Preservation · IEEE Trans. Serv. Comput. 2025
Privacy and data protection › location privacy
synthetic trajectory generation
0.912025
Artificial Impostors: An Efficient and Scalable Scheme for Location Privacy Preservation · IEEE Trans. Serv. Comput. 2025
Usable security › security operations › security analytics › cyber threat intelligence
threat intelligence sharing
0.312026
Along Came a Spider: Enabling Effective Cross-Domain Threat Detection via Collaborative Graph Learning · IEEE Trans. Mob. Comput. 2026

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

graph neural network · 1.0collaborative graph learning · 1.0semantic trajectory modeling · 0.9population-level semantic model · 0.9
YearPublicationVenuePosition
2026 Tool retrieval bridge: Aligning vague instructions with retriever preferences via bridge model
Kunfeng Chen, Luyao Zhuang, Juhua Liu, Bo Du 0001
Neural Networks1
2026 Along Came a Spider: Enabling Effective Cross-Domain Threat Detection via Collaborative Graph Learning
abstract
Advanced persistent threat groups are launching extensive attacks on national critical institutions and key infrastructures. Learning contextual information among entities using graph neural network models based on provenance graphs has demonstrated excellent performance in threat detection. However, due to constraints of transmission costs and privacy concerns, existing threat detection methods typically rely solely on audit logs within their own domains, which contain only part of the attacker's behavior. Attackers have also recognized this, so they brazenly carry out attack attempts and expand their impact. The information asymmetry across multiple domains indeed significantly impacts the efficiency and timeliness of APT detection. This paper introduces a novel cross-domain threat detection (CDTD) scheme based on collaborative graph learning for effective and early APT detection. The core idea of CDTD is to foster mutual benefits by utilizing potential cross-domain general knowledge from heterogeneous data and collaborating on precious threat intelligence, which could mitigate information asymmetry. Experimental results demonstrate that the proposed method achieves state-of-the-art detection capabilities and reduces the workload of security analysts. Additionally, the distributed detection scheme significantly decreases system overheads in terms of network bandwidth, memory usage, and execution time, which shows promising potential for broad applications of the proposed scheme.
Cheng Wang 0001, Kunfeng Chen, Changjun Jiang 0002
IEEE Trans. Mob. Comput.3
2025 Artificial Impostors: An Efficient and Scalable Scheme for Location Privacy Preservation
abstract
The progress of location-based services has led to severe concerns about location privacy leakage. However, existing methods are still incompetent for efficient and scalable location privacy preservation (LPP). They are often vulnerable to inference attacks with side information, or hard to be implemented due to the high computational complexity. In this paper, we pursue the high protection quality with low computational complexity. We propose ascalableLPP method based on the paradigm of counterfeiting locations. To make fake locations extremely plausible, we forge them by synthesizingartificial impostors. The so-called artificial impostors refer to the synthesized traces that have similar semantic features to the actual traces, e.g., similar transition patterns, and do not contain anyprotected location, i.e., the exact location that needs to be protected. We devise two dedicated techniques: thestation-based synthesis methodand thepopulation-level semantic model. We conduct the experiments on real datasets of two cities (Shanghai of China and Asturias of Spain) to validate the quality of privacy preservation, utility loss, and scalability of the proposed method. Based on these two datasets, the experimental results show that our method achieves the privacy preservation quality of$97.68\%$and$96.24\%$, respectively, and the time spent on building generators is only 144.96 seconds and 136.08 seconds, respectively. The experimental results also show that our method achieves a good trade-off between privacy and utility. Our study would give the research community new insights into improving the practicality of LPP paradigm via counterfeiting locations.
Kunfeng Chen, Zhiyang Xie, Cheng Wang 0001
IEEE Trans. Serv. Comput.2
2021 Clothes-Independent Identity Feature Learning for Long-Term Person Re-identification
Kunfeng Chen, Xi Zhan
ICIG (2)1
2020 Joint Feature Learning Network for Visible-Infrared Person Re-identification
Kunfeng Chen, Zhisong Pan 0003, Jiabao Wang 0001, Shanshan Jiao 0002, Zhicheng Zeng, Zhuang Miao
PRCV (2)1