arrow
返回

HyperX: A Scalable Hypergraph Framework

delete2019-05-01
delete20
PRE
AI
江
江文凯 (Wenkai Jiang)
J
Jianzhong Qi
J
Jeffrey Xu Yu
J
Jin Huang
R
Rui Zhang *
DOI:10.1109/TKDE.2018.2848257delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Hypergraphs are generalizations of graphs where the (hyper) edges can connect any number of vertices. They are powerful tools for representing complex and non-pairwise relationships. However, existing graph computation frameworks cannot accommodate hypergraphs without converting them into graphs, because they do not offer APIs that support (hyper) edges directly. This graph conversion may create excessive replicas and result in very large graphs, causing difficulties in workload balancing. A few tools have been developed for hypergraph partitioning, but they are not general-purpose frameworks for hypergraph processing. In this paper, we propose HyperX, a general-purpose distributed hypergraph processing framework built on top of Spark. HyperX is based on the computation paradigm Pregel, which is user-friendly and has been widely adopted by popular graph computation frameworks. To help create balanced workloads for distributed hypergraph processing, we further investigate the hypergraph partitioning problem and propose a novel label propagation partitioning (LPP) algorithm. We conduct extensive experiments using both real and synthetic data. The result shows that HyperX achieves an order of magnitude improvement for running hypergraph learning algorithms compared with graph conversion based approaches in terms of running time, network communication costs, and memory consumption. For hypergraph partitioning, LPP outperforms the baseline algorithms significantly in these measures as well.
Keyword:
Hypergraph
HyperX
graph framework
graph partitioning
label propagation partitioning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.9K
被引数:
3.2W

机构

C
Chinese University of Hong Kong
学者数:
3.4W
论文数: 3.2W
被引数: 5.6W
U
university of melbourne
学者数:
5.7W
论文数: 5.4W
被引数: 69
引用论文

引用论文

The hapticity of η-indenyl complexes: molecular structures of [(η5-C9R7)Rh(η4-cod)](R = H, Me)(cod = cyclo-octa-5-diene)
err1989-01-01
err0
PREAI
errAshok K. Kakkar; Simon F. Jones; Nicholas J. Taylor; Scott Collins; Todd B. Marder
err分享
err收藏
Round robin ensembles
err2003-11-17
err0
PREAI
errJohannes Fürnkranz
err分享
err收藏
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容