Determination of similarity threshold in clustering problems for large data sets

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new automatic method based on an intra-cluster criterion, to obtain a similarity threshold that generates a well-defined clustering (or near to it) for large data sets, is proposed. This method uses the connected component criterion, and it neither calculates nor stores the similarity matrix of the objects in main memory. The proposed method is focussed on unsupervised Logical Combinatorial Pattern Recognition approach. In addition, some experimentations of the new method with large data sets are presented. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Sánchez-Díaz, G., & Martínez-Trinidad, J. F. (2003). Determination of similarity threshold in clustering problems for large data sets. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2905, 611–618. https://doi.org/10.1007/978-3-540-24586-5_75

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