A note on Lopez-Hernandez procedure: New non-hierarchical algorithms in classification of data

María Araceli Garín Martín

No 1134-8984, BILTOKI from Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística)

Abstract: [EN] In this short note, we make a critique about the procedure developed in the Inductive Algorithm in the Objects of Lopez-Hernandez (1997). It is well known that the determination of maximal cliques in a graph is an important problem because it appearsin many diverse applications. However, many clique detection algorithms have been developed (most of them in the 60's and 70's) in spite of its high complexity (NP-hard). In the case of the referred procedure, a methodological justification and computational results woud have been desirable.

Keywords: maximal cluster; clique; complete subgraph; cluster maximal; ciclo; subgrafo completo; grafo no dirigido (search for similar items in EconPapers)
Date: 2000-03
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://addi.ehu.eus/handle/10810/5826 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ehu:biltok:5826

Ordering information: This working paper can be ordered from
Dpto. de Econometría y Estadística, Facultad de CC. Económicas y Empresariales, Universidad del País Vasco, Avda. Lehendakari Aguirre 83, 48015 Bilbao, Spain

Access Statistics for this paper

More papers in BILTOKI from Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística) Contact information at EDIRC.
Bibliographic data for series maintained by Alcira Macías ().