Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/5192
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRajpoot, Lucky-
dc.contributor.authorKumar, Pardeep [Guided by]-
dc.date.accessioned2022-07-26T08:51:07Z-
dc.date.available2022-07-26T08:51:07Z-
dc.date.issued2014-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui//xmlui/handle/123456789/5192-
dc.description.abstract1.1 Data mining and knowledge discovery [1]: Data mining is the process of extracting interesting (implicit, nontrivial, earlier unknown and potentially useful) information or patterns from large data repositories such as: data warehouses, relational database, XML repository etc. Data mining is one of the core processes of Knowledge Discovery in Database (KDD) which is the extracted knowledge from the large datasets used for generating patterns and decision making. There three main tasks in data mining:  Pre-processing - This is the process which is executed before data mining techniques are applied to the right data. The pre-processing includes data cleaning, integration, selection and transformation.  Data mining process – In this process hidden knowledge is produced by applying different algorithm.  Post-processing – After having the mining results, the mining result is evaluated according to user’s requirements and domain knowledge.en_US
dc.language.isoenen_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectData miningen_US
dc.subjectAlgorithmsen_US
dc.subjectFrequent patternen_US
dc.subjectHadoopen_US
dc.subjectFP-growthen_US
dc.subjectH-mineen_US
dc.titleDesign and Implementation of Global Frequent Pattern Mining Algorithm Using Map Reduceen_US
dc.typeProject Reporten_US
Appears in Collections:Dissertations (M.Tech.)

Files in This Item:
File Description SizeFormat 
Design and Implementation of Global Frequent Pattern Mining Algorithm Using Map Reduce.pdf3.81 MBAdobe PDFView/Open


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