Improved approach for infrequent weighted itemsets in data mining
At a glance
- الاستشهادات
- 1
- المراجع
- 15
- Comments
- 0
Abstract
Weighted item-set mining is used to find the profitable connection between the data. There are two types of items contained in dataset i.e. frequent and infrequent. Infrequent item-sets are nothing but items which are rarely found in database. Mining frequent items in data mining are very helpful for retrieving the related data present in the dataset. Using transactional dataset as an input dataset the weighting function is calculated. The infrequent weighted itemset support value is calculated by using the minimum support value. Then addition of processes is carried out for all the systems separately. Then merge the two systems and summate the values which are minimal. Finally, three systems are combined and summate the values which are minimal among the three. The threshold value for the dataset is calculated and the systems combination is filtered. If the addition value is greater than the threshold value, it means, the combination of systems are not considered. Else, it is considered for the next procedure. The equivalent weighted transaction dataset is then calculated from transaction dataset. And the infrequent weighted itemset minimum support value is then find out. After that find the threshold value for the equivalent weighted data itemset. And get the satisfied system summations. Then an infrequent weighted itemset miner is used to find the common systems that present in the two results. Here we are applying UP Growth and UP Growth plus algorithms to find the minimal infrequent itemsets from the transactional database. By Using these algorithms we can find the infrequent weighted itemset. And from the infrequent weighted itemset mining the final result of minimally infrequent itemset is calculated.
Publication details
- DOI
- 10.1109/iceeot.2016.7755177
- OpenAlex
- W2559589348
- Document type
- conference-paper
- Language
- EN
- Last metadata update
Comments
تسجيل الدخول للانضمام إلى النقاش.