Association Rule Mining Using k-Map Model in Data Mining
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
In data mining, many algorithms were suggested to define the frequent rules within the data set. One of the problems is to choose a correct algorithm for the problem and the determination of the efficiency of the algorithm has important role during the investigation of hidden knowledge. The thesis describes how to handle data set with Association Rules Analysis/ Market Basket Analysis with the popular Apriori algorithm and k -Map algorithm of data mining. The goal of this thesis is to find the most frequent patterns within the data set and then using different measurements to do further investigation on the obtained frequent patterns. Keywords: Data Mining, Association Rules Analysis, Market-Basket Analysis
Author
Daban Abdulsalam Abdullah
How to Cite
Daban Abdulsalam Abdullah (Master Thesis). Association Rule Mining Using k-Map Model in Data Mining, 2015, Eastern Mediterranean University, Department of Mathematics.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Eastern Mediterranean University
- An Investigation on Time and Cost Overrun in Construction Projects(2012)
- Predicting performance level of reinforced concrete structures subject to corrosion as a function of time(2012)
- Community Based Tourism (CBT) Planning- A Mechanism for Socio-Ecology Survival: A Case Study of Lake Urmia IRAN(2018)
- Serial Mediation Mechanism of Service Innovative Behaviours in the Hotel Industry: Effects of Constructive Leadership, Psychological Safety and Engagement in Creative Works(2021)
- The Use of Passive Cooling Strategies to Improve the Thermal Comfort of Mid-rise Contemporary Residential Buildings in Abuja, Nigeria(2023)
- Design and Analysis of a Novel Artificial Cervical Disc(2019)
