{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:56:11Z","timestamp":1726059371813},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030352301"},{"type":"electronic","value":"9783030352318"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-35231-8_16","type":"book-chapter","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T19:30:38Z","timestamp":1573846238000},"page":"221-235","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Similar Group Finding Algorithm Based on Temporal Subgraph Matching"],"prefix":"10.1007","author":[{"given":"Yizhu","family":"Cai","sequence":"first","affiliation":[]},{"given":"Mo","family":"Li","sequence":"additional","affiliation":[]},{"given":"Junchang","family":"Xin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"key":"16_CR1","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-981-13-6661-1_17","volume-title":"Data Mining","author":"A Alsini","year":"2019","unstructured":"Alsini, A., Datta, A., Huynh, D.Q., Li, J.: Community Aware Personalized Hashtag Recommendation in Social Networks. In: Islam, R., Koh, Y.S., Zhao, Y., Warwick, G., Stirling, D., Li, C.-T., Islam, Z. (eds.) AusDM 2018. CCIS, vol. 996, pp. 216\u2013227. Springer, Singapore (2019). \nhttps:\/\/doi.org\/10.1007\/978-981-13-6661-1_17"},{"doi-asserted-by":"crossref","unstructured":"Bogdanov, P., Mongiovi, M., Singh, A.K.: Mining heavy subgraphs in time-evolving networks. In: ICDE, pp. 81\u201390 (2011)","key":"16_CR2","DOI":"10.1109\/ICDM.2011.101"},{"doi-asserted-by":"crossref","unstructured":"Chang, Z., Zou, L., Li, F.: Privacy preserving subgraph matching on large graphs in cloud. In: SIGMOD, pp. 199\u2013213 (2016)","key":"16_CR3","DOI":"10.1145\/2882903.2882956"},{"doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, C., Liao, K., Li, J., Zhou, R.: Contextual community search over large social networks. In: ICDE, pp. 88\u201399 (2019)","key":"16_CR4","DOI":"10.1109\/ICDE.2019.00017"},{"issue":"10","key":"16_CR5","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. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"doi-asserted-by":"crossref","unstructured":"Fan, W., Wang, X., Wu, Y.: Querying big graphs within bounded resources. In: SIGMOD, pp. 301\u2013312 (2014)","key":"16_CR6","DOI":"10.1145\/2588555.2610513"},{"doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD, pp. 405\u2013418 (2008)","key":"16_CR7","DOI":"10.1145\/1376616.1376660"},{"doi-asserted-by":"crossref","unstructured":"Kansal, A., Spezzano, F.: A scalable graph-coarsening based index for dynamic graph databases. In: CIKM, pp. 207\u2013216 (2017)","key":"16_CR8","DOI":"10.1145\/3132847.3133003"},{"issue":"10","key":"16_CR9","first-page":"974","volume":"8","author":"L Lai","year":"2015","unstructured":"Lai, L., Qin, L., Lin, X., Chang, L.: Scalable subgraph enumeration in mapreduce. Very Large Data Bases 8(10), 974\u2013985 (2015)","journal-title":"Very Large Data Bases"},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00778-017-0459-4","volume":"26","author":"L Lai","year":"2017","unstructured":"Lai, L., Qin, L., Lin, X., Chang, L.: Scalable subgraph enumeration in mapreduce: a cost-oriented approach. Very Large Data Bases 26(3), 421\u2013446 (2017)","journal-title":"Very Large Data Bases"},{"issue":"6","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1109\/TKDE.2017.2785824","volume":"30","author":"G Liu","year":"2018","unstructured":"Liu, G., et al.: MCS-GPM: multi-constrained simulation based graph pattern matching in contextual social graphs. IEEE Trans. Knowl. Data Eng. 30(6), 1050\u20131064 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Liu, G., et al.: Multi-constrained graph pattern matching in large-scale contextual social graphs. In: ICDE, pp. 351\u2013362 (2015)","key":"16_CR12","DOI":"10.1109\/ICDE.2015.7113297"},{"doi-asserted-by":"crossref","unstructured":"Meng, X., Kamara, S., Nissim, K., Kollios, G.: GRECS: graph encryption for approximate shortest distance queries. In: ACM, pp. 504\u2013517 (2015)","key":"16_CR13","DOI":"10.1145\/2810103.2813672"},{"doi-asserted-by":"crossref","unstructured":"Ogaard, K., Kase, S.E., Roy, H., Nagi, R., Sambhoos, K., Sudit, M.: Searching social networks for subgraph patterns. In: Proceedings of SPIE, vol. 8711 (2013)","key":"16_CR14","DOI":"10.1117\/12.2015264"},{"issue":"5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/MIC.2014.82","volume":"18","author":"A Papaoikonomou","year":"2014","unstructured":"Papaoikonomou, A., Kardara, M., Tserpes, K., Varvarigou, T.A.: Predicting edge signs in social networks using frequent subgraph discovery. IEEE Internet Comput. 18(5), 36\u201343 (2014)","journal-title":"IEEE Internet Comput."},{"doi-asserted-by":"crossref","unstructured":"Park, N., Ovelgonne, M., Subrahmanian, V.S.: SMAC: subgraph matching and centrality in huge social networks. In: SocialCom, pp. 134\u2013141 (2013)","key":"16_CR16","DOI":"10.1109\/SocialCom.2013.27"},{"issue":"5","key":"16_CR17","first-page":"617","volume":"8","author":"X Ren","year":"2015","unstructured":"Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Very Large Data Bases 8(5), 617\u2013628 (2015)","journal-title":"Very Large Data Bases"},{"issue":"8","key":"16_CR18","doi-asserted-by":"publisher","first-page":"2583","DOI":"10.1007\/s00500-017-2513-y","volume":"22","author":"H Rong","year":"2018","unstructured":"Rong, H., Ma, T., Tang, M., Cao, J.: A novel subgraph $$k^{+}$$-isomorphism method in social network based on graph similarity detection. Soft Comput. 22(8), 2583\u20132601 (2018)","journal-title":"Soft Comput."},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"issue":"1","key":"16_CR20","first-page":"340","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. Very Large Data Bases 3(1), 340\u2013351 (2010)","journal-title":"Very Large Data Bases"},{"doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT, pp. 181\u2013192 (2008)","key":"16_CR21","DOI":"10.1145\/1353343.1353369"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35231-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T19:37:59Z","timestamp":1573846679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35231-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030352301","9783030352318"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35231-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dalian","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2019.neusoft.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"170","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":"39","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":"26","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":"23% - 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":"3","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":"7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}