Decision Making For Items To Be Kept For Sale In Supermarket Using Fuzzy-Genetic Approach with Single Minimum Support Using 3-Dimensional k-means Clustering
Keywords:
3 dimensional k-means Clustering, data mining, fuzzy set, Fuzzy Mining(FM), genetic algorithm, chromosomes, confidence, Fuzzy Association Rules, membership functions, Quantitative transactionsAbstract
Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Most conventional data-mining algorithms identify the relationships among transactions using binary values. Transactions with quantitative values are however commonly seen in real-world applications. The fuzzy concepts are used to represent item importance, item quantities, minimum supports and minimum confidences. Fuzzy operation like intersection is used to find large itemsets and association rules. Each attribute uses only the linguistic term with the maximum cardinality in the mining process. It uses a combination of large 1-itemsets and membership-function suitability to evaluate the fitness values of chromosomes. The calculation for large 1-itemsets could take a lot of time, especially when the database to be scanned could not totally fed into main memory. In this system, an enhanced approach, called the 3-dimensional k-means cluster-based fuzzy-genetic mining algorithm is used, which uses the coverage factor overlap factor and average of both factors to cluster the chromosomes. It divides the chromosomes in a population into clusters by the 3-dimensional k-means clustering approach and evaluates each individual according to both cluster and their own information. A genetic- fuzzy data-mining algorithm for extracting fit membership functions and multilevel association rules with its confidence from quantitative transactions is shown in this paper.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Computer Information Systems and Industrial Management Applications
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.