A database perspective on knowledge discovery
Communications of the ACM
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fuzzy association rules and the extended mining algorithms
Information Sciences—Informatics and Computer Science: An International Journal
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Sensor fusion and automatic vulnerability analysis
WISICT '05 Proceedings of the 4th international symposium on Information and communication technologies
A systematic approach to the assessment of fuzzy association rules
Data Mining and Knowledge Discovery
Efficient Mining of Frequent Patterns from Uncertain Data
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Maintenance of generalized association rules for record deletion based on the pre-large concept
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
GUFI: A New Algorithm for General Updating of Frequent Itemsets
CSEWORKSHOPS '08 Proceedings of the 2008 11th IEEE International Conference on Computational Science and Engineering - Workshops
Hi-index | 0.00 |
In the last years, the problem of Frequent Itemset Mining (FIM) from imperfect databases has been sufficiently tackled to handle many kinds of data imperfection. However, frequent itemsets discovered from databases describe only the current state of the data. In other words, when data are updated, the frequent itemsets could no longer reflect the data, i.e., the data updates could invalidate some frequent itemsets and vice versa, some infrequent ones could become valid. In this paper, we try to resolve the problem of Incremental Maintenance of Frequent Itemsets (IMFI) in the context of evidential data. We introduce a new maintenance method whose experimentations show efficiency compared to classic methods.