Results 111 to 120 of about 739 (208)

An Efficient Union Approach to Mining Closed Large Itemsets in DNA Microarray Datasets

, 2006
A DNA microarray is a very good tool to study the gene expression level in different situations. Mining association rules in DNA microarray datasets can help us know how genes affect each other, and what genes are usually co-expressed.
Lee, Li-Wen
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

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

, 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  

Mining personalized core traditional Chinese medicine prescriptions for rheumatoid arthritis and elucidating their mechanisms via frequent closed Itemset compression and multilevel network pharmacology. [PDF]

Front Mol Biosci
Chen X, Yu J, Dong X, Chen Z, Tian J, Zhao M, Jiang M, Guo H, Zhou X, Fa L, Li Y, Zhang L.   +11 more
europepmc   +1 more source

A high utility itemsets mining algorithm based on co-evolution. [PDF]

Sci Rep
Yang W, Han M, Dai Z, Li J, Ding J.
europepmc   +1 more source

Exploration of association rule mining between lost-linking features and modes of loan customers using the FP-growth algorithm for risk warning strategies. [PDF]

PLoS One
Wang J, Jiang X, He Y, Guan B, Deng C.
europepmc   +1 more source

Finding generalized closed frequent itemsets for mining non redundant association rules

, 2007
Generalized association rules are a very important extension of traditional association rules which allows to exploit taxonomical knowledge defined over items to be mined.
Loglisci C., D'Alessandro S., Berardi M., Leo P.   +3 more
core  

Sliding window based rare partial periodic pattern mining algorithms over temporal data streams. [PDF]

Front Big Data
Upadhya KJ, Lobo R, Chhabra MS, Paleja A, Rao BD, M G, Sisodia P, Reddy BA.   +7 more
europepmc   +1 more source

Penggalian Top-K Frequent Closed Constrained Gradient Itemsets Tanpa Batasan Minimum Support Pada Basis Data Retail

, 2009
Penggalian top-k frequent closed itemsets dengan algoritma TFP tanpa menggunakan minimum support merupakan salah satu penelitian yang menarik untuk diaplikasikan dalam analisis asosiasi.
djunaidy, Arif, Absari, Dhiani Tresna
core  

Multi-level high utility-itemset hiding. [PDF]

PLoS One
Nguyen LTT, Duong H, Mai A, Vo B.
europepmc   +1 more source