Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/24357
Title: | On Developing Effectual Algorithms For Association Rule Discovery In Transaction Databases |
Researcher: | Umarani V |
Guide(s): | Punithavalli M |
Keywords: | Algorithms Association Rule data mining scalability Transaction Databases |
Upload Date: | 1-Sep-2014 |
University: | Anna University |
Completed Date: | n.d. |
Abstract: | Association rule mining is the most important and well investigated data newlinemining technique used by an organizations decision makers to improve the newlineoverall profit It aids businesses to infer useful information on customer purchase newlinepatterns shelving criterion in retail chains stock trends and more Association newlinerule mining is usually carried out in two steps they are finding frequent item sets newlineand then using these item sets to identify the association rules It is well known newlinethat the first step frequent item set mining dominates the computational and I O newlinerequirements requiring repeated passes over the entire database As the volume of newlinedata in warehouses and on the internet is growing faster the scalability of mining newlinealgorithms is a major concern newlineClassical association rule mining algorithms that require more number of newlinepasses over the entire database can take hours or even days to execute and in the newlinefuture this problem will only become worse Sampling approach can be used to newlinesolve this scalability problem In the context of standard associationrule newlinemining use of samples can make mining studies feasible that were formerly newlineimpractical due to the enormous time requirements Indeed a number of large newlinecompanies routinely run mining algorithms on a sample of their data rather than newlineon the entire warehouse Especially if data comes as a stream flowing at a faster newlinerate sampling seems to be the only choice Current research efforts are focused newlineon inventing efficient ways of discovering these rules from large databases newlineLikewise most of the association rule mining algorithms presented in the newlineliterature are used for mining the static databases Nowadays research newlinecommunity has focused their researches into the incremental database on behalf newlineof the real world applications and the necessity of handling the dynamically newlineupdating new records newlineApplying data mining techniques to realworld applications is a newlinechallenging task because the databases are dynamic ie changes continuously newlinedue to addition deletion modification etc of the contained data newline newline |
Pagination: | xxv,202p |
URI: | http://hdl.handle.net/10603/24357 |
Appears in Departments: | Faculty of Science and Humanities |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 72.88 kB | Adobe PDF | View/Open |
02_certificate.pdf | 1.43 MB | Adobe PDF | View/Open | |
03_abstract.pdf | 69.38 kB | Adobe PDF | View/Open | |
04_acknowledgement.pdf | 65.16 kB | Adobe PDF | View/Open | |
05_contents.pdf | 169.51 kB | Adobe PDF | View/Open | |
06_chapter 1.pdf | 491.73 kB | Adobe PDF | View/Open | |
07_chapter 2.pdf | 190.69 kB | Adobe PDF | View/Open | |
08_chapter 3.pdf | 768.98 kB | Adobe PDF | View/Open | |
09_chapter 4.pdf | 216.93 kB | Adobe PDF | View/Open | |
10_chapter 5.pdf | 1.04 MB | Adobe PDF | View/Open | |
11_chapter 6.pdf | 6.77 MB | Adobe PDF | View/Open | |
12_chapter 7.pdf | 77.64 kB | Adobe PDF | View/Open | |
13_references.pdf | 159.73 kB | Adobe PDF | View/Open | |
14_publications.pdf | 92.25 kB | Adobe PDF | View/Open | |
15_vitae.pdf | 80.03 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: