On effective linearly ordered sets of comparison functions

Both the existence and the non-existence of a linearly ordered (by certain natural order relations) effective set of comparison functions (=dense comparison classes) are compatible with the ZFC axioms of set theory.

Robust fuzzy Gustafson-Kessel clustering for nonlinear system identification

This paper deals with Takagi-Sugeno (TS) fuzzy model identification of nonlinear systems using fuzzy clustering. In particular, an extended fuzzy Gustafson-Kessel (EGK) clustering algorithm, using robust competitive agglomeration (RCA), is developed for automatically constructing a TS fuzzy model from system input-output data. The EGK algorithm can automatically determine the 'optimal' number of clusters from the training data set. It is shown that the EGK approach is relatively insensitive to initialization and is less susceptible to local minima, a benefit derived from its agglomerate property. This issue is often overlooked in the current literature on nonlinear identification using conventional fuzzy clustering. Furthermore, the robust statistical concepts underlying the EGK algorithm help to alleviate the difficulty of cluster identification in the construction of a TS fuzzy model from noisy training data. A new hybrid identification strategy is then formulated, which combines the EGK algorithm with a locally weighted, least-squares method for the estimation of local sub-model parameters. The efficacy of this new approach is demonstrated through function approximation examples and also by application to the identification of an automatic voltage regulation (AVR) loop for a simulated 3 kVA laboratory micro-machine system.

Support vector machine classification for large data sets via minimum enclosing ball clustering

Support vector machine (SVM) is a powerful technique for data classification. Despite of its good theoretic foundations and high classification accuracy, normal SVM is not suitable for classification of large data sets, because the training complexity of SVM is highly dependent on the size of data set. This paper presents a novel SVM classification approach for large data sets by using minimum enclosing ball clustering. After the training data are partitioned by the proposed clustering method, the centers of the clusters are used for the first time SVM classification. Then we use the clusters whose centers are support vectors or those clusters which have different classes to perform the second time SVM classification. In this stage most data are removed. Several experimental results show that the approach proposed in this paper has good classification accuracy compared with classic SVM while the training is significantly faster than several other SVM classifiers.

Reduced-size polarized basis sets for calculations of molecular electric properties. III. Second-row atoms

Reduced-size polarized (ZmPolX) basis sets are developed for the second-row atoms X = Si, P, S, and Cl. The generation of these basis sets follows from a simple physical model of the polarization effect of the external electric field which leads to highly compact polarization functions to be added to the chosen initial basis set. The performance of the ZmPolX sets has been investigated in calculations of molecular dipole moments and polarizabilities. Only a small deterioration of the quality of the calculated molecular electric properties has been found. Simultaneously the size of the present reduced-size ZmPolX basis sets is about one-third smaller than that of the usual polarized (PolX) sets. This reduction considerably widens the range of applications of the ZmPolX sets in calculations of molecular dipole moments, dipole polarizabilities, and related properties.