Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Efficiently Mining High Average Utility Itemsets with a Tree Structure
verfasst von : Chun-Wei Lin, Tzung-Pei Hong, Wen-Hsiang Lu
Erschienen in: Intelligent Information and Database Systems
Verlag: Springer Berlin Heidelberg
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
The average utility measure has recently been proposed to reveal a better utility effect of combining several items than the original utility measure. It is defined as the total utility of an itemset divided by its number of items within it. In this paper, a new mining approach with the aid of a tree structure is proposed to efficiently implement the concept. The high average utility pattern tree (HAUP tree) structure is first designed to help keep some related information and then the HAUP-growth algorithm is proposed to mine high average utility itemsets from the tree structure. Experimental results also show that the proposed approach has a better performance than the Apriori-like average utility mining.