A NEW ALGORITHM:Efficient cost algorithms for reducing high toll transactions |
Author(s): |
VINAY SINGH , GALGOTIAS UNIVERSITY; Dr.S.Gavaskar, GALGOTIAS UNIVERSITY |
Keywords: |
Data Mining, High utility item sets Transactional databases. |
Abstract |
Mining Cost Efficient item-sets from a transactional database refers to the discovery of transaction sets with Cost Efficient characteristics improving all profits. Although a number of important algorithms have been proposed in recent years, they incur the problem of producing a large number of candidate item-sets for Cost Efficient item-sets. Such a large number of candidate item-sets degrade the mining performance in terms of execution time and space requirement. The condition may become worse when the database contains lots of long transactions or long Cost Efficient item-sets. In this paper, we propose new algorithm, for mining Cost Efficient item-sets with a set of effective strategies for pruning candidate item-sets. The information of Cost Efficient item-sets is maintained in a tree-based data structure such that candidate item-sets can be generated efficiently with only two scans of database. |
Other Details |
Paper ID: IJSRDV2I4051 Published in: Volume : 2, Issue : 4 Publication Date: 01/07/2014 Page(s): 85-89 |
Article Preview |
|
|