.png){kind=icon}
返回
Classificatory filtering in decision systems
.png){kind=icon}
OA
AI
DOI：10.1016/S0888-613X(99)00040-7.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Classificatory data filtering is concerned with reducing data in size while preserving classification information. Duntsch and Gediga [I. Duntsch, G. Gediga, International Journal of Approximate Reasoning 18 (1998) 93-106] presented a first approach to this problem. Their technique collects values of a single feature into a single value. In this paper we present a novel approach to classificatory filtering, which can be regarded as a generalisation of the approach in the above mentioned paper. This approach is aimed at collecting values of a set of features into a single value. We look at the problem abstractly in the context of lattices. We focus on hypergranules (arrays of sets) in a problem domain, and it turns out the collection of all hypergranules can be made into a lattice. Our solution (namely, LM algorithm) is formulated to find a set of maximal elements for each class, which covers all elements in a given dataset and is consistent with the dataset. This is done through the lattice sum operation. In terms of decision systems, LM collects attributes values while preserving classification structure. To use the filtered data for classification, we present and justify two measures (C-0 and C-1) for the relationship between two hypergranules. Based on the measures, we propose an algorithm (C2) for classification. Both algorithms are evaluated using real world datasets and are compared with C4.5. The result is analysed using statistical test methods and it turns out that there is no statistical difference between the two. Regression analysis shows that the reduction ratio is a strong indicator of prediction success. (C) 2000 Elsevier Science Inc. All rights reserved.
Keyword:
artificial intelligence
machine learning
rough set
data filtering
data reduction
decision system
lattice
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容