使用自组织树的图分解

Nhat-Quang Doan, Hanene Azzag, M. Lebbah
{"title":"使用自组织树的图分解","authors":"Nhat-Quang Doan, Hanene Azzag, M. Lebbah","doi":"10.1109/IV.2012.49","DOIUrl":null,"url":null,"abstract":"In this paper, we present a new approach for graph decomposition using topological and hierarchical partitioning of data. Our method called GD-SOM-Tree (Graph Decomposition using Self-Organizing Trees) is based on self-organizing models. The benefit of this novel approach is to represent and visualize hierarchical relations which replace the original graph with a summary and gives a good understanding of the underlying problem.","PeriodicalId":264951,"journal":{"name":"2012 16th International Conference on Information Visualisation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graph Decomposition Using Self-organizing Trees\",\"authors\":\"Nhat-Quang Doan, Hanene Azzag, M. Lebbah\",\"doi\":\"10.1109/IV.2012.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a new approach for graph decomposition using topological and hierarchical partitioning of data. Our method called GD-SOM-Tree (Graph Decomposition using Self-Organizing Trees) is based on self-organizing models. The benefit of this novel approach is to represent and visualize hierarchical relations which replace the original graph with a summary and gives a good understanding of the underlying problem.\",\"PeriodicalId\":264951,\"journal\":{\"name\":\"2012 16th International Conference on Information Visualisation\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 16th International Conference on Information Visualisation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IV.2012.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 16th International Conference on Information Visualisation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IV.2012.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种利用数据的拓扑和层次划分进行图分解的新方法。我们的方法称为GD-SOM-Tree(使用自组织树的图分解)是基于自组织模型的。这种新方法的好处是表示和可视化层次关系,用摘要代替原始图,并提供对潜在问题的很好的理解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Graph Decomposition Using Self-organizing Trees
In this paper, we present a new approach for graph decomposition using topological and hierarchical partitioning of data. Our method called GD-SOM-Tree (Graph Decomposition using Self-Organizing Trees) is based on self-organizing models. The benefit of this novel approach is to represent and visualize hierarchical relations which replace the original graph with a summary and gives a good understanding of the underlying problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信