Abstract
By considering different weights of the items, weighted frequent pattern (WFP) mining becomes an important research issue in data mining and knowledge discovery. However, existing algorithms cannot be applied for incremental and interactive WFP mining because they are based on a static database and require multiple database scans. In this paper, we present a novel tree structure (Incremental WFP tree based on weight ascending order) and an algorithm for incremental and interactive WFP mining using a single database scan. Extensive performance analyses show that our tree structure and algorithm are efficient for incremental and interactive WFP mining. © 2008 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Ahmed, C. F., Tanbeer, S. K., Jeong, B. S., & Lee, Y. K. (2008). Mining weighted frequent patterns in incremental databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5351 LNAI, pp. 933–938). https://doi.org/10.1007/978-3-540-89197-0_87
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.