{"id":"https://openalex.org/W2897307453","doi":"https://doi.org/10.1109/icci-cc.2018.8482030","title":"Hybrid Air Mass Collision Based Optimization Algorithm for Data Cluster Problems","display_name":"Hybrid Air Mass Collision Based Optimization Algorithm for Data Cluster Problems","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2897307453","doi":"https://doi.org/10.1109/icci-cc.2018.8482030","mag":"2897307453"},"language":"en","primary_location":{"id":"doi:10.1109/icci-cc.2018.8482030","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icci-cc.2018.8482030","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 17th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","raw_type":"proceedings-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/A5086537011","display_name":"Ravi Kumar Saidala","orcid":"https://orcid.org/0000-0002-3658-6651"},"institutions":[{"id":"https://openalex.org/I177001074","display_name":"Acharya Nagarjuna University","ror":"https://ror.org/02mfapa96","country_code":"IN","type":"education","lineage":["https://openalex.org/I177001074"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Ravi Kumar Saidala","raw_affiliation_strings":["Department of Computer Science and Engineering, Acharya Nagarjuna University, Nagarjuna Nagar, Guntur, AP, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Acharya Nagarjuna University, Nagarjuna Nagar, Guntur, AP, India","institution_ids":["https://openalex.org/I177001074"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nagaraiu Devarakonda","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nagaraiu Devarakonda","raw_affiliation_strings":["Department of Information technology, LBR College of Engineering LBR, Nagar, Mylavaram, AP, India"],"affiliations":[{"raw_affiliation_string":"Department of Information technology, LBR College of Engineering LBR, Nagar, Mylavaram, AP, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110580192","display_name":"Raviteja Kamaraiugadda","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raviteja Kamaraiugadda","raw_affiliation_strings":["Department of Information technology, LBR College of Engineering LBR, Nagar, Mylavaram, AP, India"],"affiliations":[{"raw_affiliation_string":"Department of Information technology, LBR College of Engineering LBR, Nagar, Mylavaram, AP, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086537011"],"corresponding_institution_ids":["https://openalex.org/I177001074"],"apc_list":null,"apc_paid":null,"fwci":0.6769,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78160636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":null,"first_page":"507","last_page":"516"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9797000288963318,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12761","display_name":"Data Stream Mining Techniques","score":0.9686999917030334,"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/cluster-analysis","display_name":"Cluster analysis","score":0.8190330266952515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7269413471221924},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5814188718795776},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5779683589935303},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5276728272438049},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45993947982788086},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4442136883735657},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4385031759738922},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.42229336500167847},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27538010478019714},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.09817376732826233}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8190330266952515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7269413471221924},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5814188718795776},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5779683589935303},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5276728272438049},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45993947982788086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4442136883735657},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4385031759738922},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.42229336500167847},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27538010478019714},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.09817376732826233},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icci-cc.2018.8482030","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icci-cc.2018.8482030","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 17th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","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":29,"referenced_works":["https://openalex.org/W1570448133","https://openalex.org/W1964946597","https://openalex.org/W1984762043","https://openalex.org/W2013858170","https://openalex.org/W2026107899","https://openalex.org/W2028944928","https://openalex.org/W2072955302","https://openalex.org/W2076408892","https://openalex.org/W2097612618","https://openalex.org/W2146016260","https://openalex.org/W2152610622","https://openalex.org/W2154929945","https://openalex.org/W2188959807","https://openalex.org/W2290883490","https://openalex.org/W2612800285","https://openalex.org/W2618873858","https://openalex.org/W2768980160","https://openalex.org/W2776591644","https://openalex.org/W2778447675","https://openalex.org/W2786508967","https://openalex.org/W2886201129","https://openalex.org/W4211183651","https://openalex.org/W4241582122","https://openalex.org/W4367305637","https://openalex.org/W6681686742","https://openalex.org/W6682642761","https://openalex.org/W6737448885","https://openalex.org/W6748012369","https://openalex.org/W6754058758"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W2745001401","https://openalex.org/W4321353415","https://openalex.org/W2130974462","https://openalex.org/W972276598","https://openalex.org/W4246352526","https://openalex.org/W2028665553","https://openalex.org/W2019538911","https://openalex.org/W1996805379","https://openalex.org/W4234584818"],"abstract_inverted_index":{"In":[0,64,177],"data":[1,7,37,59,128,174,222],"mining,":[2],"clustering":[3,129,175,191,223],"is":[4,40,105,162,218],"an":[5],"important":[6],"analysis":[8,204],"concept.":[9],"It":[10],"plays":[11],"a":[12,106],"vital":[13],"role":[14,79],"in":[15,61,80,137,156,190,198],"extracting":[16],"the":[17,29,50,58,116,141,157,188,195,213],"useful":[18],"hidden":[19],"knowledge":[20],"from":[21],"large":[22],"input":[23,30],"datasets.":[24],"This":[25,110],"unsupervised":[26],"technique":[27],"partitions":[28],"dataset":[31],"into":[32,42,91],"groups":[33],"called":[34],"clusters.":[35,63],"The":[36],"objects":[38,51,60],"mapping":[39],"done":[41],"clusters":[43,45,83,104],"such":[44],"should":[46],"maintain":[47],"similarity":[48],"between":[49,57],"within":[52],"same":[53],"cluster":[54],"and":[55,74,200,205,210],"dissimilarity":[56],"different":[62],"this":[65,135],"process":[66],"factors":[67],"like":[68],"distance":[69,182,227],"measuring":[70,183,228],"techniques,":[71],"initial":[72],"conditions":[73],"criterion":[75],"functions":[76,153],"playa":[77],"key":[78],"finding":[81,102],"optimal":[82,103],"of":[84,97,115,215],"data.":[85],"Many":[86],"optimization":[87,98,146],"algorithms":[88],"have":[89,207],"come":[90],"existence":[92],"to":[93,179,186],"resolve":[94],"these":[95],"types":[96],"problems.":[99,176],"But":[100],"still":[101],"big":[107],"challenging":[108],"task.":[109],"work":[111,136],"presents":[112],"hybrid":[113],"version":[114],"recently":[117],"devised":[118],"nature-inspired":[119],"algorithm":[120],"i.e.":[121],"Tornadogenesis":[122,167],"Optimization":[123,168],"Algorithm":[124,169],"(TOA)":[125],"for":[126,145],"solving":[127,221],"problems":[130,224],"using":[131,225],"BB-BC.":[132],"We":[133,193],"framed":[134],"two":[138],"phases":[139],"wherein":[140],"first":[142],"phase":[143,159],"testing":[144],"performance":[147,214],"on":[148,171],"23":[149],"standard":[150],"mathematical":[151],"benchmark":[152],"took":[154],"place,":[155],"second":[158],"numerical":[160],"ability":[161],"tested":[163],"by":[164],"applying":[165],"hybridized":[166],"(HTOA)":[170],"10":[172],"real-world":[173],"addition":[178],"that":[180,212],"various":[181],"techniques":[184],"used":[185],"test":[187],"improvement":[189],"performance.":[192],"portrayed":[194],"obtained":[196],"results":[197],"tabular":[199],"graphical":[201],"forms.":[202],"Various":[203],"comparisons":[206],"been":[208],"made":[209],"found":[211],"proposed":[216],"HTOA":[217],"good":[219],"at":[220],"Euclidean":[226],"technique.":[229]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}