An Improved Value Reduction Algorithm Based on Core Value


Article Preview

Value reduction algorithm can filter and delete redundant conditional attribute value, so as to obtain decision rule of information system with least conditional attribute values. Based on the introduction of basic value reduction algorithm, the paper supplemented functions. Aiming at the circumstance of there is no repeated record and no conflict after deleting some attributes of a record, the algorithm supplement it. The example of value reduction based on the improved algorithm illustrated that it is an effective value reduction algorithm and an important supplement of basic value reduction algorithm.



Edited by:

Yanwen Wu






W. Du and W. Wang, "An Improved Value Reduction Algorithm Based on Core Value", Advanced Materials Research, Vol. 187, pp. 216-220, 2011

Online since:

February 2011





[1] Lin T Y: Rough Set Theory in Very Large Databases, Proceedings of IMACS. Vol. 2, 1996, pp.942-947.

[2] Chan P and Stolfo S: On the Accuracy of Meta-learning for Scalable Data Mining, Journal of Intelligent Systems, vol. 8, 1997 pp.5-28.

[3] Anannd S: EDM: A General Framework for Data Mining Based on Evidence Theory, Data & Knowledge Engineering, vol. 18, 1996, pp.189-223.

DOI: 10.1016/0169-023x(95)00038-t

[4] Chen M.: Data Mining: An Overview from a Database Perspective, IEEE Transactions on Knowledge and Data Engineering, vol. 8, 1996, pp.866-883.

DOI: 10.1109/69.553155

[5] Breslow L and Aha D.: Simplifying Decision Trees: A Survey, Knowledge Engineering Review, vol. 12, 1997, pp.1-40.

In order to see related information, you need to Login.