This paper deals with clustering by optimizing the c-means clustering model. For some data sets this clustering model possesses many local optima, so conventional alternating optimization (AO) will produce bad results. For obtaining good clustering results, the minimization procedure has to be kept
Optimization of Taxonomic Keys by Means of Probabilistic Modelling
β Scribed by Dr. A. V. Sviridov; Dr. D. Leuschner
- Publisher
- John Wiley and Sons
- Year
- 1986
- Tongue
- English
- Weight
- 445 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0323-3847
No coin nor oath required. For personal study only.
β¦ Synopsis
A t present biological systematics, i. e. clesaification and identification of organisms, is 8180 a subject of the employment of mathematical methods. The topic of this paper is identification. One of the most important methode of identification is that by means of keys. Therefore a short review on the types of keye and their valuation is repreaented. Moreover there are discussed the essential propertiax of keys: reliability and velocity of identification. Further in connection with these two quantities probabik~tic models are treated. The last part of the article deals with the optimization of keys concerning theory and practice of the problem.
π SIMILAR VOLUMES
## Abstract An atomic model has been proposed to analyze scattering problems by a dielectric cylinder of arbitrary cross section. The advantages and differences from the usual method of moments are: (1) the field exiting an atom is that due to all the sources other than that atom, (2) the causeβand
## Abstract The aim of this paper is to compare the forecasting performance of competing threshold models, in order to capture the asymmetric effect in the volatility. We focus on examining the relative outβofβsample forecasting ability of the SETARβThreshold GARCH (SETARβTGARCH) and the SETARβThre