Seeking Stable Clusters in the Blogosphere

The popularity of blogs has been increasing dramatically over the last couple of years. As topics evolve in the blogosphere, keywords align together and form the heart of various stories. Intuitively we expect that in certain contexts, when there is a lot of discussion on a specific topic or event, a set of keywords will be correlated: the keywords in the set will frequently appear together (pair-wise or in conjunction) forming a cluster. Note that such keyword clusters are temporal (associated with specific time periods) and transient. As topics recede, associated keyword clusters dissolve, because their keywords no longer appear frequently together. In this paper, we formalize this intuition and present efficient algorithms to identify keyword clusters in large collections of blog posts for specific temporal intervals. We then formalize problems related to the temporal properties of such clusters. In particular, we present efficient algorithms to identify clusters that persist ...

• Type: Conference
• Year: 2007
• Where: VLDB
• Authors: Nilesh Bansal, Fei Chiang, Nick Koudas, Frank Wm. Tompa
• Keywords: Database, Keyword Clusters, Keywords, Present Efficient Algorithms, VLDB 2007