Web Intell.Pub Date : 2021-12-22DOI: 10.3233/web-210475
Naiyue Chen, Yi Jin, Yinglong Li, L. Cai
{"title":"Trust-based federated learning for network anomaly detection","authors":"Naiyue Chen, Yi Jin, Yinglong Li, L. Cai","doi":"10.3233/web-210475","DOIUrl":"https://doi.org/10.3233/web-210475","url":null,"abstract":"With the rapid development of social networks and the massive popularity of intelligent mobile terminals, network anomaly detection is becoming increasingly important. In daily work and life, edge nodes store a large number of network local connection data and audit data, which can be used to analyze network abnormal behavior. With the increasingly close network communication, the amount of network connection and other related data collected by each network terminal is increasing. Machine learning has become a classification method to analyze the features of big data in the network. Face to the problems of excessive data and long response time for network anomaly detection, we propose a trust-based Federated learning anomaly detection algorithm. We use the edge nodes to train the local data model, and upload the machine learning parameters to the central node. Meanwhile, according to the performance of edge nodes training, we set different weights to match the processing capacity of each terminal which will obtain faster convergence speed and better attack classification accuracy. The user’s private information will only be processed locally and will not be uploaded to the central server, which can reduce the risk of information disclosure. Finally, we compare the basic federated learning model and TFCNN algorithm on KDD Cup 99 dataset and MNIST dataset. The experimental results show that the TFCNN algorithm can improve accuracy and communication efficiency.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123058936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rider and Sunflower optimization-driven neural network for image classification","authors":"Hanumantha Rao Nadendla, Srikrishna Atluri, Gangadhara Rao Kancherla","doi":"10.3233/web-210454","DOIUrl":"https://doi.org/10.3233/web-210454","url":null,"abstract":"Image classification is the classical issue in computer vision, machine learning, and image processing. The image classification is measured by differentiating the image into the prescribed category based on the content of the vision. In this paper, a novel classifier named RideSFO-NN is developed for image classification. The proposed method performs the image classification by undergoing two steps, namely feature extraction and classification. Initially, the images from various sources are provided to the proposed Weighted Shape-Size Pattern Spectra for pattern analysis. From the pattern analysis, the significant features are obtained for the classification. Here, the proposed Weighted Shape-Size Pattern Spectra is designed by modifying the gray-scale decomposition with Weight-Shape decomposition. Then, the classification is done based on Neural Network (NN) classifier, which is trained using an optimization approach. The optimization will be done by the proposed Ride Sunflower optimization (RideSFO) algorithm, which is the integration of Rider optimization algorithm (ROA), and Sunflower optimization algorithm (SFO). Finally, the image classification performance is evaluated using RideSFO-NN based on sensitivity, specificity, and accuracy. The developed RideSFO-NN method achieves the maximal accuracy of 94%, maximal sensitivity of 93.87%, and maximal specificity of 90.52% based on K-Fold.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129100564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Intell.Pub Date : 2021-11-18DOI: 10.3233/web-210468
Yinghua Feng, Wei Yang
{"title":"Packet loss rate monitoring model of IoT based on differential evolution algorithm","authors":"Yinghua Feng, Wei Yang","doi":"10.3233/web-210468","DOIUrl":"https://doi.org/10.3233/web-210468","url":null,"abstract":"In order to overcome the problems of high energy consumption and low execution efficiency of traditional Internet of things (IOT) packet loss rate monitoring model, a new packet loss rate monitoring model based on differential evolution algorithm is proposed. The similarity between each data point in the data space of the Internet of things is set as the data gravity. On the basis of the data gravity, combined with the law of gravity in the data space, the gravity of different data is calculated. At the same time, the size of the data gravity is compared, and the data are classified. Through the classification results, the packet loss rate monitoring model of the Internet of things is established. Differential evolution algorithm is used to solve the model to obtain the best monitoring scheme to ensure the security of network data transmission. The experimental results show that the proposed model can effectively reduce the data acquisition overhead and energy consumption, and improve the execution efficiency of the model. The maximum monitoring efficiency is 99.74%.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124223023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Intell.Pub Date : 2021-11-17DOI: 10.3233/web-210466
Yuanyuan Li, Jidong Sha, Rongna Geng
{"title":"Research on internal network data security monitoring method based on NB-IoT","authors":"Yuanyuan Li, Jidong Sha, Rongna Geng","doi":"10.3233/web-210466","DOIUrl":"https://doi.org/10.3233/web-210466","url":null,"abstract":"In order to overcome the problems of poor data classification accuracy and effectiveness of traditional data monitoring methods, this paper designs a data security monitoring method based on narrow-band Internet of things. Firstly, the model of network data acquisition and sensor node’s optimal configuration is established to collect intranet data. Based on the analysis of data characteristics, dynamic intranet data analysis indexes are designed from three aspects: establishing security incident quantity index, establishing address entropy index and data diversion. According to the above-mentioned narrow-band data aggregation rate, the security index of the Internet of things is calculated to realize the security of monitoring data. The experimental results show that: whether the network attack exists or not, the accuracy rate of the method is always higher than 90%, the classification time is less than 4 s, and the energy consumption of monitoring process is always less than 150 J, which fully proves that the method achieves the design expectation.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122402278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Intell.Pub Date : 2021-11-17DOI: 10.3233/web-210467
Lin Tang
{"title":"Integrity protection method for trusted data of IoT nodes based on transfer learning","authors":"Lin Tang","doi":"10.3233/web-210467","DOIUrl":"https://doi.org/10.3233/web-210467","url":null,"abstract":"In order to overcome the problems of high data storage occupancy and long encryption time in traditional integrity protection methods for trusted data of IOT node, this paper proposes an integrity protection method for trusted data of IOT node based on transfer learning. Through the transfer learning algorithm, the data characteristics of the IOT node is obtained, the feature mapping function in the common characteristics of the node data is set to complete the classification of the complete data and incomplete data in the IOT nodes. The data of the IOT nodes is input into the data processing database to verify its security, eliminate the node data with low security, and integrate the security data and the complete data. On this basis, homomorphic encryption algorithm is used to encrypt the trusted data of IOT nodes, and embedded processor is added to the IOT to realize data integrity protection. The experimental results show that: after using the proposed method to protect the integrity of trusted data of IOT nodes, the data storage occupancy rate is only about 3.5%, the shortest time-consuming of trusted data encryption of IOT nodes is about 3 s, and the work efficiency is high.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129683944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Intell.Pub Date : 2021-11-17DOI: 10.3233/web-210464
Linlin Zhang, Sujuan Zhang
{"title":"Research on information classification and storage in cloud computing data center based on group collaboration intelligent clustering","authors":"Linlin Zhang, Sujuan Zhang","doi":"10.3233/web-210464","DOIUrl":"https://doi.org/10.3233/web-210464","url":null,"abstract":"In order to overcome the problems of long time and low accuracy of traditional methods, a cloud computing data center information classification and storage method based on group collaborative intelligent clustering was proposed. The cloud computing data center information is collected in real time through the information acquisition terminal, and the collected information is transmitted. The optimization function of information classification storage location was constructed by using the group collaborative intelligent clustering algorithm, and the optimal solutions of all storage locations were evolved to obtain the elite set. According to the information attribute characteristics, different information was allocated to different elite sets to realize the classified storage of information in the cloud computing data center. The experimental results show that the longest time of information classification storage is only 0.6 s, the highest information loss rate is 10.0%, and the highest accuracy rate is more than 80%.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116207166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Intell.Pub Date : 2021-11-17DOI: 10.3233/web-210460
Haiyang Huang, Zhanlei Shang
{"title":"Fast mining method of network heterogeneous fault tolerant data based on K-means clustering","authors":"Haiyang Huang, Zhanlei Shang","doi":"10.3233/web-210460","DOIUrl":"https://doi.org/10.3233/web-210460","url":null,"abstract":"In the traditional network heterogeneous fault-tolerant data mining process, there are some problems such as low accuracy and slow speed. This paper proposes a fast mining method based on K-means clustering for network heterogeneous fault-tolerant data. The confidence space of heterogeneous fault-tolerant data is determined, and the range of motion of fault-tolerant data is obtained; Singular value decomposition (SVD) method is used to construct the classified data model to obtain the characteristics of heterogeneous fault-tolerant data; The redundant data in fault-tolerant data is deleted by unsupervised feature selection algorithm, and the square sum and Euclidean distance of fault-tolerant data clustering center are determined by K-means algorithm. The discrete data clustering space is constructed, and the objective optimal function of network heterogeneous fault-tolerant data clustering is obtained, Realize fault-tolerant data fast mining. The results show that the mining accuracy of the proposed method can reach 97%.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127581884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Intell.Pub Date : 2021-11-17DOI: 10.3233/web-210463
Li Qian
{"title":"Research on complex attribute big data classification based on iterative fuzzy clustering algorithm","authors":"Li Qian","doi":"10.3233/web-210463","DOIUrl":"https://doi.org/10.3233/web-210463","url":null,"abstract":"In order to overcome the low classification accuracy of traditional methods, this paper proposes a new classification method of complex attribute big data based on iterative fuzzy clustering algorithm. Firstly, principal component analysis and kernel local Fisher discriminant analysis were used to reduce dimensionality of complex attribute big data. Then, the Bloom Filter data structure is introduced to eliminate the redundancy of the complex attribute big data after dimensionality reduction. Secondly, the redundant complex attribute big data is classified in parallel by iterative fuzzy clustering algorithm, so as to complete the complex attribute big data classification. Finally, the simulation results show that the accuracy, the normalized mutual information index and the Richter’s index of the proposed method are close to 1, the classification accuracy is high, and the RDV value is low, which indicates that the proposed method has high classification effectiveness and fast convergence speed.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"534 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131460389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Intell.Pub Date : 2021-11-17DOI: 10.3233/web-210469
Xiang Li
{"title":"An anti-tampering model of sensitive data in link network based on blockchain technology","authors":"Xiang Li","doi":"10.3233/web-210469","DOIUrl":"https://doi.org/10.3233/web-210469","url":null,"abstract":"In order to overcome the problems of traditional link network sensitive data anti tampering operation, such as long time-consuming and low data security, a tamper proof model of link network sensitive data based on blockchain technology is proposed. Calculate the evenly distributed random variables of sensitive node data and the difference of running distance to obtain the probability of meeting the sensitive data with other neighbor nodes, and determine the sensitive data in the link network; obtain the frequency domain of the sensitive data of the infected link network through the square difference function, and calculate the membership mean value of the infected data samples in the sensitive data; analyze the working principle of blockchain technology, Set the master key and public key of sensitive data, generate the encryption key of sensitive data of link network, and use blockchain technology to complete the design of tamper proof model of sensitive data in link network. The experimental results show that the shortest time-consuming of the proposed method is about 1 s, and the maximum tamper proof security factor is about 9.7.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116616692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Intell.Pub Date : 2021-11-15DOI: 10.3233/web-210470
Weiwei Wu
{"title":"A secure encryption method of communication channel based on cloud computing technology","authors":"Weiwei Wu","doi":"10.3233/web-210470","DOIUrl":"https://doi.org/10.3233/web-210470","url":null,"abstract":"The traditional channel encryption method is interfered by noise signal, which leads to long encryption time and poor security. This paper proposes a communication channel security encryption method based on cloud computing technology. In order to obtain the minimum benefits of the same channel and orthogonal channel in the frequency conversion receiver, the dual input and dual output model is constructed; the influence of time domain and frequency domain on the transmission signal is analyzed, and the nonlinear transmission characteristics of the channel signal are obtained. Through cloud computing technology, the channel transmission characteristics are divided into dynamic parameters and static parameters to realize the key distribution of communication channel under cloud computing technology; the balance factor is used to provide the key for the sorted generators to realize the secure encryption of communication channel. The results show that the average error probability of the proposed method is about 0.275, and the signal-to-noise ratio is between 115 and 118 SNR.","PeriodicalId":245783,"journal":{"name":"Web Intell.","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123415796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}