{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:18:35Z","timestamp":1742933915008,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192730"},{"type":"electronic","value":"9783030192747"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19274-7_9","type":"book-chapter","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T18:09:50Z","timestamp":1556215790000},"page":"107-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Predicting Graph Operator Output over Multiple Graphs"],"prefix":"10.1007","author":[{"given":"Tasos","family":"Bakogiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Giannakopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Tsoumakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nectarios","family":"Koziris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,26]]},"reference":[{"issue":"4","key":"9_CR1","first-page":"363","volume":"34","author":"FJ Aherne","year":"1998","unstructured":"Aherne, F.J., et al.: The bhattacharyya metric as an absolute similarity measure for frequency coded data. Kybernetika 34(4), 363\u2013368 (1998)","journal-title":"Kybernetika"},{"key":"9_CR2","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, pp. 1027\u201310357\u20139 January 2007"},{"issue":"5439","key":"9_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"9","key":"9_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"1","key":"9_CR5","first-page":"99","volume":"35","author":"A Bhattacharyya","year":"1943","unstructured":"Bhattacharyya, A.: On a measure of divergence between two statistical populations defined by their probability distributions. Bull. Calcutta Math. Soc. 35(1), 99\u2013109 (1943)","journal-title":"Bull. Calcutta Math. Soc."},{"issue":"5","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170\u20131182 (1987)","journal-title":"Am. J. Sociol."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"016117","DOI":"10.1103\/PhysRevE.85.016117","volume":"85","author":"G Bounova","year":"2012","unstructured":"Bounova, G., de Weck, O.: Overview of metrics and their correlation patterns for multiple-metric topology analysis on heterogeneous graph ensembles. Phys. Rev. E 85, 016117 (2012)","journal-title":"Phys. Rev. E"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Brandes, U., Erlebach, T.: Network Analysis: Methodological Foundations. Springer, New York (2005). https:\/\/doi.org\/10.1007\/b106453","DOI":"10.1007\/b106453"},{"issue":"1\u20137","key":"9_CR9","first-page":"107","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw."},{"key":"9_CR10","first-page":"1","volume":"1695","author":"G Csardi","year":"2006","unstructured":"Csardi, G., Nepusz, T.: The Igraph software package for complex network research. Inter J. Complex Syst. 1695, 1\u20139 (2006)","journal-title":"Inter J. Complex Syst."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.7155\/jgaa.00081","volume":"8","author":"D Eppstein","year":"2004","unstructured":"Eppstein, D., Wang, J.: Fast approximation of centrality. J. Graph Algorithms Appl. 8, 39\u201345 (2004)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"da, F., Costa, L., et al.: Characterization of complex networks: a survey of measurements. Adv. Phys. 56(1), 167\u2013242 (2007)","DOI":"10.1080\/00018730601170527"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Gandomi, et al.: Beyond the hype. Int. J. Inf. Manage. 35(2), 137\u2013144 (2015)","DOI":"10.1016\/j.ijinfomgt.2014.10.007"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/959242.959248","volume":"5","author":"T G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T.: A survey of kernels for structured data. SIGKDD 5(1), 49\u201358 (2003)","journal-title":"SIGKDD"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","volume-title":"Learning Theory and Kernel Machines","author":"T G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T., Flach, P., Wrobel, S.: On graph kernels: hardness results and efficient alternatives. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT-Kernel 2003. LNCS (LNAI), vol. 2777, pp. 129\u2013143. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45167-9_11"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.cosrev.2017.11.002","volume":"27","author":"S Ghosh","year":"2018","unstructured":"Ghosh, S., Das, N., Gon\u00e7alves, T., Quaresma, P., Kundu, M.: The journey of graph kernels through two decades. Comput. Sci. Rev. 27, 88\u2013111 (2018)","journal-title":"Comput. Sci. Rev."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: SIGKDD, pp. 855\u2013864. ACM (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd edn. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-21606-5","DOI":"10.1007\/978-0-387-21606-5"},{"key":"9_CR20","unstructured":"Hern\u00e1ndez, J.M., Mieghem, P.V.: Classification of graph metrics, pp. 1\u201320 (2011)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Jamakovic, A., et al.: Robustness of networks against viruses: the role of the spectral radius. In: Symposium on Communications and Vehicular Technology, pp. 35\u201338 (2006)","DOI":"10.1109\/SCVT.2006.334367"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"345","DOI":"10.3934\/nhm.2008.3.345","volume":"3","author":"A Jamakovic","year":"2008","unstructured":"Jamakovic, A., Uhlig, S.: On the relationships between topological measures in real-world networks. NHM 3(2), 345\u2013359 (2008)","journal-title":"NHM"},{"key":"9_CR23","unstructured":"Kaufmann, L., Rousseeuw, P.: Clustering by means of medoids, pp. 405\u2013416 (1987)"},{"key":"9_CR24","unstructured":"Koutra, D., Parikh, A., Ramdas, A., Xiang, J.: Algorithms for graph similarity and subgraph matching. Technical Report Carnegie-Mellon-University (2011). https:\/\/people.eecs.berkeley.edu\/~aramdas\/reports\/DBreport.pdf"},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. TWEB 1(1), 5 (2007)","journal-title":"TWEB"},{"key":"9_CR26","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec, J., Sosi\u010d, R.: Snap: a general-purpose network analysis and graph-mining library. ACM Trans. Intell. Syst. Technol. 8(1), 1 (2016)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"9_CR28","unstructured":"McAuley, J.J., Leskovec, J.: Learning to discover social circles in ego networks. In: Bartlett, P.L., Pereira, F.C.N., Burges, C.J.C., Bottou, L., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3\u20136, 2012, Lake Tahoe, Nevada, United States, pp. 548\u2013556 (2012)"},{"issue":"2","key":"9_CR29","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10618-015-0423-0","volume":"30","author":"M Riondato","year":"2016","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Discov. 30(2), 438\u2013475 (2016)","journal-title":"Data Min. Knowl. Discov."},{"issue":"3","key":"9_CR31","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13(3), 353\u2013362 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"13928","DOI":"10.1038\/ncomms13928","volume":"8","author":"TA Schieber","year":"2017","unstructured":"Schieber, T.A., et al.: Quantification of network structural dissimilarities. Nat. Commun. 8, 13928 (2017)","journal-title":"Nat. Commun."},{"key":"9_CR33","unstructured":"Sugiyama, M., Borgwardt, K.M.: Halting in random walk kernels. In: Annual Conference on Neural Information Processing Systems, pp. 1639\u20131647 (2015)"},{"key":"9_CR34","unstructured":"Bakogiannis, T., Giannakopoulos, I., Tsoumakos, D., Koziris, N.: Graph operator modeling over large graph datasets. CoRR abs\/1802.05536 (2018). http:\/\/arxiv.org\/abs\/1802.05536"},{"key":"9_CR35","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, R., Borgwardt, K.M.: Graph kernels. J. Mach. Learn. Res. 11, 1201\u20131242 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"9_CR36","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.aml.2007.01.006","volume":"21","author":"LA Zager","year":"2008","unstructured":"Zager, L.A., Verghese, G.C.: Graph similarity scoring and matching. Appl. Math. Lett. 21(1), 86\u201394 (2008)","journal-title":"Appl. Math. Lett."}],"container-title":["Lecture Notes in Computer Science","Web Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19274-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T00:02:54Z","timestamp":1714003374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19274-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192730","9783030192747"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19274-7_9","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":"26 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICWE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","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":"11 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icwe2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icwe2019.webengineering.org\/","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":"106","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":"26","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":"9","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","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":"4","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}