DocumentCode
3494835
Title
Evolutionary spectral co-clustering
Author
Green, Nathan ; Rege, Manjeet ; Liu, Xumin ; Bailey, Reynold
fYear
2011
fDate
July 31 2011-Aug. 5 2011
Firstpage
1074
Lastpage
1081
Abstract
Co-clustering is the problem of deriving sub-matrices 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.
Keywords
evolutionary computation; matrix algebra; pattern clustering; ESCC; clustering quality; evolutionary spectral co-clustering algorithm; larger data matrix; respect to historical approach; respect to the current approach; sub-matrices; Clustering algorithms; Equations; Gaussian distribution; History; Matrix decomposition; Noise; Partitioning algorithms; clustering; co-clustering; data mining; evolving data; spectral clustering;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks (IJCNN), The 2011 International Joint Conference on
Conference_Location
San Jose, CA
ISSN
2161-4393
Print_ISBN
978-1-4244-9635-8
Type
conf
DOI
10.1109/IJCNN.2011.6033342
Filename
6033342
Link To Document