Сжатое представление строгих ассоциативных правил в анализе данных
В.В. Быкова, V.V. Bykova, Катаева Алина Владимировна et al. · Международный журнал Программные продукты и системы · 2017
Modern methods and means of searching for association rules in big data lead to a significant number of rules, many of which are redundant.Redundant association rules are generally of no value, but they can misinform.To solve this problem, the paper proposes an algorithm MClose, which is a modification of the algorithm Close.
Cited by 1 works. doi:10.15827/0236-235x.118.187-195 Open-access PDF
Authors
References
- Efficient algorithms for mining closed itemsets and their lattice structure
- An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
- Generating a Condensed Representation for Association Rules
- Mining medical data to identify frequent diseases using Apriori algorithm
- Attribute-incremental construction of the canonical implication basis
- Some Notes on Pseudo-closed Sets
- Association Rules Mining
- Association and Casual Rule Mining Using Associative Bayesian Networks
- Dimension reduction in network attacks detection systems
- Сжатое представление строгих ассоциативных правил в анализе данных