{"id":"https://openalex.org/W3117221069","doi":"https://doi.org/10.1109/icrcicn50933.2020.9296186","title":"Entropy-Based Feature Selection for Data Clustering Using k-Means and k-Medoids Algorithms","display_name":"Entropy-Based Feature Selection for Data Clustering Using k-Means and k-Medoids Algorithms","publication_year":2020,"publication_date":"2020-11-26","ids":{"openalex":"https://openalex.org/W3117221069","doi":"https://doi.org/10.1109/icrcicn50933.2020.9296186","mag":"3117221069"},"language":"en","primary_location":{"id":"doi:10.1109/icrcicn50933.2020.9296186","doi":"https://doi.org/10.1109/icrcicn50933.2020.9296186","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icrcicn50933.2020.9296186","pdf_url":null,"source":{"id":"https://openalex.org/S7407088726","display_name":"International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 Fifth International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5015090821","display_name":"Moni Kishore Dhar","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I885507782","display_name":"East West University","ror":"https://ror.org/05p0tzt32","country_code":"BD","type":"education","lineage":["https://openalex.org/I885507782"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Moni Kishore Dhar","raw_affiliation_strings":["East West University, Dhaka, Bangladesh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"East West University, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I885507782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046881026","display_name":"S. M. Nahid Hasan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I885507782","display_name":"East West University","ror":"https://ror.org/05p0tzt32","country_code":"BD","type":"education","lineage":["https://openalex.org/I885507782"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"S. M. Nahid Hasan","raw_affiliation_strings":["East West University, Dhaka, Bangladesh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"East West University, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I885507782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023173353","display_name":"Tahsin Rahaman Otushi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I885507782","display_name":"East West University","ror":"https://ror.org/05p0tzt32","country_code":"BD","type":"education","lineage":["https://openalex.org/I885507782"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Tahsin Rahaman Otushi","raw_affiliation_strings":["East West University, Dhaka, Bangladesh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"East West University, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I885507782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072551095","display_name":"Musharrat Khan","orcid":"https://orcid.org/0009-0006-8320-1087","observed_orcids":["https://orcid.org/0009-0006-8320-1087"]},"institutions":[{"id":"https://openalex.org/I885507782","display_name":"East West University","ror":"https://ror.org/05p0tzt32","country_code":"BD","type":"education","lineage":["https://openalex.org/I885507782"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Musharrat Khan","raw_affiliation_strings":["East West University, Dhaka, Bangladesh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"East West University, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I885507782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I885507782"],"apc_list":null,"apc_paid":null,"fwci":0.2388,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.4630955,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"36","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9922000169754028,"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.9922000169754028,"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/T13373","display_name":"Data Mining and Machine Learning Applications","score":0.003100000089034438,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10057","display_name":"Face and Expression Recognition","score":0.0020000000949949026,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/entropy-based-feature-selection","display_name":"entropy-based feature selection","score":0.9430000185966492},{"id":"https://openalex.org/keywords/clustering","display_name":"clustering","score":0.8429999947547913},{"id":"https://openalex.org/keywords/k-means-clustering","display_name":"K-means clustering","score":0.8960000276565552},{"id":"https://openalex.org/keywords/k-medoids-clustering","display_name":"K-medoids clustering","score":0.9789999723434448},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"dimensionality reduction","score":0.9409999847412109},{"id":"https://openalex.org/keywords/high-dimensional-data","display_name":"high-dimensional data","score":0.8560000061988831},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.9779999852180481},{"id":"https://openalex.org/keywords/manhattan-distance","display_name":"Manhattan distance","score":0.8790000081062317},{"id":"https://openalex.org/keywords/clustering-accuracy","display_name":"clustering accuracy","score":0.8489999771118164}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8636483550071716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6189140677452087},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.6043118238449097},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.6008232235908508},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5902547836303711},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5878310203552246},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.5694044828414917},{"id":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","display_name":"k-medoids","level":5,"score":0.521369993686676},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5104257464408875},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.509732186794281},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5075994729995728},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.48916080594062805},{"id":"https://openalex.org/C63085389","wikidata":"https://www.wikidata.org/wiki/Q4287912","display_name":"Medoid","level":3,"score":0.46018606424331665},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4532831311225891},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.44928833842277527},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.44221749901771545},{"id":"https://openalex.org/C149872217","wikidata":"https://www.wikidata.org/wiki/Q5265701","display_name":"Determining the number of clusters in a data set","level":5,"score":0.4264466166496277},{"id":"https://openalex.org/C207968372","wikidata":"https://www.wikidata.org/wiki/Q310401","display_name":"k-means clustering","level":3,"score":0.413047730922699},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icrcicn50933.2020.9296186","doi":"https://doi.org/10.1109/icrcicn50933.2020.9296186","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icrcicn50933.2020.9296186","pdf_url":null,"source":{"id":"https://openalex.org/S7407088726","display_name":"International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 Fifth International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2082888943","https://openalex.org/W2138521141","https://openalex.org/W2140190241","https://openalex.org/W2153958734","https://openalex.org/W2539301238","https://openalex.org/W3038112596","https://openalex.org/W4230765542"],"related_works":["https://openalex.org/W7219573574","https://openalex.org/W3157030441","https://openalex.org/W2153922613","https://openalex.org/W4394629167","https://openalex.org/W1839418504","https://openalex.org/W3100095447","https://openalex.org/W2774125682","https://openalex.org/W4327731212","https://openalex.org/W2105371669","https://openalex.org/W7203491234"],"abstract_inverted_index":{"Clustering":[0,46],"method":[1],"splits":[2],"a":[3,14,71],"large":[4],"dataset":[5,49,60,72],"into":[6],"smaller":[7],"subsets,":[8],"where":[9],"each":[10,23],"subset":[11,76],"is":[12,25,61],"called":[13],"cluster.":[15],"Every":[16],"cluster":[17,24],"has":[18],"the":[19,37,42,55,59,64,99,104,111],"same":[20],"characteristics":[21],"and":[22,41,88],"different":[26],"from":[27,98],"all":[28],"other":[29],"clusters.":[30],"The":[31],"most":[32],"common":[33],"clustering":[34,39,44,123],"algorithms":[35],"are":[36],"k-Means":[38],"algorithm":[40],"k-Medoids":[43],"algorithm.":[45],"of":[47,58,70,77,103,106,113,127],"high-dimensional":[48],"may":[50],"become":[51],"difficult.":[52],"To":[53],"overcome":[54],"problem,":[56],"dimension":[57,69],"reduced.":[62],"In":[63],"present":[65],"work,":[66],"we":[67,115],"reduce":[68],"by":[73],"selecting":[74],"suitable":[75],"features":[78],"using":[79,85],"entropy-based":[80],"method.":[81],"We":[82,91],"calculate":[83],"entropy":[84],"both":[86],"Euclidean":[87],"Manhattan":[89],"distances.":[90],"experiment":[92],"with":[93],"three":[94],"widely":[95],"used":[96],"datasets":[97],"Machine":[100],"Learning":[101],"Repository":[102],"University":[105],"California,":[107],"Irvine":[108],"(UCI).":[109],"From":[110],"results":[112],"experimentation,":[114],"can":[116],"conclude":[117],"that":[118],"our":[119],"approach":[120],"produces":[121],"higher":[122],"accuracies":[124],"than":[125],"those":[126],"previous":[128],"works.":[129]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2021-01-05T00:00:00"}