Abstract
Mining a weighted single large graph has recently attracted many researchers. The WeGraMi algorithm is considered the state-of-the-art among current approaches. It uses a MaxMin measure to calculate weights for all mined subgraphs. However, if all values in the domain have the same role and the user needs an average value of that domain, then we have to use another measure. In this paper, we introduce a novel algorithm called AWeGraMi (Average Weighted Graph Mining) to solve the above problem, and our method calculates the weight based on the average of all values in the domain. We also apply the MaxMin measure as an upper-bound to prune the search space. The new algorithm can mine all frequent weighted subgraphs effectively. Our experiments on the directed and undirected datasets have shown that AWeGraMi has better performance in comparison to post-processing GraMi for all three criteria: search space (the number of candidate subgraphs), running time, and memory consumption.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Nguyen LBQ, Vo B, Le N-T, Snasel V, Zelinka I (2020) Fast and scalable algorithms for mining subgraphs in a single large graph. Eng Appl Artif Intell 90:103539
Le N-T, Vo B, Nguyen LBQ, Fujita H, Le B (2020) Mining weighted subgraphs in a single large graph. Inf Sci 514:149–165
Le N-T, Vo B, Nguyen LBQ, Le B (2022) “OWGraMi: Efficient Method for Mining Weighted Subgraphs in a Single Graph”, Expert Systems with Applications
Elseidy M, Abdelhamid E, Skiadopoulos S, Kalnis P (2014) Grami: Frequent subgraph and pattern mining in a single large graph. Proc VLDB Endowm 7(7):517–528
Yan X, Han J (2002) “gspan: Graph-based substructure pattern mining,” in 2002 IEEE International Conference on Data Mining, 2002. Proceedings., pp. 721–724.
Nabti C, Seba H (2016) Subgraph isomorphism search in massive graph databases. Université de Lyon, Doctoral dissertation
Lin JC-W, Ren S, Fournier-Viger P (2018) MEMU: more efficient algorithm to mine high average-utility patterns with multiple minimum average-utility thresholds. IEEE Access 6:7593–7609
Gan W, Lin JC-W, Zhang J, Yu PS (2020) Utility mining across multi-sequences with individualized thresholds. ACM Transac Data Sci 1(2):1–29
Nguyen LBQ (2022) “Efficient Methods for Mining Subgraphs in a Single Large Graph,” Doctoral dissertation, VSB – Technical University of Ostrava
Lin JC-W, Li T, Fournier-Viger P, Zhang J, Guo X, “Mining of high average-utility patterns with item-level thresholds”, J Int Technol, vol. 20, no. 1, pp. 187–194, 2019.
Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. Proc 20th Int Conf Large Data Bases, VLDB 1215:487–499
Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using fp-trees. IEEE Trans Knowl Data Eng 17(10):1347–1362
Zaki MJ, Hsiao C-J (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462–478
Vo B, Hong T-P, Le B (2012) DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets. Expert Syst Appl 39(8):7196–7206
Bui H, Vo B, Nguyen H, Nguyen-Hoang T-A, Hong T-P (2018) A weighted N-list-based method for mining frequent weighted itemsets. Expert Syst Appl 96:388–405
Vo B, Pham S, Le T, Deng Z-H (2017) A novel approach for mining maximal frequent patterns. Expert Syst Appl 73:178–186
Nguyen LTT, Vu VV, Lam MTH, Duong TTM, Manh LT, Nguyen TTT, Vo B, Fujita H (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78–99
Nguyen LTT, Nguyen P, Nguyen TDD, Vo B, Fournier-Viger P, Tseng VS (2019) Mining high-utility itemsets in dynamic profit databases. Knowled-Based Syst 175:130–144
Fournier-Viger P, Zhang Y, Lin JC-W, Fujita H, Koh YS (2019) Mining local and peak high utility itemsets. Inf Sci 481:344–367
Wang X, Xu Y, Zhan H (2020) Extending association rules with graph patterns. Expert Syst Appl 141:112897
Nguyen LBQ, Zelinka I, Snasel V, Nguyen LTT, Vo B (2022) “Subgraph mining in a large graph: A review,” Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, p. e1454
Nguyen LBQ, Nguyen LTT, Vo B, Zelinka I, Lin JCW, Yun U, Nguyen HS (2022) An efficient and scalable approach for mining subgraphs in a single large graph. Appl Intell 52:1–15
Talukder N, Zaki MJ (2016) “Parallel graph mining with dynamic load balancing,” in 2016 IEEE International Conference on Big Data (Big Data). pp. 3352–3359
Abdelhamid E, Abdelaziz I, Kalnis P, Khayyat Z, Jamour F (2016) “Scalemine: Scalable parallel frequent subgraph mining in a single large graph,” in SC’16: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. pp. 716–727
Qiao F, Zhang X, Li P, Ding Z, Jia S, Wang H (2018) A parallel approach for frequent subgraph mining in a single large graph using spark. Appl Sci 8(2):230
Fournier-Viger P et al (2020) A survey of pattern mining in dynamic graphs. Wiley Interdiscip Rev: Data Mining Knowled Discover 10(6):e1372
Pedrycz W (2020) The benefits and drawbacks of data mining technologies. Wiley Interdiscip Rev: Data Mining Knowled Discover 10(1):e1344
Nguyen LBQ, Zelinka I, Diep QB (2021) CCGraMi: An Effective Method for Mining Frequent Subgraphs in a Single Large Graph. MENDEL 27(2):90–99
Nguyen LBQ, Nguyen LTT, Zelinka I, Snasel V, Nguyen HS, Vo B (2021) “A Method for Closed Frequent Subgraph Mining in a Single Large Graph”, IEEE Access
Teixeira CHC, Fonseca AJ, Serafini M, Siganos G, Zaki MJ, Aboulnaga A (2015) “Arabesque: a system for distributed graph mining”, In: Proceedings of the 25th Symposium on Operating Systems Principles, pp. 425–440
Talukder N, Zaki MJ (2016) A distributed approach for graph mining in massive networks. Data Min Knowl Disc 30(5):1024–1052
Zhao X, Chen Y, Xiao C, Ishikawa Y, Tang J (2016) Frequent subgraph mining based on Pregel. Comput J 59(8):1113–1128
Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data Min Knowl Disc 11(3):243–271
Kuramochi M, Karypis G (2004) “Grew-a scalable frequent subgraph discovery algorithm,” in Fourth IEEE International Conference on Data Mining (ICDM’04). pp. 439–442
Chen C, Yan X, Zhu F, Han J (2007) “gapprox: Mining frequent approximate patterns from a massive network”, In: Seventh IEEE International Conference on Data Mining (ICDM 2007). pp. 445–450
Guzmán-Ponce A, Marcial-Romero JR, Valdovinos-Rosas RM, Sánchez-Garreta JS (2020) Weighted complete graphs for condensing data. Electron Notes Theoret Comput Sci 354:45–60
Liu N, Li D, Zhang Y, Li X (2020) Large-scale graph processing systems: a survey. Front Inform Technol Electr Eng 21(3):384–404
Sun L, Huang X, Li R, Choi B, Xu J (2020) “Index-based intimate-core community search in large weighted graphs,” IEEE Transactions on Knowledge and Data Engineering
Ramalingeswara Rao T, Ghosh SK, Goswami A (2021) Mining user–user communities for a weighted bipartite network using spark GraphFrames and Flink Gelly. J Supercomput 77(6):5984–6035
Preti G, Lissandrini M, Mottin D, Velegrakis Y (2021) Mining patterns in graphs with multiple weights. Distrib Paral Datab 39(2):281–319
Lin JC-W, Gan W, Fournier-Viger P, Hong T-P, Zhan J (2016) Efficient mining of high-utility itemsets using multiple minimum utility thresholds. Knowl-Based Syst 113:100–115
Liu X, Wang X (2021) Cohesive subgraph identification in weighted bipartite graphs. Appl Sci 11(19):9051
Raayatpanah MA, Khodayifar S, Weise T, Pardalos P (2022) A novel approach to subgraph selection with multiple weights on arcs. J Comb Optim 44(1):242–268
Hu Y, Xiao F (2022) “Time Series Forecasting Based on Fuzzy Cognitive Visibility Graph and Weighted Multi-Subgraph Similarity,” IEEE Transactions on Fuzzy Systems
Li M-W, Xu D-Y, Geng J, Hong W-C (2022) A hybrid approach for forecasting ship motion using CNN–GRU–AM and GCWOA. Appl Soft Comput 114:108084
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Le, NT., Vo, B., Yun, U. et al. A novel approach to discover frequent weighted subgraphs using the average measure. Appl Intell 53, 19491–19504 (2023). https://doi.org/10.1007/s10489-023-04501-y
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-023-04501-y