Community finding within the community set space

Community finding algorithms strive to find communities that have a higher connectivity within the communities than between them. Recently a framework called the community set space was introduced which provided a way to measure the quality of community sets. We present a new community finding algorithm, CHI, designed to minimize the violations defined by this framework. It will be shown that the CHI algorithm has similarities to kmeans. It is flexible and fast and can also be tuned to find certain types of communities. It is optimized for the community set framework and results so that it performs better than other algorithms within that framework.