当前位置:网站首页>Figure calculation - figure introduction
Figure calculation - figure introduction
2022-07-22 16:21:00 【uncle_ ll】
chart
Most data structures can be seen as graph data structures , Including the list , Trees, etc . If you study it in depth, you can look at graph theory
chart (Graph) It's a node (Vertices/Nodes) And the side (Edge)
G = ( V , E ) G = (V, E) G=(V,E)
notes : In general , We think that figure (graph) And the Internet (network) The two terms can be used interchangeably . Usually we call it graph .
Classification of graphs
- Undirected and directed graphs : Whether there is direction between nodes , If there is no direction, it means that both sides can visit directly , If there is a direction , It can only be accessed in a unilateral direction
- Unauthorized graph and authorized graph : Whether the connecting edge has weight , If there is no weight, the weight of each edge is the same , If there is weight, judge the importance of connection according to the weight
- Isomorphic diagrams and isomers : Whether nodes and edges belong to the same type , If it is a unified type, it is isomorphic graph , If it's a different type , Is a heterogeneous graph
Degree and neighbor of graph
- Use V Representation node ,E edge , Then the graph can be used G=(V, E) Express
- For digraphs and undirected graphs , Different sides , An undirected graph is equivalent to a bilateral digraph
- degree : The number of nodes associated with it
- The degree of : The number of nodes reaching this node
- The degree of : The number of nodes from this node to other nodes
For the node 4: There are three neighbors , The degree is 3, The degree of 2, The degree of 1
The representation of the figure
- Adjacency matrix :n Nodes , n x n nxn nxn Matrix , Indicate the relationship between nodes , If node i And nodes j There's a side between , be A i j = 1 A_{ij}=1 Aij=1, Or the weight value of the edge , If there is no edge A i j = 0 A_{ij}=0 Aij=0, Adjacency matrix of undirected graph is symmetric matrix .
Adjacency list : Similar to hash table , Each node acts as key, The following value is a list , Indicates the connected nodes .
Side set : Be similar to pair Pair style , Give the start and end points of each edge
- structure characteristics , Node characteristics , Edge feature
Practical example
Graph is a unified language to describe complex things . Like social networks , Internet , Recommendation system , Chemical molecules, etc .
Social networks
node : people
edge : All kinds of connections between people , Such as parental relationship 、 Friendship 、 Colleague relations, etc .
Internet
- node : Webpage
- edge : Hyperlinks between web pages
Recommendation system
- node : Users and products
- edge : user 、 Purchase between goods 、 Click and so on
Chemical molecules
- node : atom
- edge : The interaction between atoms , Also known as chemical bonds
Picture learning
The data object is graph
Like voice 、 Images 、 Text has a neat and regular data structure :
In reality, the graph is irregular , Difficult to model directly :
Figure the advantages of learning
- General deep learning : Most of them deal with rule data , Difficult to handle irregular data .
- Picture learning : It can easily handle irregular data ( chart ), Make full use of graph structure information .
Application of graph learning
- Node level tasks
- Side level tasks
- Graph level tasks
Node level tasks
- Financial fraud detection
Node classification task , Features and associations based on nodes , Judge the node ( People or incoming items ) Is it a fraud category or a non fraud category
Reference article :《A semi-supervised Graph Attentive Network for Financial Fraud Detection》
- object detection
Different from general target detection image data , It's usually 3D Point cloud data , Discrete data obtained by means of lidar .
Reference article : 《Point-GNN: Graph Neural Network for 3D object Detection in a Point Cloud》
Side level tasks
- Recommendation system
The recommendation system is classic Link Prediction Mission
Graph level tasks
- Smell recognition
Reference article :《Learning to Smell: Using Deep Learning to Predict the Olfactory Properties of Molecules》
Figure learning application
Reference resources
Stanford CS224W Course : http://cs224w.stanford.edu
Figure Learning Library PGL:https://github.com/PaddlePaddle/PGL
边栏推荐
猜你喜欢
EasyCVR平台如何实现无需鉴权即可接入特殊设备?
什么是单片机?单片机的组成部分有哪些?
Matlab simulation of BER performance of rs+bch concatenated coding and decoding
Docker data management case - MySQL data persistence
Elephant Swap的LaaS方案迅速崛起,构建全新DeFi2.0协议
操作教程:大华摄像头通过GB28181协议注册EasyCVR平台的详细配置
Helm understanding and use
Mock模拟数据,并发起get,post请求(保姆级教程,一定能成功)
一个15年ABAP老兵的建议:了解这些基础知识,对ABAP开发有百利而无一害
ENVI_ Idl: batch production of thematic maps
随机推荐
下班前几分钟,Express 快速入门
分布式调度问题
Signal FFT, STFT, wavelet transform, envelope analysis, etc
Program environment and pretreatment
mysql中not like的简化写法
Typora免费下载压缩包(最新可用)
The LAAS solution of elephant swap has risen rapidly and built a new defi2.0 protocol
JMeter interface font size setting method
RS+BCH级联编译码误码率性能matlab仿真
Mask RCNN源码详解
NFT 交易所合约开发教程(Solidity & Hardhat)
SFTP creation
MP查询条件
The big problem of HA automatic failover (active) namenode
Segment tree learning record
C# ftp检测目录是否存在和创建文件夹
Remember a composer dependency problem requires composer runtime API ^2.0.0 - > no matching package found
红队怎么打
RquestMapping的注解功能、注解使用范围、注解的属性详情
Elephant Swap的LaaS方案迅速崛起,构建全新DeFi2.0协议