Affiliations: Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, 400065, P.R. China | [v] Cairo University, Egypt | [w] Kyushu Institute of Technology, Japan | [x] University of Warsaw & Infobright Inc., Poland | [y] University of Calcutta, India | [z] UESTC, Chengdu, China
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 produce the overlapping clusters autonomously. The comparative experiments with synthetic and standard data sets show that the proposed algorithm is valid, efficient, and has better accuracy. The experiments with the web users access paths data set show that the proposed algorithm is capable of clustering access paths at an acceptable computational expense.
