EVCLUS: Evidential Clustering of Proximity Data
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Published 1 February 2004
Thierry Denœux, Marie-Hélène Masson
Citations250
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A notion of credal partition is introduced, which subsumes those of hard, fuzzy, and possibilistic partitions, allowing to gain deeper insight into the structure of the data.
Abstract
A new relational clustering method is introduced, based on the Dempster-Shafer theory of belief functions (or evidence theory). Given a matrix of dissimilarities between n objects, this method, referred to as evidential clustering (EVCLUS), assigns a basic belief assignment (or mass function) to each object in such a way that the degree of conflict between the masses given to any two objects reflects their dissimilarity. A notion of credal partition is introduced, which subsumes those of hard, fuzzy, and possibilistic partitions, allowing to gain deeper insight into the structure of the data. Experiments with several sets of real data demonstrate the good performances of the proposed method as compared with several state-of-the-art relational clustering techniques.
Keywords
Computer Science
Choice Reviews OnlineNeural networks for pattern recognition
18,687 Citations1994
This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
Neural Networks for Pattern Recognition
12,198 Citations1995Chris Bishop
IEEE Transactions on Pattern Analysis and Machine IntelligenceA Cluster Separation Measure
8,543 Citations1979David L. Davies, Donald W. Bouldin
A measure is presented which indicates the similarity of clusters which are assumed to have a data density which is a decreasing function of distance from a vector characteristic of the cluster which can be used to infer the appropriateness of data partitions.
PsychometrikaAn Examination of Procedures for Determining the Number of Clusters in a Data Set
3,870 Citations1985Glenn W. Milligan, Martha C. Cooper
A Monte Carlo evaluation of 30 procedures for determining the number of clusters was conducted on artificial data sets which contained either 2, 3, 4, or 5 distinct nonoverlapping clusters to provide a variety of clustering solutions.
IEEE Transactions on ComputersA Nonlinear Mapping for Data Structure Analysis
3,381 Citations1969John W. Sammon
An algorithm for the analysis of multivariate data is presented along with some experimental results that is based upon a point mapping of N L-dimensional vectors from the L-space to a lower-dimensional space such that the inherent data "structure" is approximately preserved.
IEEE Transactions on Systems Man and CyberneticsMethods of combining multiple classifiers and their applications to handwriting recognition
2,171 Citations1992Longchang Xu, Adam Krzyżak +1 more
On applying these methods to combine several classifiers for recognizing totally unconstrained handwritten numerals, the experimental results show that the performance of individual classifiers can be improved significantly.
Artificial IntelligenceThe transferable belief model
2,165 Citations1994Philippe Smets, Robert Kennes
IEEE Transactions on Fuzzy SystemsOn cluster validity for the fuzzy c-means model
1,839 Citations1995Nikhil R. Pal, James C. Bezdek
Limitation analysis indicates, and numerical experiments confirm, that the Fukuyama-Sugeno index is sensitive to both high and low values of m and may be unreliable because of this, and calculations suggest that the best choice for m is probably in the interval [1.5, 2.5], whose mean and midpoint, m=2, have often been the preferred choice for many users of FCM.
The Handbooks of fuzzy sets seriesFuzzy Models and Algorithms for Pattern Recognition and Image Processing
1,382 Citations1999James C. Bezdek, James F. Keller +2 more
Pattern Recognition, Cluster Analysis for Object Data, Classifier Design, and Image Processing and Computer Vision are studied.
IEEE Transactions on Pattern Analysis and Machine IntelligenceThe combination of evidence in the transferable belief model
1,080 Citations1990P. Smets
A description of the transferable belief model, which is used to quantify degrees of belief based on belief functions, is given and a set of axioms justifying Dempster's rule for the combination of belief functions induced by two distinct evidences is presented.
IEEE Transactions on Systems Man and CyberneticsA k-nearest neighbor classification rule based on Dempster-Shafer theory
977 Citations1995Thierry Denœux
In this paper, the problem of classifying an unseen pattern on the basis of its nearest neighbors in a recorded data set is addressed from the point of view of Dempster-Shafer theory to provide a global treatment of such issues as ambiguity and distance rejection, and imperfect knowledge regarding the class membership of training patterns.
Studies in fuzziness and soft computingA k-Nearest Neighbor Classification Rule Based on Dempster-Shafer Theory
835 Citations2008Thierry Denœux
Springer series in statisticsModern Multidimensional Scaling
817 Citations1997Ingwer Borg, Patrick J. F. Groenen
Computational IntelligenceRepresentation and combination of uncertainty with belief functions and possibility measures
759 Citations1988Didler Dubois, Henri Prade
The framework of belief functions in terms of expressive power for knowledge representation is examined and it is indicated that combination rules issued from fuzzy set and possibility theory look more flexible than Dempster rule because many variants exist, and their numerical stability seems to be better.
International Journal of Approximate ReasoningBelief functions: The disjunctive rule of combination and the generalized Bayesian theorem
648 Citations1993Philippe Smets
The Bayes’ theorem is generalized within the transferable belief model framework and the DRC and GBT and their uses for belief propagation in directed belief networks are analysed.
Journal of NeuroscienceAnalysis of connectivity in the cat cerebral cortex
581 Citations1995JW Scannell, Colin Blakemore +1 more
It is shown that hierarchical rules, when applied to the cat visual system, define a largely consistent hierarchy, and in both auditory and visual systems, the ordering of areas by hierarchical analysis and by optimization analysis was statistically significantly related.
Uncertainty-Based Information: Elements of Generalized Information Theory
501 Citations1998George J. Klir, Mark J. Wierman +1 more
IEEE Transactions on Pattern Analysis and Machine IntelligencePairwise data clustering by deterministic annealing
461 Citations1997Thomas Hofmann, Joachim M. Buhmann
A deterministic annealing approach to pairwise clustering is described which shares the robustness properties of maximum entropy inference and the resulting Gibbs probability distributions are estimated by mean-field approximation.
IEEE Transactions on Systems Man and Cybernetics - Part A Systems and HumansA neural network classifier based on Dempster-Shafer theory
421 Citations2000T. Denoeux
A new adaptive pattern classifier based on the Dempster-Shafer theory of evidence is presented, which uses reference patterns as items of evidence regarding the class membership of each input pattern under consideration.
Pattern RecognitionNerf c-means: Non-Euclidean relational fuzzy clustering
315 Citations1994Richard J. Hathaway, James C. Bezdek
This paper substantially improves RFCM by generalizing it to the case of arbitrary (symmetric) dissimilarity data, and is applicable to any numerical relational data that are positive, reflexive (or anti-reflexive) and symmetric.
Pattern RecognitionRelational duals of the c-means clustering algorithms
297 Citations1989Richard J. Hathaway, John W. Davenport +1 more
New relational versions of the hard and fuzzy c-means algorithms are presented here for the case when the relational data can reasonably be viewed as some measure of distance.
Fuzzy Sets and SystemsPattern classification problems and fuzzy sets
209 Citations1978Marc Roubens
A unified presentation of classical clustering algorithms is proposed both for the hard and fuzzy pattern classification problems, and two coefficients that measure the “degree of non-fuzziness” of the partition are proposed.
Pattern RecognitionAnalysis of evidence-theoretic decision rules for pattern classification
174 Citations1997Thierry Denœux
Different strategies that can be applied in this context to reach a decision (e.g. assignment to a class or rejection), provided the possible consequences of each action can be quantified are examined.
Pattern RecognitionBootstrap technique in cluster analysis
147 Citations1987Anil K. Jain, J.V. Moreau
A method to estimate the number of clusters in a data set E, using the bootstrap technique, which involves the generation of several “fake” data sets by sampling patterns with replacement in E (bootstrapping).
Elsevier eBooksSpeeding up Backpropagation
147 Citations1990Fernando M. Silva, Luı́s B. Almeida
This paper presents an improvement to the backpropagation algorithm, based on the use of an independent, adaptive learning rate parameter for each weight, and gives experimental results showing the improvement in learning speed.
Classification on Pairwise Proximity Data
137 Citations1998Thore Graepel, Ralf Herbrich +2 more
Medical Entomology and ZoologyFuzzy clustering models and applications
123 Citations1997Mika Sato, Yoshiharu Sato +2 more
The general Fuzzy Clustering Model Using Aggregation Operators for Asymmetric Similarity and its application in 3-way data is described.
International Journal of Approximate ReasoningUncertainty measures for evidential reasoning II: A new measure of total uncertainty
108 Citations1993Nikhil R. Pal, James C. Bezdek +1 more
A set of intuitively desirable axioms for a measure of total uncertainty (TU) associated with a basic assignment m(A) are proposed, and an expression for a (unique) function that satisfies these requirements is derived.
Journal of ClassificationNumerical classification of proximity data with assignment measures
102 Citations1985Michael P. Windham
An approach to numerical classification is described, which treats the assignment of objects to types as a continuous variable, called an assignment measure, and the Assignment-Prototype algorithm, a numerical technique for obtaining assignment measures directly from one-mode, two-way proximity matrices.
International Journal of Approximate ReasoningUncertainty measures for evidential reasoning I: A review
101 Citations1992Nikhil Pal, James C. Bezdek +1 more
A set of intuitively desirable axioms for a measure of total uncertainty is proposed and several theorems are proved about the new measure, which reduces to Shannon's probabilistic entropy when the basic probability assignment focuses only on singletons.
Classification on proximity data with LP-machines
83 Citations1999Thore Graepel
A new linear program to deal with classification of data in the case of data given in terms of pairwise proximities, which allows to avoid the problems inherent in using feature spaces with indefinite metric in support vector machines.
Neural ComputationA Stochastic Self-Organizing Map for Proximity Data
79 Citations1999Thore Graepel, Klaus Obermayer
An efficient algorithm is derived for topographic mapping of proximity data (TMP), which can be seen as an extension of Kohonen's self-organizing map to arbitrary distance measures and is used to generate a connection map of areas of the cat's cerebral cortex.
International Journal of Approximate ReasoningOn the normalization of fuzzy belief structures
62 Citations1996Ronald R. Yager
It is shown that the usual process of normalizing an individual subnormal fuzzy subset by proportionally increasing the membership grades until the maximum membership grade is one is a special case of this smoothnormalization process and in turn closely related to the Dempster normalization process.
Artificial IntelligenceThe normative representation of quantified beliefs by belief functions
57 Citations1997Philippe Smets
A set of requirements that justify the use of belief functions are presented and the assessment of the validity of these requirements provides a tool for assessing the relative value of normative models of subjective behaviors.
Clustering of relational data containing noise and outliers
43 Citations2002Sumit Sen, Rajesh N. Davé
The FRC algorithm is shown to have the same objective functional as the relational fuzzy c-means algorithm, but through use of direct objective function minimization based on the Lagrangian multiplier technique.
IEEE Transactions on Systems Man and CyberneticsEvidential reasoning approach to multisource-data classification in remote sensing
39 Citations1995Hyun Kim, P. H. Swain
The proposed method is applied to the ground-cover classification of simulated 201-band high resolution imaging spectrometer (HIRIS) data, from which a set of multiple sources is obtained by dividing the dimensionally huge data into smaller pieces based on the global statistical correlation information.
Multidimensional Scaling and Data Clustering
35 Citations1994Thomas Hofmann, Joachim M. Buhmann
Algorithms for embedding dissimilarity data set in a Euclidian space, for clustering these data and for actively selecting data to support the clustering process are discussed in the maximum entropy framework.
Combination of Non Distinct Evidences
1 Citations1984Philippe Smets
The concept of distinctness is defined and the rule of combination that applies when evidences are non distinct is developed, which is based on Dempster'srule of combination.