Internet Archive Scholar

Detecting Commmunities via Simultaneous Clustering of Graphs and Folksonomies [article]

Akshay Java, Anupam Joshi, Tim Finin, University, My, University, My
2008

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (625.7 kB)
https://web.archive.org/web/20220120080424/https://mdsoar.org/bitstream/handle/11603/12078/408.pdf;jsessionid=77623BD539C854E873D0D9EB24006692?sequence=1

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL. The file type is application/pdf.

We present a simple technique for detecting communities by utilizing both the link structure and folksonomy (or tag) information that is readily available in most social media systems. A simple way to describe our approach is by defining a community as a set of nodes in a graph that link more frequently to within this set than outside it and they share similar tags. Our technique is based on the Normalized Cut (NCut) algorithm and can be easily and efficiently implemented. We validate our
more » ... by using a real network of blogs and tag information obtained from a social bookmarking site. We also verify our results on a citation network for which we have access to ground truth cluster information. Our method, Simultaneous Cut (SimCut), has the advantage that it can group related tags and cluster the nodes simultaneously.
doi:10.13016/m2x34mw6k fatcat:yjpk2hdmq5dzxnbjnedg2c7idq
Citation

Akshay Java, Anupam Joshi, Tim Finin, University, My, University, My. "Detecting Commmunities via Simultaneous Clustering of Graphs and Folksonomies." (2008)