Spectral Co-Clustering for Dynamic Bipartite Graphs
Submitted by Derek Greene on Mon, 2010-10-04 14:13.
Publication Type:
Conference PaperSource:
Workshop on Dynamic Networks and Knowledge Discovery at ECML'10, Barcelona, Spain (2010)URL:
http://www.csi.ucd.ie/files/ucd-csi-2010-05.pdfKeywords:
clustering; dynamic clustering; text miningAbstract:
A common task in many domains with a temporal aspect involves identifying and tracking clusters over time. Often dynamic data will have a feature-based representation. In some cases, a direct mapping will exist for both objects and features over time. But in many scenarios, smaller subsets of objects or features alone will persist across succes- sive time periods. To address this issue, we propose a dynamic spectral co-clustering method for simultaneously clustering objects and features over time, as represented by successive bipartite graphs. We evaluate the method on a benchmark text corpus and Web 2.0 bookmarking data.
»
- Login to post comments

Clique News Feed