Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Gharib, Tarek F.a; * | Taha, Mohamedb | Nassar, Hamedb
Affiliations: [a] Faculty of Computer and Information Sciences, Ain Shams University, Cairo 11566, Egypt | [b] Faculty of Computers and Informatics, Suez Canal University, Ismailia, Egypt
Correspondence: [*] Corresponding author. E-mail: tgharib@asunet.shams.edu.eg
Abstract: Recent developments in information technology resulted in rapid accumulation of huge amounts of data. Therefore, the task of managing large databases efficiently, in addition to quickly retrieving useful information and mining association rules, has become increasingly important. In this paper, an efficient technique is proposed for updating the discovered association rules in incremental databases. The experimental results show that the proposed algorithm is quite efficient and outperforms other well known algorithms.
Keywords: Incremental mining, maintenance of association rules, updating association rules
DOI: 10.3233/HIS-2008-5104
Journal: International Journal of Hybrid Intelligent Systems, vol. 5, no. 1, pp. 45-53, 2008
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl