Full Text:   <1004>

CLC number: TP391

On-line Access: 

Received: 2006-03-02

Revision Accepted: 2006-06-02

Crosschecked: 0000-00-00

Cited: 1

Clicked: 2386

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE A 2006 Vol.7 No.101 P.219~222


Value reduction algorithm in rough sets based on association rules support

Author(s):  Ma Yu-Liang, Yan Wen-Jun

Affiliation(s):  School of Electrical Engineering, Zhejiang University, Hangzhou 310027, China

Corresponding email(s):   myl98@sohu.com, wj.yan@126.com

Key Words:  Association rules, Value reduction, Support, Rough sets

Ma Yu-Liang, Yan Wen-Jun. Value reduction algorithm in rough sets based on association rules support[J]. Journal of Zhejiang University Science A, 2006, 7(101): 219~222.

@article{title="Value reduction algorithm in rough sets based on association rules support",
author="Ma Yu-Liang, Yan Wen-Jun",
journal="Journal of Zhejiang University Science A",
publisher="Zhejiang University Press & Springer",

%0 Journal Article
%T Value reduction algorithm in rough sets based on association rules support
%A Ma Yu-Liang
%A Yan Wen-Jun
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 101
%P 219~222
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.AS0219

T1 - Value reduction algorithm in rough sets based on association rules support
A1 - Ma Yu-Liang
A1 - Yan Wen-Jun
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 101
SP - 219
EP - 222
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.AS0219

Aiming at value reduction, a sort of RSVR algorithm was presented based on support in association rules via Apriori algorithm. A more effective reduction table can be obtained by deleting those rules with less support according to least supportminsup. The reduction feasibility of this algorithm was achieved by reducing the given decision table. Testing by UCI machine learning database and comparing this algorithm with least value reduction algorithm indicate the validity of RSVR algorithm.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article


[1] Agrawal, R., Srikant, R., 1994. Fast Algorithms for Mining Association Rules. Proceedings of the 20th VLDB Conference, Santiago, p.487-499.

[2] Agrawal, R., Imielinski, T., Swami, A., 1993. Mining Association Rules between Sets of Items in Large Databases. Proceedings of the ACM SIGMOD Conference on Management of Data, p.207-216.

[3] Jiang, W.J., Xu, Y.H., Xu, Y.S., 2005. Research on the Nature of Reduction to Simplifying Reduction Algorithm. Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, Guangzhou, p.1800-1805.

[4] Lin, T.Y., 1996. Rough Set Theory in Very Large Databases. Proceedings of CESA’96, Lille, p.936-941.

[5] Liu, Q., 2001. Rough Sets and Rough Reasoning. Science Press, Beijing (in Chinese).

[6] Pawlak, Z., 1991. Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Boston.

[7] Pawlak, Z., 1995. Vagueness and uncertainty—A rough set perspective. Computation Intelligence, 11(2):227-232.

[8] Wang, J., Wang, R., Miao, D.Q., 1998. Data condensation based on rough set theory. Computer Transaction, 21(5):393-400 (in Chinese).

[9] Yang, Z.F., Guo, J.F., Chang, F., 2003. A value reduction method based on rough sets. Computer Engineering, 29(9):96-97 (in Chinese).

Open peer comments: Debate/Discuss/Question/Opinion


Please provide your name, email address and a comment

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - Journal of Zhejiang University-SCIENCE