| Ph.D. Thesis |
|
| Written by Horia F. Pop |
Doctoral School
Details About the ThesisThis Ph.D. thesis is the result of my research in the field of fuzzy classification, that has begun in 1988 by starting the work for the B.Sc. Thesis. The fuzzy set appeared as a result of the trials to solve the pattern recognition problem in the context of imprecisely defined categories. In such cases, the membership degree of an object to a class is a problem of nuance. A first application of the fuzzy sets theory in the cluster analysis is due to Ruspini in 1969 [16]. However, the relevance of the fuzzy sets theory for the classification theory and for pattern recognition was definitely established in 1974, with the paper of Dunn and Bezdek [8] concerning the Fuzzy n-Means algorithm. The thesis lays on 204 pages, is structured on six chapters, and has a bibliography of 105 titles. The first chapter shows the fundamental notions of the fuzzy sets theory. There are defined the fuzzy sets and fuzzy points. There are presented the axioms of the fuzzy sets operations. The triangular norms and co-norms and the fuzzy complement are introduced. The properties of the operations induced on fuzzy sets by T0 and S0; T_infty and S_infty; two arbitrary connectives T and S, are studied. The disjointness of two fuzzy sets and of a family at most countable of fuzzy sets are discussed. Finally, there are approached metrical notions as distance between two fuzzy sets, diameter of a fuzzy set and distance with respect to a fuzzy set. The second chapter discusses the problem of convex decomposition of finite fuzzy partitions. There are approached both the degenerate and the non-degenerate convex decomposition. The MiniMax and MiniMiniMax degenerate convex decomposition algorithms are studied. We show that these algorithms have a series of common properties. A comparative statistical study with respect to these two algorithms is presented. In the second part, the problem of non-degenerate convex decomposition is studied. The algorithm DNDCD for non-degenerate convex decomposition of a fuzzy partition is presented. If such a convex decomposition does not exist, the algorithm produces a convex decomposition as less degenerate as possible. The properties of the DNDCD algorithm are then studied. The third chapter approaches the unsupervised fuzzy classification. The fundamental problem of classification is presented. The most important classes of classification algorithms are discussed. In what follows the algorithms based on optimizing a criterion function will be studied. The (di-)similarity measure is defined. The Classical n-Means algorithm and its fuzzy version, Fuzzy n-Means, are presented. The convergence of the algorithms similar to Fuzzy n-Means is studied. The 'weak points' of the Fuzzy n-Means are discussed. There is approached the cluster validity problem. Different validity functionals are presented. The generalization of the Fuzzy n-Means algorithm for producing the cluster substructure of a fuzzy set, and the fuzzy divisive hierarchical clustering algorithm are studied. The problem of unequal sized clusters is discussed. The algorithms based on adaptive metric and ellipsoidal prototypes are studied. There is studied the problem of the classes' shape and the use of linear prototypes; the use of convex combinations between the criterion functions; the use of adaptive prototypes. Other types of classification are approached: characteristics classification; cross-classification; classification of non-metrical data. The notion of fuzzy set associated to a classical set is then studied. There is presented an algorithm to produce this fuzzy set. Finally, a series of numerical experiments with respect to these algorithms is done. The fourth chapter studies the problem of supervised fuzzy classification. The Rosenblatt perceptron algorithm is presented. The notion of linear separability with respect to two fuzzy sets is studied. A few generalization of the perceptron algorithm are studied: the fuzzy perceptron algorithm; the generalized fuzzy perceptron algorithm; the Gallant Pocket algorithm; the Keller-Hunt algorithm are presented. The fuzzy relaxation algorithm is studied. This algorithm has a series of interesting properties that allow its use in the case of two linearly non-separable fuzzy sets. A series of fuzzy algorithms based on minimization of the square error are presented: the fuzzy method of the minimal square error; the fuzzy Widrow-Hoff algorithm; the fuzzy Ho-Kashyap algorithm. The fuzzy decision supervised classification is then studied. A series of fuzzy algorithms are discussed: the fuzzy algorithm of the nearest k neighbors; the fuzzy algorithm of the nearest prototype; the Restricted Fuzzy n-Means algorithm. Finally, a series of numerical experiments with respect to these algorithms is done. The fifth chapter presents the SAADI software (System for Automatic Analysis of Data and for their Interpretation). This system, realized using Borland Pascal with Objects 7.0, implements the algorithms presented in this thesis, together with a series of algorithms aimed to reduce the data dimensionality. The system has effectively been used in the research activity of the Fuzzy Systems Research Group from the Department of Computer Science, as well as in the research activity at other faculties of our university. The sixth chapter presents a few fuzzy classification applications. There is approached the use of fuzzy sets to optimally selecting the solvents systems; to the study of Roman pottery (terra sigillata); to the classification of Greek muds and pelloids; to the study of importance of fuzzy regression algorithms in chemistry; to the creation of a fuzzy system of chemical elements. Among the original elements presented throughout this thesis we recall the following:
Selected References
|
| Last Updated on Sunday, 07 March 2010 18:44 |
|
|
Hosted by
|