Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Mining association rules with multiple minimum supports
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Data mining: concepts and techniques
Data mining: concepts and techniques
Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
An Efficient Hash-Based Method for Discovering the Maximal Frequent Set
COMPSAC '01 Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development
An Effective Boolean Algorithm for Mining Association Rules in Large Databases
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Swarm Optimisation as a New Tool for Data Mining
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Expert Systems with Applications: An International Journal
Computers & Mathematics with Applications
An improved association rules mining method
Expert Systems with Applications: An International Journal
Damage detection based on improved particle swarm optimization using vibration data
Applied Soft Computing
Association rule mining using binary particle swarm optimization
Engineering Applications of Artificial Intelligence
Multi-objective PSO algorithm for mining numerical association rules without a priori discretization
Expert Systems with Applications: An International Journal
Mining association rules with single and multi-objective grammar guided ant programming
Integrated Computer-Aided Engineering
Hi-index | 0.00 |
In the area of association rule mining, most previous research had focused on improving computational efficiency. However, determination of the threshold values of support and confidence, which seriously affect the quality of association rule mining, is still under investigation. Thus, this study intends to propose a novel algorithm for association rule mining in order to improve computational efficiency as well as to automatically determine suitable threshold values. The particle swarm optimization algorithm first searches for the optimum fitness value of each particle and then finds corresponding support and confidence as minimal threshold values after the data are transformed into binary values. The proposed method is verified by applying the FoodMart2000 database of Microsoft SQL Server 2000 and compared with a genetic algorithm. The results indicate that the particle swarm optimization algorithm really can suggest suitable threshold values and obtain quality rules. In addition, a real-world stock market database is employed to mine association rules to measure investment behavior and stock category purchasing. The computational results are also very promising.