Evolutionary Spectral Co-Clustering

被引:0
|
作者
Green, Nathan [1 ]
Rege, Manjeet [1 ]
Liu, Xumin [1 ]
Bailey, Reynold [1 ]
机构
[1] Rochester Inst Technol, Dept Comp Sci, Rochester, NY 14623 USA
来源
2011 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN) | 2011年
关键词
data mining; clustering; co-clustering; evolving data; spectral clustering;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Co-clustering is the problem of deriving submatrices from the larger data matrix by simultaneously clustering rows and columns of the data matrix. Traditional co-clustering techniques are inapplicable to problems where the relationship between the instances (rows) and features (columns) evolve over time. Not only is it important for the clustering algorithm to adapt to the recent changes in the evolving data, but it also needs to take the historical relationship between the instances and features into consideration. We present ESCC, a general framework for evolutionary spectral co-clustering. We are able to efficiently co-cluster evolving data by incorporation of historical clustering results. Under the proposed framework, we present two approaches, Respect To the Current (RTC), and Respect To Historical (RTH). The two approaches differ in the way the historical cost is computed. In RTC, the present clustering quality is of most importance and historical cost is calculated with only one previous time-step. RTH, on the other hand, attempts to keep instances and features tied to the same clusters between time-steps. Extensive experiments performed on synthetic and real world data, demonstrate the effectiveness of the approach.
引用
收藏
页码:1074 / 1081
页数:8
相关论文
共 50 条
  • [21] Co-clustering with augmented matrix
    Wu, Meng-Lun
    Chang, Chia-Hui
    Liu, Rui-Zhe
    APPLIED INTELLIGENCE, 2013, 39 (01) : 153 - 164
  • [22] Co-clustering for Fair Recommendation
    Frisch, Gabriel
    Leger, Jean-Benoist
    Grandvalet, Yves
    MACHINE LEARNING AND PRINCIPLES AND PRACTICE OF KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2021, PT I, 2021, 1524 : 607 - 630
  • [23] Methods for co-clustering: a review
    Brault, Vincent
    Lomet, Aurore
    JOURNAL OF THE SFDS, 2015, 156 (03): : 27 - 51
  • [24] Weighted bilateral K-means algorithm for fast co-clustering and fast spectral clustering
    Song, Kun
    Yao, Xiwen
    Nie, Feiping
    Li, Xuelong
    Xu, Mingliang
    PATTERN RECOGNITION, 2021, 109 (109)
  • [25] CO-CLUSTERING OF NONSMOOTH GRAPHONS
    Choi, David
    ANNALS OF STATISTICS, 2017, 45 (04): : 1488 - 1515
  • [26] Image and feature co-clustering
    Qiu, GP
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 4, 2004, : 991 - 994
  • [27] Scalable Co-clustering Algorithms
    Kwon, Bongjune
    Cho, Hyuk
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PT 1, PROCEEDINGS, 2010, 6081 : 32 - +
  • [28] Co-clustering by similarity refinement
    Zhang, Jian
    ICMLA 2007: SIXTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS, PROCEEDINGS, 2007, : 381 - 386
  • [29] Co-clustering with augmented matrix
    Meng-Lun Wu
    Chia-Hui Chang
    Rui-Zhe Liu
    Applied Intelligence, 2013, 39 : 153 - 164
  • [30] Adapting Spectral Co-clustering to Documents and Terms Using Latent Semantic Analysis
    Park, Laurence A. F.
    Leckie, Christopher A.
    Ramamohanarao, Kotagiri
    Bezdek, James C.
    AI 2009: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5866 : 301 - 311