A TIME EFFICIENT TECHNIQUE FOR MINING HIGH UTILITY ITEM SETS FROM A LARGE DATA SET

A TIME EFFICIENT TECHNIQUE FOR MINING HIGH UTILITY ITEM SETS FROM A LARGE DATA SET
Author(s):
Aabhas Solanki, Amit Kumar Sariya
Keywords:
Data Mining, High Utility Mining, Minimum Utility, 2 phase algorithm
Abstract
Information Mining, additionally called learning Discovery in Database, is one of the most recent research region, which has developed in light of the Tsunami information or the surge of information, world is confronting these days. It has responded to the call to create methods that can assist people with discovering valuable patterns in monstrous information. One such significant method is utility mining. Visit thing set mining attempts to find thing set which are every now and again show up in exchange database, which can be find based on help and certainty estimation of various itemset. Utilizing successive itemset mining idea as a base, numerous scientists have likewise proposed diverse new idea on utility based mining of itemset. This paper exhibits an investigation of different approachs utilized for mining high utility thing sets from an utility informational collection. This paper also presents a hash map based technique for mining all high utility itemsets from a transaction data set and profit data set. The proposed technique is efficient in comparison to existing technique.
Article Details
Unique Paper ID: 148127 Publication Volume & Issue: Volume 5, Issue 12 Page(s): 453 - 456
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org