An integrated approach for mining meta-rules

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An integrated approach of mining association rules and meta-rules based on a hyper-structure is put forward. In this approach, time serial databases are partitioned according to time segments, and the total number of scanning database is only twice. In the first time, a set of 1-frequent itemsets and its projection database are formed at every partition. Then every projected database is scanned to construct a hyper-structure. Through mining the hyper-structure, various rules, for example, global association rules, meta-rules, stable association rules and trend rules etc. can be obtained. Compared with existing algorithms for mining association rule, our approach can mine and obtain more useful rules. Compared with existing algorithms for meta-mining or change mining, our approach has higher efficiency. The experimental results show that our approach is very promising. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Ye, F., Wang, J., Wu, S., Chen, H., Huang, T., & Tao, L. (2005). An integrated approach for mining meta-rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3587 LNAI, pp. 549–557). Springer Verlag. https://doi.org/10.1007/11510888_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free