|Discovering underlying structure from co-occurrence data is an important task in many fields, including: insurance, intelligence, criminal investigation, epidemiology, human resources, and marketing. For example a store may wish to identify underlying sets of items purchased together or a human resources department may wish to identify groups of employees that collaborate with each other.
Previously Kubica et. al. presented the group detection algorithm (GDA) - an algorithm for finding underlying groupings of entities from co-occurrence data. This algorithm is based on a probabilistic generative model and produces coherent groups that are consistent with prior knowledge. Unfortunately, the optimization used in GDA is slow, making it potentially infeasible for many real world data sets.
To this end, we present k-groups - an algorithm that uses an approach similar to that of k-means (hard clustering and localized updates) to significantly accelerate the discovery of the underlying groups while retaining GDA's probabilistic model. In addition, we show that k-groups is guaranteed to converge to a local minimum. We also compare the performance of GDA and k-groups on several real world and artificial data sets, showing that k-groups' sacrifice in solution quality is significantly offset by its increase in speed. This trade-off makes group detection tractable on significantly larger data sets.
|Link Analysis, Clustering|
|Jeremy Martin Kubica, Andrew Moore, and Jeff Schneider, "K-groups: Tractable Group Detection on Large Link Data Sets," tech. report CMU-RI-TR-03-32, Robotics Institute, Carnegie Mellon University, September, 2003|
author = "Jeremy Martin Kubica and Andrew Moore and Jeff Schneider",
title = "K-groups: Tractable Group Detection on Large Link Data Sets",
booktitle = "",
institution = "Robotics Institute",
month = "September",
year = "2003",
address= "Pittsburgh, PA",
|The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University.|
Contact Us | Update Instructions