Results 121 to 130 of about 739 (208)

FCILINK: Mining Frequent Closed Itemsets Based on a Link Structure between Transactions

open access: yes
The problem of discovering association rules between items in a database is an emerging area of research. Its goal is to extract significant patterns or interesting rules from large databases.
Kyong Rok Han, Jae Yearn Kim
core  

Temporal Evolution of the Profile of Patients Hospitalized with Heart Failure (2000-2022). [PDF]

open access: yesClin Pract
Seoane-Pillado T   +5 more
europepmc   +1 more source

Size of random Galois lattices and number of frequent itemsets

open access: yes, 2005
19 pagesWe compute the mean and the variance of the size of the Galois lattice built from a random matrix with i.i.d. Bernoulli(p) entries. Then, obseving that closed frequent itemsets are in bijection with winning coalitions, we compute the mean and the
Emilion, Richard, Levy, Gerard
core  

cdeNDI:a Efficient Algorithm for Mining Frequent Itemsets

open access: yes, 2007
頻繁項目集的探勘,也就是從大型資料庫中找出頻繁項目集。這是許多其他問題的根本和基礎,像是關連規則、循序規則、分類和許多其他的課題。 在過去十年來,這個問題已經有了很大的進展。許多的演算法或改進現有演算法都不斷的被提出。然而,當我們降低最低支持度或是當我們遇到的資料庫是高度關連的時候,頻繁項目集的數目可能會極大。因此,如何應付密集資料庫仍然是一各具挑戰性的課題。 在這篇論文裡,我們提出cdeNDI這一種新演算法。這是以Eclat這個演算法為基礎,將closed itemsets和non ...
Huang, Chien-Ming, 黃健銘
core  

Home - About - Disclaimer - Privacy