Kun Xie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kun Xie has a total of 216 co-authors. Here are the top co-authors by number of shared publications:
- Gaogang Xie
Chinese Academy of Sciences
50 shared publications - Jigang Wen
Hunan University of Science and Technology, Xiangtan, China
47 shared publications - Wei Liang
University of South China
32 shared publications - Xin Wang
Stony Brook University
24 shared publications - Kenli Li
Hunan University
21 shared publications - Jiannong Cao
The Hong Kong Polytechnic University
20 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5986-6000
LR-DSTC: Low-Rank Driven Secure Tensor Completion for Privacy-Preserving IoT Data Recovery
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5986-6000
Open AccessLR-DSTC: Low-Rank Driven Secure Tensor Completion for Privacy-Preserving IoT Data Recovery
- 20 October 2026
- Published by Springer Nature in Science China Information Sciences
- Vol. 69  (11) , 212302
Can a CNN perform well on network traffic matrices? A case study on formulating network data to maximize the benefits of deep learning
- 20 October 2026
- Published by Springer Nature in Science China Information Sciences
- Vol. 69  (11) , 212302
Can a CNN perform well on network traffic matrices? A case study on formulating network data to maximize the benefits of deep learning
- 12 July 2026
- Published by Springer Nature
- p. 49-61
A Graph Attention-Based Multimodal Fusion Approach for Encrypted Traffic Classification
- 12 July 2026
- Published by Springer Nature
- p. 49-61
A Graph Attention-Based Multimodal Fusion Approach for Encrypted Traffic Classification
- Open Access
- 1 June 2026
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 31  (3) , 1934-1948
Efficient Log Parsing Method Based on Log Locality Features
Log parsing is indispensable for system maintenance, converting unstructured log data into structured formats (log templates) for further log compression and anomaly detection. The effectiveness of log parsing relies on the efficiency of two key processes: template extraction and log matching. Traditional methods, however, suffer from slow pairwise comparisons for template extraction and the tedious, non-scalable sequential approach for template matching. Our research has uncovered two opportunities for optimization based on two log locality characteristics: logs from the same template tend to cluster sequentially, and there is a limited variety of templates used within given timeframes. To exploit these opportunities, we propose the Multi-Logs Template Extraction (MLTE)-Cache framework. MLTE-Cache leverages the MLTE algorithm to enhance the efficiency of template extraction by grouping similar logs and processing them in batch mode. Furthermore, the framework utilizes a cache-assisted proximity matching algorithm to accelerate the log matching procedure. Through comprehensive experiments on open-source datasets, the MLTE-Cache framework has proven highly effective, maintaining a high level of accuracy while delivering a 37% improvement in efficiency.
- 1 June 2026
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 31  (3) , 1934-1948
Open AccessEfficient Log Parsing Method Based on Log Locality Features
Log parsing is indispensable for system maintenance, converting unstructured log data into structured formats (log templates) for further log compression and anomaly detection. The effectiveness of log parsing relies on the efficiency of two key processes: template extraction and log matching. Traditional methods, however, suffer from slow pairwise comparisons for template extraction and the tedious, non-scalable sequential approach for template matching. Our research has uncovered two opportunities for optimization based on two log locality characteristics: logs from the same template tend to cluster sequentially, and there is a limited variety of templates used within given timeframes. To exploit these opportunities, we propose the Multi-Logs Template Extraction (MLTE)-Cache framework. MLTE-Cache leverages the MLTE algorithm to enhance the efficiency of template extraction by grouping similar logs and processing them in batch mode. Furthermore, the framework utilizes a cache-assisted proximity matching algorithm to accelerate the log matching procedure. Through comprehensive experiments on open-source datasets, the MLTE-Cache framework has proven highly effective, maintaining a high level of accuracy while delivering a 37% improvement in efficiency.
- 19 May 2026
- Published by Springer Nature
- p. 237-250
Group-Based Parallel Split Federated Learning
- 19 May 2026
- Published by Springer Nature
- p. 470-487
Log Anomaly Detection Based on Time-Delta Sequential Feature
- 19 May 2026
- Published by Springer Nature
- p. 470-487
Log Anomaly Detection Based on Time-Delta Sequential Feature
- 16 May 2026
- Published by Elsevier in Computer Networks
- Vol. 285
H2-NRF: A high-performance and evolvable NRF with hierarchical indexing and minimal-overhead profile handling
- 16 May 2026
- Published by Elsevier in Computer Networks
- Vol. 285
H2-NRF: A high-performance and evolvable NRF with hierarchical indexing and minimal-overhead profile handling
- 1 May 2026
- Published by Springer Nature
- p. 3-16
Towards Next-Generation Computer Network Education: AI-Driven Reform
- 1 May 2026
- Published by Springer Nature
- p. 3-16
Towards Next-Generation Computer Network Education: AI-Driven Reform
- 24 April 2026
- Published by Springer Nature
- p. 500-523
CCGCRN: Cluster and Completion Graph Convolution Recurrent Network for Incomplete Traffic Flow Forecasting
- 24 April 2026
- Published by Springer Nature
- p. 500-523
CCGCRN: Cluster and Completion Graph Convolution Recurrent Network for Incomplete Traffic Flow Forecasting
- 24 April 2026
- Published by Springer Nature
- p. 529-543
Low Energy Consumption Hierarchical Federated Learning
- 24 April 2026
- Published by Springer Nature
- p. 529-543
Low Energy Consumption Hierarchical Federated Learning