Flexible fuzzy co-clustering with feature-cluster weighting

被引:0
作者
Tjhi, William-Chandra [1 ]
Chen, Lihui [1 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
来源
2006 9TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION, VOLS 1- 5 | 2006年
关键词
fuzzy co-clustering; data clustering; fuzzy system; autonomous agent; computational intelligence;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Fuzzy co-clustering is an unsupervised technique that performs simultaneous fuzzy clustering of objects and features. In this paper, we propose a new flexible fuzzy co-clustering algorithm which incorporates feature-cluster weighting in the formulation. We call it Flexible Fuzzy Coclustering with Feature-cluster Weighting (FFCFW). By flexible we mean the algorithm allows the number of object clusters to be different from the number of feature clusters. There are two motivations behind this work. First, in the fuzzy framework, many co-clustering algorithms still require the number of object clusters to be the same as the number of feature clusters [1][2][3][4]. This is despite the fact that such rigid structure is hardly found in real-world applications. The second motivation is that while there have been numerous attempts for flexible coclustering, it is common that in such scheme the relationships between object and feature clusters are not clearly represented. For this reason we incorporate a feature-cluster weighting scheme for each object cluster generated by FFCFW so that the relationships between the two types of clusters are manifested in the feature-cluster weights. This enables the new algorithm to generate more accurate representation of fuzzy co-clusters. FFCFW' is formulated by fusing together the core components of two existing algorithms [2][5]. Like its predecessors, FFCFW adopts an iterative optimization procedure. We discuss in details the derivation of the proposed algorithm and the advantages it has over other existing works. Experiments on several large benchmark document datasets reveal the feasibility of our proposed algorithm.
引用
收藏
页码:1547 / +
页数:2
相关论文
共 15 条
  • [1] [Anonymous], P 4 SIAM INT C DAT M
  • [2] [Anonymous], Pattern Recognition With Fuzzy Objective Function Algorithms
  • [3] [Anonymous], 1999, Modern Information Retrieval
  • [4] Dhillon I. S., 2003, P 9 ACM SIGKDD INT C, P89, DOI DOI 10.1145/956750.956764
  • [5] Dhillon IS, 2001, MASSIVE COMP, V2, P357
  • [6] Frigui H, 2004, SURVEY OF TEXT MINING, P45
  • [7] Kurnmamuru K, 2003, IEEE INT CONF FUZZY, P772
  • [8] Biclustering algorithms for biological data analysis: A survey
    Madeira, SC
    Oliveira, AL
    [J]. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2004, 1 (01) : 24 - 45
  • [9] Mandhani B., 2003, P 12 INT C WORLD WID, P511
  • [10] Mendes MES, 2003, IEEE INT CONF FUZZY, P648