To enhance network security,this study employs a deep graph matching model for vulnerability similarity detection.The model utilizes a Word Embedding layer to vectorize data words,an Image Embedding layer to vectorize...To enhance network security,this study employs a deep graph matching model for vulnerability similarity detection.The model utilizes a Word Embedding layer to vectorize data words,an Image Embedding layer to vectorize data graphs,and an LSTM layer to extract the associations between word and graph vectors.A Dropout layer is applied to randomly deactivate neurons in the LSTM layer,while a Softmax layer maps the LSTM analysis results.Finally,a fully connected layer outputs the detection results with a dimension of 1.Experimental results demonstrate that the AUC of the deep graph matching vulnerability similarity detection model is 0.9721,indicating good stability.The similarity scores for vulnerabilities such as memory leaks,buffer overflows,and targeted attacks are close to 1,showing significant similarity.In contrast,the similarity scores for vulnerabilities like out-of-bounds memory access and logical design flaws are less than 0.4,indicating good similarity detection performance.The model’s evaluation metrics are all above 97%,with high detection accuracy,which is beneficial for improving network security.展开更多
Based on the framework of support vector machines （SVM） using one-against-one （OAO） strategy, a new multi-class kernel method based on directed aeyclie graph （DAG） and probabilistic distance is proposed to raise...Based on the framework of support vector machines （SVM） using one-against-one （OAO） strategy, a new multi-class kernel method based on directed aeyclie graph （DAG） and probabilistic distance is proposed to raise the multi-class classification accuracies. The topology structure of DAG is constructed by rearranging the nodes＇ sequence in the graph. DAG is equivalent to guided operating SVM on a list, and the classification performance depends on the nodes＇ sequence in the graph. Jeffries-Matusita distance （JMD） is introduced to estimate the separability of each class, and the implementation list is initialized with all classes organized according to certain sequence in the list. To testify the effectiveness of the proposed method, numerical analysis is conducted on UCI data and hyperspectral data. Meanwhile, comparative studies using standard OAO and DAG classification methods are also conducted and the results illustrate better performance and higher accuracy of the orooosed JMD-DAG method.展开更多
【目的/意义】利用图书文本内容实现相似图书推荐,海量图书数据环境下提高图书相似度计算效率。【方法/过程】构建了一种基于图结构的相似图书内容推荐方法,在图书的文本内容进行短语抽取后计算短语网络中的TextRank值获得图书关键词,...【目的/意义】利用图书文本内容实现相似图书推荐,海量图书数据环境下提高图书相似度计算效率。【方法/过程】构建了一种基于图结构的相似图书内容推荐方法,在图书的文本内容进行短语抽取后计算短语网络中的TextRank值获得图书关键词,进而建立图书向量并结合层次可导航小世界算法(Hierarchcal Navigable Small World,HNSW)得到目标图书和推荐图书之间的相似度。【结果/结论】利用基于内容的相似图书推荐方法得到的用户评价平均准确率达到0.807,客观平均准确率显著高于TF-IDF和TextRank的文本表示方法,可以实现较好的图书推荐效果,HNSW算法将计算效率缩小到对数级别,对大数据环境下的相似图书计算效率起到一定的优化作用。【创新/局限】本研究创新性地结合图结构和HNSW算法提高了图书推荐的准确性和计算效率,但受限于对腾讯词典的依赖,影响了向量表达的普适性和跨语言适应性。展开更多
Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for ...Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for each pairs of points. Based on the proximity graph model [3], the Euclidean distance in Hilbert space is calculated using a Gaussian kernel, which is the right criterion to generate a minimum spanning tree using Kruskal's algorithm. Then the connectivity estimation is lowered by only checking the linkages between the edges that construct the main stem of the MST (Minimum Spanning Tree), in which the non-compatibility degree is originally defined to support the edge selection during linkage estimations. This new approach is experimentally analyzed. The results show that the revised algorithm has a better performance than the proximity graph model with faster speed, optimized clustering quality and strong ability to noise suppression, which makes SVC scalable to large data sets.展开更多
无线光通信网络的隐蔽窃听攻击具有高度的隐蔽性和复杂性,其中包含的复杂数据模式和特征,加大了无线光通信网络隐蔽窃听攻击检测难度。故提出无线光通信网络隐蔽窃听攻击自适应检测研究。采用图信号处理方法全面监测无线光通信网络,捕...无线光通信网络的隐蔽窃听攻击具有高度的隐蔽性和复杂性,其中包含的复杂数据模式和特征,加大了无线光通信网络隐蔽窃听攻击检测难度。故提出无线光通信网络隐蔽窃听攻击自适应检测研究。采用图信号处理方法全面监测无线光通信网络,捕捉异常信号范围;利用人工智能技术识别隐蔽窃听攻击特征;建立基于混合核最小二乘支持向量机(hybridkernel least-squares support vector machine,HKLSSVM)的窃听攻击检测模型,通过引入混合核函数将数据映射到更高维的特征空间中,识别出的隐蔽窃听攻击特征,并通过鲸鱼提升算法选择最优的惩罚参数和内核参数,实现无线光通信网络隐蔽窃听攻击自适应检测。实验结果表明,所提方法能准确获取异常信号范围和异常信号,在保证计算稳定性的同时,提高攻击检测性能。展开更多
基金Special Project Funded by Tsinghua University Press:“Engineering Drawing and CAD”Course Construction and Textbook Development。
文摘To enhance network security,this study employs a deep graph matching model for vulnerability similarity detection.The model utilizes a Word Embedding layer to vectorize data words,an Image Embedding layer to vectorize data graphs,and an LSTM layer to extract the associations between word and graph vectors.A Dropout layer is applied to randomly deactivate neurons in the LSTM layer,while a Softmax layer maps the LSTM analysis results.Finally,a fully connected layer outputs the detection results with a dimension of 1.Experimental results demonstrate that the AUC of the deep graph matching vulnerability similarity detection model is 0.9721,indicating good stability.The similarity scores for vulnerabilities such as memory leaks,buffer overflows,and targeted attacks are close to 1,showing significant similarity.In contrast,the similarity scores for vulnerabilities like out-of-bounds memory access and logical design flaws are less than 0.4,indicating good similarity detection performance.The model’s evaluation metrics are all above 97%,with high detection accuracy,which is beneficial for improving network security.
基金Sponsored by the National Natural Science Foundation of China(Grant No.61201310)the Fundamental Research Funds for the Central Universities(Grant No.HIT.NSRIF.201160)the China Postdoctoral Science Foundation(Grant No.20110491067)
文摘Based on the framework of support vector machines （SVM） using one-against-one （OAO） strategy, a new multi-class kernel method based on directed aeyclie graph （DAG） and probabilistic distance is proposed to raise the multi-class classification accuracies. The topology structure of DAG is constructed by rearranging the nodes＇ sequence in the graph. DAG is equivalent to guided operating SVM on a list, and the classification performance depends on the nodes＇ sequence in the graph. Jeffries-Matusita distance （JMD） is introduced to estimate the separability of each class, and the implementation list is initialized with all classes organized according to certain sequence in the list. To testify the effectiveness of the proposed method, numerical analysis is conducted on UCI data and hyperspectral data. Meanwhile, comparative studies using standard OAO and DAG classification methods are also conducted and the results illustrate better performance and higher accuracy of the orooosed JMD-DAG method.
文摘【目的/意义】利用图书文本内容实现相似图书推荐,海量图书数据环境下提高图书相似度计算效率。【方法/过程】构建了一种基于图结构的相似图书内容推荐方法,在图书的文本内容进行短语抽取后计算短语网络中的TextRank值获得图书关键词,进而建立图书向量并结合层次可导航小世界算法(Hierarchcal Navigable Small World,HNSW)得到目标图书和推荐图书之间的相似度。【结果/结论】利用基于内容的相似图书推荐方法得到的用户评价平均准确率达到0.807,客观平均准确率显著高于TF-IDF和TextRank的文本表示方法,可以实现较好的图书推荐效果,HNSW算法将计算效率缩小到对数级别,对大数据环境下的相似图书计算效率起到一定的优化作用。【创新/局限】本研究创新性地结合图结构和HNSW算法提高了图书推荐的准确性和计算效率,但受限于对腾讯词典的依赖,影响了向量表达的普适性和跨语言适应性。
基金TheNationalHighTechnologyResearchandDevelopmentProgramofChina (No .86 3 5 11 930 0 0 9)
文摘Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for each pairs of points. Based on the proximity graph model [3], the Euclidean distance in Hilbert space is calculated using a Gaussian kernel, which is the right criterion to generate a minimum spanning tree using Kruskal's algorithm. Then the connectivity estimation is lowered by only checking the linkages between the edges that construct the main stem of the MST (Minimum Spanning Tree), in which the non-compatibility degree is originally defined to support the edge selection during linkage estimations. This new approach is experimentally analyzed. The results show that the revised algorithm has a better performance than the proximity graph model with faster speed, optimized clustering quality and strong ability to noise suppression, which makes SVC scalable to large data sets.
文摘无线光通信网络的隐蔽窃听攻击具有高度的隐蔽性和复杂性,其中包含的复杂数据模式和特征,加大了无线光通信网络隐蔽窃听攻击检测难度。故提出无线光通信网络隐蔽窃听攻击自适应检测研究。采用图信号处理方法全面监测无线光通信网络,捕捉异常信号范围;利用人工智能技术识别隐蔽窃听攻击特征;建立基于混合核最小二乘支持向量机(hybridkernel least-squares support vector machine,HKLSSVM)的窃听攻击检测模型,通过引入混合核函数将数据映射到更高维的特征空间中,识别出的隐蔽窃听攻击特征,并通过鲸鱼提升算法选择最优的惩罚参数和内核参数,实现无线光通信网络隐蔽窃听攻击自适应检测。实验结果表明,所提方法能准确获取异常信号范围和异常信号,在保证计算稳定性的同时,提高攻击检测性能。
