International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 103 - Number 5 |
Year of Publication: 2014 |
Authors: Sujatha Kamepalli, Raja Sekhara Rao Kurra, Sundara Krishna.y.k |
10.5120/18070-9013 |
Sujatha Kamepalli, Raja Sekhara Rao Kurra, Sundara Krishna.y.k . Infrequent Weighted Item Set Mining in Complex Data Analysis. International Journal of Computer Applications. 103, 5 ( October 2014), 12-17. DOI=10.5120/18070-9013
Infrequent Weighted Association Mining (IWAM) is one of the main areas in data mining for extracting the rare items in high dimensional datasets. Traditional Association rule mining algorithms produce large number of candidate sets along with the database scans. Due to large number of transactions and database size, traditional methods consume more time to find the relevant association rules with the specified threshold. Prior and post database scans are required an additional effort to validate the association rules. Most of the existing weighted models are implemented for mining frequent itemsets, but finding infrequent itemset mining are useful in many recent fields like web,medical,cloud,complex databases,protein sequence etc. In weighted infrequent association rule mining, each item in the transaction is assigned a weight in order to mine high utility infrequent itemsets. In this proposed work, weighted association rule mining algorithm is proposed to find infrequent itemsets using weighted threshold measures. Proposed approach gives better results on real-time datasets compare to existing weighted models.