Improved Aprori Algorithm Based on bottom up approach using Probability and Matrix

Kumar, Sunil S and Karanth, Shyam S and Akshay, KC and Prabhu, Ananth and Kumar, Bharathraj M (2012) Improved Aprori Algorithm Based on bottom up approach using Probability and Matrix. International Journal of Computer Science, 9 (2). pp. 242-246. ISSN 1694-0814

[img] PDF
2012_IJCSI_Improved Aprori Algorithm Based on bottom up approach using Probability and Matrix.pdf - Published Version
Restricted to Registered users only

Download (668kB) | Request a copy
Official URL: http://www.IJCSI.org

Abstract

Knowledge Discovery through mining association rule among data from a large database is the one of key area of research. The first proposed Algorithm apriori is used to mine frequent items from the large database which leads to mine Association Rule between the data for discovering the Knowledge from the large database. Due to the limitation and complexity of Apriori algorithm, lot of research is underway for discovering new algorithms with a motive of minimizing the time and number of database scans for Knowledge Discovery through mining Association Rule among data from a large database. This paper propose one such kind of new algorithm which takes less number of scans to mining the frequent items from the large database which leads to mine the association rule between the data

Item Type: Article
Uncontrolled Keywords: Apriori, Confidence, Support, matrix, AND operation, frequent Item Set,Probablity
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Engineering > MIT Manipal > Information and Communication Technology
Depositing User: MIT Library
Date Deposited: 26 May 2016 10:12
Last Modified: 26 May 2016 10:12
URI: http://eprints.manipal.edu/id/eprint/146155

Actions (login required)

View Item View Item