most citedEvidential relational clustering using medoids

1 citations · 1 across the 1 of their papers we have counts for

collaborators

5 papers

cs.AI2016

Evidential Label Propagation Algorithm for Graphs

Kuang Zhou, Arnaud Martin, Quan Pan +1

Community detection has attracted considerable attention crossing many areas as it can be used for discovering the structure and features of complex networks. With the increasing s…

cs.AI2016

The belief noisy-or model applied to network reliability analysis

Kuang Zhou, Arnaud Martin, Quan Pan

One difficulty faced in knowledge engineering for Bayesian Network (BN) is the quan-tification step where the Conditional Probability Tables (CPTs) are determined. The number of pa…

cs.AI2016

ECMdd: Evidential c-medoids clustering with multiple prototypes

Kuang Zhou, Arnaud Martin, Quan Pan +1

In this work, a new prototype-based clustering method named Evidential C-Medoids (ECMdd), which belongs to the family of medoid-based clustering for proximity data, is proposed as…

cs.RO2016

Robust and Efficient Relative Pose with a Multi-camera System for Autonomous Vehicle in Highly Dynamic Environments

Liu Liu, Hongdong Li, Yuchao Dai

This paper studies the relative pose problem for autonomous vehicle driving in highly dynamic and possibly cluttered environments. This is a challenging scenario due to the existen…

cs.AI20151 cited

Evidential relational clustering using medoids

Kuang Zhou, Arnaud Martin, Quan Pan +1

In real clustering applications, proximity data, in which only pairwise similarities or dissimilarities are known, is more general than object data, in which each pattern is descri…