期刊名称：Journal of Emerging Trends in Computing and Information Sciences
电子版ISSN：2079-8407
出版年度：2011
卷号：2
期号：11
页码：608-614
出版社：ARPN Publishers
摘要：Community (also known as clusters) is a group of nodes with dense connection. Detecting outlier-communities from database is a big desire. In this paper we propose a novel Minimum Spanning Tree based algorithm for detecting outlier-communities from complex networks. The algorithm uses a new community validation criterion based on the geometric property of data partition of the data set in order to find the proper number of communities. The algorithm works in two phases. The first phase of the algorithm creates optimal number of communities, whereas the second phase of the algorithm finds outlier-communities.
关键词：Euclidean minimum spanning tree; Clustering; Eccentricity; Center; Community validity; Community Separation; Outliers
