Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/16041
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBORAH, MALAYA DUTTA-
dc.date.accessioned2017-11-10T16:17:49Z-
dc.date.available2017-11-10T16:17:49Z-
dc.date.issued2017-10-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/16041-
dc.description.abstractChanges in the underlying database occur due to proliferation of innovations from heterogeneous online and offline resources. Mining frequent patterns are costly in changing databases, since it requires scanning the database from the start. Incremental Mining of frequent patterns is a solution to deal with this problem. The incremental mining process uses previous mining result to get the desired knowledge by reducing mining costs in terms of time and space. This research focuses on incremental mining of frequent patterns using four approaches. Firstly, it is important to take into account the functionality i.e. Kind of patterns and performance (how to mine frequent patterns) of the patterns to be mined. One approach to find frequent patterns from frequently changing databases is to construct efficient data structures. A novel tree based data structure and mining algorithm called TIMFP (Tree for Incremental Mining of Frequent Pattern) is proposed, which is compact as well as based on “Build Once and Mine Many” property. Secondly, to measure the semantic significance of an item as per users‟ perspectives, a novel approach for mining high utility is presented. Focus of this research work is to introduce Average Maximum Utility (AvgMU) concept, which prunes items in early stages to avoid unnecessary staying of the items in the pruning phases. Thirdly, this work proposes a tree based algorithm called CIFMine (Constraint based Incremental Frequent Pattern Mining) to mine the incremental data by using a dataset filtering technique. In general, the goal of the pattern mining process is to v discover all the patterns from the data sources where not all the patterns may be suitable for the end user. This approach focuses on the constraints and specifies the desired properties of the patterns to mine that are likely to be of interest for the end user. Lastly, we have focused on Educational Data Mining (EDM) by focusing research trends, challenges and Educational Outcomes to enhance the quality of education. A modified constraint based algorithm “Modified TIMFP” (Modified Tree for Incremental Mining of Frequent Pattern) to construct and mine incremental educational data is proposed. All the approaches are tested using Synthetic and Real dataset. This research successfully establishes the fact that, approaches for Incremental Mining of frequent patterns are cost effective (in terms of time and space), efficient, scalable and produces optimal solutions for mining frequent patterns from different kind of data as compared to traditional frequent pattern mining approaches.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD-3018;-
dc.subjectINCREMENTAL MININGen_US
dc.subjectFREQUENT PATTERNSen_US
dc.subjectEDUCATIONAL DATAen_US
dc.subjectMODIFIED TIMFPen_US
dc.titleINCREMENTAL MINING OF FREQUENT PATTERNS FROM THE EDUCATIONAL DATAen_US
dc.typeThesisen_US
Appears in Collections:Ph.D. Computer Engineering

Files in This Item:
File Description SizeFormat 
PhD Final Thesis Malaya D Borah.pdf2.52 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.