Graph clustering method based on attribute fusion

A graph clustering and attribute graph technology, which is applied in special data processing applications, network data retrieval, instruments, etc., can solve problems such as poor clustering effect

Inactive Publication Date: 2017-10-20
UNIV OF ELECTRONIC SCI & TECH OF CHINA
View PDF0 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The algorithm needs to specify the number of clusters in advance, but there may be a large deviation between the specified number of clusters and the real clustering results without prior conditions, making the clustering effect poor
In view of the problems existing in the NetScan algorithm, Moser et al. proposed the Join

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 clustering method based on attribute fusion
  • Graph clustering method based on attribute fusion
  • Graph clustering method based on attribute fusion

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0049] figure 1 It is a flowchart of the graph clustering method based on attribute fusion in the present invention.

[0050] In this example, if figure 1 As shown, a graph clustering method based on attribute fusion of the present invention comprises the following steps:

[0051] S1. A graph with attribute nodes is called an attribute graph, and an attribute graph G=(V, E, A, F) model is constructed using data with structure and attribute relationships, where V represents the set of vertices in the attribute graph, and V= {v 1 ,v 2 ,...,v n}; E represents the set of edges in the attribute graph, E={(v i ,v j )|(v i ,v j )∈E(G),1≤i,j≤n}, (v i ,v j ) represented by node v i ,v j The edges formed, n represents the total number of edge nodes; A represents the attribute set, A={a 1 ,a 2 ,...,a m}, a m Represents the mth attribute feature; F represents the mapping relationship between the attribute feature of the vertex in the attribute graph and its attribute value...

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 present invention discloses a graph clustering method based on attribute fusion. A multi-layer attribute fusion model is constructed, the attribute characteristics and the structure relation of nodes in a graph are divided into different hierarchies, the data structure relation and the attribute characteristics are uniformly combined to the same bottom layer network for clustering operation, the data structure and attributes are subjected to weight fusion according to the node ballot mechanism in the clustering, and the weight coefficients of an attribute layer are subjected to adaptive changing to allow a final clustering result to reflect the original distribution of data so as to solve the influence problem of the clustering result of the setting of the initial value of the attribute layer and allow the final clustering to reach a better effect.

Description

technical field [0001] The invention belongs to the technical field of data mining, and more specifically relates to a graph clustering method based on attribute fusion. Background technique [0002] With the rapid development of the Internet, a large amount of complex graph-structured data has been generated in related fields. How to make full use of these data and mine useful knowledge and information has become a current research hotspot. Graph clustering technology is an effective method to mine graph structure data, and has important practical application value in the fields of biology, chemistry and social network. [0003] However, traditional graph clustering techniques such as partition-based clustering methods, density-based clustering, hierarchical-based clustering, and model-based clustering often only consider the topological relationship of the graph and the similarity of node attributes, and divide the graph into For a subgraph with a tight structure or a sub...

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
IPC IPC(8): G06K9/62G06F17/30
CPCG06F16/951G06F2216/03G06F18/23213G06F18/25
Inventor 徐杰陈文龙卢思变唐淳
Owner UNIV OF ELECTRONIC SCI & TECH OF CHINA
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap