Apriori Algorithm using Hashing for Frequent Itemsets Mining
Author(s) -
Debabrata Datta,
Atindriya De,
Deborupa Roy,
Soumodeep Dutta
Publication year - 2018
Publication title -
international journal of education and management engineering
Language(s) - English
Resource type - Journals
eISSN - 2305-8463
pISSN - 2305-3623
DOI - 10.5815/ijeme.2018.06.05
Subject(s) - apriori algorithm , computer science , data mining , hash function , association rule learning , set (abstract data type) , data warehouse , a priori and a posteriori , process (computing) , algorithm , philosophy , computer security , epistemology , programming language , operating system
Data Warehousing, data mining and analysis plays a very important role in decision support. Various commercial organisations are using tools based on these techniques to be used for decision support system. Apriori algorithm is a classic algorithm which works on a set of data in the database and provides us with the set of most frequent itemsets. It is used to find the association rules and mines the most frequent itemsets in a set of transactions. Here the frequent subsets are extended one item at a time. In this paper a hash-based technique with Apriori algorithm has been designed to work on data analysis. Hashing helps in improving the spatial requirements as well as makes the process faster. The main purpose behind the work is to help in decision making. The user will select an item which he/she wishes to purchase, and his/her item selection is analysed to give him/her an option of two and three item sets. He/she can consider choosing a combination of two item sets or three item sets, or he/she can choose to go with his/her own purchase. Either ways, the algorithm helps him in making a decision.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom