Unsupervised learning for hierarchical clustering using statistical information

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a novel hierarchical clustering method that can classify given data without specified knowledge of the number of classes. In this method, at each node of a hierarchical classification tree, log-linearized Gaussian mixture networks [2] are utilized as classifiers to divide data into two subclasses based on statistical information, which are then classified into secondary subclasses and so on. Also, unnecessary structure of the tree can be avoided by training in a cross-validation manner. Validity of the proposed method is demonstrated with classification experiments on artificial data. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Okamoto, M., Bu, N., & Tsuji, T. (2004). Unsupervised learning for hierarchical clustering using statistical information. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3173, 834–839. https://doi.org/10.1007/978-3-540-28647-9_137

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