@INPROCEEDINGS { Rsds4563,
author = {Han, Jianchao and Lin, Tsau Young}, 
title = {High Frequent Value Reduct in Very Large Databases}, 
booktitle = {Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC'2007)}, 
series =  = {Lecture Notes in Artificial Intelligence}, 
volume = 4482, 
pages = {346--354}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
year = 2007, 
editor = {An, A. and Stefanowski, Jerzy and Ramanna, Sheela and Butz, C. and Pedrycz, Witold and Wang, Guoying}, 
isbn = {978-3-540-72529-9}, 
abstract = {One of the main contributions of rough set theory to data mining is data reduction. There are three reductions: attribute (column) reduction, row reduction, and value reduction. Row reduction is merging the duplicate rows. Attribute reduction is to find important attributes. Value reduction is to reduce the decision rules to a logically equivalent minimal length. Most recent attentions have been on finding attribute reducts. Traditionally, the value reduct has been searched through the attribute reduct. This paper observes that this method may miss the best value reducts. It also revisits an old rudiment idea [11], namely, a rough set theory on high frequency data: The notion of high frequency value reduct is extracted in a bottom-up fashion without finding attribute reducts. Our method can discover concise and important decision rules in large databases, and is described and illustrated by an example.}, 
keywords = {rough set theory, high frequency, decision rule, relational database, }, 
}