✦ LIBER ✦

Cluster analysis by simulated annealing

✍ Scribed by Li-Xian Sun; Yu-Long Xie; Xin-Hua Song; Ji-Hong Wang; Ru-Qin Yu

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 487 KB
Volume: 18
Category: Article
ISSN: 0097-8485
DOI: 10.1016/0097-8485(94)85003-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fuzzy cluster analysis by simulated anne

Fuzzy cluster analysis by simulated annealing

✍ Li-Xian Sun; Klaus Danzer 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 810 KB

In this paper a novel fuzzy cluster analysis algorithm based on simulated annealing (FCASA) is proposed. Instead of the perturbation criterion of the literature in which membership grades of several samples may be changed simultaneously in each perturbation or perhaps each sample has unequal probabi

Cluster analysis by the K-means algorith

Cluster analysis by the K-means algorithm and simulated annealing

✍ Li-Xian Sun; Fen Xu; Yi-Zeng Liang; Yu-Long Xie; Ru-Qin Yu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 874 KB

Spectral deconvolution by simulated anne

Spectral deconvolution by simulated annealing

✍ R.E Hoffman; G.C Levy 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 413 KB

Blind deconvolution by simulated anneali

Blind deconvolution by simulated annealing

✍ B.C. McCallum 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 427 KB

Geometry optimization by simulated annea

Geometry optimization by simulated annealing

✍ Robert A. Donnelly 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Simulated annealing is shown to be effective in locating good local minima in a simple geometry-optimization problem. Extensions to problems involving small clusters of molecules is straightforward, as is its use in geometry optimization within a single molecule. The simplicity of the technique reco

Layer assignment by simulated annealing

✍ Paul Molitor 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 311 KB