A Heuristic Approach to Possibilistic Clustering: Algorithms and Applications
β Scribed by Dmitri A. Viattchenin (auth.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 2013
- Tongue
- English
- Leaves
- 238
- Series
- Studies in Fuzziness and Soft Computing 297
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
The present book outlines a new approach to possibilistic clustering in which the sought clustering structure of the set of objects is based directly on the formal definition of fuzzy cluster and the possibilistic memberships are determined directly from the values of the pairwise similarity of objects. The proposed approach can be used for solving different classification problems. Here, some techniques that might be useful at this purpose are outlined, including a methodology for constructing a set of labeled objects for a semi-supervised clustering algorithm, a methodology for reducing analyzed attribute space dimensionality and a methods for asymmetric data processing. Moreover, a technique for constructing a subset of the most appropriate alternatives for a set of weak fuzzy preference relations, which are defined on a universe of alternatives, is described in detail, and a method for rapidly prototyping the Mamdaniβs fuzzy inference systems is introduced. This book addresses engineers, scientists, professors, students and post-graduate students, who are interested in and work with fuzzy clustering and its applications
β¦ Table of Contents
Front Matter....Pages 1-10
Introduction....Pages 1-58
Heuristic Algorithms of Possibilistic Clustering....Pages 59-118
Clustering Approaches for Uncertain Data....Pages 119-182
Applications of Heuristic Algorithms of Possibilistic Clustering....Pages 183-218
Back Matter....Pages 219-227
β¦ Subjects
Computational Intelligence; Data Mining and Knowledge Discovery; Artificial Intelligence (incl. Robotics)
π SIMILAR VOLUMES
<p>Bayesian decision theory is known to provide an effective framework for the practical solution of discrete and nonconvex optimization problems. This book is the first to demonstrate that this framework is also well suited for the exploitation of heuristic methods in the solution of such problems,
Research on the problem of clustering tends to be fragmented across the pattern recognition, database, data mining, and machine learning communities. Addressing this problem in a unified way, Data Clustering: Algorithms and Applications provides complete coverage of the entire area of clustering, fr
Research on the problem of clustering tends to be fragmented across the pattern recognition, database, data mining, and machine learning communities. Addressing this problem in a unified way, Data Clustering: Algorithms and Applications provides complete coverage of the entire area of clustering, fr
<P>Research on the problem of clustering tends to be fragmented across the pattern recognition, database, data mining, and machine learning communities. Addressing this problem in a unified way, <STRONG>Data Clustering: Algorithms and Applications</STRONG> provides complete coverage of the entire ar
This book presents major advances in high performance computing as well as major advances due to high performance computing. It contains a collection of papers in which results achieved in the collaboration of scientists from computer science, mathematics, physics, and mechanical engineering are pre