文摘
英文文摘
论文说明:LIST OF FIGURES、LIST OF TABLES
CHAPTER 1:INTRODUCTION
1.1 Statement of Problem
1.1.1 Definition(Utility Mining)
1.1.2.Definition The transaction utility value in a transaction
1.1.3.Definition.The external utility value
1.1.4.Definition (Utility Table)
1.1.5.Definition A utility function f (o,s)
1.1.6.Definition The utility of an item iq in a transaction Tq
1.1.7.Definition A k-itemset
1.1.8.Defmition The local utility
1.1.9.Definition The utility of an itemset X
1.2.Theoretical Model of Utility Mining
1.2.1 Goal of utility mining
1.3.Motivation and Contribution of the Thesis
1.4.Outline of the Thesis
CHAPTER 2: PERFORMANCE ISSUES OF EFFICIENTLY MINING HIGH UTILITY ITEMSETS WITH NEGATIVE ITEM VALUES FROM LARGE DATABASES
2.1 Background
2.2. SOME ALGORITHMS AND APPLICATION
2.2.1 Apriori Algorithm
2.2.2. Algorithm FUP
2.2.3. Algorithm FUP2
2.2.4 Algorithm UWEP(Update With Early Pruning)
2.2.5. Algorithm FTP-DS
2.2.6. Algorithm RAM-DS
2.2.7 Algorithm SWF and CET
2.2.8 Algorithm MEU 20
2.2.9 Algorithm Two-Phase
2.2.10 Algorithm THUI(Temporal High Utility Itemsets)
CHAPTER 3: PROPOSED ALGORITHM(HUINIV)-MINE
3.1.Basic concept of HUIWNIV-Mine
3.2.An example of mining high utility itemsets with negative item values
3.3.HUINIV-Mine Algorithm
CHAPTER 4: EXPERIMENTAL RESULTS
4.Experimental evaluation
4.1.Evaluation of number of generated candidates
4.2.Evaluation of execution time
4.3.Scale-up on incremental mining
4.4.Evaluation with real data
CHAPTER 5: CONCLUSIONS AND FUTURE WORK 52错误!未定义书签。
REFERENCES
ACKNOWLEDGEMENTS
APPENDIX B: PUBLISHED PAPER
湖南大学;