{"id":"https://openalex.org/W4417002495","doi":"https://doi.org/10.1109/tbdata.2025.3639917","title":"A Fast Linearithmic Graph Clustering Approach for Big Data Using Gravitational Attraction Principle","display_name":"A Fast Linearithmic Graph Clustering Approach for Big Data Using Gravitational Attraction Principle","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W4417002495","doi":"https://doi.org/10.1109/tbdata.2025.3639917"},"language":null,"primary_location":{"id":"doi:10.1109/tbdata.2025.3639917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tbdata.2025.3639917","pdf_url":null,"source":{"id":"https://openalex.org/S2491400915","display_name":"IEEE Transactions on Big Data","issn_l":"2332-7790","issn":["2332-7790","2372-2096"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Big Data","raw_type":"journal-article"},"type":"article","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/A5038026421","display_name":"Mohammad Maksood Akhter","orcid":"https://orcid.org/0000-0002-2539-1859"},"institutions":[{"id":"https://openalex.org/I193073490","display_name":"Siksha O Anusandhan University","ror":"https://ror.org/056ep7w45","country_code":"IN","type":"education","lineage":["https://openalex.org/I193073490"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mohammad Maksood Akhter","raw_affiliation_strings":["Department of Computer Science and Engineering, Shiksha ‘O’ Anusandhan (Deemed to be University), Bhubneshwar, Odisha, India","Department of Computer Science and Engineering, Shiksha ‘o’ Anusandhan (Deemed to be University), Bhubneshwar, Odisha, India"],"raw_orcid":"https://orcid.org/0000-0002-2539-1859","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Shiksha ‘O’ Anusandhan (Deemed to be University), Bhubneshwar, Odisha, India","institution_ids":["https://openalex.org/I193073490"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Shiksha ‘o’ Anusandhan (Deemed to be University), Bhubneshwar, Odisha, India","institution_ids":["https://openalex.org/I193073490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089497134","display_name":"Abdul Atif Khan","orcid":null},"institutions":[{"id":"https://openalex.org/I207223250","display_name":"Indian Institute of Information Technology Design and Manufacturing Jabalpur","ror":"https://ror.org/00gmd7q80","country_code":"IN","type":"education","lineage":["https://openalex.org/I207223250"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Abdul Atif Khan","raw_affiliation_strings":["PDPM Indian Institute of Information Technology, Design and Manufacturing, Jabalpur, Madhya Pradesh, India"],"raw_orcid":"https://orcid.org/0009-0006-7943-6545","affiliations":[{"raw_affiliation_string":"PDPM Indian Institute of Information Technology, Design and Manufacturing, Jabalpur, Madhya Pradesh, India","institution_ids":["https://openalex.org/I207223250"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Rashmi Maheshwari","orcid":null},"institutions":[{"id":"https://openalex.org/I193073490","display_name":"Siksha O Anusandhan University","ror":"https://ror.org/056ep7w45","country_code":"IN","type":"education","lineage":["https://openalex.org/I193073490"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rashmi Maheshwari","raw_affiliation_strings":["Department of Computer Science and Engineering, Shiksha ‘O’ Anusandhan (Deemed to be University), Bhubneshwar, Odisha, India","Department of Computer Science and Engineering, Shiksha ‘o’ Anusandhan (Deemed to be University), Bhubneshwar, Odisha, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Shiksha ‘O’ Anusandhan (Deemed to be University), Bhubneshwar, Odisha, India","institution_ids":["https://openalex.org/I193073490"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Shiksha ‘o’ Anusandhan (Deemed to be University), Bhubneshwar, Odisha, India","institution_ids":["https://openalex.org/I193073490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000674132","display_name":"Sraban Kumar Mohanty","orcid":"https://orcid.org/0000-0001-9203-7174"},"institutions":[{"id":"https://openalex.org/I207223250","display_name":"Indian Institute of Information Technology Design and Manufacturing Jabalpur","ror":"https://ror.org/00gmd7q80","country_code":"IN","type":"education","lineage":["https://openalex.org/I207223250"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sraban Kumar Mohanty","raw_affiliation_strings":["PDPM Indian Institute of Information Technology, Design and Manufacturing, Jabalpur, Madhya Pradesh, India"],"raw_orcid":"https://orcid.org/0000-0001-9203-7174","affiliations":[{"raw_affiliation_string":"PDPM Indian Institute of Information Technology, Design and Manufacturing, Jabalpur, Madhya Pradesh, India","institution_ids":["https://openalex.org/I207223250"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2282,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.86445761,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"12","issue":"2","first_page":"661","last_page":"673"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.6642000079154968,"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"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.6642000079154968,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0940999984741211,"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.026799999177455902,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8353999853134155},{"id":"https://openalex.org/keywords/big-data","display_name":"Big data","score":0.5539000034332275},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5422999858856201},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4772999882698059},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.4708999991416931},{"id":"https://openalex.org/keywords/consensus-clustering","display_name":"Consensus clustering","score":0.4544999897480011},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.42410001158714294},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4108000099658966}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8353999853134155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7373999953269958},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.5539000034332275},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5422999858856201},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4772999882698059},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.4708999991416931},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4607999920845032},{"id":"https://openalex.org/C186767784","wikidata":"https://www.wikidata.org/wiki/Q5162841","display_name":"Consensus clustering","level":5,"score":0.4544999897480011},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.42410001158714294},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4108000099658966},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39969998598098755},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.39579999446868896},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.364300012588501},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.33169999718666077},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.3303999900817871},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.31040000915527344},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.3003999888896942},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.272599995136261},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.265500009059906},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.2549999952316284},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tbdata.2025.3639917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tbdata.2025.3639917","pdf_url":null,"source":{"id":"https://openalex.org/S2491400915","display_name":"IEEE Transactions on Big Data","issn_l":"2332-7790","issn":["2332-7790","2372-2096"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Big Data","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1466719059","https://openalex.org/W1489405128","https://openalex.org/W1988187701","https://openalex.org/W1992419399","https://openalex.org/W1998871699","https://openalex.org/W2011430131","https://openalex.org/W2051224630","https://openalex.org/W2084224084","https://openalex.org/W2084642062","https://openalex.org/W2088470289","https://openalex.org/W2141585940","https://openalex.org/W2156090204","https://openalex.org/W2167929847","https://openalex.org/W2399495295","https://openalex.org/W2793947018","https://openalex.org/W2891815414","https://openalex.org/W2940439836","https://openalex.org/W2949597887","https://openalex.org/W2994497769","https://openalex.org/W2997591727","https://openalex.org/W3020391806","https://openalex.org/W3025751404","https://openalex.org/W3087330142","https://openalex.org/W3121183267","https://openalex.org/W3193643434","https://openalex.org/W4213418104","https://openalex.org/W4220942341","https://openalex.org/W4285113998","https://openalex.org/W4295736907","https://openalex.org/W4317611850","https://openalex.org/W4367663440","https://openalex.org/W4384285155","https://openalex.org/W4403123685"],"related_works":[],"abstract_inverted_index":{"With":[0],"the":[1,42,79,161,179,203,246,249,252],"exponential":[2],"growth":[3],"of":[4,82,120,163,181,205,251],"Big":[5,36,260],"Data":[6,37,261],"in":[7,35,138],"domains":[8],"such":[9],"as":[10,91],"healthcare,":[11],"genomics,":[12],"and":[13,18,103,141,224,248],"sensor":[14],"networks,":[15],"computationally":[16],"efficient":[17],"effective":[19],"clustering":[20,30,54,88,129,136,152,231],"techniques":[21,110],"have":[22],"become":[23],"essential":[24],"for":[25,259],"uncovering":[26],"meaningful":[27],"patterns.":[28],"Traditional":[29],"methods":[31,67],"face":[32],"fundamental":[33],"limitations":[34],"analysis.":[38],"K-means":[39],"is":[40,123],"among":[41],"fastest":[43],"known":[44],"approaches,":[45,226],"but":[46,59],"it":[47,256],"fails":[48],"to":[49,77,96,99,124,173,188],"capture":[50,78,190],"non-spherical":[51],"clusters.":[52],"Hierarchical":[53],"can":[55],"detect":[56],"arbitrary":[57],"shapes":[58],"suffers":[60],"from":[61],"sub-cubic":[62],"complexity,":[63,114],"while":[64,134,233],"many":[65],"state-of-the-art":[66,225],"still":[68],"incur":[69,112],"quadratic":[70,113],"complexity.":[71],"Moreover,":[72],"most":[73],"existing":[74,108],"approaches":[75],"fail":[76],"intrinsic":[80],"structure":[81],"data.":[83],"In":[84],"this":[85,121],"context,":[86],"graph-based":[87,109,128],"has":[89],"emerged":[90],"a":[92,126,149,169,182,198],"powerful":[93],"alternative":[94],"due":[95],"its":[97],"ability":[98],"model":[100],"geometric":[101],"relationships":[102],"reveal":[104],"underlying":[105],"structures.":[106],"However,":[107],"typically":[111],"limiting":[115],"their":[116],"scalability.":[117],"The":[118,166],"objective":[119],"work":[122],"develop":[125],"scalable":[127],"framework":[130,153],"that":[131,218],"reduces":[132],"complexity":[133],"preserving":[135],"quality":[137],"large,":[139],"noisy,":[140],"high-dimensional":[142],"datasets.":[143],"To":[144],"achieve":[145],"this,":[146],"we":[147],"propose":[148],"fast":[150],"graph":[151,184],"with":[154,208],"overall":[155],"complexity$\\mathcal":[156],"{O}(N":[157],"\\lg":[158],"N)$,":[159],"where$N$denotes":[160],"number":[162],"data":[164],"points.":[165],"method":[167,220],"employs":[168],"two-stage":[170],"dispersion-based":[171],"partitioning":[172],"generate":[174],"cohesive":[175],"sub-clusters,":[176],"followed":[177],"by":[178,236],"construction":[180],"sparse":[183],"on":[185,213,240],"sub-cluster":[186],"centers":[187],"efficiently":[189],"adjacency.":[191],"Sub-clusters":[192],"are":[193],"then":[194],"merged":[195],"iteratively":[196],"using":[197],"gravitational-force-inspired":[199],"attraction":[200],"model,":[201],"enabling":[202],"discovery":[204],"coherent":[206],"structures":[207],"reduced":[209],"computation.":[210],"Extensive":[211],"experiments":[212],"41":[214],"multi-scale":[215],"datasets":[216],"demonstrate":[217],"our":[219],"consistently":[221],"outperforms":[222],"traditional":[223],"achieving":[227],"average":[228],"27.33%":[229],"higher":[230],"accuracy":[232],"reducing":[234],"runtime":[235],"more":[237],"than":[238],"86.64%":[239],"average.":[241],"These":[242],"results":[243],"highlight":[244],"both":[245],"innovation":[247],"effectiveness":[250],"proposed":[253],"approach,":[254],"making":[255],"highly":[257],"suitable":[258],"analytics.":[262]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-12-04T00:00:00"}