{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T03:28:15Z","timestamp":1783740495629,"version":"3.55.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T00:00:00Z","timestamp":1466985600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10115-016-0965-5","type":"journal-article","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T07:27:04Z","timestamp":1467012424000},"page":"689-722","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":62,"title":["Graphlet decomposition: framework, algorithms, and applications"],"prefix":"10.1007","volume":"50","author":[{"given":"Nesreen K.","family":"Ahmed","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer","family":"Neville","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryan A.","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nick G.","family":"Duffield","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theodore L.","family":"Willke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,6,27]]},"reference":[{"key":"965_CR1","doi-asserted-by":"crossref","unstructured":"Ahlberg C, Williamson C, Shneiderman B (1992) Dynamic queries for information exploration: an implementation and evaluation. In: Proceedings of SIGCHI, pp 619\u2013626","DOI":"10.1145\/142750.143054"},{"key":"965_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed NK, Duffield N, Neville J, Kompella R (2014) Graph sample and hold: a framework for big-graph analytics. In: SIGKDD","DOI":"10.1145\/2623330.2623757"},{"key":"965_CR3","unstructured":"Ahmed NK, Neville J, Kompella R (2010) Reconsidering the foundations of network sampling. In: Proceedings of the 2nd Workshop on Information in Networks"},{"key":"965_CR4","doi-asserted-by":"crossref","unstructured":"Ahmed NK, Neville J, Kompella R (2012) Space-efficient sampling from social activity streams. In: Proceedings of the 1st international workshop on big data, streams and heterogeneous source mining: algorithms, systems, programming models and applications, pp 53\u201360","DOI":"10.1145\/2351316.2351324"},{"issue":"2","key":"965_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2601438","volume":"8","author":"NK Ahmed","year":"2014","unstructured":"Ahmed NK, Neville J, Kompella R (2014) Network sampling: from static to streaming graphs. ACM Trans Knowl Discov Data (TKDD) 8(2):1\u201356","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"965_CR6","unstructured":"Ahmed NK, Rossi RA (2015) Interactive visual graph analytics on the web. In: Proceedings of the Ninth International AAAI Conference on Web and Social Media"},{"key":"965_CR7","doi-asserted-by":"crossref","unstructured":"Becchetti L, Boldi P, Castillo C, Gionis A (2008) Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: SIGKDD","DOI":"10.1145\/1401890.1401898"},{"key":"965_CR8","doi-asserted-by":"crossref","unstructured":"Bhuiyan MA, Rahman M, Rahman M, Al Hasan M (2012) Guise: uniform sampling of graphlets for large graph analysis. In: ICDM","DOI":"10.1109\/ICDM.2012.87"},{"key":"965_CR9","unstructured":"Costa F, De Grave K (2010) Fast neighborhood subgraph pairwise distance kernel. In: ICML"},{"issue":"3","key":"965_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.socnet.2010.03.004","volume":"32","author":"K Faust","year":"2010","unstructured":"Faust K (2010) A puzzle concerning triads in social networks: graph constraints and the triad census. Soc Netw 32(3):221\u2013233","journal-title":"Soc Netw"},{"key":"965_CR11","doi-asserted-by":"crossref","unstructured":"Feldman D, Shavitt Y (2008) Automatic large scale generation of internet pop level maps. In: IEEE GLOBECOM","DOI":"10.1109\/GLOCOM.2008.ECP.466"},{"key":"965_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0167-5060(08)70779-9","volume":"38","author":"O Frank","year":"1988","unstructured":"Frank O (1988) Triad count statistics. Ann Discrete Math 38:141\u2013149","journal-title":"Ann Discrete Math"},{"key":"965_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to statistical relational learning","author":"L Getoor","year":"2007","unstructured":"Getoor L, Taskar B (2007) Introduction to statistical relational learning. MIT Press, Cambridge"},{"issue":"21","key":"965_CR14","doi-asserted-by":"crossref","first-page":"8685","DOI":"10.1073\/pnas.0701361104","volume":"104","author":"K-I Goh","year":"2007","unstructured":"Goh K-I, Cusick ME, Valle D, Childs B, Vidal M, Barab\u00e1si A-L (2007) The human disease network. PNAS 104(21):8685\u20138690","journal-title":"PNAS"},{"issue":"3","key":"965_CR15","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1080\/15427951.2009.10390645","volume":"6","author":"M Gonen","year":"2009","unstructured":"Gonen M, Shavitt Y (2009) Approximating the number of network motifs. Internet Math 6(3):349\u2013372","journal-title":"Internet Math"},{"issue":"1","key":"965_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.2307\/202051","volume":"1","author":"M Granovetter","year":"1983","unstructured":"Granovetter M (1983) The strength of weak ties: a network theory revisited. Sociol Theory 1(1):201\u2013233","journal-title":"Sociol Theory"},{"key":"965_CR17","doi-asserted-by":"crossref","DOI":"10.1201\/b16132","volume-title":"Handbook of graph theory","author":"JL Gross","year":"2013","unstructured":"Gross JL, Yellen J, Zhang P (2013) Handbook of graph theory, 2nd edn. Chapman & Hall, London","edition":"2"},{"issue":"2","key":"965_CR18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.3934\/nhm.2008.3.239","volume":"3","author":"D Hales","year":"2008","unstructured":"Hales D, Arteconi S (2008) Motifs in evolving cooperative networks look like protein structure networks. J Netw Heterog Media 3(2):239\u2013249","journal-title":"J Netw Heterog Media"},{"issue":"4","key":"965_CR19","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1093\/bioinformatics\/bts729","volume":"29","author":"W Hayes","year":"2013","unstructured":"Hayes W, Sun K, Pr\u017eulj N (2013) Graphlet-based measures are suitable for biological network comparison. Bioinformatics 29(4):483\u2013491","journal-title":"Bioinformatics"},{"issue":"4","key":"965_CR20","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","volume":"30","author":"T Ho\u010devar","year":"2014","unstructured":"Ho\u010devar T, Dem\u0161ar J (2014) A combinatorial approach to graphlet counting. Bioinformatics 30(4):559\u2013565","journal-title":"Bioinformatics"},{"key":"965_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/270703","volume":"7","author":"PW Holland","year":"1976","unstructured":"Holland PW, Leinhardt S (1976) Local structure in social networks. Sociol Methodol 7:1\u201345","journal-title":"Sociol Methodol"},{"key":"965_CR22","doi-asserted-by":"crossref","unstructured":"Kashima H, Saigo H, Hattori M, Tsuda K (2010) Graph kernels for chemoinformatics. Chemoinformatics and advanced machine learning perspectives: complex computational methods and collaborative techniques, p 1","DOI":"10.4018\/978-1-61520-911-8.ch001"},{"issue":"1","key":"965_CR23","doi-asserted-by":"crossref","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","volume":"7","author":"PJ Kelly","year":"1957","unstructured":"Kelly PJ (1957) A congruence theorem for trees. Pac J Math 7(1):961\u2013968","journal-title":"Pac J Math"},{"issue":"3","key":"965_CR24","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0020-0190(00)00047-8","volume":"74","author":"T Kloks","year":"2000","unstructured":"Kloks T, Kratsch D, M\u00fcller H (2000) Finding and counting small induced subgraphs efficiently. Inf Process Lett 74(3):115\u2013121","journal-title":"Inf Process Lett"},{"issue":"50","key":"965_CR25","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1098\/rsif.2010.0063","volume":"7","author":"O Kuchaiev","year":"2010","unstructured":"Kuchaiev O, Milenkovi\u0107 T, Memi\u0161evi\u0107 V, Hayes W, Pr\u017eulj N (2010) Topological network alignment uncovers biological function and phylogeny. J R Soc Interface 7(50):1341\u20131354","journal-title":"J R Soc Interface"},{"key":"965_CR26","doi-asserted-by":"crossref","first-page":"218","DOI":"10.2307\/2689082","volume":"44","author":"B Manvel","year":"1971","unstructured":"Manvel B, Stockmeyer PK (1971) On reconstruction of matrices. Math Mag 44:218\u2013221","journal-title":"Math Mag"},{"issue":"2","key":"965_CR27","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.comnet.2011.08.019","volume":"56","author":"D Marcus","year":"2012","unstructured":"Marcus D, Shavitt Y (2012) Rage\u2014a rapid graphlet enumerator for large networks. Comput Netw 56(2):810\u2013819","journal-title":"Comput Netw"},{"key":"965_CR28","first-page":"123","volume":"15","author":"BD McKay","year":"1997","unstructured":"McKay BD (1997) Small graphs are reconstructible. Australas J Comb 15:123\u2013126","journal-title":"Australas J Comb"},{"key":"965_CR29","first-page":"257","volume":"6","author":"T Milenkovi\u00e6","year":"2008","unstructured":"Milenkovi\u00e6 T, Pr\u017eulj N (2008) Uncovering biological network function via graphlet degree signatures. Cancer Inform 6:257","journal-title":"Cancer Inform"},{"key":"965_CR30","doi-asserted-by":"crossref","first-page":"121","DOI":"10.4137\/CIN.S4744","volume":"9","author":"T Milenkovi\u0107","year":"2010","unstructured":"Milenkovi\u0107 T, Ng WL, Hayes W, Pr\u017eulj N (2010) Optimal network alignment with graphlet degree vectors. Cancer Inform 9:121","journal-title":"Cancer Inform"},{"issue":"5594","key":"965_CR31","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"key":"965_CR32","doi-asserted-by":"crossref","unstructured":"Noble CC, Cook DJ (2003) Graph-based anomaly detection. In: SIGKDD","DOI":"10.1145\/956750.956831"},{"issue":"18","key":"965_CR33","doi-asserted-by":"crossref","first-page":"3508","DOI":"10.1093\/bioinformatics\/bth436","volume":"20","author":"N Pr\u017eulj","year":"2004","unstructured":"Pr\u017eulj N, Corneil DG, Jurisica I (2004) Modeling interactome: scale-free or geometric? Bioinformatics 20(18):3508\u20133515","journal-title":"Bioinformatics"},{"issue":"8","key":"965_CR34","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1016\/j.neunet.2005.07.009","volume":"18","author":"L Ralaivola","year":"2005","unstructured":"Ralaivola L, Swamidass SJ, Saigo H, Baldi P (2005) Graph kernels for chemical informatics. Neural Netw 18(8):1093\u20131110","journal-title":"Neural Netw"},{"key":"965_CR35","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015a) The network data repository with interactive graph analytics and visualization. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"965_CR36","doi-asserted-by":"crossref","unstructured":"Rossi RA, Gallagher B, Neville J, Henderson K (2013) Modeling dynamic behavior in large evolving graphs. In: Proceedings of WSDM, pp 667\u2013676","DOI":"10.1145\/2433396.2433479"},{"issue":"1","key":"965_CR37","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1613\/jair.3659","volume":"45","author":"RA Rossi","year":"2012","unstructured":"Rossi RA, McDowell LK, Aha DW, Neville J (2012) Transforming graph data for statistical relational learning. J Artif Intell Res 45(1):363\u2013441","journal-title":"J Artif Intell Res"},{"key":"965_CR38","doi-asserted-by":"crossref","unstructured":"Rossi R, Ahmed N (2015b) Role discovery in networks. In: TKDE","DOI":"10.1109\/TKDE.2014.2349913"},{"issue":"1","key":"965_CR39","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE (2007) Graph clustering. Comput Sci Rev 1(1):27\u201364","journal-title":"Comput Sci Rev"},{"key":"965_CR40","unstructured":"Shervashidze N, Petri T, Mehlhorn K, Borgwardt KM, Vishwanathan S (2009) Efficient graphlet kernels for large graph comparison. In: AISTATS"},{"key":"965_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"What is enumerative combinatorics?","author":"RP Stanley","year":"1986","unstructured":"Stanley RP (1986) What is enumerative combinatorics?. Springer, Berlin"},{"key":"965_CR42","volume-title":"Illuminating the path: the research and development agenda for visual analytics","author":"JJ Thomas","year":"2005","unstructured":"Thomas JJ, Cook KA (2005) Illuminating the path: the research and development agenda for visual analytics. IEEE Computer Society, Washington"},{"issue":"16","key":"965_CR43","doi-asserted-by":"crossref","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud AL, Mucha PJ, Porter MA (2012) Social structure of facebook networks. Physica A 391(16):4165\u20134180","journal-title":"Physica A"},{"key":"965_CR44","doi-asserted-by":"crossref","unstructured":"Ugander J, Backstrom L, Kleinberg J (2013) Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. In: WWW","DOI":"10.1145\/2488388.2488502"},{"key":"965_CR45","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan SVN, Schraudolph NN, Kondor R, Borgwardt KM (2010) Graph kernels. JMLR 11:1201\u20131242","journal-title":"JMLR"},{"issue":"6684","key":"965_CR46","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D Watts","year":"1998","unstructured":"Watts D, Strogatz S (1998) Collective dynamics of small-world networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"9","key":"965_CR47","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke S, Rasche F (2006) Fanmod: a tool for fast network motif detection. Bioinformatics 22(9):1152\u20131153","journal-title":"Bioinformatics"},{"issue":"12","key":"965_CR48","doi-asserted-by":"crossref","first-page":"5071","DOI":"10.1109\/TIP.2013.2278465","volume":"22","author":"L Zhang","year":"2013","unstructured":"Zhang L, Han Y, Yang Y, Song M, Yan S, Tian Q (2013) Discovering discriminative graphlets for aerial image categories recognition. IEEE Trans Image Process 22(12):5071\u20135084","journal-title":"IEEE Trans Image Process"},{"key":"965_CR49","doi-asserted-by":"crossref","unstructured":"Zhang L, Song M, Liu Z, Liu X, Bu J, Chen C (2013) Probabilistic graphlet cut: exploiting spatial structure cue for weakly supervised image segmentation. In: CVPR","DOI":"10.1109\/CVPR.2013.249"},{"key":"965_CR50","unstructured":"Zhao B, Sen P, Getoor L (2006) Event classification and relationship labeling in affiliation networks. In: ICML Workshop on Statistical Network Analysis (SNA)"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0965-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-016-0965-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0965-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0965-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T06:27:53Z","timestamp":1656743273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-016-0965-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,27]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["965"],"URL":"https:\/\/doi.org\/10.1007\/s10115-016-0965-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,27]]}}}