Network Embedding for Cluster Analysis

Ilya Makarov, Artem Oborevich
{"title":"Network Embedding for Cluster Analysis","authors":"Ilya Makarov, Artem Oborevich","doi":"10.1109/CINTI53070.2021.9668468","DOIUrl":null,"url":null,"abstract":"Graph visualization is an effective and efficient way to discover complex inter-connections between elements within the nested structure of data. To accomplish this type of representation machine learning algorithms use a technique called graph embedding and node embedding in particular. However, in this paper, we will compare well-known techniques to yet largely under-explored setting of graph embedding named community embedding: embedding individual communities instead of individual nodes. This type of embedding can be especially useful in graph visualization and community detection tasks. Despite the fact that graph embedding and clustering tasks are separate, a good solution to the first one tends to have a correlation with the solution of the second problem and may have a positive impact if knowledge is transferred.","PeriodicalId":340545,"journal":{"name":"2021 IEEE 21st International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 21st International Symposium on Computational Intelligence and Informatics (CINTI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINTI53070.2021.9668468","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Graph visualization is an effective and efficient way to discover complex inter-connections between elements within the nested structure of data. To accomplish this type of representation machine learning algorithms use a technique called graph embedding and node embedding in particular. However, in this paper, we will compare well-known techniques to yet largely under-explored setting of graph embedding named community embedding: embedding individual communities instead of individual nodes. This type of embedding can be especially useful in graph visualization and community detection tasks. Despite the fact that graph embedding and clustering tasks are separate, a good solution to the first one tends to have a correlation with the solution of the second problem and may have a positive impact if knowledge is transferred.
聚类分析的网络嵌入
图形可视化是发现数据嵌套结构中元素之间复杂的相互联系的有效方法。为了完成这种类型的表示,机器学习算法使用一种称为图嵌入和节点嵌入的技术。然而,在本文中,我们将比较众所周知的技术和尚未充分开发的图嵌入设置,称为社区嵌入:嵌入单个社区而不是单个节点。这种类型的嵌入在图形可视化和社区检测任务中特别有用。尽管图嵌入和聚类任务是分开的,但第一个问题的良好解决方案往往与第二个问题的解决方案具有相关性,并且如果知识被转移,可能会产生积极的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信