کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6857347 662176 2016 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Computing sets of graded attribute implications with witnessed non-redundancy
ترجمه فارسی عنوان
مجموعه های محاسباتی از ضوابط ویژگی درجه بندی شده با عدم انعقاد شاهد
کلمات کلیدی
افزونگی، معانی مشخص شبکه خالی، منطق فازی، شجاعت قصد،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی
In this paper we extend our previous results on sets of graded attribute implications with witnessed non-redundancy. We assume finite residuated lattices as structures of truth degrees and use arbitrary idempotent truth-stressing linguistic hedges as parameters which influence the semantics of graded attribute implications. In this setting, we introduce algorithm which transforms any set of graded attribute implications into an equivalent non-redundant set of graded attribute implications with saturated consequents whose non-redundancy is witnessed by antecedents of the formulas. As a consequence, we solve the open problem regarding the existence of general systems of pseudo-intents which appear in formal concept analysis of object-attribute data with graded attributes and linguistic hedges. Furthermore, we show a polynomial-time procedure for determining bases given by general systems of pseudo-intents from sets of graded attribute implications which are complete in data.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 351, 10 July 2016, Pages 90-100
نویسندگان
,