Novel Approach to Minimize the Memory Requirements of Frequent Subgraph Mining Techniques

查看全文 作　　者：BİLGİN Turgay [1]Tugay;OĞUZ [2]Murat

机构地区：[1]Department of Computer Engineering,Bursa Technical University,Bursa,Turkey;[2]Microsoft Corporation Turkey Branch,İstanbul,Turkey

出　　处：《Chinese Journal of Electronics》索引2021年第30卷第2期,共10页

摘　　要：Frequent subgraph mining(FSM) is a subset of the graph mining domain that is extensively used for graph classification and clustering. Over the past decade, many efficient FSM algorithms have been developed with improvements generally focused on reducing the time complexity by changing the algorithm structure or using parallel programming techniques. FSM algorithms also require high memory consumption, which is another problem that should be solved. In this paper, we propose a new approach called Predictive dynamic sized structure packing(PDSSP) to minimize the memory needs of FSM algorithms. Our approach redesigns the internal data structures of FSM algorithms without making algorithmic modifications. PDSSP offers two contributions. The first is the Dynamic Sized Integer Type, a newly designed unsigned integer data type, and the second is a data structure packing technique to change the behavior of the compiler. We examined the effectiveness and efficiency of the PDSSP approach by experimentally embedding it into two state-of-the-art algorithms, g Span and Gaston.We compared our implementations to the performance of the originals. Nearly all results show that our proposed implementation consumes less memory at each support level, suggesting that PDSSP extensions could save memory, with peak memory usage decreasing up to 38% depending on the dataset. 关键词：Frequent Subgraphs Data Mining MEMORY Space Complexity

相关文献

参考文献（30）
引证文献（1）
耦合文献（1）

参考文献(30)

引证文献(1)

耦合文献(1)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

Novel Approach to Minimize the Memory Requirements of Frequent Subgraph Mining Techniques

参考文献(30)

引证文献(1)

耦合文献(1)

用户提示