Ordinal network representation: Representing proximities by graphs (Q2277198): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Karl Christoph Klauer / rank | |||
Property / reviewed by | |||
Property / reviewed by: Q587747 / rank | |||
Property / author | |||
Property / author: Karl Christoph Klauer / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: I.Křiv\v{y} / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spatial, non-spatial and hybrid models for scaling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extended similarity trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Free trees and bidirectional trees as representations of psychological distance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3844775 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hierarchical clustering schemes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A metric and an ordering on sets / rank | |||
Normal rank |
Latest revision as of 16:12, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ordinal network representation: Representing proximities by graphs |
scientific article |
Statements
Ordinal network representation: Representing proximities by graphs (English)
0 references
1989
0 references
The author considers ordinal network representations as graph-theoretical representations of proximity data by means of the minimum-path-length distance of a connected and weighted graph. In contrast to traditional tree-based graph-theoretic approaches, the ordinal network representation is not limited to but includes the representation by trees. The paper explores fundamental representation and uniqueness results and discusses a method of constructing ordinal network representations. A simple strategy for handling the problem of errors in the data is described and illustrated.
0 references
addtrees
0 references
extended similarity trees
0 references
hierarchical clustering
0 references
graph- theoretical representations of proximity data
0 references
minimum-path-length distance
0 references
ordinal network representations
0 references