Extracting Communities of Interests for Semantics-Based Graph Searches


IEICE TRANSACTIONS on Information and Systems   Vol.E95-D    No.4    pp.932-941
Publication Date: 2012/04/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E95.D.932
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Knowledge-Based Software Engineering)
semantic search,  semantics-based user interface,  newman clustering,  and link navigation,  

Full Text: PDF(652KB)>>
Buy this Article

Users recently find their interests by checking the contents published or mentioned by their immediate neighbors in social networking services. We propose semantics-based link navigation; links guide the active user to potential neighbors who may provide new interests. Our method first creates a graph that has users as nodes and shared interests as links. Then it divides the graph by link pruning to extract practical numbers, that the active user can navigate, of interest-sharing groups, i.e. communities of interests (COIs). It then attaches a different semantic tag to the link to each representative user, which best reflects the interests of COIs that they are included in, and to the link to each immediate neighbor of the active user. It finally calculates link attractiveness by analyzing the semantic tags on links. The active user can select the link to access by checking the semantic tags and link attractiveness. User interests extracted from large scale actual blog-entries are used to confirm the efficiency of our proposal. Results show that navigation based on link attractiveness and representative users allows the user to find new interests much more accurately than is otherwise possible.

open access publishing via