Skip to main content
Journal ArticleOPEN ACCESS

Graph-based clustering of random point set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3138 948-956
DOI: 10.1007/978-3-540-27868-9_104
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we define clusters and the boundary curves of clusters in a random point set using the Delaunay triangulation and the principal curve analysis. The principal curve analysis is a generalization of principal axis analysis, which is a standard method for data analysis in pattern recognition. © Springer-Verlag 004.

Cite

CITATION STYLE

APA

Imiya, A., & Tatara, K. (2004). Graph-based clustering of random point set. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3138, 948–956. https://doi.org/10.1007/978-3-540-27868-9_104

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