HUSM: High utility subgraph mining in single graph databases-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

HUSM: High utility subgraph mining in single graph databases

Published:2024-07 Issue: Volume:675 Page:120743
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Chen Zhaoming^ORCID,He Cheng^ORCID,Chen Guoting^ORCID,Gan Wensheng^ORCID,Fournier-Viger Philippe

Funder

National Natural Science Foundation of China

Basic and Applied Basic Research Foundation of Guangdong Province

Science, Technology and Innovation Commission of Shenzhen Municipality

Shenzhen Science and Technology Innovation Program

Publisher

Elsevier BV

Reference45 articles.

1. ScaleMine: scalable parallel frequent subgraph mining in a single large graph;Abdelhamid,2016

2. Fast algorithms for mining association rules in large databases;Agrawal,1994

3. Efficient tree structures for high utility pattern mining in incremental databases;Ahmed;IEEE Trans. Knowl. Data Eng.,2009

4. UGMINE: utility-based graph mining;Alam;Appl. Intell.,2022

5. WeFreS: weighted frequent subgraph mining in a single large graph;Ashraf,2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP