Efficient Sampling Algorithms for Approximate Temporal Motif Counting
Author:
Affiliation:
1. Hunan University, Changsha, China
2. National University of Singapore, Singapore, Singapore
3. Singapore Management University & Alibaba-Zhejiang University Joint Research Institute of Frontier Technologies, Singapore, Singapore
Funder
National Natural Science Foundation of China
the Singapore Ministry of Education
the China Scholarships Council
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3340531.3411862
Reference50 articles.
1. Nesreen K. Ahmed Nick G. Duffield Jennifer Neville and Ramana Rao Kompella. 2014. Graph sample and hold: a framework for big-graph analytics. In KDD. 1446--1455. Nesreen K. Ahmed Nick G. Duffield Jennifer Neville and Ramana Rao Kompella. 2014. Graph sample and hold: a framework for big-graph analytics. In KDD. 1446--1455.
2. Counting Graphlets
3. Lorenzo De Stefani Alessandro Epasto Matteo Riondato and Eli Upfal. 2016. TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. In KDD. 825--834. Lorenzo De Stefani Alessandro Epasto Matteo Riondato and Eli Upfal. 2016. TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. In KDD. 825--834.
4. Roohollah Etemadi Jianguo Lu and Yung H. Tsin. 2016. Efficient Estimation of Triangles in Very Large Graphs. In CIKM. 1251--1260. Roohollah Etemadi Jianguo Lu and Yung H. Tsin. 2016. Efficient Estimation of Triangles in Very Large Graphs. In CIKM. 1251--1260.
5. A puzzle concerning triads in social networks: Graph constraints and the triad census
Cited by 18 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Heterogeneous Network Motif Coding, Counting, and Profiling;ACM Transactions on Knowledge Discovery from Data;2024-08-28
2. Scalable Temporal Motif Densest Subnetwork Discovery;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
3. Querying Cohesive Subgraph Regarding Span-Constrained Triangles on Temporal Graphs;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
4. Everest: GPU-Accelerated System for Mining Temporal Motifs;Proceedings of the VLDB Endowment;2023-10
5. MaNIACS : Approximate Mining of Frequent Subgraph Patterns through Sampling;ACM Transactions on Intelligent Systems and Technology;2023-04-13
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3