{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:29:49Z","timestamp":1742981389646,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030864712"},{"type":"electronic","value":"9783030864729"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86472-9_16","type":"book-chapter","created":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T22:02:41Z","timestamp":1630360961000},"page":"171-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Diversified Pattern Mining on Large Graphs"],"prefix":"10.1007","author":[{"given":"Xin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huayi","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuanzhe","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"16_CR1","unstructured":"Amazon. http:\/\/snap.stanford.edu\/data\/amazon-meta.html"},{"key":"16_CR2","unstructured":"Pokec social network. http:\/\/snap.stanford.edu\/data\/soc-pokec.html"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Abdelhamid, E., Abdelaziz, I., Kalnis, P., Khayyat, Z., Jamour, F.T.: ScaleMine: scalable parallel frequent subgraph mining in a single large graph. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC, pp. 716\u2013727. IEEE Computer Society (2016)","DOI":"10.1109\/SC.2016.60"},{"issue":"12","key":"16_CR4","doi-asserted-by":"publisher","first-page":"2710","DOI":"10.1109\/TKDE.2017.2743075","volume":"29","author":"E Abdelhamid","year":"2017","unstructured":"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\u20132723 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR5","unstructured":"Alonso, O., Gamon, M., Haas, K., Pantel, P.: Diversity and relevance in social search. In: DDR (2012)"},{"key":"16_CR6","unstructured":"Ashraf, N., et al.: WeFreS: weighted frequent subgraph mining in a single large graph. In: Perner, P. (ed.) 19th Industrial Conference on Advances in Data Mining - Applications and Theoretical Aspects, ICDM, pp. 201\u2013215. ibai Publishing (2019)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Aslay, \u00c7., Nasir, M.A.U., De Francisci Morales, G., Gionis, A.: Mining frequent patterns in evolving graphs. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM, pp. 923\u2013932. ACM (2018)","DOI":"10.1145\/3269206.3271772"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TKDE.2014.2345408","volume":"27","author":"M Bhuiyan","year":"2015","unstructured":"Bhuiyan, M., Hasan, M.A.: An iterative MapReduce based frequent subgraph mining algorithm. IEEE Trans. Knowl. Data Eng. 27(3), 608\u2013620 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Borodin, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions and dynamic updates. In: PODS, pp. 155\u2013166. ACM (2012)","DOI":"10.1145\/2213556.2213580"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Borodin, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions and dynamic updates. In: Benedikt, M., Kr\u00f6tzsch, M., Lenzerini, M. (eds.) Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS, pp. 155\u2013166. ACM (2012)","DOI":"10.1145\/2213556.2213580"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Chen, H., Liu, M., Zhao, Y., Yan, X., Yan, D., Cheng, J.: G-Miner: an efficient task-oriented graph mining system. In: Oliveira, R., Felber, P., Hu, Y.C. (eds.) Proceedings of the Thirteenth EuroSys Conference, EuroSys, pp. 32:1\u201332:12. ACM (2018)","DOI":"10.1145\/3190508.3190545"},{"issue":"10","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. TPAMI 26(10), 1367\u20131372 (2004)","journal-title":"TPAMI"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.is.2017.05.006","volume":"69","author":"W Dhifli","year":"2017","unstructured":"Dhifli, W., Aridhi, S., Nguifo, E.M.: MR-SimLab: scalable subgraph selection with label similarity for big data. Inf. Syst. 69, 155\u2013163 (2017)","journal-title":"Inf. Syst."},{"issue":"7","key":"16_CR14","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":"16_CR15","doi-asserted-by":"crossref","unstructured":"Fiedler, M., Borgelt, C.: Subgraph support in a single large graph. In: Workshops Proceedings of the 7th IEEE International Conference on Data Mining, pp. 399\u2013404. IEEE Computer Society (2007)","DOI":"10.1109\/ICDMW.2007.74"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Gollapudi, S., Sharma, A.: An axiomatic approach for result diversification. In: Quemada, J., Le\u00f3n, G., Maarek, Y.S., Nejdl, W. (eds.) Proceedings of the 18th International Conference on World Wide Web, pp. 381\u2013390. ACM (2009)","DOI":"10.1145\/1526709.1526761"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Gong, N.Z., et al.: Evolution of social-attribute networks: measurements, modeling, and implications using Google+. In IMC (2012)","DOI":"10.1145\/2398776.2398792"},{"issue":"11","key":"16_CR18","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1109\/TKDE.2006.173","volume":"18","author":"E Gudes","year":"2006","unstructured":"Gudes, E., Shimony, S.E., Vanetik, N.: Discovering frequent graph patterns using disjoint paths. IEEE Trans. Knowl. Data Eng. 18(11), 1441\u20131456 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: SPIN: mining maximal frequent subgraphs from graph databases. In: SIGKDD (2004)","DOI":"10.1145\/1014052.1014123"},{"issue":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/2481244.2481249","volume":"14","author":"U Kang","year":"2012","unstructured":"Kang, U., Faloutsos, C.: Big graph mining: algorithms and discoveries. SIGKDD Explor. 14(2), 29\u201336 (2012)","journal-title":"SIGKDD Explor."},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ins.2019.12.010","volume":"514","author":"N Le","year":"2020","unstructured":"Le, N., Vo, B., Nguyen, L.B.Q., Fujita, H., Le, B.: Mining weighted subgraphs in a single large graph. Inf. Sci. 514, 149\u2013165 (2020)","journal-title":"Inf. Sci."},{"issue":"5","key":"16_CR22","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1007\/s10489-019-01622-1","volume":"50","author":"T Le","year":"2020","unstructured":"Le, T., Vo, B., Huynh, V., Nguyen, N.T., Baik, S.W.: Mining top-k frequent patterns from uncertain databases. Appl. Intell. 50(5), 1487\u20131497 (2020). https:\/\/doi.org\/10.1007\/s10489-019-01622-1","journal-title":"Appl. Intell."},{"key":"16_CR23","unstructured":"Ray, A., Holder, L., Choudhury, S.: Frequent subgraph discovery in large attributed streaming graphs. In: Proceedings of the 3rd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications, vol. 36, pp. 166\u2013181. JMLR.org (2014)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Shao, Y., Cui, B., Chen, L., Ma, L., Yao, J., Xu, N.: Parallel subgraph listing in a large-scale graph. In: SIGMOD (2014)","DOI":"10.1145\/2588555.2588557"},{"issue":"5","key":"16_CR25","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1007\/s10618-016-0466-x","volume":"30","author":"N Talukder","year":"2016","unstructured":"Talukder, N., Zaki, M.J.: A distributed approach for graph mining in massive networks. Data Min. Knowl. Discov. 30(5), 1024\u20131052 (2016). https:\/\/doi.org\/10.1007\/s10618-016-0466-x","journal-title":"Data Min. Knowl. Discov."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Teixeira, C.H.C., Fonseca, A.J., Serafini, M., Siganos, G., Zaki, M.J., Aboulnaga, A.: Arabesque: a system for distributed graph mining. In: Miller, E.L., Hand, S. (eds.) Proceedings of the 25th Symposium on Operating Systems Principles, SOSP 2015, Monterey, CA, USA, 4\u20137 October 2015, pp. 425\u2013440. ACM (2015)","DOI":"10.1145\/2815400.2815410"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Yan, D., Qu, W., Guo, G., Wang, X.: PrefixFPM: a parallel framework for general-purpose frequent pattern mining. In: 36th IEEE International Conference on Data Engineering, ICDE, pp. 1938\u20131941. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00208"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: Getoor, L., Senator, T.E., Domingos, P.M., Faloutsos, C. (eds.) Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 286\u2013295. ACM (2003)","DOI":"10.1145\/956750.956784"},{"issue":"11","key":"16_CR29","first-page":"807","volume":"4","author":"F Zhu","year":"2011","unstructured":"Zhu, F., Qu, Q., Lo, D., Yan, X., Han, J., Yu, P.: Mining top-k large structural patterns in a massive network. VLDB 4(11), 807\u2013818 (2011)","journal-title":"VLDB"},{"key":"16_CR30","unstructured":"Zhu, X., Chen, W., Zheng, W., Ma, X.: Gemini: a computation-centric distributed graph processing system. In: Keeton, K., Roscoe, T. (eds.) 12th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2016, Savannah, GA, USA, 2\u20134 November 2016, pp. 301\u2013316. USENIX Association (2016)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86472-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:39:01Z","timestamp":1710358741000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86472-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030864712","9783030864729"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86472-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"149","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"DEXA 2021 Workshops: 50 papers submitted, 23 papers accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}