Download now Free registration required
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set within a certain topic. Each blog is assigned a score that reflects how representative it is. Blog scores are calculated recursively in terms of the scores of their neighbors in a lexical similarity graph. A random walk is performed on a graph where nodes represent blogs and edges link lexically similar blogs. Lexical similarity is measured using either the cosine similarity measure, or the Kullback-Leibler (KL) divergence.
- Format: PDF
- Size: 1311.4 KB