Show simple item record

dc.contributor.authorViattchenin, Dmitri A.en_US
dc.date.accessioned2017-07-19T06:55:17Z
dc.date.available2017-07-19T06:55:17Z
dc.date.issued2013en_US
dc.identifier.isbn978-3-642-35535-6en_US
dc.identifier.isbn978-3-642-35536-3en_US
dc.identifier.otherHPU5160278en_US
dc.identifier.urihttps://lib.hpu.edu.vn/handle/123456789/26215
dc.description.abstractThe 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 applicationsen_US
dc.format.extent238 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectPossibilistic Clusteringen_US
dc.subjectAlgorithmsen_US
dc.subjectApplicationsen_US
dc.titleA Heuristic Approach to Possibilistic Clustering: Algorithms and Applicationsen_US
dc.typeBooken_US
dc.size2,634Kben_US
dc.departmentTechnologyen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record