International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 119 - Issue 13 |
Published: June 2015 |
Authors: S.Kannimuthu, S.Gunasekaran, S.Roopa |
![]() |
S.Kannimuthu, S.Gunasekaran, S.Roopa . Review on Hiding the Sensitive High Utility Itemsets. International Journal of Computer Applications. 119, 13 (June 2015), 30-33. DOI=10.5120/21130-3938
@article{ 10.5120/21130-3938, author = { S.Kannimuthu,S.Gunasekaran,S.Roopa }, title = { Review on Hiding the Sensitive High Utility Itemsets }, journal = { International Journal of Computer Applications }, year = { 2015 }, volume = { 119 }, number = { 13 }, pages = { 30-33 }, doi = { 10.5120/21130-3938 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2015 %A S.Kannimuthu %A S.Gunasekaran %A S.Roopa %T Review on Hiding the Sensitive High Utility Itemsets%T %J International Journal of Computer Applications %V 119 %N 13 %P 30-33 %R 10.5120/21130-3938 %I Foundation of Computer Science (FCS), NY, USA
The Association Rule Mining is the traditional mining technique which identifies the frequent itemsets from the databases and this technique generates the rules by considering the each items. The traditional association rule mining fails to obtain the infrequent itemsets with higher profit. Since association rule mining technique treats all the items in the database equally by considering only the presence of items within the transaction. The above problem can be solved using the Utility Mining technique. The Utility Mining technique identifies the product combinations with high profit but low frequency itemsets in the transactional database. Hiding High Utility Itemsets (HUIs) is the main challenges faced in the utility mining. In this paper, a detailed discussion about the traditional Association Rule Mining and the various algorithms involved in Utility Mining is explained.