粗集
计算机科学
熵(时间箭头)
数据挖掘
特征选择
决策表
群(周期表)
特征(语言学)
选择(遗传算法)
人口
人工智能
机器学习
模式识别(心理学)
哲学
有机化学
化学
物理
语言学
量子力学
人口学
社会学
作者
Jiye Liang,Feng Wang,Chuangyin Dang,Yuhua Qian
标识
DOI:10.1109/tkde.2012.146
摘要
Many real data increase dynamically in size. This phenomenon occurs in several fields including economics, population studies, and medical research. As an effective and efficient mechanism to deal with such data, incremental technique has been proposed in the literature and attracted much attention, which stimulates the result in this paper. When a group of objects are added to a decision table, we first introduce incremental mechanisms for three representative information entropies and then develop a group incremental rough feature selection algorithm based on information entropy. When multiple objects are added to a decision table, the algorithm aims to find the new feature subset in a much shorter time. Experiments have been carried out on eight UCI data sets and the experimental results show that the algorithm is effective and efficient.
科研通智能强力驱动
Strongly Powered by AbleSci AI