Recently many researchers are working on cluster analysis as a main tool for exploratory data analysis and data mining. A notable feature is that specialists in di?erent ?elds of sciences are considering the tool of data clustering to be useful. A major reason is that clustering algorithms and software are ?exible in thesensethatdi?erentmathematicalframeworksareemployedinthealgorithms and a user can select a suitable method according to his application. Moreover clusteringalgorithmshavedi?erentoutputsrangingfromtheolddendrogramsof agglomerativeclustering to more recent self-organizingmaps. Thus, a researcher or user can choose an appropriate output suited to his purpose,which is another ?exibility of the methods of clustering. An old and still most popular method is the K-means which use K cluster centers. A group of data is gathered around a cluster center and thus forms a cluster. The main subject of this book is the fuzzy c-means proposed by Dunn and Bezdek and their variations including recent studies. A main reasonwhy we concentrate on fuzzy c-means is that most methodology and application studies infuzzy clusteringusefuzzy c-means,andfuzzy c-meansshouldbe consideredto beamajortechniqueofclusteringingeneral,regardlesswhetheroneisinterested in fuzzy methods or not. Moreover recent advances in clustering techniques are rapid and we requirea new textbook that includes recent algorithms.We should also note that several books have recently been published but the contents do not include some methods studied herein.

Dieser Band konzentriert sich auf Konzepte, Algorithmen und Anwendungen des Fuzzy Clustering. In sich geschlossen werden Techniken wie das Fuzzy-c-Mittel und die Gustafson-Kessel- und Gath- und Gava-Algorithmen behandelt, wobei vom Leser keine Vorkenntnisse auf dem Gebiet von Fuzzy-Systemen erwartet werden. Durch anschauliche Anwendungsbeispiele eignet sich das Buch als Einführung für Praktiker der Datenanalyse, der Bilderkennung und der angewandten Mathematik. (05/99)

This book presents our most recent research on fuzzy clustering models and applications. These models represent new methods in the field of cluster analysis which are based on common properties between objects to be clustered. We present asymmetric aggregation operators as a new concept for representing asymmetric relationship between objects. Asymmetric aggregation operators are proposed in order to obtain clusters in which objects are not only similar to each other but are also asymetrically related. Implementation of clustering model by using neural networks is also presented. A number of examples are presented to demonstrate the proposed new techniques. This book will prove useful to the researchers, scientists, engineers and postgraduate students in all the areas including science, engineering and business.

In recent years rough set theory has attracted the attention of many researchers and practitioners all over the world, who have contributed essentially to its development and applications. Weareobservingagrowingresearchinterestinthefoundationsofroughsets, including the various logical, mathematical and philosophical aspects of rough sets. Some relationships have already been established between rough sets and other approaches, and also with a wide range of hybrid systems. As a result, rough sets are linked with decision system modeling and analysis of complex systems, fuzzy sets, neural networks, evolutionary computing, data mining and knowledge discovery, pattern recognition, machine learning, and approximate reasoning. In particular, rough sets are used in probabilistic reasoning, granular computing (including information granule calculi based on rough mereology), intelligent control, intelligent agent modeling, identi?cation of autonomous s- tems, and process speci?cation. Methods based on rough set theory alone or in combination with other - proacheshavebeendiscoveredwith awide rangeofapplicationsinsuchareasas: acoustics, bioinformatics, business and ?nance, chemistry, computer engineering (e.g., data compression, digital image processing, digital signal processing, p- allel and distributed computer systems, sensor fusion, fractal engineering), de- sion analysis and systems, economics, electrical engineering (e.g., control, signal analysis, power systems), environmental studies, informatics, medicine, mole- lar biology, musicology, neurology, robotics, social science, software engineering, spatial visualization, Web engineering, and Web mining.

The fuzzy set was conceived as a result of an attempt to come to grips with the problem of pattern recognition in the context of imprecisely defined categories. In such cases, the belonging of an object to a class is a matter of degree, as is the question of whether or not a group of objects form a cluster. A pioneering application of the theory of fuzzy sets to cluster analysis was made in 1969 by Ruspini. It was not until 1973, however, when the appearance of the work by Dunn and Bezdek on the Fuzzy ISODATA (or fuzzy c-means) algorithms became a landmark in the theory of cluster analysis, that the relevance of the theory of fuzzy sets to cluster analysis and pattern recognition became clearly established. Since then, the theory of fuzzy clustering has developed rapidly and fruitfully, with the author of the present monograph contributing a major share of what we know today. In their seminal work, Bezdek and Dunn have introduced the basic idea of determining the fuzzy clusters by minimizing an appropriately defined functional, and have derived iterative algorithms for computing the membership functions for the clusters in question. The important issue of convergence of such algorithms has become much better understood as a result of recent work which is described in the monograph.

The goal of traditional clustering is to assign each data point to one and only one cluster. In contrast, fuzzy clustering assigns different degrees of membership to each point. The membership of a point is thus shared among various clusters. This creates the concept of fuzzy boundaries which differs from the traditional concept of well-defined boundaries. In hard clustering, data is divided into distinct clusters, where each data element belongs to exactly one cluster. In fuzzy clustering (also referred to as soft clustering), data elements can belong to more than one cluster, and associated with each element is a set of membership levels. These indicate the strength of the association between that data element and a particular cluster. Fuzzy clustering is a process of assigning these membership levels, and then using them to assign data elements to one or more clusters. This algorithm uses the FCM traditional algorithm to locate the centers of clusters for a bulk of data points. The potential of all data points is being calculated with respect to specified centers. The availability of dividing the data set into large number of clusters will slow the processing time and needs more memory size for the program. Hence traditional clustering should device the data to four clusters and each data point should be located in one specified cluster .Imprecision in data and information gathered from and about our environment is either statistical(e.g., the outcome of a coin toss is a matter of chance) or no statistical (e.g., “apply the brakes pretty soon”). Many algorithms can be implemented to develop clustering of data sets. Fuzzy C-mean clustering (FCM) is efficient and common algorithm. We are tuning this algorithm to get a solution for the rest of data point which omitted because of its farness from all clusters. To develop a high performance algorithm that sort and group data set in variable number of clusters to use this data in control and managing of those clusters.