Results 101 to 110 of about 9,218 (205)

Frequent Closed High-Utility Itemset Mining Algorithm Based on Leiden Community Detection and Compact Genetic Algorithm

open access: yesIEEE Access
Traditional pattern mining algorithms are based on tree and linked list structures. However, they often only consider a single factor of frequency or utility and have to deal with exponential search spaces as well as generate numerous candidates.
Xiumei Zhao, Xincheng Zhong, Bing Han
doaj   +1 more source

A Mining-Based Compression Approach for Constraint Satisfaction Problems

open access: yes, 2013
In this paper, we propose an extension of our Mining for SAT framework to Constraint satisfaction Problem (CSP). We consider n-ary extensional constraints (table constraints). Our approach aims to reduce the size of the CSP by exploiting the structure of
Jabbour, Said   +2 more
core   +1 more source

Grafting for Combinatorial Boolean Model using Frequent Itemset Mining

open access: yes, 2017
This paper introduces the combinatorial Boolean model (CBM), which is defined as the class of linear combinations of conjunctions of Boolean attributes. This paper addresses the issue of learning CBM from labeled data.
Lee, Taito   +2 more
core  

FREQUENT ITEMSETS MINING FOR BIG DATA

open access: yes, 2019
Frequent Itemsets Mining (FIM) is a fundamental mining model and plays an important role in Data Mining. It has a vast range of application fields and can be employed as a key calculation phase in many other mining models such as Association Rules, Correlations, Classifications, etc. Generally speaking, FIM counts the frequencies of co-occurrence items,
openaire   +2 more sources

WBIN-Tree: A Single Scan Based Complete, Compact and Abstract Tree for Discovering Rare and Frequent Itemset Using Parallel Technique

open access: yesIEEE Access
Data analytics is an integral part of strategic decision making in various fields but not limited to business, education and healthcare systems. Existing research works focus on the discovery of itemsets with rare antecedents and consequent or frequent ...
Shwetha Rai   +4 more
doaj   +1 more source

Extraction of itemsets frequents

open access: yesInternational Journal of Mathematics Research, 2020
R. Elayachi   +3 more
openaire   +1 more source

Probabilistic Support Prediction: Fast Frequent Itemset Mining in Dense Data

open access: yesIEEE Access
Frequent itemset mining (FIM) is a highly resource-demanding data-mining task fundamental to numerous data-mining applications. Support calculation is a frequently performed computation-intensive operation of FIM algorithms, whereas storing transactional
Muhammad Sadeequllah   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy