Individual approximate clusters: Methods, properties, applications

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

Abstract

A least-squares data approximation approach to finding individual clusters is advocated. A simple local optimization algorithm leads to suboptimal clusters satisfying some natural tightness criteria. Three versions of an iterative extraction approach are considered, leading to a portrayal of the cluster structure of the data. Of these, probably most promising is what is referred to as the incjunctive clustering approach. Applications are considered to the analysis of semantics, to integrating different knowledge aspects and consensus clustering. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Mirkin, B. (2013). Individual approximate clusters: Methods, properties, applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8170 LNAI, pp. 26–37). https://doi.org/10.1007/978-3-642-41218-9_4

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