✦ LIBER ✦

A genetic approach to the automatic clustering problem

✍ Scribed by Lin Yu Tseng; Shiueng Bien Yang

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 360 KB
Volume: 34
Category: Article
ISSN: 0031-3203
DOI: 10.1016/s0031-3203(00)00005-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A relaxation approach to the fuzzy clust

A relaxation approach to the fuzzy clustering problem

✍ Mohamed S. Kamel; Shokri Z. Selim 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 665 KB

A genetic approach to the quadratic assi

A genetic approach to the quadratic assignment problem

✍ David M. Tate; Alice E. Smith 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 811 KB

A new approach to clustering

✍ R. Wilson; M. Spann 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 950 KB

Exploiting problem structure in a geneti

Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem

✍ Uwe Aickelin; Kathryn A. Dowsland 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 234 KB 👁 1 views

There is considerable interest in the use of genetic algorithms to solve problems arising in the areas of scheduling and timetabling. However, the classical genetic algorithm (GA) paradigm is not well equipped to handle the con#ict between objectives and constraints that typically occur in such prob

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

Optimal clustering in graphs with weight

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

✍ Goetschel, Roy ;Voxman, William 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB

## 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 para