{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:26:14Z","timestamp":1758273974583},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T00:00:00Z","timestamp":1377734400000},"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":[[2015,1]]},"DOI":"10.1007\/s10115-013-0680-4","type":"journal-article","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T07:51:12Z","timestamp":1377676272000},"page":"49-74","source":"Crossref","is-referenced-by-count":9,"title":["Detecting multiple stochastic network motifs in network data"],"prefix":"10.1007","volume":"42","author":[{"given":"Kai","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William K.","family":"Cheung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,29]]},"reference":[{"issue":"2","key":"680_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M Newman","year":"2003","unstructured":"Newman M (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"5439","key":"680_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"4","key":"680_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/345966.345982","volume":"31","author":"J Kleinberg","year":"1999","unstructured":"Kleinberg J (1999) Hubs, authorities, and communities. ACM Comput Surv 31(4):5\u20137","journal-title":"ACM Comput Surv"},{"key":"680_CR4","doi-asserted-by":"crossref","unstructured":"Leskovec J, Lang K, Mahoney M (2010) Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th international conference on World Wide Web, pp 631\u2013640","DOI":"10.1145\/1772690.1772755"},{"issue":"3","key":"680_CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos S, Kompatsiaris Y, Vakali A, Spyridonos P (2012) Community detection in social media. Data Min Knowl Discov 24(3):515\u2013554","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"680_CR6","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/s10618-012-0260-3","volume":"25","author":"P Comar","year":"2012","unstructured":"Comar P, Tan PN, Jain AK (2012) Simultaneous classification and community detection on heterogeneous network data. Data Min Knowl Discov 25(3):420\u2013449","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"680_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"S Shen-Orr","year":"2002","unstructured":"Shen-Orr S, Milo R, Mangan S, Alon U (2002) Network motifs in the transcriptional regulation network of Escherichia coli. Nature Genet 31(1):64\u201368","journal-title":"Nature Genet"},{"issue":"5594","key":"680_CR8","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"},{"issue":"5663","key":"680_CR9","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, Ayzenshtat I, Sheffer M, Alon U (2004) Superfamilies of evolved and designed networks. Science 303(5663):1538\u20131541","journal-title":"Science"},{"issue":"11","key":"680_CR10","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":"4","key":"680_CR11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1109\/TCBB.2006.51","volume":"3","author":"S Wernicke","year":"2006","unstructured":"Wernicke S (2006) Efficient detection of network motifs. IEEE\/ACM Trans Comput Biol Bioinform 3(4):347\u2013359","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"41","key":"680_CR12","doi-asserted-by":"crossref","first-page":"14689","DOI":"10.1073\/pnas.0305199101","volume":"101","author":"J Berg","year":"2004","unstructured":"Berg J, Michael L (2004) Local graph alignment and motif search in biological networks. Proc Natl Acad Sci 101(41):14689\u201314694","journal-title":"Proc Natl Acad Sci"},{"issue":"25","key":"680_CR13","doi-asserted-by":"crossref","first-page":"9404","DOI":"10.1073\/pnas.0507841103","volume":"103","author":"R Jiang","year":"2006","unstructured":"Jiang R, Tu Z, Chen T, Sun F (2006) Network motif identification in stochastic networks. Proc Natl Acad Sci 103(25):9404\u20139409","journal-title":"Proc Natl Acad Sci"},{"key":"680_CR14","doi-asserted-by":"crossref","unstructured":"Zhao Q, Tian Y, He Q, Oliver N, Jin R, Lee W (2010) Communication motifs: A tool to characterize social communications. In: Proccedings of the 19th ACM international conference on information and, knowledge management, pp 1645\u20131648","DOI":"10.1145\/1871437.1871694"},{"issue":"11","key":"680_CR15","first-page":"5","volume":"11","author":"L Kovanen","year":"2011","unstructured":"Kovanen L, Karsai M, Kaski K, Kert\u00e9sz J, Saram\u00e4ki J (2011) Temporal motifs in time-dependent networks. J Stat Mech Theory Exp 11(11):5\u201323","journal-title":"J Stat Mech Theory Exp"},{"key":"680_CR16","doi-asserted-by":"crossref","unstructured":"Juszczyszyn K, Kazienko P, Musial K (2008) Local topology of social network based on motif analysis. In: Proceedings of knowledge-based intelligent information and engineering systems, pp 97\u2013105","DOI":"10.1007\/978-3-540-85565-1_13"},{"key":"680_CR17","doi-asserted-by":"crossref","unstructured":"Musial K, Juszczyszyn K (2009) Motif-based analysis of social position influence on interconnection patterns in complex social network. In: Procceedings of the 1st Asian conference on intelligent information and database systems, pp 34\u201339","DOI":"10.1109\/ACIIDS.2009.76"},{"key":"680_CR18","doi-asserted-by":"crossref","unstructured":"Braha D, Bar-Yam Y (2009) Time-dependent complex networks: dynamic centrality, dynamic motifs, and cycles of social interactions. Theory, models and applications, adaptive networks, pp 39\u201350","DOI":"10.1007\/978-3-642-01284-6_3"},{"key":"680_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the 28th international conference on human factors in computing systems, pp 1361\u20131370","DOI":"10.1145\/1753326.1753532"},{"issue":"2","key":"680_CR20","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1103\/PhysRevE.72.026132","volume":"72","author":"A Clauset","year":"2005","unstructured":"Clauset A (2005) Finding local community structure in networks. Phys Rev E 72(2):132\u2013137","journal-title":"Phys Rev E"},{"issue":"1","key":"680_CR21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1111\/j.1467-9531.2007.00179.x","volume":"37","author":"K Faust","year":"2007","unstructured":"Faust K (2007) Very local structure in social networks. Sociol Method 37(1):209\u2013256","journal-title":"Sociol Method"},{"key":"680_CR22","doi-asserted-by":"crossref","unstructured":"Kossinets G, Kleinberg J, Watts D (2008) The structure of information pathways in a social communication network. In: Proceeding of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 435\u2013443","DOI":"10.1145\/1401890.1401945"},{"issue":"1","key":"680_CR23","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1214\/12-EJS698","volume":"6","author":"E Birmele","year":"2012","unstructured":"Birmele E (2012) Detecting local network motifs. Electron J Stat 6(1):908\u2013933","journal-title":"Electron J Stat"},{"issue":"3","key":"680_CR24","first-page":"14","volume":"2","author":"LK Gallos","year":"2012","unstructured":"Gallos LK, Diego R, Fredrik L, Shlomo H, Hern\u00e1n MA (2012) How people interact in evolving online affiliation networks. Phys Rev X 2(3):14\u201331","journal-title":"Phys Rev X"},{"key":"680_CR25","doi-asserted-by":"crossref","unstructured":"Allan E, Turkett W, Fulp E (2009) Using network motifs to identify application protocols. In: Global telecommunications conference, pp 1\u20137","DOI":"10.1109\/GLOCOM.2009.5425781"},{"key":"680_CR26","unstructured":"Callaghan D, Harrigan M, Carthy J, Cunningham P (2012) Network analysis of recurring YouTube spam campaigns. In: Proceedings of the 6th international AAAI conference on weblogs and social media, pp 531\u2013534"},{"key":"680_CR27","doi-asserted-by":"crossref","unstructured":"Liu K, Cheung WK, Liu J (2011) Stochastic network motif detection in social media. In: Proccedings of ICDM workshop on data mining in networks, pp 949\u2013956","DOI":"10.1109\/ICDMW.2011.159"},{"key":"680_CR28","doi-asserted-by":"crossref","unstructured":"Liu K, Cheung W K, Liu J (2012) Detecting multiple stochastic network motifs in network data. In: Proceedings of the 16th Pacific\u2013Asia conference on knowledge discovery and data mining, pp 205\u2013217","DOI":"10.1007\/978-3-642-30220-6_18"},{"issue":"3","key":"680_CR29","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/34.990138","volume":"24","author":"M Figueiredo","year":"2002","unstructured":"Figueiredo M, Jain AK (2002) Unsupervised learning of finite mixture models. IEEE Trans Pattern Anal Mach Intell 24(3):381\u2013396","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"680_CR30","doi-asserted-by":"crossref","first-page":"81","DOI":"10.4018\/jkdb.2010100206","volume":"1","author":"F Bruno","year":"2010","unstructured":"Bruno F, Palopoli L, Rombo S (2010) New trends in graph mining: structural and node-colored network motifs. Int J Knowl Discov Bioinform 1(1):81\u201399","journal-title":"Int J Knowl Discov Bioinform"},{"issue":"2","key":"680_CR31","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1093\/bib\/bbr033","volume":"12","author":"E Wong","year":"2012","unstructured":"Wong E, Baur B, Quader S, Huang C (2012) Biological network motif detection: principles and practice. Briefings Bioinform 12(2):202\u2013215","journal-title":"Briefings Bioinform"},{"key":"680_CR32","doi-asserted-by":"crossref","unstructured":"Schreiber F, Schw\u00f6bbermeyer H (2005) Frequency concepts and pattern detection for the analysis of motifs in networks. Transactions on computational systems biology, pp 89\u2013104","DOI":"10.1007\/11599128_7"},{"issue":"17","key":"680_CR33","doi-asserted-by":"crossref","first-page":"3572","DOI":"10.1093\/bioinformatics\/bti556","volume":"21","author":"F Schreiber","year":"2005","unstructured":"Schreiber F, Schw\u00f6bbermeyer H (2005) MAVisto: a tool for the exploration of network motifs. Bioinformatics 21(17):3572\u20133574","journal-title":"Bioinformatics"},{"key":"680_CR34","doi-asserted-by":"crossref","unstructured":"Chen J, Hsu W, Lee M, Ng S (2006) Nemofinder: dissecting genome-wide protein\u2013protein interactions with meso-scale network motifs. In: Proccedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp 106\u2013115","DOI":"10.1145\/1150402.1150418"},{"issue":"1","key":"680_CR35","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 et al (2009) Kavosh: a new algorithm for finding network motifs. BMC Bioinform 10(1):318\u2013329","journal-title":"BMC Bioinform"},{"key":"680_CR36","doi-asserted-by":"crossref","unstructured":"Grochow J, Kellis M (2007) Network motif discovery using subgraph enumeration and symmetry-breaking. Research in computational, molecular biology, pp 92\u2013106","DOI":"10.1007\/978-3-540-71681-5_7"},{"issue":"5","key":"680_CR37","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"},{"key":"680_CR38","unstructured":"Fortin S (1996) The graph isomorphism problem. Technical Report 96\u201320, University of Alberta, Edomonton, Alberta, Canada"},{"key":"680_CR39","unstructured":"McKay B (2007) Nauty user\u2019s guide (version 2.4). Computer Science Dept, Australian National University"},{"issue":"52","key":"680_CR40","doi-asserted-by":"crossref","first-page":"17940","DOI":"10.1073\/pnas.0406024101","volume":"101","author":"A Vazquez","year":"2004","unstructured":"Vazquez A, Dobrin R, Sergi D, Eckmann J, Oltvai Z, Barab\u00e1si A (2004) The topological relationship between the large-scale attributes and local interaction patterns of complex networks. Proc Natl Acad Sci 101(52):17940\u201317945","journal-title":"Proc Natl Acad Sci"},{"issue":"3","key":"680_CR41","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10115-010-0291-2","volume":"26","author":"CE Tsourakakis","year":"2011","unstructured":"Tsourakakis CE (2011) Counting triangles in real-world networks using projections. Knowl Inf Syst 26(3):501\u2013520","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"680_CR42","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/15427951.2012.625260","volume":"8","author":"M Kolountzakis","year":"2012","unstructured":"Kolountzakis M, Miller G, Peng R, Tsourakakis C (2012) Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Math 8(2):161\u2013185","journal-title":"Internet Math"},{"key":"680_CR43","doi-asserted-by":"crossref","unstructured":"Seshadhri C, Pinar A, Kolda T (2013) Triadic measures on graphs: the power of wedge sampling. CoRR, abs\/1202.5230","DOI":"10.1137\/1.9781611972832.2"},{"issue":"1","key":"680_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A Dempster","year":"1977","unstructured":"Dempster A, Laird N, Rubin D (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc Ser B (Methodol) 39(1):1\u201338","journal-title":"J R Stat Soc Ser B (Methodol)"},{"issue":"4","key":"680_CR45","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1198\/106186001317243403","volume":"10","author":"G Celeux","year":"2001","unstructured":"Celeux G, Chr\u00e9tien S, Forbes F, Mkhadri A (2001) A component-wise EM algorithm for mixtures. J Comput Graph Stat 10(4):697\u2013712","journal-title":"J Comput Graph Stat"},{"issue":"4","key":"680_CR46","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"C Wallace","year":"1999","unstructured":"Wallace C, Dowe D (1999) Minimum message length and kolmogorov complexity. Comput J 42(4):270\u2013283","journal-title":"Comput J"},{"key":"680_CR47","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"T Cover","year":"1991","unstructured":"Cover T, Thomas J, Wiley J et al (1991) Elements of information theory. Wiley, New York"},{"issue":"1","key":"680_CR48","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic L, Huberman B (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5\u201344","journal-title":"ACM Trans Web"},{"issue":"5","key":"680_CR49","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright D, Harary F (1956) Structural balance: a generalization of Heider\u2019s theory. Psychol Rev 63(5):277\u2013293","journal-title":"Psychol Rev"},{"key":"680_CR50","doi-asserted-by":"crossref","unstructured":"Kumar N, Satoor S, Buck I (2009) Fast parallel expectation maximization for gaussian mixture models on GPUs using CUDA. In: Proccedings of the 11th IEEE international conference on high performance computing and communications, pp 103\u2013109","DOI":"10.1109\/HPCC.2009.45"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0680-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0680-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0680-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T09:54:47Z","timestamp":1715939687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0680-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,29]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["680"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0680-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,29]]}}}