Much attention has been paid to construct an applicable knowledge measure or uncertainty measure for Atanassov’s intuitionistic fuzzy set (AIFS). However, many of these measures were developed from intuitionistic fuzzy entropy, which cannot really reflect the knowledge amount associated with an AIFS well. Some knowledge measures were constructed based on the distinction between an AIFS and its complementary set, which may lead to information loss in decision making. In this paper, knowledge amount of an AIFS is quantified by calculating the distance from an AIFS to the AIFS with maximum uncertainty. Axiomatic properties for the definition of knowledge measure are extended to a more general level. Then the new knowledge measure is developed based on an intuitionistic fuzzy distance measure. The properties of the proposed distance-based knowledge measure are investigated based on mathematical analysis and numerical examples. The proposed knowledge measure is finally applied to solve the multi-attribute group decision-making (MAGDM) problem with intuitionistic fuzzy information. The new MAGDM method is used to evaluate the threat level of malicious code. Experimental results in malicious code threat evaluation demonstrate the effectiveness and validity of proposed method.
In recent years, the presence of malware has been growing exponentially, resulting in enormous demand for efficient malware classification methods. However, the existing machine learning-based classifiers have high false positive rates and cannot effectively classify malware variants, packers, and obfuscation. To address this shortcoming, this paper proposes an efficient deep learning-based method named AIFS-IDL (Atanassov Intuitionistic Fuzzy Sets-Integrated Deep Learning), which uses static features to classify malware. The proposed method first extracts six types of features from the disassembly and byte files and then fuses them to solve the single-feature problem in traditional classification methods. Next, Atanassov’s intuitionistic fuzzy set-based method is used to integrate the result of the three deep learning models, namely, GRU (Temporal Convolutional Network), TCN (Temporal Convolutional Network), and CNN (Convolutional Neural Networks), which improves the classification accuracy and generalizability of the classification model. The proposed method is verified by experiments and the results show that the proposed method can effectively improve the accuracy of malware classification compared to the existing methods. Experiments were carried out on the six types of features of malicious code and compared with traditional classification algorithms and ensemble learning algorithms. A variety of comparative experiments show that the classification accuracy rate of integrating multi-feature, multi-model aspects can reach 99.92%. The results show that, compared with other static classification methods, this method has better malware identification and classification ability.
Aiming at the problems of existing time series data clustering methods, such as the lack of similarity metric universality, the influence of dimensional catastrophe, and the limitation of feature expression ability, a time series data clustering method based on unsupervised contrasting learning (UCL-TSC) is proposed. The method first utilizes Residual, TCN, and CNN-TCN to construct multi-view representations of spatial, temporal, and spatial–temporal features of time series data, and adaptively fuses complementary information to enhance feature extraction capabilities. Subsequently, positive and negative sample pairs are constructed based on nearest neighbor and pseudo-clustering label information. Finally, a contrast loss function consisting of feature loss, clustering loss, and a regularization term is designed to facilitate the model in achieving compact intra-cluster and sparse inter-cluster clustering effects in the clustering process. The experimental results on the UCR dataset show that UCL-TSC performs well with respect to several evaluation indexes, such as clustering accuracy, normalized information degree, and purity, and is more effective in learning time series data features and achieving accurate clustering compared to traditional clustering and deep clustering methods.
Malicious traffic detection in IoT environments faces dual challenges: limited labeled data and heterogeneous, complex traffic patterns. To address these limitations, we propose a malicious traffic detection framework, GADF-SRGA, which integrates Gram-angle-difference-field (GADF) imaging with meta-learning. The framework first encodes raw IoT traffic into images via GADF, preserving the spatiotemporal characteristics of malicious traffic. It then employs meta-learning on these encoded images to enable feature-space learning under scarce data. In the inner loop, Sample-Relation Guided Attention (SRGA) leverages class-label-guided supervision graphs to learn sample similarity, improving intra-class compactness and inter-class separability in the feature space. Comprehensive evaluations on public IoT intrusion datasets Malicious_TLS and ToN_IoT demonstrate the framework’s superiority and robustness, particularly under class-imbalanced conditions, over baseline methods.
Open-set IoT intrusion detection must distinguish unfamiliar attacks from uncertain known traffic. OpenTriIDS implements a three-action policy: a random forest accepts high-confidence predictions, routes uncertain samples to a compact known-class prototype memory, and rejects routed samples beyond a standardized Euclidean distance boundary. At the representative S1 operating points on Edge-IIoTset and CIC-IoT-2023, the operational macro-F1 reaches 68.44% and 76.81%, with routing rates of 4.53% and 4.13%, respectively. The representative S1 analysis shows that the confidence gate defines the selected subset, while the three-prototype support rule improves macro-F1 and changes the balance between known-class retention and unknown rejection; the magnitude and direction depend on the dataset and operating point. The prototype-distance module records the matched label and distance for each routed sample. A complementary controlled protocol evaluates three seeds across multiple held-out-family settings, while a seven-method S1 comparison evaluates MSP, OpenMax, ORI open recognition, EFC, post hoc Energy OOD, single-layer Mahalanobis scoring, and OpenTriIDS at their documented operating points. OpenTriIDS achieves the highest macro-F1 among the evaluated methods in both datasets under this comparison. Together, the analyses characterize a selective open-set policy whose matched-gate macro-F1 advantage is accompanied by dataset- and holdout-dependent unknown-recall trade-offs, while distinguishing predictive performance from routing and computational cost.