Longjie Li

Prof. Dr. Longjie Li

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 December 2017 in IEEE Access
Verified
Journal Article
Open access
Longjie LiLongjie Li
Longjie Li
YYYang Yu
Yang Yu
SBShenshen Bai
Shenshen Bai
YHYing Hou
Ying Hou
XCXiaoyun Chen
Xiaoyun Chen
Intrusion detection has been an important countermeasure to secure computing infrastructures from malicious attacks. To improve detection performance and reduce bias towards frequent attacks, this paper proposes a two-step hybrid method based on binary classification and k-NN technique. Step 1 employs several binary classifiers and one aggregation module to effectively detect the exact classes of network connections. After step 1, the connections whose classes are uncertain are sent to step 2 to further determine their classes by the k-NN algorithm. Step 2 is based on the outcomes of step 1 and yields a beneficial supplement to step 1. By combining the two steps, the proposed method achieves reliable results on the NSL-KDD data set. The effectiveness of the proposed method is evaluated in comparison with five supervised learning techniques. Experimental results demonstrate that the proposed method outperforms baselines with respect to various evaluation criteria. In particular, for U2R and R2L attacks, the F1-scores of the proposed method are much higher than those of baselines. Furthermore, comparisons with some recent hybrid approaches are also listed. The results illustrate that the proposed method is competitive.

1 November 2021 in Chaos, Solitons & Fractals
Verified
Journal Article
Closed access
PLPanfeng Liu
Panfeng Liu
Longjie LiLongjie Li
Longjie Li
SFShiyu Fang
Shiyu Fang
YYYukai Yao
Yukai Yao

26 March 2018 in Journal of Sensors
Verified
Journal Article
Open access
PDF file
Longjie LiLongjie Li
Longjie Li
YYYang Yu
Yang Yu
SBShenshen Bai
Shenshen Bai
JCJianjun Cheng
Jianjun Cheng
XCXiaoyun Chen
Xiaoyun Chen
In order to protect computing systems from malicious attacks, network intrusion detection systems have become an important part in the security infrastructure. Recently, hybrid models that integrating several machine learning techniques have captured more attention of researchers. In this paper, a novel hybrid model was proposed with the purpose of detecting network intrusion effectively. In the proposed model, Gini index is used to select the optimal subset of features, the gradient boosted decision tree (GBDT) algorithm is adopted to detect network attacks, and the particle swarm optimization (PSO) algorithm is utilized to optimize the parameters of GBDT. The performance of the proposed model is experimentally evaluated in terms of accuracy, detection rate, precision, F1-score, and false alarm rate using the NSL-KDD dataset. Experimental results show that the proposed model is superior to the compared methods.

23 November 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
HDHu Dong
Hu Dong
Longjie LiLongjie Li
Longjie Li
DTDongwen Tian
Dongwen Tian
YSYiyang Sun
Yiyang Sun
YZYuncong Zhao
Yuncong Zhao

1 May 2021 in Knowledge-Based Systems
Verified
Journal Article
Closed access
HLHongsheng Luo
Hongsheng Luo
Longjie LiLongjie Li
Longjie Li
YZYakun Zhang
Yakun Zhang
SFShiyu Fang
Shiyu Fang
XCXiaoyun Chen
Xiaoyun Chen

1 February 2014 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
RJRuoming Jin
Ruoming Jin
VLVictor E. Lee
Victor E. Lee
Longjie LiLongjie Li
Longjie Li
A key task in analyzing social networks and other complex networks is role analysis: describing and categorizing nodes according to how they interact with other nodes. Two nodes have the same role if they interact with equivalent sets of neighbors. The most fundamental role equivalence is automorphic equivalence. Unfortunately, the fastest algorithms known for graph automorphism are nonpolynomial. Moreover, since exact equivalence is rare, a more meaningful task is measuring the role similarity between any two nodes. This task is closely related to the structural or link-based similarity problem that SimRank addresses. However, SimRank and other existing similarity measures are not sufficient because they do not guarantee to recognize automorphically or structurally equivalent nodes. This article makes two contributions. First, we present and justify several axiomatic properties necessary for a role similarity measure or metric. Second, we present RoleSim, a new similarity metric that satisfies these axioms and can be computed with a simple iterative algorithm. We rigorously prove that RoleSim satisfies all of these axiomatic properties. We also introduce Iceberg RoleSim, a scalable algorithm that discovers all pairs with RoleSim scores above a user-defined threshold θ. We demonstrate the interpretative power of RoleSim on both both synthetic and real datasets.