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 here

This book discusses recent theoretical developments in agglomerative hierarchical clustering. The general understanding of agglomerative hierarchical clustering is that its theory was completed long ago and there is no room for further methodological studies, at least in its fundamental structure. This book has been planned counter to that view: it will show that there are possibilities for further theoretical studies and they will be not only for methodological interests but also for usefulness in real applications. When compared with traditional textbooks, the present book has several notable features. First, standard linkage methods and agglomerative procedure are described by a general algorithm in which dendrogram output is expressed by a recursive subprogram. That subprogram describes an abstract tree structure, which is used for a two-stage linkage method for a greater number of objects. A fundamental theorem for single linkage using a fuzzy graph is proved, which uncovers several theoretical features of single linkage. Other theoretical properties such as dendrogram reversals are discussed. New methods using positive-definite kernels are considered, and some properties of the Ward method using kernels are studied. Overall, theoretical features are discussed, but the results are useful as well for application-oriented users of agglomerative clustering.

This edited volume focuses on the latest developments in classification and data science and covers a wide range of topics in the context of data analysis and related areas, e.g. the analysis of complex data, analysis of qualitative data, methods for high-dimensional data, dimensionality reduction, data visualization, multivariate statistical methods, and various applications to real data in the social sciences, medical sciences, and other disciplines. In addition to sharing theoretical and methodological findings, the book shows how to apply the proposed methods to a variety of problems - e.g. in consumer behavior, decision-making, marketing data and social network structures. Both methodological aspects and applications to a wide range of areas such as economics, behavioral science, marketing science, management science and the social sciences are covered. The book is chiefly intended for researchers and practitioners who are interested in the latest developments and practical applications in these fields, as well as applied statisticians and data analysts. Its combination of methodological advances with a wide range of real-world applications gathered from several fields makes it of unique value in helping readers solve their research problems.

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 here

This book constitutes the refereed proceedings of the 5th International Conference on Rough Sets and Current Trends in Computing, RSCTC 2006, held in Kobe, Japan in November 2006.

The 91 revised full papers presented together with 5 invited papers and 2 commemorative papers were carefully reviewed and selected from 332 submissions. The papers are organized in topical sections on logics in rough sets, logics in fuzzy sets, fuzzy-rough hybridization, approximate and uncertain reasoning, variable precision rough set models, incomplete/nondeterministic information systems, decision support, multi-criteria decision support, rough sets in KDD, rough sets in medicine, granular computing, grey systems, ontology and mereology, statistical methods, machine learning, clustering, data mining, evolutionary computing, intelligent information systems, pattern recognition and image processing, as well as data clustering: algorithms and applications.

This volume contains papers presented at the 2nd International Conference on Modeling Decisions for Arti?cial Intelligence (MDAI 2005), held in Tsukuba, Japan, July 25 27. This conference follows MDAI 2004 (held in Barcelona, Catalonia, Spain), the proceedings of which were also published in the LNAI series (Vol. 3131). The aim of this conference was to provide a forum for researchers to discuss about theory and tools for modeling decisions, as well as applications that - compass decision-making processes and information fusion techniques. In this second edition, special focus was given to applications related to risk, security and safety. The organizers received 118 papers, from 14 di?erent countries, 40 of which are published in this volume. Each submission received at least two reviews from the Program Committee and a few external reviewers. We would like to express our gratitude to them for their work. The plenary talks presented at the conference are also included in this volume. The conference was supported by the Department of Risk Engineering of the University of Tsukuba, the Japan Society for Fuzzy Theory and Intelligent Informatics (SOFT), the Catalan Association for Arti?cial Intelligence (ACIA), the European Society for Fuzzy Logic and Technology (EUSFLAT) and the Generalitat de Catalunya (AGAUR 2004XT 0004)."

This book discusses recent theoretical developments in agglomerative hierarchical clustering. The general understanding of agglomerative hierarchical clustering is that its theory was completed long ago and there is no room for further methodological studies, at least in its fundamental structure. This book has been planned counter to that view: it will show that there are possibilities for further theoretical studies and they will be not only for methodological interests but also for usefulness in real applications. When compared with traditional textbooks, the present book has several notable features. First, standard linkage methods and agglomerative procedure are described by a general algorithm in which dendrogram output is expressed by a recursive subprogram. That subprogram describes an abstract tree structure, which is used for a two-stage linkage method for a greater number of objects. A fundamental theorem for single linkage using a fuzzy graph is proved, which uncovers several theoretical features of single linkage. Other theoretical properties such as dendrogram reversals are discussed. New methods using positive-definite kernels are considered, and some properties of the Ward method using kernels are studied. Overall, theoretical features are discussed, but the results are useful as well for application-oriented users of agglomerative clustering.