Generating Significant Graph Clusterings
نویسندگان
چکیده
Many applications such as experimental evaluations of clustering algorithms require the existence of a significant reference clustering. This task is dual to finding significant clusterings of a given graph. We present several generators for pre–clustered graphs based on perturbation and geometry. In an experimental evaluation we confirm the applicability of our generators. Furthermore, the presented results lead to a better understanding of the correlation between the degree of perturbation and significance.
منابع مشابه
Engineering Comparators for Graph Clusterings
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of clusterings or quality-based aspects with respect to some index evaluating both clusterings. Each approach suffers from conceptional drawbacks. We introduce a new approach combining both aspects and leading to better result...
متن کاملExperiments on Comparing Graph Clusterings
A promising approach to compare graph clusterings is based on using measurements for calculating the distance. Existing measures either use the structure of clusterings or quality–based aspects. Each approach suffers from critical drawbacks. We introduce a new approach combining both aspects and leading to better results for comparing graph clusterings. An experimental evaluation of existing an...
متن کاملWeighted Ensemble Clustering for Increasing the Accuracy of the Final Clustering
Clustering algorithms are highly dependent on different factors such as the number of clusters, the specific clustering algorithm, and the used distance measure. Inspired from ensemble classification, one approach to reduce the effect of these factors on the final clustering is ensemble clustering. Since weighting the base classifiers has been a successful idea in ensemble classification, in th...
متن کاملExtending Consensus Clustering to Explore Multiple Clustering Views
Consensus clustering has emerged as an important extension of the classical clustering problem. Given a set of input clusterings of a given dataset, consensus clustering aims to find a single final clustering which is a better fit in some sense than the existing clusterings. There is a significant drawback in generating a single consensus clustering since different input clusterings could diffe...
متن کاملComplete hierarchical cut-clustering: A case study on expansion and modularity
In this work we study the hierarchical cut-clustering approach introduced by Flake et al., which is based on minimum s-t-cuts. The resulting cut-clusterings stand out due to strong connections inside the clusters, which indicate a clear membership of the vertices to the clusters. The algorithm uses a parameter which controls the coarseness of the resulting partition and which can be used to con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006