کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
390563 661270 2009 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Idempotent version of the Fréchet contingency array problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Idempotent version of the Fréchet contingency array problem
چکیده انگلیسی

In this paper we study the idempotent version of the so-called Fréchet correlation array problem. The problem is studied using an algebraic approach. The major result is that there exists a unique upper bound and several lower bounds. The formula for the upper bound is given. An algorithm is proposed to compute one lower bound. Another algorithm is provided to compute all lower bounds, but the number of lower bounds may be a very large number. Note that all these results are only based on the distributive lattice property of the idempotent algebraic structure.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Fuzzy Sets and Systems - Volume 160, Issue 16, 16 August 2009, Pages 2317-2327