GraphMDL: Graph Pattern Selection Based on Minimum Description Length
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-030-44584-3_5
Reference14 articles.
1. Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. 1, 231–255 (1993)
2. Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21(2), 194–203 (1975)
3. Grünwald, P.: Model selection based on minimum description length. J. Math. Psychol. 44(1), 133–152 (2000)
4. Koopman, A., Siebes, A.: Characteristic relational patterns. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 437–446. ACM (2009)
5. Koutra, D., Kang, U., Vreeken, J., Faloutsos, C.: Summarizing and understanding large graphs. Stat. Anal. Data Mining: ASA Data Sci. J. 8(3), 183–202 (2015)
Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A High‐Scalability Graph Modification System for Large‐Scale Networks;Computer Graphics Forum;2024-08-16
2. Mining domain-specific edit operations from model repositories with applications to semantic lifting of model differences and change profiling;Automated Software Engineering;2023-04-26
3. CSPM: Discovering compressing stars in attributed graphs;Information Sciences;2022-09
4. The minimum description length principle for pattern mining: a survey;Data Mining and Knowledge Discovery;2022-07-04
5. Discovering Representative Attribute-stars via Minimum Description Length;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3