2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (2012)
Aug. 26, 2012 to Aug. 29, 2012
R. Rabbany , Comput. Sci. Dept., Univ. of Alberta, Edmonton, AB, Canada
M. Takaffoli , Comput. Sci. Dept., Univ. of Alberta, Edmonton, AB, Canada
J. Fagnan , Comput. Sci. Dept., Univ. of Alberta, Edmonton, AB, Canada
O. R. Zaane , Comput. Sci. Dept., Univ. of Alberta, Edmonton, AB, Canada
R. J. G. B. Campello , Comput. Sci. Dept., Univ. of Alberta, Edmonton, AB, Canada
Grouping data points is one of the fundamental tasks in data mining, which is commonly known as clustering if data points are described by attributes. When dealing with interrelated data that does not have any attributes and is represented in the form of nodes and their relationships, this task is also referred to as community mining. There has been a considerable number of approaches proposed in recent years for mining communities in a given network. But little work has been done on how to evaluate community mining results. The common practice is to use an agreement measure to compare the mining result against a ground truth, however, the ground truth is not known in most of the real world applications. In this paper, we investigate relative clustering quality measures defined for evaluation of clustering data points with attributes and propose proper adaptations to make them applicable in the context of social networks. Not only these relative criteria could be used as metrics for evaluating quality of the groupings but also they could be used as objectives for designing new community mining algorithms.
Communities, Benchmark testing, Data mining, Indexes, Correlation, Clustering algorithms, Algorithm design and analysis, Evaluation, Community Mining
R. J. Campello, O. R. Zaane, J. Fagnan, M. Takaffoli and R. Rabbany, "Relative Validity Criteria for Community Mining Algorithms," 2012 IEEE/ACM International Conference on Advances in Social Network Analysis and Mining(ASONAM), Istanbul, 2012, pp. 258-265.