|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|4944118||1437979||2018||14 صفحه PDF||سفارش دهید||دانلود کنید|
- Give an lth decision class lower approximation reduction algorithm.
- Give an lth decision class reduction algorithm for decision tables.
- Give an lth decision class Î²-reduction algorithm for decision tables.
- Study the relationship between lth 1-reduction and positive region reduction.
Attribute reduction is among the most important areas of research in rough sets. This paper investigates the types of local attribute reduction for decision tables. We propose the concepts of lth decision class lower approximation reduction, lth decision class reduction, and lth decision class Î²-reduction for decision tables, and provide their corresponding reduction algorithms via discernibility matrices. We also establish the relationship between positive-region reduction and the lth decision class Î²-reduction, and report a case study using the University of California-Irvine dataset to verify the theoretical results.
Journal: Information Sciences - Volume 422, January 2018, Pages 204-217