Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Fast vertical mining using diffsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure
IEEE Transactions on Knowledge and Data Engineering
A fast high utility itemsets mining algorithm
UBDM '05 Proceedings of the 1st international workshop on Utility-based data mining
Mining itemset utilities from transaction databases
Data & Knowledge Engineering - Special issue: ER 2003
CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach
CIT '07 Proceedings of the 7th IEEE International Conference on Computer and Information Technology
Isolated items discarding strategy for discovering high utility itemsets
Data & Knowledge Engineering
A bottom-up projection based algorithm for mining high utility itemsets
AIDM '07 Proceedings of the 2nd international workshop on Integrating artificial intelligence and data mining - Volume 84
Mining long high utility itemsets in transaction databases
WSEAS Transactions on Information Science and Applications
An Efficient Candidate Pruning Technique for High Utility Pattern Mining
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
A Novel Algorithm for Mining High Utility Itemsets
ACIIDS '09 Proceedings of the 2009 First Asian Conference on Intelligent Information and Database Systems
Efficiently mining high average utility itemsets with a tree structure
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
A three-scan algorithm to mine high on-shelf utility itemsets
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
A new method for mining Frequent Weighted Itemsets based on WIT-trees
Expert Systems with Applications: An International Journal
A tree-based approach for mining frequent weighted utility itemsets
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
A space-time trade off for FUFP-trees maintenance
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II
MEI: An efficient algorithm for mining erasable itemsets
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
Methods for mining high utility itemsets from databases have been discussed widely in recent years. They mine itemsets having high utility from databases. Pruning candidates based on transaction-weighted utilisation value is a good method at all. In this paper, we develop a tree structure called WIT-tree, and use it in the proposed TWU-mining algorithm, an algorithm for improving the mining time and the search space. Using Diffset for fast computing transaction-weighted utilisation values and saving memory will be discussed. Experimental results show that proposed algorithms are more efficient.