{"id":"https://openalex.org/W2586833130","doi":"https://doi.org/10.1504/ijbidm.2017.10003121","title":"Data Clustering Using Levy Flight and Local Memory Bees Algorithm","display_name":"Data Clustering Using Levy Flight and Local Memory Bees Algorithm","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2586833130","doi":"https://doi.org/10.1504/ijbidm.2017.10003121","mag":"2586833130"},"language":"en","primary_location":{"id":"doi:10.1504/ijbidm.2017.10003121","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijbidm.2017.10003121","pdf_url":null,"source":{"id":"https://openalex.org/S47982532","display_name":"International Journal of Business Intelligence and Data Mining","issn_l":"1743-8187","issn":["1743-8187","1743-8195"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Business Intelligence and Data Mining","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/A5028503071","display_name":"Nahlah M. Shatnawi","orcid":"https://orcid.org/0000-0003-4117-5707"},"institutions":[{"id":"https://openalex.org/I85507684","display_name":"Yarmouk University","ror":"https://ror.org/004mbaj56","country_code":"JO","type":"education","lineage":["https://openalex.org/I85507684"]}],"countries":["JO"],"is_corresponding":true,"raw_author_name":"Nahlah Shatnawi","raw_affiliation_strings":["Department of Computer Science, Yarmouk University, Irbid, Jordan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yarmouk University, Irbid, Jordan","institution_ids":["https://openalex.org/I85507684"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028503071"],"corresponding_institution_ids":["https://openalex.org/I85507684"],"apc_list":null,"apc_paid":null,"fwci":0.5851,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74189215,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9958999752998352,"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.9958999752998352,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.991599977016449,"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/T12761","display_name":"Data Stream Mining Techniques","score":0.9786999821662903,"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.7932497262954712},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7898355722427368},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.7351017594337463},{"id":"https://openalex.org/keywords/centroid","display_name":"Centroid","score":0.5915391445159912},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5350514650344849},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48291656374931335},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.4494662582874298},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4489096403121948},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4361320436000824},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.41144615411758423},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.34246352314949036},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.3051426112651825},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2650509178638458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1292402148246765}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7932497262954712},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7898355722427368},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.7351017594337463},{"id":"https://openalex.org/C146599234","wikidata":"https://www.wikidata.org/wiki/Q511093","display_name":"Centroid","level":2,"score":0.5915391445159912},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5350514650344849},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48291656374931335},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.4494662582874298},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4489096403121948},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4361320436000824},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.41144615411758423},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.34246352314949036},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.3051426112651825},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2650509178638458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1292402148246765},{"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/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijbidm.2017.10003121","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijbidm.2017.10003121","pdf_url":null,"source":{"id":"https://openalex.org/S47982532","display_name":"International Journal of Business Intelligence and Data Mining","issn_l":"1743-8187","issn":["1743-8187","1743-8195"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Business Intelligence and Data Mining","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":23,"referenced_works":["https://openalex.org/W183795708","https://openalex.org/W1537544648","https://openalex.org/W1585653628","https://openalex.org/W1594087472","https://openalex.org/W1725679015","https://openalex.org/W1803643184","https://openalex.org/W1890613635","https://openalex.org/W1967363471","https://openalex.org/W1976779966","https://openalex.org/W2002830978","https://openalex.org/W2019617030","https://openalex.org/W2028373980","https://openalex.org/W2071965987","https://openalex.org/W2087313087","https://openalex.org/W2088686019","https://openalex.org/W2125836634","https://openalex.org/W2136272140","https://openalex.org/W2157123205","https://openalex.org/W2163163936","https://openalex.org/W2168628751","https://openalex.org/W2304161989","https://openalex.org/W2334388407","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2559422900","https://openalex.org/W3144143113","https://openalex.org/W4306940721","https://openalex.org/W2160785859","https://openalex.org/W4301002638","https://openalex.org/W2892323093","https://openalex.org/W3120229345","https://openalex.org/W3022637481","https://openalex.org/W3088133960","https://openalex.org/W2374506950"],"abstract_inverted_index":{"One":[0],"of":[1,33,44,76,113],"the":[2,83,99,111,134],"most":[3],"popular":[4],"clustering":[5,18,56],"algorithms":[6],"is":[7,22,47,74,89],"K-":[8],"means":[9],"cluster":[10,65],"due":[11],"to":[12,48,81,97,109,119],"its":[13,60,106],"simplicity":[14],"and":[15,24,39,58,122,126,140],"efficiency.":[16],"Although":[17],"using":[19],"K-means":[20,125],"algorithm":[21,52,88,92,117,136],"fast":[23],"produces":[25],"good":[26],"results,":[27],"it":[28],"still":[29],"has":[30,94],"a":[31,50,90],"number":[32],"limitations":[34,57],"including":[35],"initial":[36,84],"centroid":[37,85],"selection":[38],"local":[40,100,107,142],"optima.":[41],"The":[42,115,130],"purpose":[43],"this":[45,68],"research":[46],"develop":[49],"hybrid":[51],"that":[53,133],"address":[54],"k-means":[55],"improve":[59],"performance":[61,139],"by":[62],"finding":[63],"optimal":[64],"centre.":[66],"In":[67],"paper,":[69],"L\u00e9vy-flights":[70],"or":[71],"L\u00e9vy":[72],"motion":[73],"one":[75],"non-Gaussian":[77],"random":[78],"processes":[79],"used":[80,103],"solve":[82],"problem.":[86,144],"Bees":[87,128],"population-based":[91],"which":[93],"been":[95],"proposed":[96,116,135],"overcome":[98],"optima":[101,143],"problem,":[102],"along":[104],"with":[105,124],"memory":[108],"enhance":[110],"efficiency":[112],"K-means.":[114],"applied":[118],"different":[120],"datasets":[121],"compared":[123],"basic":[127],"algorithm.":[129],"results":[131],"show":[132],"gives":[137],"better":[138],"avoid":[141]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}