{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:42Z","timestamp":1740109302220,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,12,13]],"date-time":"2018-12-13T00:00:00Z","timestamp":1544659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U1301254","61603290"],"award-info":[{"award-number":["U1301254","61603290"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61602371"],"award-info":[{"award-number":["61602371"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Ministry of Education&China Mobile Research Fund","award":["MCM20160311"],"award-info":[{"award-number":["MCM20160311"]}]},{"name":"Shenzhen Basic Research Grant","award":["JCYJ20160229195940462","JCYJ20170816100819428"],"award-info":[{"award-number":["JCYJ20160229195940462","JCYJ20170816100819428"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"crossref","award":["2015M582663"],"award-info":[{"award-number":["2015M582663"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["2016JQ6034"],"award-info":[{"award-number":["2016JQ6034"]}]},{"name":"National Key R&D Program of China","award":["2018YFC0830500"],"award-info":[{"award-number":["2018YFC0830500"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10115-018-1301-z","type":"journal-article","created":{"date-parts":[[2018,12,13]],"date-time":"2018-12-13T04:51:09Z","timestamp":1544676669000},"page":"301-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SNOD: a fast sampling method of exploring node orbit degrees for large graphs"],"prefix":"10.1007","volume":"61","author":[{"given":"Pinghui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junzhou","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangliang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,13]]},"reference":[{"key":"1301_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed NK, Neville J, Rossi RA, Duffield N (2015) Efficient graphlet counting for large networks. In: ICDM","DOI":"10.1109\/ICDM.2015.141"},{"key":"1301_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed N, Duffield N, Neville J, Kompella R (2014) Graph sample and hold: a framework for big-graph analytics. In: KDD, pp 589\u2013597","DOI":"10.1145\/2623330.2623757"},{"issue":"4","key":"1301_CR3","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon N, Yuster R, Zwick U (1995) Color-coding. J ACM 42(4):844\u2013856. \n                    https:\/\/doi.org\/10.1145\/210332.210337","journal-title":"J ACM"},{"key":"1301_CR4","doi-asserted-by":"crossref","unstructured":"Aparicio DO, Ribeiro PMP, da Silva FMA (2014) Parallel subgraph counting for multicore architectures. In: ISPA, pp 34\u201341","DOI":"10.1109\/ISPA.2014.14"},{"issue":"6295","key":"1301_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson AR, Gleich DF, Leskovec J (2016) Higher-order organization of complex networks. Science 353(6295):163\u2013166","journal-title":"Science"},{"key":"1301_CR6","doi-asserted-by":"crossref","unstructured":"Bhuiyan MA, Rahman M, Rahman M, Hasan MA (2012) Guise: Uniform sampling of graphlets for large graph analysis. In: ICDM, pp 91\u2013100","DOI":"10.1109\/ICDM.2012.87"},{"key":"1301_CR7","doi-asserted-by":"crossref","unstructured":"Chu S, Cheng J (2011) Triangle listing in massive networks and its applications. In: KDD, pp 672\u2013680","DOI":"10.1145\/2020408.2020513"},{"key":"1301_CR8","doi-asserted-by":"crossref","unstructured":"Dave VS, Ahmed NK, Hasan MH (2017) E-CLoG: counting edge-centric local graphlets. In: BigData, pp 586\u2013595","DOI":"10.1109\/BigData.2017.8257974"},{"key":"1301_CR9","doi-asserted-by":"crossref","unstructured":"Elenberg ER, Shanmugam K, Borokhovich M, Dimakis AG (2015) Beyond triangles: a distributed framework for estimating 3-profiles of large graphs. In: KDD, pp 229\u2013238","DOI":"10.1145\/2783258.2783413"},{"key":"1301_CR10","doi-asserted-by":"crossref","unstructured":"Elenberg ER, Shanmugam K, Borokhovich M, Dimakis AG (2016) Distributed estimation of graph 4-profiles. In: WWW","DOI":"10.1145\/2872427.2883082"},{"issue":"9","key":"1301_CR11","first-page":"2536","volume":"27","author":"M Fang","year":"2015","unstructured":"Fang M, Yin J, Zhu X, Zhang C (2015) Trgraph: cross-network transfer learning via common signature subgraphs. TKDE 27(9):2536\u20132549","journal-title":"TKDE"},{"key":"1301_CR12","unstructured":"Google programming contest. \n                    http:\/\/www.google.com\/programming-contest\/\n                    \n                   (2002)"},{"issue":"4","key":"1301_CR13","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2527652","volume":"15","author":"FA Graybill","year":"1959","unstructured":"Graybill FA, Deal RB (1959) Combining unbiased estimators. Biometrics 15(4):543\u2013550","journal-title":"Biometrics"},{"key":"1301_CR14","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: KDD","DOI":"10.1145\/2939672.2939754"},{"key":"1301_CR15","doi-asserted-by":"crossref","unstructured":"Henderson K, Gallagher B, Eliassi-Rad T, Tong H, Basu S, Akoglu L, Koutra D, Faloutsos C, Li L (2012) Rolx: structural role extraction and mining in large graphs. In: KDD, pp 1231\u20131239","DOI":"10.1145\/2339530.2339723"},{"key":"1301_CR16","doi-asserted-by":"crossref","unstructured":"Jha M, Seshadhri C, Pinar A (2013) A space efficient streaming algorithm for triangle counting using the birthday paradox. In: KDD, pp 589\u2013597","DOI":"10.1145\/2487575.2487678"},{"key":"1301_CR17","doi-asserted-by":"crossref","unstructured":"Jha M, Seshadhri C, Pinar A (2015) Path sampling: a fast and provable method for estimating 4-vertex subgraph counts. In: WWW, pp 495\u2013505","DOI":"10.1145\/2736277.2741101"},{"issue":"11","key":"1301_CR18","doi-asserted-by":"publisher","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"},{"key":"1301_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: WWW, pp 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"issue":"2","key":"1301_CR20","doi-asserted-by":"publisher","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: a rapid graphlet enumerator for large networks. Comput Netw 56(2):810\u2013819","journal-title":"Comput Netw"},{"key":"1301_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.4137\/CIN.S680","volume":"6","author":"T Milenkovic","year":"2008","unstructured":"Milenkovic T, Przulj N (2008) Uncovering biological network function via graphlet degree signatures. Cancer Inform 6:257\u2013273","journal-title":"Cancer Inform"},{"issue":"44","key":"1301_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1098\/rsif.2009.0192","volume":"7","author":"T Milenkovic","year":"2010","unstructured":"Milenkovic T, Memisevic V, Ganesan AK, Przulj N (2010) Systems-level cancer gene identification from protein interaction network topology applied to melanogenesis-related functional genomics data. J R Soc Interface 7(44):423\u2013437","journal-title":"J R Soc Interface"},{"key":"1301_CR23","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: IMC, pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"issue":"5","key":"1301_CR24","doi-asserted-by":"publisher","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":"1301_CR25","doi-asserted-by":"crossref","unstructured":"Pavany A, Tangwongsan K, Tirthapuraz S, Wu KL (2013) Counting and sampling triangles from a graph stream. In: PVLDB, pp 1870\u20131881","DOI":"10.14778\/2556549.2556569"},{"key":"1301_CR26","doi-asserted-by":"crossref","unstructured":"Pinar A, Seshadhr C, Visha V (2017) Escape: efficiently counting all 5-vertex subgraphs. In: WWW","DOI":"10.1145\/3038912.3052597"},{"issue":"2","key":"1301_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Przulj","year":"2007","unstructured":"Przulj N (2007) Biological network comparison using graphlet degree distribution. Bioinformatics 23(2):177\u2013183","journal-title":"Bioinformatics"},{"key":"1301_CR28","doi-asserted-by":"crossref","unstructured":"Rahman M, Bhuiyan M, Hasan MA (2012) Graft: an approximate graphlet counting algorithm for large graph analysis. In: CIKM","DOI":"10.1145\/2396761.2398454"},{"key":"1301_CR29","unstructured":"Rossi RA, Zhou R, Ahmed NK (2017) Estimation of graphlet statistics. CoRR abs\/1701.01772"},{"key":"1301_CR30","unstructured":"Schank T (2007) Algorithmic aspects of triangle-based network analysis. Ph.D. in Computer Science"},{"issue":"4","key":"1301_CR31","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1002\/sam.11224","volume":"7","author":"C Seshadhri","year":"2014","unstructured":"Seshadhri C, Pinar A, Kolda TG (2014) Wedge sampling for computing clustering coefficients and triangle counts on large graphs. Stat Anal Data Min 7(4):294\u2013307","journal-title":"Stat Anal Data Min"},{"key":"1301_CR32","doi-asserted-by":"crossref","unstructured":"Shao Y, Cui B, Chen L, Ma L, Yao J, Xu N (2014) Parallel subgraph listing in a large-scale graph. In: SIGMOD, pp 625\u2013636","DOI":"10.1145\/2588555.2588557"},{"key":"1301_CR33","doi-asserted-by":"crossref","unstructured":"Suri S, Vassilvitskii S (2011) Counting triangles and the curse of the last reducer. In: WWW, pp 607\u2013614","DOI":"10.1145\/1963405.1963491"},{"key":"1301_CR34","unstructured":"Takac L, Zabovsky M (2012) Data analysis in public social networks. In: International scientific conference and international workshop present day trends of innovations, pp 1\u20136"},{"key":"1301_CR35","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE, Kang U, Miller GL, Faloutsos C (2009) Doulion: Counting triangles in massive graphs with a coin. In: KDD","DOI":"10.1145\/1557019.1557111"},{"issue":"2","key":"1301_CR36","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/2629564","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang P, Lui JC, Zhao J, Ribeiro B, Towsley D, Guan X (2014) Efficiently estimating motif statistics of large networks. TKDD 9(2):8:1\u20138:27","journal-title":"TKDD"},{"key":"1301_CR37","doi-asserted-by":"crossref","unstructured":"Wang P, Lui JCS, Towsley D (2015) Minfer: inferring motif statistics from sampled edges. In: ICDE","DOI":"10.1109\/ICDE.2016.7498312"},{"key":"1301_CR38","unstructured":"Wang P, Tao J, Zhao J, Guan X (2015) Moss: a scalable tool for efficiently sampling and counting 4- and 5-node graphlets. CoRR abs\/1509.08089. \n                    arXiv:1509.08089"},{"issue":"10","key":"1301_CR39","first-page":"2507","volume":"26","author":"B Wei","year":"2014","unstructured":"Wei B, Liu J, Ma J, Zheng Q, Zhang W, Feng B (2014) Motif-based hyponym relation extraction from wikipedia hyperlinks. TKDE 26(10):2507\u20132519","journal-title":"TKDE"},{"issue":"4","key":"1301_CR40","doi-asserted-by":"publisher","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"},{"key":"1301_CR41","doi-asserted-by":"crossref","unstructured":"Ye J, Cheng H, Zhu Z, Chen M (2013) Predicting positive and negative links in signed social networks by transfer learning. In: WWW, pp 1477\u20131488","DOI":"10.1145\/2488388.2488517"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1301-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-018-1301-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1301-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T19:23:01Z","timestamp":1576178581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-018-1301-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,13]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["1301"],"URL":"https:\/\/doi.org\/10.1007\/s10115-018-1301-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2018,12,13]]},"assertion":[{"value":"12 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}