文件名称:Node Similarity-based Graph Clustering and Visualization
-
所属分类:
- 标签属性:
- 上传时间:2016-07-26
-
文件大小:169.66kb
-
已下载:0次
-
提 供 者:
-
相关连接:Miklos Erdelyi, Janos Abonyi下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
The basis of the presented methods for the visualization and clustering of graphs is a novel similarity and distance metric, and the matrix describing the similarity of the nodes in the graph. This matrix represents the type of connections between the nodes in the graph in a compact form, thus it provides a very good starting point for both the clustering and visualization algorithms. Hence visualization is done with the MDS (Multidimensional Scaling) dimensionality reduction technique obtaining the spectral decomposition of this matrix, while the partitioning is based on the results of this step generating a hierarchical representation. A detailed example is shown to justify the capability of the described algorithms for clustering and visualization of the link structure of Web sites. For detailed descr iption please check: http://www.abonyilab.com/software-and-data
相关搜索: Clustering
visualization
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : graphvis.zip 列表 adj2inc.m Coauthors/Coauthors_Giant_Component.csv Coauthors/netscience.gml Coauthors/netscience.txt Coauthors/netscience_GC.gml.gephi graphvis_v3.m MDS.m test7.mat
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.