A Cheap Feature Selection Approach for the K-Means Algorithm.
IEEE Transactions on Neural Networks and Learning Systems(2021)
摘要
The increase in the number of features that need to be analyzed in a wide variety of areas, such as genome sequencing, computer vision, or sensor networks, represents a challenge for the $K$ -means algorithm. In this regard, different dimensionality reduction approaches for the $K$ -means algorithm have been designed recently, leading to algorithms that have proved to generate competitive cluste...
更多查看译文
关键词
Feature extraction,Clustering algorithms,Partitioning algorithms,Approximation algorithms,Dimensionality reduction,Heuristic algorithms,Proposals
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要