A stratificational overlapping cluster scheme (Q1063980)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3919580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A stratificational overlapping cluster scheme |
scientific article; zbMATH DE number 3919580 |
Statements
A stratificational overlapping cluster scheme (English)
0 references
1985
0 references
The threshold graph is defined for a set of overlapping clusters by a given threshold value, where a vertex 1-1 corresponds to a cluster. In this paper, a graph theoretic scheme to link overlapping clusters is proposed in terms of the maximal complete subgraph (MCS) of a threshold graph. Stratificational property is mathematically discussed and an algorithm SOCAL is presented to implement the proposed stratificational overlapping cluster scheme.
0 references
hierarchy
0 references
pattern recognition
0 references
classification
0 references
stratification
0 references
threshold graph
0 references
overlapping clusters
0 references
maximal complete subgraph
0 references
algorithm SOCAL
0 references
0 references
0.7403552532196045
0 references
0.7372585535049438
0 references
0.725913941860199
0 references
0.7153074741363525
0 references
