A Novel Possibilistic Fuzzy Leader Clustering Algorithm

  • Authors:
  • Hong Yu;Hu Luo

  • Affiliations:
  • Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, P.R. China 400065;Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, P.R. China 400065

  • Venue:
  • RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The clusters tend to have vague or imprecise boundaries in some fields such as web mining, since clustering has been widely used. Fuzzy clustering is sensitive to noises and possibilistic clustering is sensitive to the initialization of cluster centers and generates coincident clusters. Based on combination of fuzzy clustering and possibilistic clustering, a novel possibilistic fuzzy leader (PFL) clustering algorithm is proposed in this paper to overcome these shortcomings. Considering the advantages of the leader algorithm in time efficiency and the initialization of cluster, the framework of the leader algorithm is used. In addition, a 驴-cut set is defined to process the overlapping clusters adaptively. The comparison of experimental results shows that our proposed algorithm is valid, efficient, and has better accuracy.