This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
en:publi [2010/03/25 11:08] – quostben | en:publi [2013/10/21 16:01] (current) – quostben | ||
---|---|---|---|
Line 1: | Line 1: | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
====== Journal papers ====== | ====== Journal papers ====== | ||
+ | |||
+ | V. Antoine, B. Quost, M.-H. Masson and T. Denoeux. CEVCLUS: evidential clustering with instance-level constraints for relational data. Soft Computing, 2013, DOI: 10.1007/ | ||
+ | |||
+ | V. Antoine, B. Quost, M.-H. Masson and T. Denoeux. CECM: Constrained Evidential C-Means algorithm. Computational Statistics and Data Analysis, vol. 56, issue 4, pages 894-914, 2012. {{fr: | ||
+ | |||
+ | B. Quost, M.-H. Masson and T. Denoeux. Classifier fusion in the Dempster-Shafer framework using optimized t-norm based combination rules. International Journal of Approximate Reasoning, vol. 52, issue 3, pages 353-374, 2011. {{fr: | ||
+ | |||
+ | D. Mercier, B. Quost and T. Denoeux. Refined modeling of sensor reliability in the belief function framework using contextual discounting. Information Fusion, vol. 9, pages 246–258, 2008. {{fr: | ||
+ | |||
+ | B. Quost, T. Denoeux and M.-H. Masson. Combinaison crédibiliste de classifieurs binaires. Traitement du Signal, vol. 24, issue 2, pages 83-101, 2007. {{fr: | ||
+ | |||
+ | B. Quost, T. Denoeux and M.-H. Masson. Pairwise classifier combination using belief functions. Pattern Recognition Letters, vol. 28, issue 5 , Pages 644-653, 2007. {{fr: | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
- | D. Mercier, B. Quost and T. Denoeux. Refined modeling of sensor reliability in the belief function framework using contextual discounting, | ||
- | B. Quost, T. Denoeux and M.-H. Masson. Combinaison crédibiliste de classifieurs binaires. Traitement du Signal, Vol. 24, Issue 2, pages 83-101, 2007. {{fr: | ||
- | B. Quost, T. Denoeux and M.-H. Masson. Pairwise classifier combination using belief functions. Pattern Recognition Letters, Volume 28, Issue 5 , Pages 644-653, 2007. {{fr: | ||
Line 13: | Line 33: | ||
====== Conference papers ====== | ====== Conference papers ====== | ||
- | V. Antoine, B. Quost, M.-H. Masson and T. Denoeux. CECM: Adding pairwise constraints to evidential clustering. | + | Zhou, D. and Frémont, V. and Quost, B., Moving Objects Detection and Credal Boosting Based Recognition in Urban Environments, |
+ | |||
+ | X. Wang, B. Quost, J.D. Chazot and J. Antoni. Sound source localization from uncertain information using the Evidential EM algorithm. Proceedings of the 7th International Conference on Scalable Uncertainty Management and Applications (SUM’2013), | ||
+ | |||
+ | S. Destercke and B. Quost. Correcting Binary Imprecise Classifiers: | ||
+ | |||
+ | S. Destercke and B. Quost. Combining Binary Classifiers with Imprecise Probabilities. In Y. Tang, V.-N. Huynh, and J. Lawry (eds.): Proceedings of the International Symposium on Integrated Uncertainty Management and Applications (IUKM' | ||
+ | |||
+ | B. Quost and T. Denoeux. Clustering fuzzy data using the fuzzy EM algorithm. In A. Deshpande, A. Hunter (eds): Proceedings of the 4th International Conference on Scalable Uncertainty Management (SUM' | ||
+ | |||
+ | V. Antoine, B. Quost, M.-H. Masson and T. Denoeux. CECM: Adding pairwise constraints to evidential clustering. 2010 IEEE International Conference on Fuzzy Systems (FUZZ‐IEEE 2010), Barcelona, Spain, July 2010, pages 879-886, IEEE. {{fr: | ||
- | V. Antoine, B. Quost, M.-H. Masson and T. Denoeux. Evidential clustering with constraints and adptive | + | V. Antoine, B. Quost, M.-H. Masson and T. Denoeux. Evidential clustering with constraints and adaptive |
V. Antoine, B. Quost, M.-H. Masson and T. Denoeux. CECM : Algorithme évidentiel des c-moyennes avec contraintes. In Rencontres Francophones sur la Logique Floue et ses Applications (LFA 2009), pages 275-282, Annecy, France, November 2009, Cépaduès-Editions. {{fr: | V. Antoine, B. Quost, M.-H. Masson and T. Denoeux. CECM : Algorithme évidentiel des c-moyennes avec contraintes. In Rencontres Francophones sur la Logique Floue et ses Applications (LFA 2009), pages 275-282, Annecy, France, November 2009, Cépaduès-Editions. {{fr: | ||
Line 25: | Line 55: | ||
B. Quost, T. Denoeux, and M.-H. Masson. Adapting a Combination Rule to Non-Independent Information Sources. In L. Magdalena, M. Ojeda-Aciego, | B. Quost, T. Denoeux, and M.-H. Masson. Adapting a Combination Rule to Non-Independent Information Sources. In L. Magdalena, M. Ojeda-Aciego, | ||
- | B. Quost, T. Denoeux, and M. Masson. One-against-all combination in the framework of belief functions, Proceedings of IPMU’2006, | + | B. Quost, T. Denoeux, and M. Masson. One-against-all combination in the framework of belief functions, Proceedings of IPMU’2006, |
B. Quost, T. Denoeux, M. Masson. Pairwise Classifier Combination in the Framework of Belief Functions, Proceedings of FUSION’2005, | B. Quost, T. Denoeux, M. Masson. Pairwise Classifier Combination in the Framework of Belief Functions, Proceedings of FUSION’2005, |