Xintai He

Dr. Xintai He

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
29 October 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
QLQing Li
Qing Li
XHXintai He
Xintai He
KCKun Chen
Kun Chen
QOQicheng Ouyang
Qicheng Ouyang
Labeled data in insufficient amounts and missing categories are two observable features for high maneuvering target trajectory data. However, the existing research achievements are insufficient for solving these two problems simultaneously during data classification. This study proposed a two-stage semi-supervised trajectory data classification algorithm. By pre-training the autoencoder and combining it with the Siamese network, a two-stage joint training was formed, which enabled the model to deal with missing categories by clustering and maintaining the classification ability under the missing label categories. The experimental simulation results showed that the performance of this algorithm was better than the classical semi-supervised algorithm label propagation and transferred learning when the amount of various labeled data was as low as 1–5. The two-stage training model also had a good effect on the problem of missing categories. When 75% of the types were missing, the purity could still reach 82%, which was about eight percentage points higher than the directly trained network. When two problems appeared simultaneously, compared with the directly trained network, the performance improved by about three percentage points on average, and the purity was consistently higher than the clustering results. In summary, this algorithm was more tolerant of the problems of labeled datasets, so it was more practical.

22 July 2022 in Electronics
Verified
Journal Article
Open access
PDF file
XHXintai He
Xintai He
QLQing Li
Qing Li
RWRunze Wang
Runze Wang
KCKun Chen
Kun Chen
The trajectory data of aircraft, ships, and so on, can be analyzed to obtain valuable information. Clustering is the basic technology of trajectory analysis, and the feature extraction process is one of the decisive factors for clustering performance. Trajectory features can be divided into two categories: spatial features and temporal features. In mainstream algorithms, spatial features are represented by latitude and longitude coordinates. However, such algorithms are only suitable for trajectories where spatial features are tightly coupled with latitude and longitude. When the same types of trajectories are in different latitude and longitude ranges or there are transformations such as rotation, scaling, and so on, this kind of algorithm is infeasible. Therefore, this paper proposes a spatio-temporal feature trajectory clustering algorithm based on deep learning. In this algorithm, the extraction process of the trajectory spatial shape feature is designed based on image matching technology, and the extracted spatial features are combined with the trajectory temporal features to improve the clustering performance. The experimental results on simulated and real datasets show that the algorithm can effectively extract the trajectory spatial shape features and that the clustering effect of the fused spatio-temporal feature is better than that of a single feature.

1 March 2021 in IEEE Access
Verified
Journal Article
Open access
QLQing Li
Qing Li
YJYonghui Ju
Yonghui Ju
CZChang Zhao
Chang Zhao
XHXintai He
Xintai He
Encrypted network data classification has received considerable attention in the industry and research communities for a long time. However, the emergence of new private applications and encryption protocols has brought more new challenges. The primary task of classification is to determine whether the sample is encrypted. When the specification of private protocol is unpublished, only the whole sample can be processed, and thus the unencrypted field which coexists with the encrypted field will seriously lower the classification effect. To tackle this problem, an algorithm based on data reconstruction and moment eigenvector is proposed, which can not only estimate the encryption result but also locate the encrypted field in each data sample. In the algorithm, the encryption probability sequence is calculated firstly by data reconstruction and CNN (Convolutional Neural Network) model transfer. Then, based on the derivative of the encryption probability sequence, the suspected encrypted field set is generated. Finally, encrypted field matching is performed based on the similarity of the four-dimensional moment eigenvector, and thus the possible encrypted field of each sample is obtained. The proposed algorithm achieved a recall rate of 93% and a precision rate of 72% in an experiment of distinguishing the encrypted/unencrypted ones of complex data. The forward coverage, reverse coverage, and F1 value in identifying encrypted field reached 89%, 90%, and 90%, respectively. Compared with the encrypted field matching methods based on the K-Nearest Neighbor algorithm, Dynamic Time Warping, Runs test, and Frequency test, the method proposed in this paper exhibited salient advantages.