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.

Kan He

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

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

Computer networks · 3 · 3 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.

Artificial intelligence
1 paper
Efficient and distributed learning · 77% Graph learning · 23%
Computer networks
1 paper
Internet of things and sensor networks · 50% Wireless networking · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › federated learning
client selection
1.012026
Cost-Efficient Federated Learning in Massive IoT: A Physics-Inspired Graph Learning Approach · IEEE Trans. Commun. 2026
Machine learning › Efficient and distributed learning
federated learning
1.012026
Cost-Efficient Federated Learning in Massive IoT: A Physics-Inspired Graph Learning Approach · IEEE Trans. Commun. 2026
Internet of things and sensor networks › iot networks
massive iot
1.012026
Cost-Efficient Federated Learning in Massive IoT: A Physics-Inspired Graph Learning Approach · IEEE Trans. Commun. 2026
Wireless networking
scheduling
1.012026
Cost-Efficient Federated Learning in Massive IoT: A Physics-Inspired Graph Learning Approach · IEEE Trans. Commun. 2026
Emerging computing paradigms
quantum computer architecture
0.412019
Implementing termination analysis on quantum programming · Sci. China Inf. Sci. 2019
Emerging computing paradigms › quantum computer architecture
quantum programming
0.412019
Implementing termination analysis on quantum programming · Sci. China Inf. Sci. 2019
Machine learning › Graph learning
graph neural network
0.312026
Cost-Efficient Federated Learning in Massive IoT: A Physics-Inspired Graph Learning Approach · IEEE Trans. Commun. 2026
Machine learning › Graph learning › graph neural network
node classification
0.312026
Cost-Efficient Federated Learning in Massive IoT: A Physics-Inspired Graph Learning Approach · IEEE Trans. Commun. 2026

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

statistical physics · 2.0ising spin hamiltonian · 2.0graph neural network · 2.0
YearPublicationVenuePosition
2026 PREMADC: Protocol Reverse Engineering via Multiagent Analysis and Deep Clustering for Industrial Control Protocols
Xuejun Zong, Xinxu Gao, Dong Li 0027, Kan He, Lian Lian, Hongyan Shi, Bowei Ning
IEEE Internet Things J.4
2026 Cost-Efficient Federated Learning in Massive IoT: A Physics-Inspired Graph Learning Approach
abstract
Federated learning emerges as a key enabler toward pervasive intelligence across IoT ecosystems with provable privacy guarantees. While recent efforts on client selection have been made for optimizing its communication efficiency in iterative model aggregation over resource-constrained networks, their scalability fundamentally breaks down in dense deployments. This limitation stems from the NP-hard complexity of congestion-aware scheduling, where co-channel interference creates exponentially growing solution spaces. In this context, we present a novel client selection framework with asymptotic scalability in massive IoT, which leverages the intrinsic graph topology with insights from statistical physics. First, this work formulate a universal client selection problem, capturing both positive network externalities derived from collaborative knowledge exchange and congestion effects induced by co-channel interference. This formulation is then transformed into a node classification task via Ising spin Hamiltonian mapping, establishing an explicit connection between federated learning, statistical physics, and graph optimization. Building on this foundation, we develop a lightweight graph neural solver that adaptively selects clients via recognizing node state with iterative neighbor aggregation of learnable embeddings. Comprehensive experiments validate that our approach maintains state-of-the-art scheduling performance, while scaling to network sizes orders of magnitude beyond what conventional methods can handle.
Lindong Zhao, Dan Wu 0001, Kan He, Hongfei Niu, Liang Zhou 0002
IEEE Trans. Commun.3
2025 DyGRA-Edge: A Dynamic Gradient-Regulated Attention Network for Real-Time Intrusion Detection on Industrial IoT-Edge Nodes
abstract
Industrial control networks still face significant challenges in grayscale-based intrusion detection, including feature degradation, dispersed attention weights, and computational redundancy, particularly under dynamic attacks and large-scale traffic streams. To address these issues, this paper proposes the Dynamic Gradient-Regulated Attention Network (DyGRA-Edge), a framework tailored for resource-constrained industrial IoT edge environments. It integrates three key mechanisms: a Dynamic Gradient Controller (DGC) guided by Lyapunov stability to regulate feature evolution, anisotropic diffusion convolution (ADC) to enhance edge responses in low-contrast grayscale images, and sparse entropy attention (SEA) to minimize conditional entropy and suppress redundant features. Experiments conducted on two real-world industrial platforms—oil-gas gathering and catalytic reforming—demonstrate that DyGRA-Edge achieves detection accuracy above 98.5%, with a false positive rate of 2.1% and inference latency between 63–98 ms. Ablation studies confirm the complementary contributions of each module, while comparisons with lightweight models such as MobileViT and FastViT show that DyGRA-Edge provides superior robustness against noisy traffic and redundant features. Edge deployment validation further indicates that in a Raspberry Pi environment using the NSL-KDD dataset, DyGRA-Edge maintains an average CPU utilization of only 5.3%. These results highlight that DyGRA-Edge achieves a strong balance of accuracy, real-time performance, and resource efficiency, making it a high-precision and low-latency IDS solution for industrial edge environments.
Kan He, Xuejun Zong, Bowei Ning, Hongyan Shi, Duotao Pan, Buer Sen
IEEE Internet Things J.2
2019 Implementing termination analysis on quantum programming
Shusen Liu 0002, Kan He, Runyao Duan
Sci. China Inf. Sci.2