Java, AkshayJoshi, AnupamFinin, Tim2018-11-212018-11-212008-08-24Akshay Java, Anupam Joshi, and Tim Finin, Detecting Commmunities via Simultaneous Clustering of Graphs and Folksonomies, Proceedings of the Tenth Workshop on Web Mining and Web Usage Analysis (WebKDD), 2008, https://ebiquity.umbc.edu/paper/html/id/406/Detecting-Commmunities-via-Simultaneous-Clustering-of-Graphs-and-Folksonomieshttp://hdl.handle.net/11603/12078Proceedings of the Tenth Workshop on Web Mining and Web Usage Analysis (WebKDD)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 method 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.14 pagesen-USThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.Detecting CommmunitiesSimultaneous ClusteringGraphsFolksonomiesUMBC Ebiquity Research GroupText