A formal algorithm for verifying the validity of clustering results based on model checking

8Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

The limitations in general methods to evaluate clustering will remain difficult to overcome if verifying the clustering validity continues to be based on clustering results and evaluation index values. This study focuses on a clustering process to analyze crisp clustering validity. First, we define the properties that must be satisfied by valid clustering processes and model clustering processes based on program graphs and transition systems. We then recast the analysis of clustering validity as the problem of verifying whether the model of clustering processes satisfies the specified properties with model checking. That is, we try to build a bridge between clustering and model checking. Experiments on several datasets indicate the effectiveness and suitability of our algorithms. Compared with traditional evaluation indices, our formal method can not only indicate whether the clustering results are valid but, in the case the results are invalid, can also detect the objects that have led to the invalidity. © 2014 Huang et al.

Cite

CITATION STYLE

APA

Huang, S., Cheng, Y., Lang, D., Chi, R., & Liu, G. (2014). A formal algorithm for verifying the validity of clustering results based on model checking. PLoS ONE, 9(3). https://doi.org/10.1371/journal.pone.0090109

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free