{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:19:18Z","timestamp":1742995158624,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319930398"},{"type":"electronic","value":"9783319930404"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93040-4_52","type":"book-chapter","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T13:29:41Z","timestamp":1529155781000},"page":"664-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["WFSM-MaxPWS: An Efficient Approach for Mining Weighted Frequent Subgraphs from Edge-Weighted Graph Databases"],"prefix":"10.1007","author":[{"given":"Md. Ashraful","family":"Islam","sequence":"first","affiliation":[]},{"given":"Chowdhury Farhan","family":"Ahmed","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7541-9127","authenticated-orcid":false,"given":"Carson K.","family":"Leung","sequence":"additional","affiliation":[]},{"given":"Calvin S. H.","family":"Hoi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,17]]},"reference":[{"issue":"9","key":"52_CR1","doi-asserted-by":"publisher","first-page":"7976","DOI":"10.1016\/j.eswa.2012.01.117","volume":"39","author":"CF Ahmed","year":"2012","unstructured":"Ahmed, C.F., Tanbeer, S.K., Jeong, B.S., Lee, Y.K., Choi, H.J.: Single-pass incremental and interactive mining for weighted frequent patterns. Expert Syst. Appl. 39(9), 7976\u20137994 (2012)","journal-title":"Expert Syst. Appl."},{"key":"52_CR2","doi-asserted-by":"publisher","unstructured":"Babu, N., John, A.: A distributed approach to weighted frequent subgraph mining. In: ICETT 2016. IEEE (2016). https:\/\/doi.org\/10.1109\/ICETT.2016.7873705","DOI":"10.1109\/ICETT.2016.7873705"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-319-57529-2_49","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Z Cheng","year":"2017","unstructured":"Cheng, Z., Flouvat, F., Selmaoui-Folcher, N.: Mining recurrent patterns in a dynamic attributed graph. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10235, pp. 631\u2013643. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57529-2_49"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-0-85729-130-1_5","volume-title":"Research and Development in Intelligent Systems","author":"F Eichinger","year":"2011","unstructured":"Eichinger, F., Huber, M., B\u00f6hm, K.: On the usefulness of weight-based constraints in frequent subgraph mining. In: Bramer, M., Petridis, M., Hopgood, A. (eds.) Research and Development in Intelligent Systems, vol. XXVII, pp. 65\u201378. Springer, London (2011). https:\/\/doi.org\/10.1007\/978-0-85729-130-1_5"},{"key":"52_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-37453-1_4","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A Fariha","year":"2013","unstructured":"Fariha, A., Ahmed, C.F., Leung, C.K.-S., Abdullah, S.M., Cao, L.: Mining frequent patterns from human interactions in meetings using directed acyclic graphs. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013. LNCS (LNAI), vol. 7818, pp. 38\u201349. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37453-1_4"},{"issue":"2","key":"52_CR6","first-page":"349","volume":"12","author":"A Gupta","year":"2017","unstructured":"Gupta, A., Thakur, H., Gupta, T., Yadav, S.: Regular pattern mining (with jitter) on weighted-directed dynamic graphs. JESTEC 12(2), 349\u2013364 (2017)","journal-title":"JESTEC"},{"key":"52_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-57454-7_29","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Z Huang","year":"2017","unstructured":"Huang, Z., Ye, Y., Li, X., Liu, F., Chen, H.: Joint weighted nonnegative matrix factorization for mining attributed graphs. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10234, pp. 368\u2013380. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57454-7_29"},{"key":"52_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-17316-5_39","volume-title":"Advanced Data Mining and Applications","author":"C Jiang","year":"2010","unstructured":"Jiang, C., Coenen, F., Zito, M.: Finding frequent subgraphs in longitudinal social network data using a weighted graph mining approach. In: Cao, L., Feng, Y., Zhong, J. (eds.) ADMA 2010. LNCS (LNAI), vol. 6440, pp. 405\u2013416. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17316-5_39"},{"key":"52_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-15105-7_7","volume-title":"Data Warehousing and Knowledge Discovery","author":"C Jiang","year":"2010","unstructured":"Jiang, C., Coenen, F., Zito, M.: Frequent sub-graph mining on edge weighted graphs. In: Pedersen, T.B., Mohania, M.K., Tjoa, A.M. (eds.) DaWaK 2010. LNCS, vol. 6263, pp. 77\u201388. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15105-7_7"},{"issue":"1","key":"52_CR10","first-page":"197","volume":"8","author":"G Lee","year":"2013","unstructured":"Lee, G., Yun, U.: Mining strongly correlated sub-graph patterns by considering weight and support constraints. IJMUE 8(1), 197\u2013206 (2013)","journal-title":"IJMUE"},{"issue":"9","key":"52_CR11","doi-asserted-by":"publisher","first-page":"2480","DOI":"10.1166\/asl.2016.7821","volume":"22","author":"G Lee","year":"2016","unstructured":"Lee, G., Yun, U., Kim, D.: A weight-based approach: frequent graph pattern mining with length-decreasing support constraints using weighted smallest valid extension. Adv. Sci. Lett. 22(9), 2480\u20132484 (2016)","journal-title":"Adv. Sci. Lett."},{"key":"52_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-540-68125-0_61","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"CK-S Leung","year":"2008","unstructured":"Leung, C.K.-S., Mateo, M.A.F., Brajczuk, D.A.: A tree-based approach for frequent pattern mining from uncertain data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 653\u2013661. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68125-0_61"},{"key":"52_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-37453-1_2","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"CK-S Leung","year":"2013","unstructured":"Leung, C.K.-S., Tanbeer, S.K.: PUF-tree: a compact tree structure for frequent pattern mining of uncertain data. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013. LNCS (LNAI), vol. 7818, pp. 13\u201325. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37453-1_2"},{"key":"52_CR14","doi-asserted-by":"crossref","unstructured":"Ozaki, T., Etoh, M.: Closed and maximal subgraph mining in internally and externally weighted graph databases. In: IEEE AINA 2011 Workshops, pp. 626\u2013631 (2011)","DOI":"10.1109\/WAINA.2011.48"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Shinoda, M., Ozaki, T., Ohkawa, T.: Weighted frequent subgraph mining in weighted graph databases. In: IEEE ICDM 2009 Workshops, pp. 58\u201363 (2009)","DOI":"10.1109\/ICDMW.2009.12"},{"key":"52_CR16","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: IEEE ICDM 2002, pp. 721\u2013724 (2002)"},{"key":"52_CR17","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1137\/1.9781611972825.93","volume-title":"Proceedings of the 2012 SIAM International Conference on Data Mining","author":"Jiong Yang","year":"2012","unstructured":"Yang, J., Su, W., Li, S., Dalkilic, M.M.: WIGM: discovery of subgraph patterns in a large weighted graph. In: SIAM SDM 2012, pp. 1083\u20131094 (2012)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93040-4_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:09:19Z","timestamp":1710324559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93040-4_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319930398","9783319930404"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93040-4_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/prada-research.net\/pakdd18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}