{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:17:54Z","timestamp":1758273474565,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319914510"},{"type":"electronic","value":"9783319914527"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-91452-7_18","type":"book-chapter","created":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T06:43:19Z","timestamp":1526107399000},"page":"272-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["SSRW: A Scalable Algorithm for Estimating Graphlet Statistics Based on Random Walk"],"prefix":"10.1007","author":[{"given":"Chen","family":"Yang","sequence":"first","affiliation":[]},{"given":"Min","family":"Lyu","sequence":"additional","affiliation":[]},{"given":"Yongkun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Qianqian","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,13]]},"reference":[{"key":"18_CR1","unstructured":"https:\/\/tinyurl.com\/com-ssrw"},{"key":"18_CR2","first-page":"1","volume":"50","author":"NK Ahmed","year":"2016","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N.G., Willke, T.L.: Graphlet decomposition: framework, algorithms, and applications. Knowl. Inf. Syst. 50, 1\u201334 (2016)","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"18_CR3","first-page":"1","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. Combinatorics: Paul Erd\u00f6s Is Eighty 2(1), 1\u201346 (1993)","journal-title":"Combinatorics: Paul Erd\u00f6s Is Eighty"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bhuiyan, M.A., Rahman, M., Al Hasan, M.: Guise: uniform sampling of graphlets for large graph analysis. In: ICDM. IEEE (2012)","DOI":"10.1109\/ICDM.2012.87"},{"issue":"3","key":"18_CR5","first-page":"253","volume":"10","author":"X Chen","year":"2016","unstructured":"Chen, X., Li, Y., Wang, P., Lui, J.: A general framework for estimating graphlet statistics via random walk. VLDB 10(3), 253\u2013264 (2016)","journal-title":"VLDB"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., Lui, J.C.: Mining graphlet counts in online social networks. In: ICDM. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0018"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Han, G., Sethu, H.: Waddling random walk: fast and accurate mining of motif statistics in large graphs. In: ICDM. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0029"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Hardiman, S.J., Katzir, L.: Estimating clustering coefficients and size of social networks via random walk. In: WWW. ACM (2013)","DOI":"10.1145\/2488388.2488436"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1086\/224954","volume":"76","author":"PW Holland","year":"1970","unstructured":"Holland, P.W., Leinhardt, S.: A method for detecting structure in sociometric data. Am. J. Sociol. 76(3), 492\u2013513 (1970)","journal-title":"Am. J. Sociol."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: Path sampling: a fast and provable method for estimating 4-vertex subgraph counts. In: WWW. ACM (2015)","DOI":"10.1145\/2736277.2741101"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Lee, C.-H., Xu, X., Eun, D.Y.: Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling. In: SIGMETRICS (2012)","DOI":"10.1145\/2254756.2254795"},{"key":"18_CR12","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Lim, Y., Kang, U.: Mascot: memory-efficient and accurate sampling for counting local triangles in graph streams. In: KDD (2015)","DOI":"10.1145\/2783258.2783285"},{"issue":"2","key":"18_CR14","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.: RAGE-a rapid graphlet enumerator for large networks. Comput. Netw. 56(2), 810\u2013819 (2012)","journal-title":"Comput. Netw."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Milenkovic, T., Przulj, N.: Uncovering biological network function via graphlet degree signatures. arXiv preprint arXiv:0802.0556 (2008)","DOI":"10.4137\/CIN.S680"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: SIGCOMM. ACM (2007)","DOI":"10.1145\/1298306.1298311"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Peng, W., Gao, T., Sisodia, D., Saha, T.K., Li, F., Al Hasan, M.: ACTS: extracting android app topological signature through graphlet sampling. In: 2016 IEEE Conference on Communications and Network Security (CNS), pp. 37\u201345. IEEE (2016)","DOI":"10.1109\/CNS.2016.7860468"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: ESCAPE: efficiently counting all 5-vertex subgraphs. arXiv preprint arXiv:1610.09411 (2016)","DOI":"10.1145\/3038912.3052597"},{"issue":"18","key":"18_CR19","doi-asserted-by":"publisher","first-page":"3508","DOI":"10.1093\/bioinformatics\/bth436","volume":"20","author":"N Pr\u017eulj","year":"2004","unstructured":"Pr\u017eulj, N., Corneil, D.G., Jurisica, I.: Modeling interactome: scale-free or geometric? Bioinformatics 20(18), 3508\u20133515 (2004)","journal-title":"Bioinformatics"},{"issue":"10","key":"18_CR20","first-page":"2466","volume":"26","author":"M Rahman","year":"2014","unstructured":"Rahman, M., Bhuiyan, M.A., Al Hasan, M.: Graft: an efficient graphlet counting method for large graph analysis. TKDE 26(10), 2466\u20132478 (2014)","journal-title":"TKDE"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F.: G-tries: an efficient data structure for discovering network motifs. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 1559\u20131566. ACM (2010)","DOI":"10.1145\/1774088.1774422"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015). http:\/\/networkrepository.com\/socfb.php","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"18_CR23","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-16112-9_2","volume-title":"Complex Networks VI","author":"TK Saha","year":"2015","unstructured":"Saha, T.K., Hasan, M.A.: Finding network motifs using MCMC sampling. In: Mangioni, G., Simini, F., Uzzo, S.M., Wang, D. (eds.) Complex Networks VI. SCI, vol. 597, pp. 13\u201324. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16112-9_2"},{"key":"18_CR24","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. In: Artificial Intelligence and Statistics, pp. 488\u2013495 (2009)"},{"issue":"2","key":"18_CR25","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/2629564","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang, P., Lui, J., Ribeiro, B., Towsley, D., Zhao, J., Guan, X.: Efficiently estimating motif statistics of large networks. TKDD 9(2), 8 (2014)","journal-title":"TKDD"},{"key":"18_CR26","first-page":"73","volume":"30","author":"P Wang","year":"2017","unstructured":"Wang, P., Zhao, J., Zhang, X., Li, Z., Cheng, J., Lui, J.C., Towsley, D., Tao, J., Guan, X.: MOSS-5: a fast method of approximating counts of 5-node graphlets in large graphs. TKDE 30, 73\u201386 (2017)","journal-title":"TKDE"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91452-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:18:38Z","timestamp":1751635118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91452-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319914510","9783319914527"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91452-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ict.griffith.edu.au\/conferences\/dasfaa2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}