Traditional k-means algorithm is well known for its clustering ability and efficiency on large amount of data sets. But this method is well suited for numeric values only and cannot be effectively used for categorical data sets. In this paper, we present modified k-means algorithms that can that can perform clustering very effectively on mixed data sets. The main intuition behind our proposed method is that all prototypes are the potential candidates at the root level. For the children of the root node, we can prune the candidate set by using simple geometrical constraints. The experimental results show that this method is well suited for categorical data sets and overall time of computation is very minimal.
Association rule mining is one of the most interesting and challenging task in data mining process. There exists many association rule mining techniques, each having merits and demerits. The main problem that exists in many traditional association rule mining algorithms is that these algorithms need more than one database scan to generate association rules. As scanning the database is a costly operation, algorithms capable of generating association rules with only one scan is the need of the hour. In this paper, a novel algorithm for generating association rules is presented which uses hashing function. This algorithm scans the database only once by utilizing the latest version of priori algorithm, direct hashing algorithm and pruning process. The algorithm discovers set of association rules from frequent k-item sets by computing the frequency of each item set. Then pruning process is applied to minimize the number of item sets generated after scanning the size of the database. Experimental results show that our method is very effective in generating association rules without any collision, leading to very high data accuracy.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.