Search
4 articles for “high utility item set mining”
-
Enhanced Association Rule Mining Algorithm (EARMA) for Reducing Computational Time on Large Data Set
Abstract: Association rule learning is a trendy process for discovering exciting relationships between variables in big database. It is frequently used in market basket analysis field e.g. if a buyer buys onions and potatoes then he also purchases beef. But, in fact, it can be implemented in different application area where we want to determine the association among variables. The APRIORI method is definitely the trendiest. But, even with its good …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 3, Issue 2, 2016 · pp. 20–25 Read article
-
A Study of Mining High Utility Itemset
Abstract: Cost effective exploitation of a transactional database refers to the procedure of choosing the transaction sets with most cost effective features that will improve overall incomes of a company. A plethora of data mining algorithms have been recommended in the past few years to focus on mining item sets with high utility value. The word utility is about that feature of item-sets. Thus, mining algorithms tries to find out all …
Published in Journal of Software Engineering Tools & Technology Trends · Vol. 2, Issue 3, 2015 · pp. 21–25 Read article
-
Parallelizing Apriori Algorithm using Open MP
Abstract: An Association rule mining used for finding frequent item sets thus generating rules from the frequent item sets. Finding frequent itemsets is more expensive in terms of CPU power and computing resources utilization. Apriori Algorithm is used for high dimensionality on massively large data sets. Parallelism reduces the time required for serial processing. Parallel computing can be applied for mining of association rules. Parallel apriori algorithm focus on parallelizing the …
Published in Recent Trends in Parallel Computing · Vol. 1, Issue 1, 2014 · pp. 1–5 Read article
-
Web Mining Competitors Analyses for Frequent Unstructured Dataset Using Pattern Mining Utility Incremental Ranking Results Based on Query Process
Abstract: Abstract Nowadays, the mining competition in the market requires best approach fir every company to distinguish not only which companies are its primary competitors but also in whichdomains the company’s rivals compete with itself and what its competitors’ strength is in a specific competitive domain. The task ofcompetitor mining that we address in the paper includes mining all the information such as competitors, competing domains, andcompetitors’ strengthproblems which potential privacy …
Published in Journal of Web Engineering & Technology · Vol. 5, Issue 3, 2018 · pp. 38–46 Read article