Please use this identifier to cite or link to this item:
|Title:||Mining top-k covering rule groups for gene expression data|
|Source:||Cong, G.,Tan, K.-L.,K.h.tung, A.,Xu, X. (2005). Mining top-k covering rule groups for gene expression data. Proceedings of the ACM SIGMOD International Conference on Management of Data : 670-681. ScholarBank@NUS Repository. https://doi.org/10.1145/1066157.1066234|
|Abstract:||In this paper, we propose a novel algorithm to discover the top-k covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets show that the new top-k covering rule mining algorithm is orders of magnitude faster than previous association rule mining algorithms. Furthermore, we propose a new classification method RCBT. RCBT classifier is constructed from the top-k covering rule groups. The rule groups generated for building RCBT are bounded in number. This is in contrast to existing rule-based classification methods like CBA  which despite generating excessive number of redundant rules, is still unable to cover some training data with the discovered rules. Experiments show that the RCBT classifier can match or outperform other state-of-the-art classifiers on several benchmark gene expression datasets. In addition, the top-k covering rule groups themselves provide insights into the mechanisms responsible for diseases directly. Copyright 2005 ACM.|
|Source Title:||Proceedings of the ACM SIGMOD International Conference on Management of Data|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 11, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.