SELP: semi-supervised evidential label propagation algorithm for graph data clustering
DOI10.1016/j.ijar.2017.09.008zbMath1423.68394OpenAlexW2761915970MaRDI QIDQ1687278
Arnaud Martin, Zhunga Liu, Quan Pan, Kuang Zhou
Publication date: 22 December 2017
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2017.09.008
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Active classification using belief functions and information gain maximization
- Evidential calibration of binary SVM classifiers
- Prediction of future observations using belief functions: a likelihood-based approach
- Learning from partially supervised data using mixture models and belief functions
- Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
- Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
- Decision making in the TBM: the necessity of the pignistic transformation
- Two-probabilities focused combination in recommender systems
- ECM: An evidential version of the fuzzy \(c\)-means algorithm
- Clustering Approach Using Belief Function Theory
- The Belief Noisy-OR Model Applied to Network Reliability Analysis
This page was built for publication: SELP: semi-supervised evidential label propagation algorithm for graph data clustering