Faculty Scholarly Dissemination Grants
Community Finding within the Community Set Space
Department
School of Computing and Information Systems
College
Padnos College of Engineering and Computing
Date Range
2013-2014
Disciplines
Engineering
Abstract
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 means. 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.
Conference Name
SIGKDD International Conference on Knowledge Discovery and Data Mining
Conference Location
Chicago, Ill
ScholarWorks Citation
Scripps, Jerry and Trefftz, Christian, "Community Finding within the Community Set Space" (2014). Faculty Scholarly Dissemination Grants. 765.
https://scholarworks.gvsu.edu/fsdg/765
