Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/231435
Title: Development of efficient algorithms for mining optimized positive and negative association rule
Researcher: Berin Jeba Jingle I
Guide(s): Jeya A Celin J
University: Manonmaniam Sundaranar University
Completed Date: 2017
Abstract: Data mining is the process of extracting high quality datasets or patterns from newlinea massive database with various technologies embedded in it. Association rule mining newlineis one of the vital mining methods used in data mining which extracts many newlineprospective information and associations from large amount of databases. Many newlinedifferent existing methodologies are used in the case of association rule mining for newlinegenerating positive association rule from frequent item set and for generating negative newlineassociation rule from infrequent item set which results in lack of efficiency and newlineaccuracy. The extracted rules also lack in quality. newlineAssociation rule is one of the momentous research fields which is incredibly newlineused in discovering frequent and infrequent datasets in text documents. Usually, the newlinerules generated from frequent item sets are named as Positive Association Rule newline(PAR). Mining the Negative Association Rule (NAR) from the infrequent item set is a newlinechallenging issue because more valuable information is hidden here which is more newlineuseful than PAR in the case of medical field. Most probably, the positive symptoms newlineof a disease are easily recognised and always it is strong. But negative symptoms are newlinevery difficult to distinguish and diagnose. This research has three contributions which newlineprove, through the result analysis how the algorithm helps to detect symptoms and newlineprescriptions in the case of medical field related to cancer. newlineThe first contribution focuses on finding or generating meaningful or accurate newlinefrequent and infrequent item sets using the proposed Apriori_AMLMS (Accurate newlineMulti level Minimum support) algorithm. newline
Pagination: xv, 152p.
URI: http://hdl.handle.net/10603/231435
Appears in Departments:Department of Computer Science & Engg.

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File20.61 kBAdobe PDFView/Open
02_certificate.pdf19.46 kBAdobe PDFView/Open
03_declaration.pdf15.07 kBAdobe PDFView/Open
04_acknowledgement.pdf18.78 kBAdobe PDFView/Open
05_content.pdf25.69 kBAdobe PDFView/Open
06_tables&figures.pdf33.62 kBAdobe PDFView/Open
09_chapter1.pdf422.24 kBAdobe PDFView/Open
10_chapter2.pdf126.78 kBAdobe PDFView/Open
11_chapter3.pdf422.84 kBAdobe PDFView/Open
12_chapter5.pdf339.64 kBAdobe PDFView/Open
13_chapter6.pdf192.97 kBAdobe PDFView/Open
14_chapter7.pdf17.94 kBAdobe PDFView/Open
15_reference.pdf94.26 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: