Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Mining Frequent Weighted Closed Itemsets
verfasst von : Bay Vo, Nhu-Y Tran, Duong-Ha Ngo
Erschienen in: Advanced Computational Methods for Knowledge Engineering
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Mining frequent itemsets plays an important role in mining association rules. One of methods for mining frequent itemsets is mining frequent weighted itemsets (FWIs). However, the number of FWIs is often very large when the database is large. Besides, FWIs will generate a lot of rules and some of them are redundant. In this paper, a method for mining frequent weighted closed itemsets (FWCIs) in weighted items transaction databases is proposed. Some theorems are derived first, and based on them, an algorithm for mining FWCIs is proposed. Experimental results show that the number of FWCIs is always smaller than that of FWIs and the mining time is also better.