Back to results
Bibliographic record · Consultation and access
Artículo

Taxonomic evidence applying intelligent information algorithm and the principle of maximum entropy: the case of asteroids families

Perichinsky, Gregorio et al · Facultade Cenecista de Campo Largo · 2005

Open-access full text
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.

Resource access

Open the content from the main option or choose another available source.

CONICET Digital CONICET Digital OAI-PMH
Entrar por CONICET Digital
Main access

Open-access full text

Texto completo identificado como acceso abierto.
Open text

Summary

Descripción general del contenido del recurso.

The Numeric Taxonomy aims to group operational taxonomic units in clusters (OTUs or taxons or taxa), using the denominated structure analysis by means of numeric methods. These clusters that constitute families are the purpose of this series of projects and they emerge of the structural analysis, of their phenotypical characteristic, exhibiting the relationships in terms of grades of similarity of the OTUs, employing tools such as i) the Euclidean distance and ii) nearest neighbor techniques. Thus taxonomic evidence is gathered so as to quantify the similarity for each pair of OTUs (pair-group method) obtained from the basic data matrix and in this way the significant concept of spectrum of the OTUs is introduced, being based the same one on the state of their characters. A new taxonomic criterion is thereby formulated and a new approach to Computational Taxonomy is presented, that has been already employed with reference to Data Mining, when apply of Machine Learning techniques, in particular to the C4.5 algorithms, created by Quinlan, the degree of efficiency achieved by the TDIDT family´s algorithms when are generating valid models of the data in classification problems with the Gain of Entropy through Maximum Entropy Principle. Fil: Perichinsky, Gregorio. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina Fil: Jiménez Rey, Elizabeth Miriam. Universidad de Buenos Aires. Facultad de Ingeniería; Argentina

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Perichinsky, G. E. A. (2005). Taxonomic evidence applying intelligent information algorithm and the principle of maximum entropy: the case of asteroids families. http://hdl.handle.net/11336/39609

MLA

Perichinsky, Gregorio et al. "Taxonomic evidence applying intelligent information algorithm and the principle of maximum entropy: the case of asteroids families." 2005. http://hdl.handle.net/11336/39609.

Chicago

Perichinsky, Gregorio et al. 2005. "Taxonomic evidence applying intelligent information algorithm and the principle of maximum entropy: the case of asteroids families.". http://hdl.handle.net/11336/39609.

Harvard

Perichinsky, G. E. A. 2005, Taxonomic evidence applying intelligent information algorithm and the principle of maximum entropy: the case of asteroids families, Facultade Cenecista de Campo Largo, available at: http://hdl.handle.net/11336/39609 [Accessed 6 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Taxonomic evidence applying intelligent information algorithm and the principle of maximum entropy: the case of asteroids families
Author / contributors
Perichinsky, Gregorio et al
Publisher
Facultade Cenecista de Campo Largo
Publication year
2005
ISSN
1677-3071
ISSN
1677-3071
Language
English

Subjects

Explore related resources through these subjects.

Copied