{"id":"https://openalex.org/W2295190359","doi":"https://doi.org/10.1109/bigcomp.2016.7425950","title":"An efficient parallel graph clustering technique using Pregel","display_name":"An efficient parallel graph clustering technique using Pregel","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2295190359","doi":"https://doi.org/10.1109/bigcomp.2016.7425950","mag":"2295190359"},"language":"en","primary_location":{"id":"doi:10.1109/bigcomp.2016.7425950","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigcomp.2016.7425950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Big Data and Smart Computing (BigComp)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020793191","display_name":"Seok-Joo Lee","orcid":"https://orcid.org/0009-0003-7317-2583"},"institutions":[{"id":"https://openalex.org/I35886859","display_name":"Korea University of Technology and Education","ror":"https://ror.org/053nycv62","country_code":"KR","type":"education","lineage":["https://openalex.org/I35886859"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seok-Joo Lee","raw_affiliation_strings":["School of Computer Science and Engineering, KOREATECH, CheonAn, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, KOREATECH, CheonAn, Republic of Korea","institution_ids":["https://openalex.org/I35886859"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101607518","display_name":"Sungmin Kang","orcid":"https://orcid.org/0000-0002-0298-5320"},"institutions":[{"id":"https://openalex.org/I35886859","display_name":"Korea University of Technology and Education","ror":"https://ror.org/053nycv62","country_code":"KR","type":"education","lineage":["https://openalex.org/I35886859"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sungmin Kang","raw_affiliation_strings":["School of Computer Science and Engineering, KOREATECH, CheonAn, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, KOREATECH, CheonAn, Republic of Korea","institution_ids":["https://openalex.org/I35886859"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111301260","display_name":"Hong-Yeon Kim","orcid":"https://orcid.org/0000-0003-0452-6336"},"institutions":[{"id":"https://openalex.org/I35886859","display_name":"Korea University of Technology and Education","ror":"https://ror.org/053nycv62","country_code":"KR","type":"education","lineage":["https://openalex.org/I35886859"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hongyeon Kim","raw_affiliation_strings":["School of Computer Science and Engineering, KOREATECH, CheonAn, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, KOREATECH, CheonAn, Republic of Korea","institution_ids":["https://openalex.org/I35886859"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042408197","display_name":"Jun\u2010Ki Min","orcid":"https://orcid.org/0000-0003-3987-201X"},"institutions":[{"id":"https://openalex.org/I35886859","display_name":"Korea University of Technology and Education","ror":"https://ror.org/053nycv62","country_code":"KR","type":"education","lineage":["https://openalex.org/I35886859"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jun-Ki Min","raw_affiliation_strings":["School of Computer Science and Engineering, KOREATECH, CheonAn, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, KOREATECH, CheonAn, Republic of Korea","institution_ids":["https://openalex.org/I35886859"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I35886859"],"apc_list":null,"apc_paid":null,"fwci":0.3019,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61035318,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"370","last_page":"373"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7374167442321777},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7207089066505432},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6131134629249573},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5456188917160034},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.526354193687439},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.4946765601634979},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.46972572803497314},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.37417036294937134},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16438525915145874}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7374167442321777},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7207089066505432},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6131134629249573},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5456188917160034},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.526354193687439},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.4946765601634979},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.46972572803497314},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.37417036294937134},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16438525915145874},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigcomp.2016.7425950","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigcomp.2016.7425950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Big Data and Smart Computing (BigComp)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W192724328","https://openalex.org/W1664520935","https://openalex.org/W1736726159","https://openalex.org/W2034331023","https://openalex.org/W2045271686","https://openalex.org/W2057793636","https://openalex.org/W2132069633","https://openalex.org/W2152565070","https://openalex.org/W2170616854","https://openalex.org/W6607776381","https://openalex.org/W6679663036"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2389214306"],"abstract_inverted_index":{"To":[0,111],"represent":[1],"complex":[2],"structure,":[3],"graph":[4,20,22,34,40,73,89],"data":[5,41,61],"is":[6,24,80],"widely":[7],"used":[8],"in":[9,19,103],"diverse":[10],"applications.":[11],"Among":[12],"various":[13],"techniques":[14],"to":[15,62,142],"extract":[16],"meaningful":[17],"information":[18],"data,":[21],"clustering":[23,52,74,92],"an":[25,32,71],"important":[26],"task":[27],"for":[28,87],"the":[29,37,58,95,101,133],"discovery":[30],"of":[31,39,60,82,137],"underlying":[33],"structure.":[35],"However,":[36],"volume":[38],"becomes":[42],"large":[43],"and":[44,135],"increases":[45],"fast":[46],"recently":[47],"as":[48,50,57],"well":[49],"traditional":[51],"algorithms":[53],"become":[54],"computationally":[55],"expensive":[56],"size":[59],"be":[63],"clustered":[64],"increases.":[65],"In":[66,127],"this":[67],"paper,":[68],"we":[69,117,131],"propose":[70],"efficient":[72],"algorithm":[75,140],"running":[76],"on":[77],"Pregel":[78],"which":[79,120],"one":[81],"prominent":[83],"parallel":[84,139],"processing":[85],"models":[86],"large-scale":[88],"data.":[90],"Graph":[91],"technique":[93],"merges":[94],"nodes":[96,102,115],"into":[97],"clusters":[98],"such":[99],"that":[100],"a":[104],"cluster":[105],"are":[106],"strongly":[107,113],"connected":[108,114],"each":[109],"other.":[110],"seek":[112],"efficiently,":[116],"utilize":[118],"Min-Hash":[119],"calculates":[121],"similarity":[122],"between":[123],"vertices":[124],"and/or":[125],"clusters.":[126],"our":[128,138],"experimental":[129],"study,":[130],"demonstrate":[132],"efficiency":[134],"scalability":[136],"compared":[141],"existing":[143],"algorithms.":[144]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}