Abstract
Frequent Pattern Mining (FPM) is a classical graph mining task. In recent years, we have witnessed wide applications of FPM. However, emerging applications keep calling for more expressive patterns to capture more complex structures in a large graph. In light of this, we investigate the problem of mining frequent patterns with counting quantifiers. We first introduce quantified graph patterns (QGPs), which are the patterns incorporated with counting quantifiers. We then develop an algorithm along with an optimization technique to mine QGPs in a single large graph. On real-life graphs, we verified the performances of our (optimization) techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Full version. https://github.com/202022000283/paper
Nielsen global online consumer survey. http://www.nielsen.com/content/dam/corporate/us/en/newswire/uploads/2009/07/prglobal-study07709.pdf
Social network. http://snap.stanford.edu/data/
Abdelhamid, E., Canim, M., Sadoghi, M., Bhattacharjee, B., Chang, Y., Kalnis, P.: Incremental frequent subgraph mining on large evolving graphs. IEEE Trans. Knowl. Data Eng. 29(12), 2710–2723 (2017)
Amer-Yahia, S., Lakshmanan, L.V.S., Yu, C.: Socialscope: Enabling information discovery on social content sites. CoRR abs/0909.2058 (2009)
Ashraf, N., et al.: Wefres: weighted frequent subgraph mining in a single large graph. In: ICDM 2019, pp. 201–215. ibai Publishing (2019)
Bapna, R., Umyarov, A.: Do your online friends make you pay? a randomized field experiment on peer influence in online social networks. Manag. Sci. 61(8), 1902–1920 (2015)
Blau, H., Immerman, N., Jensen, D.: A visual language for querying and updating graphs. University of Massachusetts Amherst Computer Science Technical Report 37, 2002 (2002)
Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 858–863. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68125-0_84
Bry, F., Furche, T., Marnette, B., Ley, C., Linse, B., Poppe, O.: SPARQLog: SPARQL with rules and quantification. In: de Virgilio, R., Giunchiglia, F., Tanca, L. (eds.) Semantic Web Information Management, pp. 341–370. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04329-1_15
Elseidy, M., Abdelhamid, E., Skiadopoulos, S., Kalnis, P.: GRAMI: frequent subgraph and pattern mining in a single large graph. Proc. VLDB Endow. 7(7), 517–528 (2014)
Fan, W.: Graph pattern matching revised for social network analysis. In: 15th International Conference on Database Theory, ICDT 2012, Berlin, Germany, 26–29 March, 2012, pp. 8–21. ACM (2012)
Fan, W., Wang, X., Wu, Y., Xu, J.: Association rules with graph patterns. Proc. VLDB Endow. 8(12), 1502–1513 (2015)
Fan, W., Wu, Y., Xu, J.: Adding counting quantifiers to graph patterns. In: Proceedings of the International Conference on Management of Data, pp. 1215–1230. ACM (2016)
Kavitha, D., Haritha, D., Padma, Y.: Optimized candidate generation for frequent subgraph mining in a single graph. In: Proceedings of International Conference on Computational Intelligence and Data Engineering, pp. 259–272. Springer, Singapore (2021). https://doi.org/10.1007/978-981-15-8767-2_23
Le, N., Vo, B., Nguyen, L.B.Q., Fujita, H., Le, B.: Mining weighted subgraphs in a single large graph. Inf. Sci. 514, 149–165 (2020)
Li, L., Ding, P., Chen, H., Wu, X.: Frequent pattern mining in big social graphs. IEEE Trans. Emerging Topics Comput. Intell., 1–11 (2021)
Lin, W., Alvarez, S.A., Ruiz, C.: Collaborative recommendation via adaptive association rule mining. Data Min. Knowl. Disc. 6(1), 83–105 (2000)
Mahfoud, H.: Expressive top-k matching for conditional graph patterns. Neural Computing and Applications, pp. 1–17 (2021)
Martín, M.S., Gutiérrez, C., Wood, P.T.: SNQL: a social networks query and transformation language, vol. 749 (2011)
Ray, A., Holder, L., Choudhury, S.: Frequent subgraph discovery in large attributed streaming graphs. In: Proceedings of the 3rd International Workshop on Big Data, pp. 166–181. PMLR (2014)
Wang, X., Xu, Y., Zhan, H.: Extending association rules with graph patterns. Expert Syst. Appl. 141 (2020). https://doi.org/10.1016/j.eswa.2019.112897
Acknowledgement
This work is supported by Sichuan Scientific Innovation Fund (No. 2022JDRC0009), and National Natural Science Foundation of China [No. 62172102].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
He, Y., Wang, X., Sha, Y., Zhong, X., Fang, Y. (2023). Mining Frequent Patterns with Counting Quantifiers. In: Li, B., Yue, L., Tao, C., Han, X., Calvanese, D., Amagasa, T. (eds) Web and Big Data. APWeb-WAIM 2022. Lecture Notes in Computer Science, vol 13421. Springer, Cham. https://doi.org/10.1007/978-3-031-25158-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-031-25158-0_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-25157-3
Online ISBN: 978-3-031-25158-0
eBook Packages: Computer ScienceComputer Science (R0)