{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T14:06:04Z","timestamp":1756994764618,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206238"},{"type":"electronic","value":"9783031206245"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20624-5_20","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"328-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Estimating the\u00a0Clustering Coefficient Using Sample Complexity Analysis"],"prefix":"10.1007","author":[{"given":"Alane M.","family":"de Lima","sequence":"first","affiliation":[]},{"given":"Murilo V. G.","family":"da Silva","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9 L.","family":"Vignatti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"20_CR1","volume-title":"Neural Network Learning: Theoretical Foundations","author":"M Anthony","year":"2009","unstructured":"Anthony, M., Bartlett, P.L.: Neural Network Learning: Theoretical Foundations, 1st edn. Cambridge University Press, New York (2009)","edition":"1"},{"key":"20_CR2","volume-title":"Network Science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si, A.L., P\u00f3sfai, M.: Network Science. Cambridge University Press, Cambridge (2016)"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1214\/12-AAP874","volume":"23","author":"M Bloznelis","year":"2013","unstructured":"Bloznelis, M.: Degree and clustering coefficient in sparse random intersection graphs. Ann. Appl. Probab. 23(3), 1254\u20131289 (2013)","journal-title":"Ann. Appl. Probab."},{"key":"20_CR4","unstructured":"Brautbar, M., Kearns, M.: Local algorithms for finding interesting individuals in large networks. In: Innovations in Computer Science (2010)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"de Lima, A.M., da Silva, M.V., Vignatti, A.L.: Percolation centrality via rademacher complexity. Discret. Appl. Math. (2021)","DOI":"10.1016\/j.dam.2021.07.023"},{"key":"20_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets - Reasoning About a Highly Connected World","author":"DA Easley","year":"2010","unstructured":"Easley, D.A., Kleinberg, J.M.: Networks, Crowds, and Markets - Reasoning About a Highly Connected World. Cambridge University Press, NY (2010)"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.046126","volume":"68","author":"A Fronczak","year":"2003","unstructured":"Fronczak, A., Fronczak, P., Ho\u0142yst, J.A.: Mean-field theory for clustering coefficients in Barab\u00e1si-Albert networks. Phys. Rev. E 68(4), 046126 (2003)","journal-title":"Phys. Rev. E"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, A.K., Sardana, N.: Significance of clustering coefficient over Jaccard Index. In: 2015 Eighth International Conference on Contemporary Computing (IC3), pp. 463\u2013466. IEEE (2015)","DOI":"10.1109\/IC3.2015.7346726"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1177\/104649647100200201","volume":"2","author":"PW Holland","year":"1971","unstructured":"Holland, P.W., Leinhardt, S.: Transitivity in structural models of small groups. Comp. Group Stud. 2(2), 107\u2013124 (1971)","journal-title":"Comp. Group Stud."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Iskhakov, L., Kami\u0144ski, B., Mironov, M., Pra\u0142at, P., Prokhorenkova, L.: Local clustering coefficient of spatial preferential attachment model. J. Complex Netw. 8(1), cnz019 (2020)","DOI":"10.1093\/comnet\/cnz019"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"142337","DOI":"10.1109\/ACCESS.2020.3013241","volume":"8","author":"Q Ji","year":"2020","unstructured":"Ji, Q., Li, D., Jin, Z.: Divisive algorithm based on node clustering coefficient for community detection. IEEE Access 8, 142337\u2013142347 (2020)","journal-title":"IEEE Access"},{"key":"20_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.csfx.2019.100004","volume":"1","author":"AP Kartun-Giles","year":"2019","unstructured":"Kartun-Giles, A.P., Bianconi, G.: Beyond the clustering coefficient: a topological analysis of node neighbourhoods in complex networks. Chaos Solit. Fractals: X 1, 100004 (2019)","journal-title":"Chaos Solit. Fractals: X"},{"issue":"5","key":"20_CR13","doi-asserted-by":"publisher","first-page":"S48","DOI":"10.1137\/13090729X","volume":"36","author":"TG Kolda","year":"2014","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T., Seshadhri, C., Task, C.: Counting triangles in massive graphs with MapReduce. SIAM J. Sci. Comput. 36(5), S48\u2013S77 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-26784-5_2","volume-title":"Algorithms and Models for the Web Graph","author":"A Krot","year":"2015","unstructured":"Krot, A., Ostroumova Prokhorenkova, L.: Local clustering coefficient in generalized preferential attachment models. In: Gleich, D.F., Komj\u00e1thy, J., Litvak, N. (eds.) WAW 2015. LNCS, vol. 9479, pp. 15\u201328. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26784-5_2"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Kutzkov, K., Pagh, R.: On the streaming complexity of computing local clustering coefficients. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 677\u2013686 (2013)","DOI":"10.1145\/2433396.2433480"},{"issue":"06","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1850118","DOI":"10.1142\/S0217979218501187","volume":"32","author":"M Li","year":"2018","unstructured":"Li, M., Zhang, R., Hu, R., Yang, F., Yao, Y., Yuan, Y.: Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient. Int. J. Mod. Phys. B 32(06), 1850118 (2018)","journal-title":"Int. J. Mod. Phys. B"},{"issue":"5","key":"20_CR17","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s11280-016-0420-2","volume":"20","author":"X Li","year":"2017","unstructured":"Li, X., Chang, L., Zheng, K., Huang, Z., Zhou, X.: Ranking weighted clustering coefficient in large dynamic graphs. World Wide Web 20(5), 855\u2013883 (2017)","journal-title":"World Wide Web"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1006\/jcss.2000.1741","volume":"62","author":"Y Li","year":"2001","unstructured":"Li, Y., Long, P.M., Srinivasan, A.: Improved bounds on the sample complexity of learning. J. Comput. Syst. Sci. 62(3), 516\u2013527 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"de Lima, A.M., da Silva, M.V., Vignatti, A.L.: Estimating the percolation centrality of large networks through pseudo-dimension theory. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1839\u20131847 (2020)","DOI":"10.1145\/3394486.3403235"},{"key":"20_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.122717","volume":"537","author":"S Liu","year":"2020","unstructured":"Liu, S., Xia, Z.: A two-stage BFS local community detection algorithm based on node transfer similarity and local clustering coefficient. Phys. A 537, 122717 (2020)","journal-title":"Phys. A"},{"key":"20_CR21","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"M Mitzenmacher","year":"2017","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis, 2nd edn. Cambridge University Press, New York (2017)","edition":"2"},{"key":"20_CR22","volume-title":"Foundations of Machine Learning","author":"M Mohri","year":"2012","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. The MIT Press, Cambridge (2012)"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.dam.2013.09.017","volume":"176","author":"MC Nascimento","year":"2014","unstructured":"Nascimento, M.C.: Community detection in networks via a spectral heuristic based on the clustering coefficient. Discret. Appl. Math. 176, 89\u201399 (2014)","journal-title":"Discret. Appl. Math."},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J.: Networks: an introduction. Oxford University Press (2010)","DOI":"10.1093\/acprof:oso\/9780199206650.003.0001"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"121586","DOI":"10.1109\/ACCESS.2019.2937580","volume":"7","author":"X Pan","year":"2019","unstructured":"Pan, X., Xu, G., Wang, B., Zhang, T.: A novel community detection algorithm based on local similarity of clustering coefficient in social networks. IEEE Access 7, 121586\u2013121598 (2019)","journal-title":"IEEE Access"},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10618-015-0423-0","volume":"30","author":"M Riondato","year":"2016","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Disc. 30(2), 438\u2013475 (2016)","journal-title":"Data Min. Knowl. Disc."},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Riondato, M., Upfal, E.: ABRA: approximating betweenness centrality in static and dynamic graphs with rademacher averages. ACM Trans. Knowl. Discov. Data 12(5), 61:1\u201361:38 (2018)","DOI":"10.1145\/3208351"},{"key":"20_CR28","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: Fast triangle counting through wedge sampling. In: Proceedings of the SIAM Conference on Data Mining, vol. 4, p. 5. Citeseer (2013)"},{"key":"20_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, New York (2014)"},{"issue":"5","key":"20_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.057101","volume":"71","author":"SN Soffer","year":"2005","unstructured":"Soffer, S.N., Vazquez, A.: Network clustering coefficient without degree-correlation biases. Phys. Rev. E 71(5), 057101 (2005)","journal-title":"Phys. Rev. E"},{"issue":"6684","key":"20_CR31","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"20_CR32","unstructured":"West, D.B.: Introduction to Graph Theory, 2 edn. Prentice Hall (2000)"},{"key":"20_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physa.2016.01.038","volume":"452","author":"Z Wu","year":"2016","unstructured":"Wu, Z., Lin, Y., Wang, J., Gregory, S.: Link prediction with node clustering coefficient. Phys. A 452, 1\u20138 (2016)","journal-title":"Phys. A"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-55699-4_23","volume-title":"Database Systems for Advanced Applications","author":"H Zhang","year":"2017","unstructured":"Zhang, H., Zhu, Y., Qin, L., Cheng, H., Yu, J.X.: Efficient local clustering coefficient estimation in massive graphs. In: Candan, S., Chen, L., Pedersen, T.B., Chang, L., Hua, W. (eds.) DASFAA 2017. LNCS, vol. 10178, pp. 371\u2013386. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55699-4_23"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, J., Tang, J., Ma, C., Tong, H., Jing, Y., Li, J.: Panther: fast top-k similarity search on large networks. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1445\u20131454 (2015)","DOI":"10.1145\/2783258.2783267"},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, R., Li, L., Bao, C., Zhou, L., Kong, B.: The community detection algorithm based on the node clustering coefficient and the edge clustering coefficient. In: Proceeding of the 11th World Congress on Intelligent Control and Automation, pp. 3240\u20133245. IEEE (2014)","DOI":"10.1109\/WCICA.2014.7053250"}],"container-title":["Lecture Notes in Computer Science","LATIN 2022: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20624-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T19:55:30Z","timestamp":1728244530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guanajuato","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/delta.cs.cinvestav.mx\/~francisco\/Latin22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}