超图的同态性计算计算超图的同态性
IEEE transactions on pattern analysis and machine intelligence
|January 12, 2024
概括
本研究介绍了一种新的超图Weisfeiler-Lehman (WL) 测试和内核框架,以改进网络分析. 新方法有效地捕捉复杂的高阶关系,在超图形分类的速度和准确性方面明显优于现有技术.
科学领域:
- 网络分析 网络分析
- 图形理论是指图形的理论.
- 机器学习是机器学习.
背景情况:
- 图形异态性对于网络分析至关重要,但在高阶关系方面存在困难.
- 传统的超图方法是记忆密集型和不准确的.
- 现有的图形算法不能完全捕捉复杂的超图形结构.
研究的目的:
- 开发一个高效和准确的超图异态算法.
- 为了将韦斯费勒-莱曼 (WL) 测试扩展到超图.
- 为改进网络分析引入一个超图 WL 内核框架.
主要方法:
- 引入了一个超图Weisfeiler-Lehman (WL) 测试算法.
- 开发了一个超图形WL内核框架,有两个变体:超图形WL子树内核和超图形WL超边缘内核.
- 在7个图形和12个超图形分类数据集上进行了实验.
主要成果:
- 在图形数据集上,Hypergraph WL Subtree Kernel 的性能与经典的 Graph WL Subtree Kernel 的性能相当.
- 拟议的方法显示,在超图数据集上,与传统的基于内核的方法相比,有显著的改进.
- 新方法在复杂的超图结构上演示了超过80倍更快的运行时间.
结论:
- 建议的超图 WL 测试和内核框架有效地捕获高阶结构信息.
- 这些方法为分析复杂的超图提供了显著的速度优势.
- 该框架显示了网络分析和相关领域的真实应用的巨大潜力.
相关概念视频
Vector Algebra: Graphical Method
12.2K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
12.2K
Ogive Graph
5.6K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
5.6K
Block Diagram Reduction
212
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
212
Theorems of Pappus and Guldinus: Problem Solving
740
Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...
740
pV-Diagrams
4.1K
The pV diagram, which is a graph of pressure versus volume of the gas under study, is helpful in describing certain aspects of the substance. When the substance behaves like an ideal gas, the ideal gas equation describes the relationship between its pressure and volume. On a pV diagram, it is common to plot an isotherm, which is a curve showing p as a function of V with the number of molecules and the temperature fixed. Then, for an ideal gas, the product of the pressure of the gas and its...
4.1K
SFG Algebra
118
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
118


