The condensed fuzzy k-nearest neighbor rule based on sample fuzzy entropy

The fuzzy k-nearest neighbor (F-KNN) algorithm was originally developed by Keller in 1985, which generalized the k-nearest neighbor (KNN) algorithm and could overcome the drawback of KNN in which all of instances were considered equally important. However, the F-KNN algorithm still suffers from the problem of large memory requirement same as the KNN. In order to deal with the problem, this paper proposes the condensed fuzzy k-nearest neighbor rule (CFKNN) which selects the important instances based on sample fuzzy entropy. The experimental results show that our proposed method is feasible and effective.