Results 21 to 30 of about 9,424 (197)

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

An Efficient Spark-Based Hybrid Frequent Itemset Mining Algorithm for Big Data

open access: yesData, 2022
Frequent itemset mining (FIM) is a common approach for discovering hidden frequent patterns from transactional databases used in prediction, association rules, classification, etc. Apriori is an FIM elementary algorithm with iterative nature used to find
Mohamed Reda Al-Bana   +2 more
doaj   +1 more source

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

Parallel Algorithm for Frequent Itemset Mining on Intel Many-core Systems [PDF]

open access: yes, 2018
Frequent itemset mining leads to the discovery of associations and correlations among items in large transactional databases. Apriori is a classical frequent itemset mining algorithm, which employs iterative passes over database combining with generation
Zymbler, Mikhail
core   +3 more sources

Memory-efficient frequent-itemset mining

open access: yesProceedings of the 14th International Conference on Extending Database Technology, 2011
Efficient discovery of frequent itemsets in large datasets is a key component of many data mining tasks. In-core algorithms---which operate entirely in main memory and avoid expensive disk accesses---and in particular the prefix tree-based algorithm FP-growth are generally among the most efficient of the available algorithms.
Schlegel, Benjamin   +2 more
openaire   +3 more sources

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

Efficient Mining of Frequent Itemsets Using Only One Dynamic Prefix Tree

open access: yesIEEE Access, 2020
Frequent itemset mining is a fundamental problem in data mining area because frequent itemsets have been extensively used in reasoning, classifying, clustering, and so on.
Jun-Feng Qu   +5 more
doaj   +1 more source

An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets [PDF]

open access: yes, 2009
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is becoming a major challenge in data mining applications.
Kirsch, Adam   +5 more
core   +3 more sources

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

Home - About - Disclaimer - Privacy