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
相关论文
共 20 条
[1]  
[Anonymous], P 23 ANN INT ACM SIG
[2]  
Banerjee A, 2007, J MACH LEARN RES, V8, P1919
[3]  
Cai R., 2005, P ACM MM
[4]  
Chakrabarti D., 2006, P ACM KDD
[5]  
CHAPIKAR M., 1997, P 29 STOC C
[6]  
Chi Y., 2007, P ACM KDD
[7]  
DHILLON I, 2001, P ACM KDD
[8]  
Dhillon I. S., 2003, P ACM KDD
[9]  
George T., 2005, P IEEE ICDM
[10]  
GUHA S., 2000, P IEEE S FDN COMP SC