{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:29:31Z","timestamp":1742941771160,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030309510"},{"type":"electronic","value":"9783030309527"}],"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-30952-7_24","type":"book-chapter","created":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T13:04:56Z","timestamp":1568725496000},"page":"226-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Subgraph Query Method Based on Adjacent Node Features on Large-Scale Label Graphs"],"prefix":"10.1007","author":[{"given":"Xiaohuan","family":"Shan","sequence":"first","affiliation":[]},{"given":"Jingjiao","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Jianye","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Zixuan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Baoyan","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/TNNLS.2016.2515080","volume":"28","author":"XJ Li","year":"2017","unstructured":"Li, X.J., Yang, G.H.: Graph theory-based pinning synchronization of stochastic complex dynamical networks. IEEE Trans. Neural Netw. Learn. Syst. 28(2), 427\u2013437 (2017)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.eswa.2017.05.066","volume":"86","author":"J Calle","year":"2017","unstructured":"Calle, J., Rivero, J., Cuadra, D., et al.: Extending ACO for fast path search in huge graphs and social networks. Expert Syst. Appl. 86, 292\u2013306 (2017)","journal-title":"Expert Syst. Appl."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1186\/s12859-017-1525-z","volume":"18","author":"AB Sonmez","year":"2017","unstructured":"Sonmez, A.B., Can, T.: Comparison of tissue\/disease specific integrated networks using directed graphlet signatures. BMC Bioinf. 18, 135 (2017)","journal-title":"BMC Bioinf."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.compeleceng.2016.11.018","volume":"57","author":"K Ravneet","year":"2017","unstructured":"Ravneet, K., Sarbjeet, S.: A comparative analysis of structural graph metrics to identify anomalies in online social networks. Comput. Electr. Eng. 57, 294\u2013310 (2017)","journal-title":"Comput. Electr. Eng."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-030-02934-0_35","volume-title":"Web Information Systems and Applications","author":"W Liu","year":"2018","unstructured":"Liu, W., Zhang, M., Niu, G., Liu, Y.: Weibo user influence evaluation method based on topic and node attributes. In: Meng, X., Li, R., Wang, K., Niu, B., Wang, X., Zhao, G. (eds.) WISA 2018. LNCS, vol. 11242, pp. 382\u2013391. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02934-0_35"},{"issue":"1","key":"24_CR6","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":"10","key":"24_CR7","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., et al.: 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."},{"issue":"5","key":"24_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.14778\/2735479.2735493","volume":"8","author":"X Ren","year":"2015","unstructured":"Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Proc. VLDB Endow. 8(5), 617\u2013628 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"24_CR9","unstructured":"Han, W.S., Lee, J., Lee, J.H.: TurboISO: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 337\u2013348. ACM (2013)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: TreePi: a novel graph indexing method. In: International Conference on Data Engineering, pp. 966\u2013975. IEEE (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD 2004: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"issue":"1\u20132","key":"24_CR12","doi-asserted-by":"publisher","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. VLDB Endow. 3(1\u20132), 340\u2013351 (2010)","journal-title":"VLDB Endow."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Query language and access methods for graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 125\u2013160 (2010)","DOI":"10.1007\/978-1-4419-6045-0_4"},{"issue":"z2","key":"24_CR14","first-page":"114","volume":"48","author":"YN Zhang","year":"2011","unstructured":"Zhang, Y.N., Gao, H., Zhang, W.: A dual branches feature based subgraph query algorithm. J. Comput. Res. Dev. 48(z2), 114\u2013123 (2011)","journal-title":"J. Comput. Res. Dev."},{"issue":"11","key":"24_CR15","first-page":"4035","volume":"29","author":"FR Meng","year":"2012","unstructured":"Meng, F.R., Zhang, Q., Yan, Q.Y.: Information entropy based algorithm for efficient subgraph matching. Appl. Res. Comput. 29(11), 4035\u20134037 (2012)","journal-title":"Appl. Res. Comput."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y.P., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: SIAM International Conference on Data Mining, Florida, pp. 442\u2013446 (2004)","DOI":"10.1137\/1.9781611972740.43"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30952-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:47:14Z","timestamp":1710352034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30952-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030309510","9783030309527"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30952-7_24","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":"16 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","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":"20 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/jisq.nju.edu.cn\/wisa2019\/index.html","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":"154","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":"33","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":"3.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":"8","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)"}}]}}