{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T12:48:50Z","timestamp":1749818930087,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":77,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318290"},{"type":"electronic","value":"9783642318306"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31830-6_12","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T10:02:38Z","timestamp":1340791358000},"page":"166-178","source":"Crossref","is-referenced-by-count":6,"title":["Review of BisoNet Abstraction Techniques"],"prefix":"10.1007","author":[{"given":"Fang","family":"Zhou","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Mahler","sequence":"additional","affiliation":[]},{"given":"Hannu","family":"Toivonen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Zhou, F., Mahler, S., Toivonen, H.: Review of Network Abstraction Techniques. In: Workshop on Explorative Analytics of Information Networks at ECML PKDD 2009, pp. 50\u201363 (2009)"},{"key":"12_CR2","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-31830-6_2","volume-title":"Bisociative Knowledge Discovery","author":"W. Dubitzky","year":"2012","unstructured":"Dubitzky, W., K\u00f6tter, T., Schmidt, O., Berthold, M.R.: Towards Creative Information Exploration Based on Koestler\u2019s Concept of Bisociation. In: Berthold, M.R. (ed.) Bisociative Knowledge Discovery. LNCS (LNAI), pp. 11\u201332. Springer, Heidelberg (2012)"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The Relative Neighbourhood Graph of a Finite Planar Set. Pattern Recogn.\u00a012(4), 261\u2013268 (1980)","journal-title":"Pattern Recogn."},{"issue":"9","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J. Jaromczyk","year":"1992","unstructured":"Jaromczyk, J., Toussaint, G.: Relative Neighborhood Graphs and Their Relatives. Proc. IEEE\u00a080(9), 1502\u20131517 (1992)","journal-title":"Proc. IEEE"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L.C. Freeman","year":"1979","unstructured":"Freeman, L.C.: Centrality in social networks: Conceptual clarification. Soc. Networks\u00a01(3), 215\u2013239 (1979)","journal-title":"Soc. Networks"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0378-8733(89)90016-6","volume":"11","author":"K.Z.M. Stephenson","year":"1989","unstructured":"Stephenson, K.Z.M.: Rethinking centrality: Methods and examples. Soc. Networks\u00a011(1), 1\u201337 (1989)","journal-title":"Soc. Networks"},{"key":"12_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis : Methods and Applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L. Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika\u00a018(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.socnet.2004.11.007","volume":"27","author":"M. Everett","year":"2005","unstructured":"Everett, M., Borgatti, S.P.: Ego network betweenness. Soc. Networks\u00a027(1), 31\u201338 (2005)","journal-title":"Soc. Networks"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U. Brandes","year":"2001","unstructured":"Brandes, U.: A Faster Algorithm for Betweenness Centrality. J. Math. Sociol.\u00a025(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L.C. Freeman","year":"1977","unstructured":"Freeman, L.C.: A Set of Measures of Centrality Based on Betweenness. Sociometry\u00a040, 35\u201341 (1977)","journal-title":"Sociometry"},{"issue":"6","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1086\/229694","volume":"96","author":"N.E. Friedkin","year":"1991","unstructured":"Friedkin, N.E.: Theoretical Foundations for Centrality Measures. Am. J. Sociol.\u00a096(6), 1478\u20131504 (1991)","journal-title":"Am. J. Sociol."},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"S. Gert","year":"1966","unstructured":"Gert, S.: The centrality index of a graph. Psychometrika\u00a031(4), 581\u2013603 (1966)","journal-title":"Psychometrika"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P. Bonacich","year":"1972","unstructured":"Bonacich, P.: Factoring and weighting approaches to status scores and clique identification. J. Math. Sociol.\u00a02(1), 113\u2013120 (1972)","journal-title":"J. Math. Sociol."},{"key":"12_CR15","unstructured":"Lawrence, P., Sergey, B., Rajeev, M., Terry, W.: The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project (1998)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst.\u00a030, 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"issue":"5","key":"12_CR17","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM\u00a046(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"12_CR18","first-page":"527","volume-title":"WWW 2002: Proc. 11th International Conf. on World Wide Web","author":"L. Li","year":"2002","unstructured":"Li, L., Shang, Y., Zhang, W.: Improvement of HITS-based algorithms on web documents. In: WWW 2002: Proc. 11th International Conf. on World Wide Web, pp. 527\u2013535. ACM, New York (2002)"},{"key":"12_CR19","first-page":"517","volume-title":"WWW 2002: Proc. 11th International Conf. World Wide Web","author":"T.H. Haveliwala","year":"2002","unstructured":"Haveliwala, T.H.: Topic-Sensitive PageRank. In: WWW 2002: Proc. 11th International Conf. World Wide Web, pp. 517\u2013526. ACM, New York (2002)"},{"key":"12_CR20","first-page":"581","volume-title":"Multivariate Analysis - II","author":"Z.W. Birnbaum","year":"1969","unstructured":"Birnbaum, Z.W.: On the importance of different components in a multicomponent system. In: Multivariate Analysis - II, pp. 581\u2013592. Academic Press, New York (1969)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Hong, J., Lie, C.: Joint reliability-importance of two edges in an undirected network. IEEE Trans. Reliab.\u00a042, 17\u201323, 33 (1993)","DOI":"10.1109\/24.210266"},{"key":"12_CR22","series-title":"Link\u00f6ping Electronic Atricles in Computer and Information Science","volume-title":"Algorithms for graph partitioning: A Survey","author":"P.O. Fj\u00e4llstr\u00f6m","year":"1998","unstructured":"Fj\u00e4llstr\u00f6m, P.O.: Algorithms for graph partitioning: A Survey. Link\u00f6ping Electronic Atricles in Computer and Information Science. Link\u00f6ping University Electronic Press, Link\u00f6ping (1998)"},{"key":"12_CR23","unstructured":"Elsner, U.: Graph Partitioning - A Survey. Technical Report SFB393\/97-27, Technische Universit\u00e4t Chemnitz (1997)"},{"issue":"3","key":"12_CR24","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.P.: Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. Matrix Anal. Appl.\u00a011(3), 430\u2013452 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"12_CR25","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Comput.\u00a016(2), 452\u2013469 (1995)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/S1064827594262613","volume":"19","author":"G.L. Miller","year":"1998","unstructured":"Miller, G.L., Teng, S.H., Thurston, W., Vavasis, S.A.: Geometric Separators for Finite-Element Meshes. SIAM J. Sci. Comput.\u00a019(2), 364\u2013386 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"12_CR27","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/TC.1987.1676942","volume":"36","author":"M.J. Berger","year":"1987","unstructured":"Berger, M.J., Bokhari, S.H.: A Partitioning Strategy for Nonuniform Problems on Multiprocessors. IEEE Trans. Comput.\u00a036(5), 570\u2013580 (1987)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput.\u00a020, 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A Multi-Level Algorithm For Partitioning Graphs. In: Proc. 1995 ACM\/IEEE Conf. Supercomputing (CDROM). ACM, New York (1995)","DOI":"10.1145\/224170.224228"},{"issue":"2","key":"12_CR30","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J.: Detecting community structure in networks. Eur. Phy. J. B - Condensed Matter and Complex Systems\u00a038(2), 321\u2013330 (2004)","journal-title":"Eur. Phy. J. B - Condensed Matter and Complex Systems"},{"issue":"1","key":"12_CR31","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An Efficient Heuristic Procedure for Partitioning Graphs. Bell Sys. Tech. J.\u00a049(1), 291\u2013307 (1970)","journal-title":"Bell Sys. Tech. J."},{"key":"12_CR32","first-page":"175","volume-title":"DAC 1982: P. 19th Conf. Des. Autom.","author":"C.M. Fiduccia","year":"1982","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A Linear-Time Heuristic for Improving Network Partitions. In: DAC 1982: P. 19th Conf. Des. Autom., pp. 175\u2013181. ACM, New York (1982)"},{"key":"12_CR33","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1090\/dimacs\/021\/06","volume-title":"Interconnection Networks and Mapping and Scheduling Parallel Computations","author":"R. Diekmann","year":"1995","unstructured":"Diekmann, R., Monien, B., Preis, R.: Using Helpful Sets to Improve Graph Bisections. In: Interconnection Networks and Mapping and Scheduling Parallel Computations, pp. 57\u201373. American Mathematical Society, USA (1995)"},{"key":"12_CR34","volume-title":"Social Network Analysis: A Handbook","author":"J. Scott","year":"2000","unstructured":"Scott, J.: Social Network Analysis: A Handbook. SAGE Publications, UK (2000)"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E\u00a069, 026113 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"issue":"12","key":"12_CR36","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA\u00a099(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"12_CR37","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F. Radicchi","year":"2004","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA\u00a0101, 2658\u20132663 (2004)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"12_CR38","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1140\/epjb\/e2004-00125-x","volume":"38","author":"F. Wu","year":"2004","unstructured":"Wu, F., Huberman, B.: Finding Communities in Linear Time: A Physics Approach. Eur. Phys. J. B - Condensed Matter and Complex Systems\u00a038, 331\u2013338 (2004)","journal-title":"Eur. Phys. J. B - Condensed Matter and Complex Systems"},{"key":"12_CR39","unstructured":"Dehaspe, L., Toivonen, H., King, R.D.: Finding Frequent Substructures in Chemical Compounds. In: Agrawal, R., Stolorz, P., Piatetsky-Shapiro, G. (eds.) 4th International Conf. Knowl. Disc. Data Min., USA, pp. 30\u201336. AAAI Press (1998)"},{"key":"12_CR40","first-page":"169","volume-title":"Proc. AAAI Workshop Knowl. Disc. Databases","author":"L.B. Holder","year":"1994","unstructured":"Holder, L.B., Cook, D.J., Djoko, S.: Substructure Discovery in the SUBDUE System. In: Proc. AAAI Workshop Knowl. Disc. Databases, pp. 169\u2013180. AAAI, Menlo Park (1994)"},{"key":"12_CR41","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D.J. Cook","year":"1994","unstructured":"Cook, D.J., Holder, L.B.: Substructure Discovery Using Minimum Description Length and Background Knowledge. J. Artif. Intell. Res.\u00a01, 231\u2013255 (1994)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"12_CR42","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0004-3702(94)00066-A","volume":"75","author":"K. Yoshida","year":"1995","unstructured":"Yoshida, K., Motoda, H.: CLIP: Concept Learning from Inference Patterns. Artif. Intell.\u00a075(1), 63\u201392 (1995)","journal-title":"Artif. Intell."},{"key":"12_CR43","first-page":"487","volume-title":"Proc. 20th International Conf. Very Large Data Bases, VLDB 1994","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. 20th International Conf. Very Large Data Bases, VLDB 1994, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"12_CR44","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"12_CR45","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/ICDM.2001.989534","volume-title":"Proc. 2001 IEEE International Conf. Data Min., ICDM 2001","author":"M. Kuramochi","year":"2001","unstructured":"Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: Proc. 2001 IEEE International Conf. Data Min., ICDM 2001, pp. 313\u2013320. IEEE Computer Society, Washington, DC (2001)"},{"issue":"9","key":"12_CR46","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M. Kuramochi","year":"2004","unstructured":"Kuramochi, M., Karypis, G.: An Efficient Algorithm for Discovering Frequent Subgraphs. IEEE Trans. on Knowl. and Data Eng.\u00a016(9), 1038\u20131051 (2004)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"12_CR47","first-page":"721","volume-title":"Proceedings of the 2002 IEEE International Conf. Data Min.","author":"X. Yan","year":"2002","unstructured":"Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proceedings of the 2002 IEEE International Conf. Data Min., pp. 721\u2013724. IEEE Computer Society, Washington, DC (2002)"},{"key":"12_CR48","first-page":"286","volume-title":"KDD 2003: Proc. 9th ACM SIGKDD International Conf. Knowl. Disc. Data Min.","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J.: CloseGraph: Mining Closed Frequent Graph Patterns. In: KDD 2003: Proc. 9th ACM SIGKDD International Conf. Knowl. Disc. Data Min., pp. 286\u2013295. ACM, New York (2003)"},{"key":"12_CR49","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1145\/1014052.1014123","volume-title":"KDD 2004: Proc. 10th ACM SIGKDD International Conf. Knowl. Disc Data Min.","author":"J. Huan","year":"2004","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: SPIN: Mining Maximal Frequent Subgraphs from Graph Databases. In: KDD 2004: Proc. 10th ACM SIGKDD International Conf. Knowl. Disc Data Min., pp. 581\u2013586. ACM, New York (2004)"},{"key":"12_CR50","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1007\/978-3-540-68125-0_84","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B. Bringmann","year":"2008","unstructured":"Bringmann, B., Nijssen, S.: What Is Frequent in a Single Graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 858\u2013863. Springer, Heidelberg (2008)"},{"key":"12_CR51","first-page":"399","volume-title":"ICDMW 2007: Proc. 7th IEEE International Conf. Data Min. Workshops","author":"M. Fiedler","year":"2007","unstructured":"Fiedler, M., Borgelt, C.: Subgraph Support in a Single Large Graph. In: ICDMW 2007: Proc. 7th IEEE International Conf. Data Min. Workshops, pp. 399\u2013404. IEEE Computer Society, Washington, DC (2007)"},{"key":"12_CR52","unstructured":"Fiedler, M., Borgelt, C.: Support Computation for Mining Frequent Subgraphs in a Single Graph. In: Proc. 5th Int. Workshop on Mining and Learning with Graphs, MLG 2007, Florence, Italy, pp. 25\u201330 (2007)"},{"issue":"3","key":"12_CR53","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M. Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding Frequent Patterns in a Large Sparse Graph. Data Min. Knowl. Disc.\u00a011(3), 243\u2013271 (2005)","journal-title":"Data Min. Knowl. Disc."},{"key":"12_CR54","first-page":"617","volume-title":"Handbooks in Operations Research and Management Science","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Design of survivable networks. In: Handbooks in Operations Research and Management Science, vol.\u00a07, pp. 617\u2013672 (1995)"},{"issue":"2","key":"12_CR55","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/1117454.1117462","volume":"7","author":"C. Ramakrishnan","year":"2005","unstructured":"Ramakrishnan, C., Milnor, W.H., Perry, M., Sheth, A.P.: Discovering Informative Connection Subgraphs in Multi-relational Graphs. SIGKDD Explor. Newsl.\u00a07(2), 56\u201363 (2005)","journal-title":"SIGKDD Explor. Newsl."},{"key":"12_CR56","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/1014052.1014068","volume-title":"KDD 2004: Proc. 10th ACM SIGKDD International Conf. Knowl. Disc. Data Min.","author":"C. Faloutsos","year":"2004","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast Discovery of Connection Subgraphs. In: KDD 2004: Proc. 10th ACM SIGKDD International Conf. Knowl. Disc. Data Min., pp. 118\u2013127. ACM, New York (2004)"},{"key":"12_CR57","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/1150402.1150448","volume-title":"KDD 2006: Proc. 12th ACM SIGKDD International Conf. Knowl. Disc. Data Min.","author":"H. Tong","year":"2006","unstructured":"Tong, H., Faloutsos, C.: Center-Piece Subgraphs: Problem Definition and Fast Solutions. In: KDD 2006: Proc. 12th ACM SIGKDD International Conf. Knowl. Disc. Data Min., pp. 404\u2013413. ACM, New York (2006)"},{"key":"12_CR58","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11799511_5","volume-title":"Data Integration in the Life Sciences","author":"P. Sevon","year":"2006","unstructured":"Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link Discovery in Graphs Derived from Biological Databases. In: Leser, U., Naumann, F., Eckman, B. (eds.) DILS 2006. LNCS (LNBI), vol.\u00a04075, pp. 35\u201349. Springer, Heidelberg (2006)"},{"key":"12_CR59","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10618-008-0106-1","volume":"17","author":"P. Hintsanen","year":"2008","unstructured":"Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowl. Discov.\u00a017, 3\u201323 (2008)","journal-title":"Data Min. Knowl. Discov."},{"key":"12_CR60","first-page":"2468","volume-title":"Proc. 20th International Joint Conf. Artif. Intel.","author":"L.D. Raedt","year":"2007","unstructured":"Raedt, L.D., Kimmig, A., Toivonen, H.: ProbLog: A Probabilistic Prolog and its Application in Link Discovery. In: Proc. 20th International Joint Conf. Artif. Intel., pp. 2468\u20132473. AAAI Press, Menlo Park (2007)"},{"issue":"2-3","key":"12_CR61","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10994-007-5030-x","volume":"70","author":"L. Raedt","year":"2008","unstructured":"Raedt, L., Kersting, K., Kimmig, A., Revoredo, K., Toivonen, H.: Compressing probabilistic Prolog programs. Mach. Learn.\u00a070(2-3), 151\u2013168 (2008)","journal-title":"Mach. Learn."},{"key":"12_CR62","first-page":"171","volume-title":"ICDM 2003: Proc. 3rd IEEE International Conf. Data Min.","author":"S. Lin","year":"2003","unstructured":"Lin, S., Chalupsky, H.: Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis. In: ICDM 2003: Proc. 3rd IEEE International Conf. Data Min., p. 171. IEEE Computer Society, Washington, DC (2003)"},{"key":"12_CR63","first-page":"266","volume-title":"KDD 2003: Proc. 9th ACM SIGKDD International Conf. Knowl. Disc. Data Min.","author":"S. White","year":"2003","unstructured":"White, S., Smyth, P.: Algorithms for Estimating Relative Importance in Networks. In: KDD 2003: Proc. 9th ACM SIGKDD International Conf. Knowl. Disc. Data Min., pp. 266\u2013275. ACM, New York (2003)"},{"key":"12_CR64","first-page":"271","volume-title":"WWW 2003: Proc. 12th International Conf. World Wide Web","author":"G. Jeh","year":"2003","unstructured":"Jeh, G., Widom, J.: Scaling Personalized Web Search. In: WWW 2003: Proc. 12th International Conf. World Wide Web, pp. 271\u2013279. ACM, New York (2003)"},{"issue":"3","key":"12_CR65","first-page":"335","volume":"2","author":"D. Forgaras","year":"2005","unstructured":"Forgaras, D., R\u00e1cz, B., Csalog\u00e1ny, K., Sarl\u00f3s, T.: Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds and Experiments. Internet Mathematics\u00a02(3), 335\u2013358 (2005)","journal-title":"Internet Mathematics"},{"issue":"1","key":"12_CR66","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. J. ACM\u00a023(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"issue":"10","key":"12_CR67","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L.P. 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.\u00a026(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal."},{"key":"12_CR68","first-page":"39","volume-title":"PODS 2002: Proc. 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","author":"D. Shasha","year":"2002","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and Applications of Tree and Graph Searching. In: PODS 2002: Proc. 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 39\u201352. ACM, New York (2002)"},{"key":"12_CR69","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/1007568.1007607","volume-title":"SIGMOD 2004: Proc. 2004 ACM SIGMOD International Conf. Management of Data","author":"X. Yan","year":"2004","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph Indexing: A Frequent Structure-based Approach. In: SIGMOD 2004: Proc. 2004 ACM SIGMOD International Conf. Management of Data, pp. 335\u2013346. ACM, New York (2004)"},{"key":"12_CR70","first-page":"38","volume-title":"ICDE 2006: Proc. 22nd International Conf. Data Eng.","author":"H. He","year":"2006","unstructured":"He, H., Singh, A.K.: Closure-Tree: An Index Structure for Graph Queries. In: ICDE 2006: Proc. 22nd International Conf. Data Eng., p. 38. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"2","key":"12_CR71","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","volume":"23","author":"Y. Tian","year":"2007","unstructured":"Tian, Y., Mceachin, R.C., Santos, C., States, D.J., Patel, J.M.: SAGA: a subgraph matching tool for biological graphs. Bioinformatics\u00a023(2), 232\u2013239 (2007)","journal-title":"Bioinformatics"},{"issue":"3-4","key":"12_CR72","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett.\u00a019(3-4), 255\u2013259 (1998)","journal-title":"Pattern Recogn. Lett."},{"issue":"6-7","key":"12_CR73","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","volume":"22","author":"M.-L. Fern\u00e1ndez","year":"2001","unstructured":"Fern\u00e1ndez, M.-L., Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recogn. Lett.\u00a022(6-7), 753\u2013758 (2001)","journal-title":"Pattern Recogn. Lett."},{"key":"12_CR74","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1145\/1066157.1066244","volume-title":"SIGMOD 2005: Proc. 2005 ACM SIGMOD International Conf. Management of Data","author":"X. Yan","year":"2005","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure Similarity Search in Graph Databases. In: SIGMOD 2005: Proc. 2005 ACM SIGMOD International Conf. Management of Data, pp. 766\u2013777. ACM, New York (2005)"},{"key":"12_CR75","volume-title":"ICDE 2006: Proc. 22nd International Conf. Data Eng.","author":"X. Yan","year":"2006","unstructured":"Yan, X., Zhu, F., Han, J., Yu, P.S.: Searching Substructures with Superimposed Distance. In: ICDE 2006: Proc. 22nd International Conf. Data Eng. IEEE Computer Society, Washington, DC (2006)"},{"key":"12_CR76","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/ICDE.2008.4497505","volume-title":"Proc. 2008 IEEE 24th International Conf. Data Eng.","author":"Y. Tian","year":"2008","unstructured":"Tian, Y., Patel, J.M.: TALE: A Tool for Approximate Large Graph Matching. In: Proc. 2008 IEEE 24th International Conf. Data Eng., pp. 963\u2013972. IEEE Computer Society, Los Alamitos (2008)"},{"key":"12_CR77","first-page":"976","volume-title":"Proc. 2007 IEEE 23rd International Conf. Data Eng","author":"D. Williams","year":"2007","unstructured":"Williams, D., Huan, J., Wang, W.: Graph Database Indexing Using Structured Graph Decomposition. In: Proc. 2007 IEEE 23rd International Conf. Data Eng, pp. 976\u2013985. IEEE Computer Society Press, Los Alamitos (2007)"}],"container-title":["Lecture Notes in Computer Science","Bisociative Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31830-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T12:57:12Z","timestamp":1556888232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31830-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318290","9783642318306"],"references-count":77,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31830-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}