Extracting communities of interests for semantics-based graph searches

Makoto Nakatsuji, Akimichi Tanaka, Toru Ishida

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish
JournalCEUR Workshop Proceedings
Publication statusPublished - 2008 Dec 1
Externally publishedYes
Event7th International Semantic Web Conference, ISWC 2008 - Karlsruhe, Germany
Duration: 2008 Oct 282008 Oct 28

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Extracting communities of interests for semantics-based graph searches'. Together they form a unique fingerprint.

Cite this