A New Approach to Minimize Memory Requirements of Frequent Subgraph Mining Algorithms

Basit Öğe Kaydı
dc.contributor.authorBilgin, Turgay Tugay
dc.date.accessioned2022-08-05T06:04:16Z
dc.date.available2022-08-05T06:04:16Z
dc.date.issued2021en_US
dc.departmentBTÜ, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.description.abstractFrequent subgraph mining (FSM) is a subsection of graph mining domain which is extensively used for graph classification and graph clustering purposes. Over the past decade, many efficient FSM algorithms have been developed. The improvements generally focus on reducing time complexity by changing the algorithm structure or using parallel programming techniques. FSM algorithms have another problem to solve, which is the high memory consumption. In this study, a new approach called Predictive Dynamic Sized Structure Packing (PDSSP) have been proposed to minimize the memory requirement of FSM algorithms. Proposed approach redesigns the internal data structures of FSM algorithms without any algorithmic modifications. PDSSP has two contributions. The first one is the Dynamic Sized Integer Type (ds_Int) which is a newly designed unsigned integer data type. The second contribution is "Data Structure packaging" component that uses a data structure packing technique which changes the behaviour of the compiler. A number of experiments have been conducted to examine the effectiveness and efficiency of the PDSSP approach by embedding it into two state-of-art algorithms called gSpan and Gaston. Proposed implementation have been compared to the official one. Almost all results show that the proposed implementation consumes less memory on each support level. As a result, PDSSP extensions can save memory and the peak memory usage may decrease up to 38% depending on the dataset.en_US
dc.identifier.endpage246en_US
dc.identifier.issn1302-0900
dc.identifier.issn2147-9429
dc.identifier.issue1en_US
dc.identifier.startpage237en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12885/2004
dc.identifier.volume24en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakTR-Dizinen_US
dc.institutionauthorBilgin, Turgay Tugay
dc.language.isoenen_US
dc.publisherGazi Universitesien_US
dc.relation.ispartofJOURNAL OF POLYTECHNIC-POLITEKNIK DERGISIen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectFrequent subgraphsen_US
dc.subjectdata miningen_US
dc.subjectspace complexityen_US
dc.titleA New Approach to Minimize Memory Requirements of Frequent Subgraph Mining Algorithmsen_US
dc.typeArticleen_US

Dosyalar

Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Bilgisayar Mühendisliği Bölümü Yayın Koleksiyonu
TR-Dizin İndeksli Yayınlar Koleksiyonu