Graph classification method based on frequently dense pattern

A dense and frequent technology, applied in character and pattern recognition, instruments, computer parts, etc., can solve problems such as loss of weight information, impact on classification results, loss, etc.

Inactive Publication Date: 2016-12-07
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, thresholding will lose a lot of weight information in the loss map, which will affect the final classification results
Second, most graph features (node ​​degree, clustering coefficient, etc.) only consider the information of a single node, while ignoring the information between multiple nodes
Obviously, these two shortcomings will greatly affect the final classification performance

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Graph classification method based on frequently dense pattern
  • Graph classification method based on frequently dense pattern
  • Graph classification method based on frequently dense pattern

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0035] Such as figure 2 As shown, the specific implementation process includes four steps:

[0036] The first step is to mine frequent dense patterns. In the process of mining frequent dense patterns, a depth-first search tree is constructed to search all frequent dense patterns to judge whether they meet the frequency condition. In the search process, the Apriori nature of frequent dense patterns is used, that is, the frequency of a frequent dense pattern is not lower than the frequency of any frequent dense pattern derived based on it. exist image 3 An example diagram of the search process is given in . In the figure, each point represents an edge, and all edges from the root node to the current point constitute the current frequent dense pattern. Then, calculate the frequency of the current frequent dense pattern. If the frequency is higher than a predefined threshold, the current frequent dense pattern is a frequent dense pattern (eg dp i ), continue to search whet...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a graph classification method based on a frequently dense pattern. As a universal dataset structure, a graph can be used for expressing various complex relationships among data objects in a plurality of scientific applications. In the method disclosed by the invention, firstly, a new graph characteristic, i.e., the frequently dense pattern, is put forward, wherein the frequently dense pattern can keep weight information and a local topological structure in the graph, and is an ideal graph characteristic. Then, through a series of algorithms, an ordered pattern with discrimination is extracted from the graph, and the frequently dense pattern of the discrimination is taken as the characteristic. Finally, on the basis of a SVM (Support Vector Machine), a classifier used for graph classification is constructed. By use of the method disclosed by the invention, the graph classification can be efficiently and accurately realized.

Description

technical field [0001] The invention discloses a graph classification method based on frequent dense patterns, which involves neural image processing, social network, frequent item mining, classifier construction, etc., and aims to realize accurate and efficient classification of graph data. Background technique [0002] As a general data set structure, graph can be used in many problems to represent the complex structural relationship between data objects. For example, construct graph data based on neuroimaging, and then analyze and study the graph through complex network and other technologies, or use graph structure to represent the structure of compounds. At present, the graph classification problem mainly studies the two classification problems, that is, the positive class and the negative class. The main goal is to build a classification model to separate the two. In recent years, many kinds of graph features have been used for graph classification. For example, node...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06K9/62
CPCG06F18/2411
Inventor 张道强屠黎阳
Owner NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products