Results 71 to 80 of about 1,634,075 (173)

H.: Closed non-derivable itemsets

, 2006
. Itemset mining typically results in large amounts of redundant itemsets. Several approaches such as closed itemsets, non-derivable itemsets and generators have been suggested for losslessly reducing the amount of itemsets.
Hannu Toivonen, Juho Muhonen
core  

Pengembangan Aplikasi Penggalian Top-K Frequent Closed Constrained Gradient Itemsets Pada Basis Data Retail [PDF]

, 2008
Dalam dunia retail, pihak manajemen dapat memanfaatkan pengetahuan yang dapat dianalisis dari basis data retail untuk memahami pola kebutuhan pelanggan.
Djunaidy, Arif, Absari, Dhiani Tresna
core  

Design and Implementation of a New Local Alignment Algorithm for Multilayer Networks. [PDF]

Entropy (Basel), 2022
Milano M, Guzzi PH, Cannataro M.
europepmc   +1 more source

Innovative Mode of Human Resource Management of University Teachers Based on Intelligent Big Data Analysis. [PDF]

Comput Intell Neurosci, 2022
Bai Y.
europepmc   +1 more source

Mining actionable combined high utility incremental and associated sequential patterns. [PDF]

PLoS One, 2023
Shi M, Gong Y, Xu T, Zhao L.
europepmc   +1 more source

Mining Assocation Rules Using Frequent Closed Itemsets

, 2005
In the domain of knowledge discovery in databases and its computational part called data mining, many works addressed the problem of association rule extraction that aims at discovering relationships between sets of items (binary attributes). An example association rule fitting in the context of market basket data analysis is cereal Ù milk ® sugar ...
openaire   +2 more sources

OLOGRAM-MODL: mining enriched n-wise combinations of genomic features with Monte Carlo and dictionary learning. [PDF]

NAR Genom Bioinform, 2021
Ferré Q, Capponi C, Puthier D.
europepmc   +1 more source

Perbaikan Algoritma Penggalian Frequent Closed Itemset CHARM

, 2009
Penggalian frequent closed itemset merupakan salah satu bagian penting dari penggalian kaidahassosiasi (Association rule) karena dapat secara unik menentukan himpunan semua frequent itemsets dansupportnya.Berbagai algoritma penggalian frequent closed ...
Mardiyanto, Mardiyanto, Djunaidy, Arif
core  

Best-first search-based approach for mining top-k closed frequent itemsets from uncertain databases. [PDF]

PLoS One
Le N, Vo H, Nguyen T.
europepmc   +1 more source

High Quality, Efficient Hierarchical Document Clustering using Closed Interesting Itemsets

, 2008
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to improve the efficiency of hierarchical document clustering. In this paper,

core