Incremental Rules Mining Algorithm Based on Incomplete Decision Table

Article Preview

Abstract:

The traditional approach to deal with incomplete information system is to make it completed, when a new object added only need a static attribute reduction algorithm to obtain the rules, wastes a lot of resources. The goal of incremental rules mining is to maintain the consistency of the rules in incomplete decision table. When a new object is added, establish discernibility matrix of the original decision table, get distribution reduction set, then generate conjunctive items export rules set. It introduces incremental learning concept, avoids tedious counting process. It can be effective for large-scale incomplete ocean data reduction and it also provides a strong basis for decision making for the marine environment processing and follow-up processing.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1314-1318

Citation:

Online since:

July 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Wenxiu Zhang, Wei zhi Wu, Jiye Liang. rough set theory and method, Beijing: Science Press, 2001, 1-200. (In Chinese).

Google Scholar

[2] JuSheng Mi, Weizhi Wu, Wenxiu Zhang. Approaches to knowledge reduction based on variable precision rough sets model. Information Sciences, 2004159(3/4): 255-272.

DOI: 10.1016/j.ins.2003.07.004

Google Scholar

[3] Pawlak Z. Rough Sets theoretical aspects of reasoning about Data[M].Dordrecht: Kluwer Academic Publishers, 1991: 9-30.

Google Scholar

[4] Qingxia Yun, Gang Li. Rough set theory in mine scheduling knowledge mining, metal mining, 2004, 340 (10): 1-4, 13. (In Chinese).

Google Scholar

[5] Kennedy J, Eberhart RA. Partical swarm optimization[C]. Proccedings of IEEE International Conference on Network. Australia, 1995(4): 1942-(1948).

Google Scholar

[6] Wei Dong, Jianhui Wang, Shusheng Gu. Based on variable precision rough set theory rules mining algorithms Control Engineering, 2007, 14(01) 73-75. (In Chinese).

Google Scholar

[7] Chen Wu, Xiaohua Hu, Xiaojiong Shen et . Anincremental algorithm for mining default definite decision rules from incomplete decision table[C]. IEEE International Conference on Granular Computing. 2007: 175-179.

DOI: 10.1109/grc.2007.57

Google Scholar

[8] Liping An, Yuhua Wu, with soaring the incremental mining rules rough set [J]. Journal of Nankai University: Natural Science Edition, 2003, 36 (2): 98-103. (In Chinese).

Google Scholar

[9] Xuelan Li. Extraction algorithm based on improved discernibility matrix incremental rules . Computer Science, 2003, 30 (5): 46-49. (In Chinese).

Google Scholar

[10] Xu Tan. Improved discernibility matrix under the incremental condition attributes reduction method. Theory and practice of systems engineering, 2010, 30 (9): 1685-1693. (In Chinese).

Google Scholar

[11] Lihe Guan, Guoyin Wang, hong Yu. The incremental attribute order Pawlak reduction algorithm. Of Xi'an Jiaotong University, 2011, 46 (3) 461-466. (In Chinese).

Google Scholar