Foundations of the likelihood linkage analysis (LLA) classification method
- 1 March 1991
- journal article
- research article
- Published by Wiley in Applied Stochastic Models and Data Analysis
- Vol. 7 (1), 63-76
- https://doi.org/10.1002/asm.3150070107
Abstract
The aim of this paper is to present the concepts underlying an approach to data analysis using a hierarchical classification. The data can be provided by observation, experiment or knowledge. We begin by presenting the classical view of the context of data representation, in which the algorithm of hierarchical ascendant construction of the classification tree is set. The main notion in our method is one of ‘similarity’. The latter must be elaborated in the best way, taking into account the mathematical nature of the objects to be compared. In this elaboration, we adopt a set theoretic and combinatoric representation of the descriptive attributes, which are interpreted in terms of relations. On the other hand, we introduce a probability scale for similarity measurement by using a likelihood concept.This publication has 5 references indexed in Scilit:
- Voice matters in a dictator gameExperimental Economics, 2007
- Sur la Signification des Classes Issues D’une Classification Automatique de DonneesPublished by Springer Nature ,1983
- Strong Consistency of $K$-Means ClusteringThe Annals of Statistics, 1981
- A General Theory of Classificatory Sorting Strategies: 1. Hierarchical SystemsThe Computer Journal, 1967
- Contributions to the Theory of Models. IIndagationes Mathematicae, 1954