.png){kind=icon}
返回
Sampling informative patterns from large single networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2020.01.042.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The set of all frequent patterns that are extracted from a single network can be huge. A technique recently proposed for obtaining a compact, informative and useful set of patterns is output sampling, where a small set of frequent patterns is randomly chosen. However, existing output sampling algorithms work only in the transactional setting, where the database consists of a collection of relatively small graphs. In this paper, first we extend the output sampling framework to the single network setting where the database is a large single graph, counting supports of patterns is more complicated, and frequent patterns might be sampled based on any arbitrary target distribution. Then, we propose sampling techniques that are based on more interesting/informative measures or those that are specific to large single networks, such as product of the pattern size with its support, network compressibility, and pattern density. Finally, we study the empirical behavior of our algorithm in a real-world case study. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
World Wide Web
Large single network mining
Social network analysis
Informative patterns
Frequent patterns
Output sampling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
分享收藏Lower Extremity Necrotizing Fasciitis in Diabetic and Nondiabetic Patients: Mortality and Amputation
PREAI
分享收藏
查看更多内容