• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

来自代数图论的模式向量。

Pattern vectors from algebraic graph theory.

作者信息

Wilson Richard C, Hancock Edwin R, Luo Bin

机构信息

Department of Computer Science, University of York, Heslington, York Y01 5DD, UK.

出版信息

IEEE Trans Pattern Anal Mach Intell. 2005 Jul;27(7):1112-24. doi: 10.1109/TPAMI.2005.145.

DOI:10.1109/TPAMI.2005.145
PMID:16013758
Abstract

Graph structures have proven computationally cumbersome for pattern analysis. The reason for this is that, before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this paper, we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are unary attributes on the nodes and binary attributes on the edges by using the spectral decomposition of a Hermitian property matrix that can be viewed as a complex analogue of the Laplacian. To embed the graphs in a pattern space, we explore whether the vectors of invariants can be embedded in a low-dimensional space using a number of alternative strategies, including principal components analysis (PCA), multidimensional scaling (MDS), and locality preserving projection (LPP). Experimentally, we demonstrate that the embeddings result in well-defined graph clusters. Our experiments with the spectral representation involve both synthetic and real-world data. The experiments with synthetic data demonstrate that the distances between spectral feature vectors can be used to discriminate between graphs on the basis of their structure. The real-world experiments show that the method can be used to locate clusters of graphs.

摘要

事实证明,图结构在计算上对于模式分析来说很繁琐。原因在于,在将图转换为模式向量之前,必须在可能大小不同的结构节点之间建立对应关系。为了克服这个问题,在本文中,我们转向拉普拉斯矩阵的谱分解。我们展示了拉普拉斯谱矩阵的元素如何用于构造置换不变的对称多项式。这些多项式的系数可以用作图特征,并可以以向量方式进行编码。我们通过使用可以被视为拉普拉斯复类似物的厄米特性质矩阵的谱分解,将这种表示扩展到节点上有一元属性且边上有二元属性的图。为了将图嵌入到模式空间中,我们探索是否可以使用包括主成分分析(PCA)、多维缩放(MDS)和局部保持投影(LPP)在内的多种替代策略,将不变量向量嵌入到低维空间中。通过实验,我们证明这些嵌入会产生定义明确的图簇。我们对谱表示的实验涉及合成数据和真实世界数据。合成数据实验表明,谱特征向量之间的距离可用于根据图的结构区分不同的图。真实世界实验表明,该方法可用于定位图的簇。

相似文献

1
Pattern vectors from algebraic graph theory.来自代数图论的模式向量。
IEEE Trans Pattern Anal Mach Intell. 2005 Jul;27(7):1112-24. doi: 10.1109/TPAMI.2005.145.
2
Indexing hierarchical structures using graph spectra.使用图谱对层次结构进行索引。
IEEE Trans Pattern Anal Mach Intell. 2005 Jul;27(7):1125-40. doi: 10.1109/TPAMI.2005.142.
3
Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.将斯文森-王算法推广到对任意后验概率进行采样。
IEEE Trans Pattern Anal Mach Intell. 2005 Aug;27(8):1239-53. doi: 10.1109/TPAMI.2005.161.
4
Generic model abstraction from examples.从示例中进行通用模型抽象。
IEEE Trans Pattern Anal Mach Intell. 2005 Jul;27(7):1141-56. doi: 10.1109/TPAMI.2005.139.
5
Generalized principal component analysis (GPCA).广义主成分分析(GPCA)。
IEEE Trans Pattern Anal Mach Intell. 2005 Dec;27(12):1945-59. doi: 10.1109/TPAMI.2005.244.
6
A binary linear programming formulation of the graph edit distance.图编辑距离的二元线性规划公式化表述。
IEEE Trans Pattern Anal Mach Intell. 2006 Aug;28(8):1200-14. doi: 10.1109/TPAMI.2006.152.
7
Clustering and embedding using commute times.使用通勤时间进行聚类和嵌入。
IEEE Trans Pattern Anal Mach Intell. 2007 Nov;29(11):1873-90. doi: 10.1109/TPAMI.2007.1103.
8
Onvergence and application of online active sampling using orthogonal pillar vectors.使用正交柱向量的在线主动采样的收敛性与应用
IEEE Trans Pattern Anal Mach Intell. 2004 Sep;26(9):1197-207. doi: 10.1109/TPAMI.2004.61.
9
A modified K-means algorithm for circular invariant clustering.一种用于循环不变聚类的改进K均值算法。
IEEE Trans Pattern Anal Mach Intell. 2005 Dec;27(12):1856-65. doi: 10.1109/TPAMI.2005.230.
10
Graph partitioning active contours (GPAC) for image segmentation.用于图像分割的图划分活动轮廓模型(GPAC)
IEEE Trans Pattern Anal Mach Intell. 2006 Apr;28(4):509-21. doi: 10.1109/TPAMI.2006.76.