کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6858855 | 1438412 | 2018 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Idempotent conjunctive and disjunctive combination of belief functions by distance minimization
ترجمه فارسی عنوان
ترکیبی از همجوشی و تفکیک کننده ای از توابع باور با کمینه کردن فاصله
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
باورهای توابع، ترکیبی فاصله، همزمان شدن نظم جزئی، بهینه سازی محدب،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
چکیده انگلیسی
The notions of less and more informative are often formalized through partial orderings extending usual set-inclusion, yet the only two informative partial orders that provide a straightforward idempotent rule leading to a unique result are those based on the conjunctive and disjunctive weight functions. In this article, we show that other partial orders can achieve a similar goal when the problem is slightly relaxed into a distance optimization one. Building upon previous work, this paper investigates the use of distances compatible with informative partial orders to determine a unique solution to the combination problem. The obtained operators are conjunctive/disjunctive, idempotent and commutative, but lack associativity. They are, however, quasi-associative allowing sequential combinations at no extra complexity. Some experiments demonstrate interesting discrepancies as compared to existing approaches, notably with the aforementioned rules relying on weight functions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Approximate Reasoning - Volume 92, January 2018, Pages 32-48
Journal: International Journal of Approximate Reasoning - Volume 92, January 2018, Pages 32-48
نویسندگان
John Klein, Sebastien Destercke, Olivier Colot,