1) proximity graph
邻近图
1.
In order to reduce the computational complexity of SVC (Support Vector Clusterin g) on the basis of the proximity graph model developed by Yang et al.
为了降低支持向量聚类 (SupportVectorClustering ,SVC)的运算复杂性 ,基于Yang等提出的邻近图法 ,用Mercer核来表达Hilbert空间中的Euclidean距离 ,以此作为边的权重度量来生成最小生成树 (MinimumSpanningTree ,MST) ,并只对MST的主干进行SVC连接运算 。
2.
Network topology can be represented by the proximity graph defined as a graph with a set of vertices V and a set of edges E such that a directed edge(u,v)belong to E if and only if the point v is in the neighborhood induced by some predefined proximity measures of point u.
网络拓扑结构可由邻近图表述,定义其为一个包含点集V和边集E的图,某有向边(u,v)属于该图当且仅当点v位于点u的邻城内,这个邻域是在某事先定义的邻近测度作用下产生的。
3.
Based on proximity graph,an approximately optimal solution named distributed leader-follower strategy is presented.
首先证明最小化移动传感器网络的目标跟踪能耗是NP完全问题,并基于邻近图理论提出一种近似最优的分布式引导跟随算法。
2) nearest neighbor graphs
最邻近图
3) k-nearest neighbor graph
k-近邻图
5) The Nearest Neighbor Graph
最近邻居图
6) 8-site neighborhood image
八近邻图像
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条