Downloads: 116
Survey Paper | Computer Science & Engineering | India | Volume 5 Issue 12, December 2016
Improved Association Rule Mining based on UP-Growth Algorithm
Ashwini Patil | Poonam Gupta [7]
Abstract: Mining of associations have been considered from different point of views, the use of high-dimensional data sets could still be a hard process. Besides, one should considers that, regardless the heuristic considered to solve the problem, the number of data accesses is high, so a data structure that speeds up the queries is the keystone. In this regard, the goal is to propose a suitable data structure that enables to both handle and fast compute high-dimensional data sets. For that purpose, the desired data structure should allow either to simplify or to reorganize data items in order to reduce the data size and provide a faster access to the stored information. In this paper we introduce new algorithm known as UP-growth which has the ability to mine the high dimensional data in less time complexity.
Keywords: Association rule mining ARM, data access, data structure, index compression
Edition: Volume 5 Issue 12, December 2016,
Pages: 515 - 518
How to Cite this Article?
Ashwini Patil, Poonam Gupta, "Improved Association Rule Mining based on UP-Growth Algorithm", International Journal of Science and Research (IJSR), Volume 5 Issue 12, December 2016, pp. 515-518, https://www.ijsr.net/get_abstract.php?paper_id=ART20163484
How to Share this Article?
Similar Articles with Keyword 'data access'
Downloads: 2
Research Paper, Computer Science & Engineering, India, Volume 11 Issue 3, March 2022
Pages: 1275 - 1279A Novel Technique for Authorship Verification of Hijacked Online Social Networks User Accounts
Astha Gupta [2] | Mahesh Parmar
Downloads: 86
Research Paper, Computer Science & Engineering, India, Volume 2 Issue 5, May 2013
Pages: 297 - 300Balancing the Trade-Offs between Data Availability and Query Delay in MANETs
Umar I. Masumdar | N. S. Killarikar