Results 21 to 30 of about 8,833 (199)

Multi-Objective Optimization for High-Dimensional Maximal Frequent Itemset Mining

open access: yesApplied Sciences, 2021
The solution space of a frequent itemset generally presents exponential explosive growth because of the high-dimensional attributes of big data. However, the premise of the big data association rule analysis is to mine the frequent itemset in high ...
Yalong Zhang   +4 more
doaj   +1 more source

Hybrid Recommendation System Memanfaatkan Penggalian Frequent Itemset dan Perbandingan Keyword

open access: yesIJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2015
Abstrak Recommendation system sering dibangun dengan memanfaatkan data peringkat item dan data identitas pengguna. Data peringkat item merupakan data yang langka pada sistem yang baru dibangun.
Wayan Gede Suka Parwita, Edi Winarko
doaj   +1 more source

Simple Modification for an Apriori Algorithm With Combination Reduction and Iteration Limitation Technique

open access: yesKnowledge Engineering and Data Science, 2020
Apriori algorithm is one of the methods with regard to association rules in data mining. This algorithm uses knowledge from an itemset previously formed with frequent occurrence frequencies to form the next itemset.
Adie Wahyudi Oktavia Gama   +1 more
doaj   +1 more source

Mining frequent itemsets over uncertain databases [PDF]

open access: yesProceedings of the VLDB Endowment, 2012
In recent years, due to the wide applications of uncertain data, mining frequent itemsets over uncertain databases has attracted much attention. In uncertain databases, the support of an itemset is a random variable instead of a fixed occurrence counting of this itemset.
Tong, Yongxin   +3 more
openaire   +3 more sources

Maximal Frequent Itemset Mining Algorithm Based on Nodeset [PDF]

open access: yesJisuanji gongcheng, 2016
The major performance bottlenecks of most maximal frequent itemset mining algorithms based on FP-Tree are caused by recursively traversing and constructing conditional FP-Trees and superset check.Therefore,this paper proposes a maximal frequent itemset ...
LIN Chen,GU Junzhong
doaj   +1 more source

Hybrid Parallel Frequent Itemsets Mining Algorithm by Using N-List Structure [PDF]

open access: yesJisuanji kexue yu tansuo, 2022
Aiming at the problem of unbalanced load, bad efficiency of N-list merge and redundant search for each node based on parallel frequent itemset mining algorithm MRPrePost (parallel PrePost algorithm based on MapReduce), this paper proposes a hybrid ...
LIU Weiming, ZHANG Chi, MAO Yimin
doaj   +1 more source

Mining data quality rules based on T-dependence [PDF]

open access: yes, 2019
Since their introduction in 1976, edit rules have been a standard tool in statistical analysis. Basically, edit rules are a compact representation of non-permitted combinations of values in a dataset.
Boeckling, Toon   +2 more
core   +1 more source

DISCOVERING CONFUSING FREQUENT ITEMSETS

open access: yesTạp chí Khoa học Đại học Đà Lạt, 2018
Frequent itemset mining is one of the most important research areas in the field of association rule mining. Exploiting frequent itemsets at different abstraction levels of data will yield valuable knowledge.
Huỳnh Thành Lộc
doaj   +1 more source

Implementasi Data Mining Pada Perpustakaan Untuk Penentuan Tata Letak Buku Dalam Menarik Minat Baca

open access: yesTechno.Com, 2022
Perpustakaan memiliki sistem informasi untuk mempermudah manajemen sirkulasi buku. Sistem informasi biasanya hanya menghasilkan laporan harian, mingguan atau bahkan bulanan saja.
Adie Wahyudi Oktavia Gama   +2 more
doaj   +1 more source

Frequent regular itemset mining [PDF]

open access: yesProceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, 2010
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an extension of itemsets, called regular, with an immediate semantics and interpretability, and a conciseness comparable to closed itemsets. Regular itemsets allow for specifying
openaire   +3 more sources

Home - About - Disclaimer - Privacy