Results 31 to 40 of about 801,363 (206)
Parallel Mining Algorithm for the Enumeration Space of Closed High Utility Itemsets
To address the issues of result redundancy and time overhead in high-dimensional data environments, a closed high utility itemset mining algorithm, SpCHUIM (Closed High Utility Itemsets Mining on Spark), is proposed.
LI Chengyan, SUN Anqi, LIU Songlin
doaj +1 more source
A novel biclustering approach to association rule mining for predicting HIV-1-human protein interactions. [PDF]
Identification of potential viral-host protein interactions is a vital and useful approach towards development of new drugs targeting those interactions.
Anirban Mukhopadhyay +2 more
doaj +1 more source
Closed Frequent Itemset Mining with Arbitrary Side Constraints [PDF]
Frequent itemset mining (FIM) is a method for finding regularities in transaction databases. It has several application areas, such as market basket analysis, genome analysis, and drug design. Finding frequent itemsets allows further analysis to focus on a small subset of the data.
Gokberk Kocak +3 more
openaire +3 more sources
Weighted Association Rule Mining using Weighted Support and Significance Framework [PDF]
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to handle weighted association rule mining problems where each item is allowed to
Murtagh, Fionn, Tao, Feng, Farid, Mohsen
core +2 more sources
PARALLEL MINING OF FREQUENT MAXIMAL ITEMSETS USING ORDER PRESERVING GENERATORS [PDF]
In this paper, we propose a parallel algorithm for mining maximal itemsets. We propose POP-MAX (Parallel Order Preserving MAXimal itemset algorithm), a fast and memory efficient parallel algorithm which enumerates all the maximal patterns concurrently ...
R.V. Nataraj, S. Selvan
doaj
Class Association Rule Pada Metode Associative Classification
Frequent patterns (itemsets) discovery is an important problem in associative classification rule mining. Differents approaches have been proposed such as the Apriori-like, Frequent Pattern (FP)-growth, and Transaction Data Location (Tid)-list ...
Eka Karyawati, Edi Winarko
doaj +1 more source
Efficient heuristics for the Steiner forest problem
Abstract Let G=(V,E)$G = (V, E)$ be a connected undirected graph, V$V$ a set of nodes, E$E$ a set of edges, |V|=n$|V| = n$, and |E|=m$|E| = m$. Given a non‐negative weight function w:E→R+$w: E \rightarrow \mathbb {R}^+$ associated with its edges, a set τ={Ti⊆V|i=1,…,p}$\tau = \lbrace T_i \subseteq V | i = 1, \ldots, p\rbrace$ of terminal sets Ti$T_i ...
Murilo Stockinger +4 more
wiley +1 more source
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
AI and Big Data in Consumer Behavior Analysis. ABSTRACT The rapid expansion of digital consumer data has challenged traditional approaches to understanding behavior in digital marketing. Existing reviews often focus on individual methods and give limited guidance on how analytical techniques compare or how they should be selected for specific marketing
Leonidas Theodorakopoulos +1 more
wiley +1 more source
A Robust Technique for Closed Frequent and High Utility Itemsets Mining: Closed-FHUIM
Frequent itemset mining (FIM) and high utility itemset mining (HUIM) are popular data mining techniques used in various real-world applications such as retail-market, bio-medicine, and click-stream analysis.
Muhammad Waheed Ashraf +2 more
doaj +1 more source

