Finding cohesive clusters for analyzing knowledge communities

V Kandylas, SP Upham, LH Ungar - Knowledge and Information Systems, 2008 - Springer
V Kandylas, SP Upham, LH Ungar
Knowledge and Information Systems, 2008Springer
Documents and authors can be clustered into “knowledge communities” based on the
overlap in the papers they cite. We introduce a new clustering algorithm, Streemer, which
finds cohesive foreground clusters embedded in a diffuse background, and use it to identify
knowledge communities as foreground clusters of papers which share common citations. To
analyze the evolution of these communities over time, we build predictive models with
features based on the citation structure, the vocabulary of the papers, and the affiliations and …
Abstract
Documents and authors can be clustered into “knowledge communities” based on the overlap in the papers they cite. We introduce a new clustering algorithm, Streemer, which finds cohesive foreground clusters embedded in a diffuse background, and use it to identify knowledge communities as foreground clusters of papers which share common citations. To analyze the evolution of these communities over time, we build predictive models with features based on the citation structure, the vocabulary of the papers, and the affiliations and prestige of the authors. Findings include that scientific knowledge communities tend to grow more rapidly if their publications build on diverse information and if they use a narrow vocabulary.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果