Extracting communities of interests for semantics-based graph searches

Makoto Nakatsuji, Akimichi Tanaka, Toru Ishida

研究成果査読

抄録

We propose an algorithm that divides a graph, whose vertices are users and whose edges represent shared interests, into subgraphs - communities of interests (COIs). Our algorithm differs from conventional modularity-based community extraction because it introduces a mechanism to harmonize the number of users in each COI. It also attaches semantic tags to the relationships between COIs or between users based on taxonomies of the content items of interest. Our algorithm allows users to identify new interests quickly and accurately when searching their interests in the graph.

本文言語English
ジャーナルCEUR Workshop Proceedings
401
出版ステータスPublished - 2008 12 1
外部発表はい
イベント7th International Semantic Web Conference, ISWC 2008 - Karlsruhe, Germany
継続期間: 2008 10 282008 10 28

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)

フィンガープリント

「Extracting communities of interests for semantics-based graph searches」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル