Non-centroid-based discrete differential evolution for data clustering
Sign Up to like & getrecommendations! Published in 2025 at "Bulletin of Electrical Engineering and Informatics"
DOI: 10.11591/eei.v14i1.8811
Abstract: Data clustering can find similarities and hidden patterns within data. Given a predefined number of groups, most partitional clustering algorithms use representative centers to determine their corresponding clusters. These algorithms, such as K-means and optimization-based… read more here.
Keywords: based discrete; centroid based; non centroid; data clustering ... See more keywords