✦ LIBER ✦

Optimal clustering in graphs with weighted edges: A unified approach to the threshold problem

✍ Scribed by Goetschel, Roy ;Voxman, William

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 691 KB
Volume: 38
Category: Article
ISSN: 0002-8231
DOI: 10.1002/(sici)1097-4571(198701)38:1<13::aid-asi2>3.0.co;2-a

No coin nor oath required. For personal study only.

✦ Synopsis

Relations

on a finite set V are viewed as weighted graphs. Using the language of graph theory two methods of partitioning V are examined. In one method, partitionings of V are obtained by selecting threshold values and applying them to a maximal weighted spanning forest. In another method a parametric linear program is used to obtain a "most adhesive" partition.

📜 SIMILAR VOLUMES

Clustering analysis for graphs with mult

Clustering analysis for graphs with multiweighted edges: A unified approach to the threshold problem

✍ Goetschel, Roy 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 494 KB 👁 2 views

Multivalent relations, inferred as relationships with an added dimension of discernment, are realized as weighted graphs with multivalued edges. A unified treatment of the threshold problem is discussed and a reliability measure is produced to judge various partitions. 'R+ represents the non-negati