Work place: Postgraduate College, Academy of Equipment Command & Technology, Beijing, China
Research Interests: Control Theory, Algorithmic Complexity Theory, Algorithmic Information Theory
Ying Peng was born in Huanggang, Hubei province, China, in 1982. She obtained her bachelor degree of engineering and Master degree of engineering in 2005 and 2008, respectively, from Academy of Equipment Command & Technology, Beijing, China.
She is now a Ph.D. candidate in Academy of Equipment Command & Technology. Her research interests include evidence theory, fault diagnosis, etc.
DOI: https://doi.org/10.5815/ijigsp.2011.01.05, Pub. Date: 8 Feb. 2011
Clustering belief functions is not easy because of uncertainty and the unknown number of clusters. To overcome this problem, we extend agglomerative algorithm for clustering belief functions. By this extended algorithm, belief distance is taken as dissimilarity measure between two belief functions, and the complete-link algorithm is selected to calculate the dissimilarity between two clusters. Before every merging of two clusters, consistency test is executed. Only when the two clusters are consistent, they can merge, otherwise, dissimilarity between them is set to the largest value, which prevents them from merging and assists to determine the number of final clusters. Typical illustration shows same promising results. Firstly, the extended algorithm itself can determine the number of clusters instead of needing to set it in advance. Secondly, the extended algorithm can deal with belief functions with hidden conflict. At last, the algorithm extended is robust.[...] Read more.
Subscribe to receive issue release notifications and newsletters from MECS Press journals