Online Partitioning of Multi-Labeled Graphs

Ioanna Filippidou, Y. Kotidis
{"title":"Online Partitioning of Multi-Labeled Graphs","authors":"Ioanna Filippidou, Y. Kotidis","doi":"10.1145/2764947.2764950","DOIUrl":null,"url":null,"abstract":"Graph partitioning is an old problem that is finding renewed interest in the era of big, complex datasets and parallel computing frameworks that can benefit from a proper partitiong of big graph data across multiple nodes in a cluster. In this paper we look into a specific instance of the problem termed online graph partitioning that addresses the need to partition large graphs that do not fit in main memory. A neglected aspect of modern graph datasets is that real graphs have labels! Node labels may, for instance, correspond to categorical attributes (such as country, profession, participating groups, etc.) of the entities depicted by the vertices of the graph. Edge labels may represent different relationship types (e.g. \"friend-of\", \"likes\", etc.). In this work we first revisit the formulation of the graph partitioning problem for graphs with labels on both nodes and edges. We introduce \"relation-cut\", as a new metric that extends the traditional \"edge-cut\" metric used in graph partitioning in order to take into account the existence of different edge-types. Then, we combine this metric with a novel \"label-cut\" metric that takes into consideration the displacement of related nodes with similar labels across partitions. In our experiments we adapt two recent online partitioning algorithms for the new proposed metric and provide a thorough evaluation on a variety of real and synthetic graphs. Our experiments demonstrate that the proposed technique balances the generated cuts on both relations and labels on the resulting partitions.","PeriodicalId":144860,"journal":{"name":"Proceedings of the GRADES'15","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the GRADES'15","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2764947.2764950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Graph partitioning is an old problem that is finding renewed interest in the era of big, complex datasets and parallel computing frameworks that can benefit from a proper partitiong of big graph data across multiple nodes in a cluster. In this paper we look into a specific instance of the problem termed online graph partitioning that addresses the need to partition large graphs that do not fit in main memory. A neglected aspect of modern graph datasets is that real graphs have labels! Node labels may, for instance, correspond to categorical attributes (such as country, profession, participating groups, etc.) of the entities depicted by the vertices of the graph. Edge labels may represent different relationship types (e.g. "friend-of", "likes", etc.). In this work we first revisit the formulation of the graph partitioning problem for graphs with labels on both nodes and edges. We introduce "relation-cut", as a new metric that extends the traditional "edge-cut" metric used in graph partitioning in order to take into account the existence of different edge-types. Then, we combine this metric with a novel "label-cut" metric that takes into consideration the displacement of related nodes with similar labels across partitions. In our experiments we adapt two recent online partitioning algorithms for the new proposed metric and provide a thorough evaluation on a variety of real and synthetic graphs. Our experiments demonstrate that the proposed technique balances the generated cuts on both relations and labels on the resulting partitions.
多标记图的在线划分
图分区是一个老问题,在大而复杂的数据集和并行计算框架的时代,它重新引起了人们的兴趣,这些框架可以从跨集群中的多个节点的大图数据的适当分区中受益。在本文中,我们研究了一个被称为在线图分区的问题的具体实例,它解决了对不适合主内存的大型图进行分区的需要。现代图数据集被忽视的一个方面是,真正的图有标签!例如,节点标签可以对应于由图的顶点描述的实体的分类属性(如国家、专业、参与组等)。边缘标签可以表示不同的关系类型(例如:“朋友”、“喜欢”等等)。在这项工作中,我们首先回顾了在节点和边缘上都有标签的图的图划分问题的公式。为了考虑不同边类型的存在,我们引入了“关系切割”作为一种新的度量,它扩展了传统的“边切割”度量用于图划分。然后,我们将该度量与一种新的“标签切割”度量结合起来,该度量考虑了具有相似标签的相关节点跨分区的位移。在我们的实验中,我们采用了两种最新的在线划分算法来处理新提出的度量,并对各种真实和合成图进行了全面的评估。我们的实验表明,所提出的技术在生成的分区上平衡了关系和标签上生成的切割。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信