{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T03:58:42Z","timestamp":1790308722262,"version":"4.1.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,18]],"date-time":"2013-08-18T00:00:00Z","timestamp":1376784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s10115-013-0673-3","type":"journal-article","created":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T08:01:19Z","timestamp":1376726479000},"page":"511-536","source":"Crossref","is-referenced-by-count":19,"title":["GUISE: a uniform sampler for constructing frequency histogram of graphlets"],"prefix":"10.1007","volume":"38","author":[{"given":"Mahmudur","family":"Rahman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mansurul Alam","family":"Bhuiyan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahmuda","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad\u00a0Al","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,18]]},"reference":[{"key":"673_CR1","unstructured":"Azari Soufiani H, Airoldi EM (2012) Graphlet decomposition of a weighted network. ArXiv e-prints"},{"issue":"5439","key":"673_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"673_CR3","doi-asserted-by":"crossref","unstructured":"Baumes J, Goldberg M, Magdon-ismail M, Wallace W (2004) Discovering hidden groups in communication networks. In: Proceedings of the 2nd NSF\/NIJ symposium on intelligence and security informatics","DOI":"10.1007\/978-3-540-25952-7_28"},{"key":"673_CR4","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: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, KDD\u201908, pp 16\u201324. ACM, New York, NY, USA","DOI":"10.1145\/1401890.1401898"},{"key":"673_CR5","doi-asserted-by":"crossref","unstructured":"Becchetti L, Boldi P, Castillo C, Gionis A (2010) Efficient algorithms for large-scale local triangle counting. ACM Trans Knowl Discov Data 4(3):13-1\u201313-28","DOI":"10.1145\/1839490.1839494"},{"key":"673_CR6","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1126\/science.1165821","volume":"323","author":"SP Borgatti","year":"2009","unstructured":"Borgatti SP, Mehra A, Brass DJ, Labianca G (2009) Network analysis in the social sciences. Science 323:892\u2013895","journal-title":"Science"},{"key":"673_CR7","doi-asserted-by":"crossref","unstructured":"Chen J, Hsu W, Lee ML, Ng SK (2006) NeMoFinder: dissecting genome-wide protein\u2013protein interactions with meso-scale network motifs. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, KDD\u201906, pp. 106\u2013115","DOI":"10.1145\/1150402.1150418"},{"key":"673_CR8","volume-title":"Spectral graph theory","author":"RK Chung","year":"1997","unstructured":"Chung RK (1997) Spectral graph theory. American Mathematical Society, Providence, RI"},{"key":"673_CR9","doi-asserted-by":"crossref","first-page":"S95","DOI":"10.1086\/228943","volume":"94","author":"JS Coleman","year":"1988","unstructured":"Coleman JS (1988) Social capital in the creation of human capital. Am J Sociol 94:S95\u2013S120","journal-title":"Am J Sociol"},{"key":"673_CR10","doi-asserted-by":"crossref","unstructured":"Duke R, Lefmann H, Rodl V (1995) A fast approximation algorithm for computing the frequencies of subgraphs in a given graph. SIAM J Comput 24(3): 598\u2013620","DOI":"10.1137\/S0097539793247634"},{"key":"673_CR11","doi-asserted-by":"crossref","unstructured":"Eberle W, Holder L (2009) Graph-based approaches to insider threat detection. In: Proceedings of the 5th annual workshop on cyber security and information intelligence research: cyber security and information intelligence challenges and strategies","DOI":"10.1145\/1558607.1558658"},{"issue":"9","key":"673_CR12","doi-asserted-by":"crossref","first-page":"5825","DOI":"10.1073\/pnas.032093399","volume":"99","author":"JP Eckmann","year":"2002","unstructured":"Eckmann JP, Moses E (2002) Curvature of co-links uncovers hidden thematic layers in the world wide web. Proc Natl Acad Sci USA 99(9):5825\u20135829","journal-title":"Proc Natl Acad Sci USA"},{"key":"673_CR13","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s P, R\u00e8nyi A (1959) On random graphs. Publicationes Mathematicae (Debrecen), vol 6, pp 290\u2013297","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"673_CR14","unstructured":"Erd\u00f6s P, R\u00e8nyi A (1960) On the evolution of random graphs. In: Publication of The Mathematical Institute of The Hungarian Academy of Sciences, pp 17\u201361"},{"key":"673_CR15","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: Proceedings of the conference on applications, technologies, architectures, and protocols for computer communication, SIGCOMM\u201999, pp 251\u2013262 (1999)","DOI":"10.1145\/316188.316229"},{"key":"673_CR16","doi-asserted-by":"crossref","unstructured":"Foucault Welles B, Van Devender A, Contractor N (2010) Is a friend a friend?: Investigating the structure of friendship networks in virtual worlds. In: CHI\u201910 extended abstracts on human factors in computing systems, CHI EA\u201910, pp 4027\u20134032","DOI":"10.1145\/1753846.1754097"},{"key":"673_CR17","unstructured":"Grochow JA, Kellis M (2007) Network motif discovery using subgraph enumeration and symmetry-breaking. In: Proceedings of the 11th annual international conference on research in computational molecular biology, RECOMB\u201907, pp 92\u2013106"},{"key":"673_CR18","unstructured":"Guruswami V (2000) Rapidly mixing markov chains: a comparison of techniques. A Survey"},{"key":"673_CR19","doi-asserted-by":"crossref","unstructured":"Hasan MA, Zaki MJ (2011) A survey of link prediction in social networks. In: Aggarwal CC (ed) Social network data analytics, Springer, Science+Business Media, LLC, p 243. ISBN 978-1-4419-8461-6","DOI":"10.1007\/978-1-4419-8462-3_9"},{"issue":"1","key":"673_CR20","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"Z Kashani","year":"2009","unstructured":"Kashani Z, Ahrabian H, Elahi E, Nowzari-Dalini A, Ansari E, Asadi S, Mohammadi S, Schreiber F, Masoudi-Nejad A (2009) Kavosh: a new algorithm for finding network motifs. BMC Bioinform 10(1):318","journal-title":"BMC Bioinform"},{"issue":"11","key":"673_CR21","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11):1746\u20131758","journal-title":"Bioinformatics"},{"issue":"1","key":"673_CR22","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1186\/1471-2105-12-24","volume":"12","author":"O Kuchaiev","year":"2011","unstructured":"Kuchaiev O, Stevanovi\u0107 A, Hayes W, Pr\u017eulj N (2011) GraphCrunch 2: software tool for network modeling, alignment and clustering. BMC Bioinform 12(1):24","journal-title":"BMC Bioinform"},{"key":"673_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, KDD\u201905, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"key":"673_CR24","unstructured":"Lussier J, Bank J (2011) Local structure and evolution for cascade prediction. Stanford University Technical report"},{"key":"673_CR25","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1561\/0400000003","volume":"1","author":"R Montenegro","year":"2006","unstructured":"Montenegro R, Tetali P (2006) Mathematical aspects of mixing times in Markov chains. Found Trends Theor Comput Sci 1:237\u2013354","journal-title":"Found Trends Theor Comput Sci"},{"key":"673_CR26","doi-asserted-by":"crossref","first-page":"257","DOI":"10.4137\/CIN.S680","volume":"6","author":"T Milenkovic","year":"2008","unstructured":"Milenkovic T, Pr\u017eulj N (2008) Uncovering biological network function via graphlet degree signatures. Cancer Inform 6:257\u2013273","journal-title":"Cancer Inform"},{"key":"673_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomize algorithms","author":"S Motwani","year":"1995","unstructured":"Motwani S, Raghavan P (1995) Randomize algorithms. Cambridge University Press, Cambridge, MA"},{"issue":"5","key":"673_CR28","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1266\/ggs.84.385","volume":"84","author":"S Omidi","year":"2009","unstructured":"Omidi S, Schreiber F, Masoudi-nejad A (2009) MODA: an efficient algorithm for network motif discovery in biological networks. Genes Genet Syst 84(5):385\u2013395","journal-title":"Genes Genet Syst"},{"issue":"6","key":"673_CR29","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1093\/bioinformatics\/btq091","volume":"26","author":"N Pr\u017eulj","year":"2010","unstructured":"Pr\u017eulj N (2010) Biological network comparison using graphlet degree distribution. Bioinformatics 26(6):853\u2013854","journal-title":"Bioinformatics"},{"key":"673_CR30","doi-asserted-by":"crossref","unstructured":"Pr\u017eulj N, Corneil DG, Jurisica I (2004) Modeling interactome: scale-free or geometric? Bioinformatics 20(18):3508\u20133515","DOI":"10.1093\/bioinformatics\/bth436"},{"issue":"8","key":"673_CR31","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1093\/bioinformatics\/btl030","volume":"22","author":"N Pr\u017eulj","year":"2006","unstructured":"Pr\u017eulj N, Corneil DG, Jurisica I (2006) Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. Bioinformatics 22(8):974\u2013980","journal-title":"Bioinformatics"},{"key":"673_CR32","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/11599128_7","volume":"3","author":"F Schreiber","year":"2005","unstructured":"Schreiber F, Schwobbermeyer H (2005) Frequency concepts and pattern detection for the analysis of motifs in networks. Trans Comput Syst Biol 3:89\u2013104","journal-title":"Trans Comput Syst Biol"},{"key":"673_CR33","unstructured":"Shervashidze N, Vishwanathan SVN, Petri TH, Mehlhorn K, Borgwardt KM (2009) Efficient graphlet kernels for large graph comparison. In: van Dyk D, Welling M (eds) Proceedings of the twelfth international conference on artificial intelligence and statistics (AISTATS), JMLR: workshop and conference proceedings, vol 5, pp 488\u2013495. CSAIL"},{"key":"673_CR34","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1146\/annurev.physchem.012809.103457","volume":"61","author":"JJ Tyson","year":"2010","unstructured":"Tyson JJ, Novak B (2010) Functional motifs in biochemical reaction networks. Annu Rev Phys Chem 61:219\u2013240","journal-title":"Annu Rev Phys Chem"},{"key":"673_CR35","doi-asserted-by":"crossref","unstructured":"Vacic V, Lilia M. Iakoucheva SL, Radivojac P (2010) Graphlet kernels for prediction of functional residues in protein structures. J Comput Biol 17:55\u201372","DOI":"10.1089\/cmb.2009.0029"},{"key":"673_CR36","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge"},{"key":"673_CR37","doi-asserted-by":"crossref","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393:440\u2013442","DOI":"10.1038\/30918"},{"issue":"9","key":"673_CR38","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":"6","key":"673_CR39","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1109\/90.650138","volume":"5","author":"EW Zegura","year":"1997","unstructured":"Zegura EW, Calvert KL, Donahoo MJ (1997) A quantitative comparison of graph-based models for internet topology. IEEE\/ACM Trans Netw 5(6):770\u2013783","journal-title":"IEEE\/ACM Trans Netw"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0673-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0673-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0673-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T22:52:59Z","timestamp":1688424779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0673-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,18]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["673"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0673-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,18]]}}}