{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T13:18:49Z","timestamp":1722950329441},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T00:00:00Z","timestamp":1491955200000},"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":["J Supercomput"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s11227-017-2040-8","type":"journal-article","created":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T18:17:40Z","timestamp":1492021060000},"page":"4683-4710","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["CCFinder: using Spark to find clustering coefficient in big graphs"],"prefix":"10.1007","volume":"73","author":[{"given":"Mehdi","family":"Alemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hassan","family":"Haghighi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Shahrivari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"issue":"6684","key":"2040_CR1","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"2","key":"2040_CR2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"4","key":"2040_CR3","doi-asserted-by":"crossref","first-page":"045101","DOI":"10.1103\/PhysRevE.69.045101","volume":"69","author":"BJ Kim","year":"2004","unstructured":"Kim BJ (2004) Performance of networks of artificial neurons: the role of clustering. Phys Rev E 69(4):045101","journal-title":"Phys Rev E"},{"issue":"5996","key":"2040_CR4","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1126\/science.1185231","volume":"329","author":"D Centola","year":"2010","unstructured":"Centola D (2010) The spread of behavior in an online social network experiment. Science 329(5996):1194\u20131197","journal-title":"Science"},{"key":"2040_CR5","unstructured":"Huang Z (2006) Link prediction based on graph topology: the predictive value of generalized clustering coefficient. Paper presented at the Workshop on Link Analysis: Dynamics and Static of Large Networks (LinkKDD2006)"},{"key":"2040_CR6","first-page":"1307","volume":"5","author":"R Goldstein","year":"2013","unstructured":"Goldstein R, Vitevitch MS (2013) The influence of clustering coefficient on word-learning: how groups of similar sounding words facilitate acquisition. Front Psychol 5:1307\u20131307","journal-title":"Front Psychol"},{"issue":"5","key":"2040_CR7","doi-asserted-by":"crossref","first-page":"058701","DOI":"10.1103\/PhysRevLett.103.058701","volume":"103","author":"ME Newman","year":"2009","unstructured":"Newman ME (2009) Random graphs with clustering. Phys Rev Lett 103(5):058701","journal-title":"Phys Rev Lett"},{"key":"2040_CR8","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.physa.2004.04.110","volume":"341","author":"J Saram\u00e4ki","year":"2004","unstructured":"Saram\u00e4ki J, Kaski K (2004) Scale-free networks generated by random walkers. Phys A Stat Mech Appl 341:80\u201386","journal-title":"Phys A Stat Mech Appl"},{"issue":"6","key":"2040_CR9","doi-asserted-by":"crossref","first-page":"066122","DOI":"10.1103\/PhysRevE.65.066122","volume":"65","author":"SN Dorogovtsev","year":"2002","unstructured":"Dorogovtsev SN, Goltsev AV, Mendes JFF (2002) Pseudofractal scale-free web. Phys Rev E 65(6):066122","journal-title":"Phys Rev E"},{"key":"2040_CR10","doi-asserted-by":"crossref","unstructured":"Suri S, Vassilvitskii S (2011) Counting triangles and the curse of the last reducer. In: Proceedings of the 20th International Conference on World Wide Web, 2011. ACM, pp 607\u2013614","DOI":"10.1145\/1963405.1963491"},{"key":"2040_CR11","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/107","volume-title":"Complex graphs and networks","author":"FR Chung","year":"2006","unstructured":"Chung FR, Lu L (2006) Complex graphs and networks, vol 107. American Mathematical Society, Providence"},{"issue":"5594","key":"2040_CR12","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":"2040_CR13","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon S (2010) What is Twitter, a social network or a news media? In: Proceedings of the 19th International Conference on World Wide Web, 2010. ACM, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"issue":"1","key":"2040_CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1186\/1471-2105-6-270","volume":"6","author":"P Ye","year":"2005","unstructured":"Ye P, Peyser BD, Spencer FA, Bader JS (2005) Commensurate distances and similar motifs in genetic congruence and protein interaction networks in yeast. BMC Bioinform 6(1):270","journal-title":"BMC Bioinform"},{"key":"2040_CR15","volume-title":"Hadoop: the definitive guide","author":"T White","year":"2012","unstructured":"White T (2012) Hadoop: the definitive guide. O\u2019Reilly Media, Newton"},{"issue":"10\u201310","key":"2040_CR16","first-page":"95","volume":"10","author":"M Zaharia","year":"2010","unstructured":"Zaharia M, Chowdhury M, Franklin MJ, Shenker S, Stoica I (2010) Spark: cluster computing with working sets. HotCloud 10(10\u201310):95","journal-title":"HotCloud"},{"issue":"34","key":"2040_CR17","first-page":"1","volume":"17","author":"X Meng","year":"2016","unstructured":"Meng X, Bradley J, Yavuz B, Sparks E, Venkataraman S, Liu D, Freeman J, Tsai D, Amde M, Owen S (2016) Mllib: machine learning in apache spark. J Mach Learn Res 17(34):1\u20137","journal-title":"J Mach Learn Res"},{"key":"2040_CR18","doi-asserted-by":"crossref","unstructured":"Chen J, Li K, Tang Z, Bilal K, Yu S, Weng C, Li K (2017) A parallel random forest algorithm for big data in a Spark cloud computing environment. IEEE Trans Parallel Distrib Syst 28(4):919\u2013933","DOI":"10.1109\/TPDS.2016.2603511"},{"issue":"1","key":"2040_CR19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"2040_CR20","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, 2010. ACM, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"issue":"2","key":"2040_CR21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00778-015-0405-2","volume":"25","author":"A Quamar","year":"2016","unstructured":"Quamar A, Deshpande A, Lin J (2016) NScale: neighborhood-centric large-scale graph analytics in the cloud. VLDB J 25(2):125\u2013150","journal-title":"VLDB J"},{"issue":"8","key":"2040_CR22","doi-asserted-by":"crossref","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low Y, Bickson D, Gonzalez J, Guestrin C, Kyrola A, Hellerstein JM (2012) Distributed GraphLab: a framework for machine learning and data mining in the cloud. Proc VLDB Endow 5(8):716\u2013727","journal-title":"Proc VLDB Endow"},{"key":"2040_CR23","unstructured":"Gonzalez JE, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) GraphX: graph processing in a distributed dataflow framework. In: OSDI, 2014, pp 599\u2013613"},{"key":"2040_CR24","doi-asserted-by":"crossref","unstructured":"Quamar A, Deshpande A (2016) NScaleSpark: subgraph-centric graph analytics on Apache Spark. In: Proceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics, 2016. ACM, p 5","DOI":"10.1145\/2980523.2980529"},{"issue":"5","key":"2040_CR25","doi-asserted-by":"crossref","first-page":"057101","DOI":"10.1103\/PhysRevE.71.057101","volume":"71","author":"SN Soffer","year":"2005","unstructured":"Soffer SN, Vazquez A (2005) Network clustering coefficient without degree-correlation biases. Phys Rev E 71(5):057101","journal-title":"Phys Rev E"},{"key":"2040_CR26","unstructured":"Spark: Lightning-fast cluster computing, http:\/\/spark.apache.org\/docs\/latest\/programming-guide.html . Accessed 1 Oct 2016"},{"key":"2040_CR27","doi-asserted-by":"crossref","unstructured":"Ortmann M, Brandes U (2014) Triangle listing algorithms: back from the diversion. In: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 2014. SIAM, pp 1\u20138","DOI":"10.1137\/1.9781611973198.1"},{"key":"2040_CR28","doi-asserted-by":"crossref","unstructured":"Schank T (2007) Algorithmic aspects of triangle-based network analysis. Dissertation, University Karlsruhe","DOI":"10.1155\/2007\/52861"},{"key":"2040_CR29","doi-asserted-by":"crossref","unstructured":"Schank T, Wagner D (2005) counting and listing all triangles in large graphs, an experimental study. In: International Workshop on Experimental and Efficient Algorithms, 2005. Springer, pp 606\u2013609","DOI":"10.1007\/11427186_54"},{"issue":"1\u20133","key":"2040_CR30","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy M (2008) Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor Comput Sci 407(1\u20133):458\u2013473","journal-title":"Theor Comput Sci"},{"issue":"4","key":"2040_CR31","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai A, Rodeh M (1978) Finding a minimum circuit in a graph. SIAM J Comput 7(4):413\u2013423","journal-title":"SIAM J Comput"},{"key":"2040_CR32","doi-asserted-by":"crossref","unstructured":"Arifuzzaman S, Khan M, Marathe M (2013) PATRIC: a parallel algorithm for counting triangles in massive networks. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, 2013. ACM, pp 529\u2013538","DOI":"10.1145\/2505515.2505545"},{"issue":"4","key":"2040_CR33","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen J (2009) Graph twiddling in a mapreduce world. Comput Sci Eng 11(4):29\u201341","journal-title":"Comput Sci Eng"},{"key":"2040_CR34","doi-asserted-by":"crossref","unstructured":"Park H-M, Silvestri F, Kang U, Pagh R (2014) Mapreduce triangle enumeration with guarantees. In: Proceedings of the 23rd ACM International Conference on Information and Knowledge Management, 2014. ACM, pp 1739\u20131748","DOI":"10.1145\/2661829.2662017"},{"key":"2040_CR35","doi-asserted-by":"crossref","unstructured":"Park H-M, Chung C-W (2013) An efficient MapReduce algorithm for counting triangles in a very large graph. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, 2013. ACM, pp 539\u2013548","DOI":"10.1145\/2505515.2505563"},{"key":"2040_CR36","unstructured":"Apache Giraph, http:\/\/giraph.apache.org\/ . Accessed 1 Oct 2016"},{"key":"2040_CR37","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) PowerGraph: distributed graph-parallel computation on natural graphs. In: OSDI, 2012, vol 1, p 2"},{"key":"2040_CR38","doi-asserted-by":"crossref","unstructured":"Quick L, Wilkinson P, Hardcastle D (2012) Using pregel-like large scale graph processing frameworks for social network analysis. In: Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012), 2012. IEEE Computer Society, pp 457\u2013463","DOI":"10.1109\/ASONAM.2012.254"},{"key":"2040_CR39","unstructured":"SNAP: Stanford Network Analysis Project. http:\/\/snap.stanford.edu . Accessed 1 Oct 2016"},{"issue":"1","key":"2040_CR40","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"key":"2040_CR41","doi-asserted-by":"crossref","unstructured":"Backstrom L, Huttenlocher D, Kleinberg J, Lan X (2006) Group formation in large social networks: membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006. ACM, pp 44\u201354","DOI":"10.1145\/1150402.1150412"},{"issue":"10\u201317","key":"2040_CR42","first-page":"30","volume":"10","author":"M Cha","year":"2010","unstructured":"Cha M, Haddadi H, Benevenuto F, Gummadi PK (2010) Measuring user influence in twitter: the million follower fallacy. ICWSM 10(10\u201317):30","journal-title":"ICWSM"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-2040-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2040-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2040-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T00:40:39Z","timestamp":1569026439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-2040-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,12]]},"references-count":42,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2040"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-2040-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,12]]}}}