{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T06:47:14Z","timestamp":1768718834478,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:00:00Z","timestamp":1550448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:00:00Z","timestamp":1550448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10619-019-07259-w","type":"journal-article","created":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T13:33:22Z","timestamp":1550496802000},"page":"281-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Mining patterns in graphs with multiple weights"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2126-326X","authenticated-orcid":false,"given":"Giulia","family":"Preti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Lissandrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Mottin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Velegrakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,18]]},"reference":[{"key":"7259_CR1","doi-asserted-by":"crossref","unstructured":"Abdelhamid, E., Abdelaziz, I., Kalnis, P., Khayyat, Z., Jamour, F.: Scalemine: Scalable parallel frequent subgraph mining in a single large graph. In: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 716\u2013727 (2016)","DOI":"10.1109\/SC.2016.60"},{"key":"7259_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29659-3","volume-title":"Recommender Systems","author":"CC Aggarwal","year":"2016","unstructured":"Aggarwal, C.C.: Recommender Systems. Springer, Berlin (2016)"},{"key":"7259_CR3","doi-asserted-by":"crossref","unstructured":"Alu\u00e7, G., Hartig, O., \u00d6zsu, M.\u00a0T., Daudjee, K.: Diversified stress testing of RDF data management systems. In: International Semantic Web Conference, pp. 197\u2013212. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-319-11964-9_13"},{"key":"7259_CR4","doi-asserted-by":"crossref","unstructured":"Babu, N., John, A.: A distributed approach to weighted frequent subgraph mining. In: International Conference on Emerging Technological Trends, pp. 1\u20137 (2016)","DOI":"10.1109\/ICETT.2016.7873705"},{"issue":"4","key":"7259_CR5","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/TKDE.2016.2633993","volume":"29","author":"G Bagan","year":"2017","unstructured":"Bagan, G., Bonifati, A., Ciucanu, R., Fletcher, G.H.L., Lemay, A., Advokaat, N.: gMark: schema-driven generation of graphs and queries. IEEE Trans. Knowl. Data Eng. 29(4), 856\u2013869 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7259_CR6","unstructured":"Bandari, D., Xiang, S., Leskovec, J.: Categorizing user sessions at pinterest. arXiv:1703.09662 (2017)"},{"key":"7259_CR7","doi-asserted-by":"crossref","unstructured":"Bogdanov, P., Mongiov\u00ec, M., Singh, A.K.: Mining heavy subgraphs in time-evolving networks. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 81\u201390. IEEE (2011)","DOI":"10.1109\/ICDM.2011.101"},{"key":"7259_CR8","doi-asserted-by":"crossref","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: PAKDD, pp. 858\u2013863 (2008)","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"7259_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Y., Zhao, X., Lin, X., Wang, Y.: Towards frequent subgraph mining on single large uncertain graphs. In: 2015 IEEE International Conference on Data Mining, pp. 41\u201350 (2015)","DOI":"10.1109\/ICDM.2015.88"},{"issue":"9","key":"7259_CR10","doi-asserted-by":"publisher","first-page":"R97","DOI":"10.1186\/gb-2009-10-9-r97","volume":"10","author":"JC Costello","year":"2009","unstructured":"Costello, J.C., Dalkilic, M.M., Beason, S.M., Gehlhausen, J.R., Patwardhan, R., Middha, S., Eads, B.D., Andrews, J.R.: Gene networks in drosophila melanogaster: integrating experimental data to predict gene function. Genome Biol. 10(9), R97 (2009)","journal-title":"Genome Biol."},{"key":"7259_CR11","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt, L., Zimmermann, A.: Constraint-based pattern set mining. In: SDM, pp. 237\u2013248 (2007)","DOI":"10.1137\/1.9781611972771.22"},{"issue":"7","key":"7259_CR12","first-page":"517","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy, M., Abdelhamid, E., Skiadopoulos, S., Kalnis, P.: Grami: frequent subgraph and pattern mining in a single large graph. PVLDB 7(7), 517\u2013528 (2014)","journal-title":"PVLDB"},{"key":"7259_CR13","doi-asserted-by":"crossref","unstructured":"Fiedler, M., Borgelt, C.: Subgraph support in a single large graph. In: ICDM workshops, pp. 399\u2013404 (2007)","DOI":"10.1109\/ICDMW.2007.74"},{"key":"7259_CR14","doi-asserted-by":"crossref","unstructured":"Geng, R., Dong, X., Zhang, P., Xu, W.: Wtmaxminer: efficient mining of maximal frequent patterns based on weighted directed graph traversals. In: CCIS, pp. 1081\u20131086 (2008)","DOI":"10.1109\/ICCIS.2008.4670858"},{"key":"7259_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/376284.375670","volume":"30","author":"M Greenwald","year":"2001","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. ACM SIGMOD Rec. 30, 58\u201366 (2001)","journal-title":"ACM SIGMOD Rec."},{"key":"7259_CR16","volume-title":"Ups and downs: modeling the visual evolution of fashion trends with one-class collaborative filtering","author":"R He","year":"2016","unstructured":"He, R., McAuley, J.: Ups and downs: modeling the visual evolution of fashion trends with one-class collaborative filtering. University of California, San Diego (2016)"},{"key":"7259_CR17","unstructured":"Holder, L.B., Cook, D.J., Djoko, S. et\u00a0al.: Substucture discovery in the subdue system. In: KDD Workshop, pp. 169\u2013180 (1994)"},{"key":"7259_CR18","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: SIGKDD, pp. 581\u2013586 (2004)","DOI":"10.1145\/1014052.1014123"},{"issue":"6","key":"7259_CR19","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1089\/cmb.2005.12.657","volume":"12","author":"J Huan","year":"2005","unstructured":"Huan, J., Bandyopadhyay, D., Wang, W., Snoeyink, J., Prins, J., Tropsha, A.: Comparing graph representations of protein structure for mining family-specific residue-based packing motifs. J. Comput. Biol. 12(6), 657\u2013671 (2005)","journal-title":"J. Comput. Biol."},{"key":"7259_CR20","doi-asserted-by":"crossref","unstructured":"Jamil, S., Khan, A., Halim, Z., Baig, A.R.: Weighted muse for frequent sub-graph pattern finding in uncertain dblp data. In: 2011 International Conference on Internet Technology and Applications, pp. 1\u20136 (2011)","DOI":"10.1109\/ITAP.2011.6006415"},{"key":"7259_CR21","unstructured":"Jiang, W., Vaidya, J., Balaporia, Z., Clifton, C., Banich, B.: Knowledge discovery from transportation network data. In: ICDE, pp. 1061\u20131072 (2005)"},{"key":"7259_CR22","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P.S., Zhou, S.: Gstring: a novel approach for efficient search in graph databases. In: ICDE, pp. 566\u2013575 (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"key":"7259_CR23","doi-asserted-by":"crossref","unstructured":"Jiang, C., Coenen, F., Zito, M.: Frequent sub-graph mining on edge weighted graphs. In: DAWAK, pp. 77\u201388 (2010)","DOI":"10.1007\/978-3-642-15105-7_7"},{"key":"7259_CR24","doi-asserted-by":"crossref","unstructured":"Jin, X., Wang, C., Luo, J., Yu, X., Han, J.: Likeminer: a system for mining the power of \u2019like\u2019 in social media networks. In: KDD, pp. 753\u2013756 (2011)","DOI":"10.1145\/2020408.2020528"},{"issue":"1","key":"7259_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1093\/nar\/28.1.27","volume":"28","author":"M Kanehisa","year":"2000","unstructured":"Kanehisa, M., Goto, S.: Kegg: kyoto encyclopedia of genes and genomes. Nucleic Acids Res. 28(1), 27\u201330 (2000)","journal-title":"Nucleic Acids Res."},{"key":"7259_CR26","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM, pp. 313\u2013320 (2001)"},{"issue":"3","key":"7259_CR27","first-page":"243","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. DMKD 11(3), 243\u2013271 (2005)","journal-title":"DMKD"},{"issue":"6","key":"7259_CR28","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s00778-012-0268-8","volume":"21","author":"J Li","year":"2012","unstructured":"Li, J., Zou, Z., Gao, H.: Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDBJ 21(6), 753\u2013777 (2012)","journal-title":"VLDBJ"},{"issue":"2","key":"7259_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"7259_CR30","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8(1), 99\u2013118 (1977)","journal-title":"Artif. Intell."},{"key":"7259_CR31","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"7259_CR32","unstructured":"McSherry, F., Isard, M., Murray, D.G.: Scalability! but at what cost? In: HotOS, vol. 15, pp. 14\u201314. Citeseer (2015)"},{"key":"7259_CR33","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s00778-016-0429-2","volume":"25","author":"D Mottin","year":"2016","unstructured":"Mottin, D., Lissandrini, M., Velegrakis, Y., Palpanas, T.: Exemplar queries: a new way of searching. VLDB J. 25, 741\u2013765 (2016)","journal-title":"VLDB J."},{"issue":"5","key":"7259_CR34","doi-asserted-by":"publisher","first-page":"056131","DOI":"10.1103\/PhysRevE.70.056131","volume":"70","author":"ME Newman","year":"2004","unstructured":"Newman, M.E.: Analysis of weighted networks. Phys. Rev. E 70(5), 056131 (2004)","journal-title":"Phys. Rev. E"},{"key":"7259_CR35","doi-asserted-by":"crossref","unstructured":"Noble, C.C., Cook, D.J.: Graph-based anomaly detection. In: SIGKDD, pp. 631\u2013636 (2003)","DOI":"10.1145\/956750.956831"},{"key":"7259_CR36","doi-asserted-by":"crossref","unstructured":"Papapetrou, O., Ioannou, E., Skoutas, D.: Efficient discovery of frequent subgraph patterns in uncertain graph databases. In: Proceedings of the 14th International Conference on Extending Database Technology, pp. 355\u2013366 (2011)","DOI":"10.1145\/1951365.1951408"},{"key":"7259_CR37","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Zhu, H.: Mining access patterns efficiently from web logs. In: PAKDD, pp. 396\u2013407 (2000)","DOI":"10.1007\/3-540-45571-X_47"},{"key":"7259_CR38","unstructured":"Preti, G., Lissandrini, M., Mottin, D., Velegrakis, Y.: Beyond frequencies: graph pattern mining in multi-weighted graphs. In: Proceedings of the 21th International Conference on Extending Database Technology, EDBT (2018)"},{"key":"7259_CR39","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0167-9236(00)00123-8","volume":"31","author":"MJ Shaw","year":"2001","unstructured":"Shaw, M.J., Subramaniam, C., Tan, G.W., Welge, M.E.: Knowledge management and data mining for marketing. Decis. Support Syst. 31, 127\u2013137 (2001)","journal-title":"Decis. Support Syst."},{"issue":"5","key":"7259_CR40","first-page":"466","volume":"5","author":"A Silva","year":"2012","unstructured":"Silva, A., Meira Jr., W., Zaki, M.J.: Mining attribute-structure correlated patterns in large attributed graphs. PVLDB 5(5), 466\u2013477 (2012)","journal-title":"PVLDB"},{"key":"7259_CR41","doi-asserted-by":"crossref","unstructured":"Song, Q., Wu, Y., Dong, X.L.: Mining summaries for knowledge graph search. In: ICDM, pp. 1215\u20131220 (2016)","DOI":"10.1109\/ICDM.2016.0162"},{"key":"7259_CR42","doi-asserted-by":"crossref","unstructured":"Steinbach, M., Ert\u00f6z, L., Kumar, V.: The challenges of clustering high dimensional data. In: New Directions in Statistical Physics, pp. 273\u2013309 (2004)","DOI":"10.1007\/978-3-662-08968-2_16"},{"key":"7259_CR43","doi-asserted-by":"crossref","unstructured":"Teixeira, C.H., Fonseca, A.J., Serafini, M., Siganos, G., Zaki, M.J., Aboulnaga, A.: Arabesque: a system for distributed graph mining. In: Proceedings of the 25th Symposium on Operating Systems Principles, pp. 425\u2013440. ACM (2015)","DOI":"10.1145\/2815400.2815410"},{"issue":"8","key":"7259_CR44","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"issue":"2","key":"7259_CR45","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-006-0044-8","volume":"13","author":"N Vanetik","year":"2006","unstructured":"Vanetik, N., Shimony, S.E., Gudes, E.: Support measures for graph data. Data Min. Knowl. Discov. 13(2), 243\u2013260 (2006)","journal-title":"Data Min. Knowl. Discov."},{"key":"7259_CR46","doi-asserted-by":"crossref","unstructured":"Wang, H., Aggarwal, C.C.: A survey of algorithms for keyword search on graph data. In: Managing and Mining Graph Data, pp. 249\u2013273 (2010)","DOI":"10.1007\/978-1-4419-6045-0_8"},{"key":"7259_CR47","doi-asserted-by":"publisher","unstructured":"Wu, D., Ren, J., Sheng, L.: Uncertain maximal frequent subgraph mining algorithm based on adjacency matrix and weight. Int. J. Mach. Learn. Cybern. (2017). https:\/\/doi.org\/10.1007\/s13042-017-0655-y","DOI":"10.1007\/s13042-017-0655-y"},{"key":"7259_CR48","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM, pp. 721\u2013724 (2002)"},{"key":"7259_CR49","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"7259_CR50","doi-asserted-by":"crossref","unstructured":"Yang, J., Su, W., Li, S., Dalkilic, M.M.: Wigm: discovery of subgraph patterns in a large weighted graph. In: SDM, pp. 1083\u20131094 (2012)","DOI":"10.1137\/1.9781611972825.93"},{"issue":"11","key":"7259_CR51","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2934664","volume":"59","author":"M Zaharia","year":"2016","unstructured":"Zaharia, M., Xin, R.S., Wendell, P., Das, T., Armbrust, M., Dave, A., Meng, X., Rosen, J., Venkataraman, S., Franklin, M.J.: Apache spark: a unified engine for big data processing. Commun. ACM 59(11), 56\u201365 (2016)","journal-title":"Commun. ACM"},{"issue":"9","key":"7259_CR52","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","volume":"22","author":"Z Zou","year":"2010","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Mining frequent subgraph patterns from uncertain graph data. IEEE Trans. Knowl. Data Eng. 22(9), 1203\u20131218 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10619-019-07259-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-019-07259-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-019-07259-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T14:27:49Z","timestamp":1621866469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10619-019-07259-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,18]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["7259"],"URL":"https:\/\/doi.org\/10.1007\/s10619-019-07259-w","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,18]]},"assertion":[{"value":"18 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}