These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
Pubmed for Handhelds
PUBMED FOR HANDHELDS
Journal Abstract Search
119 related items for PubMed ID: 33817031
1. TKFIM: Top-K frequent itemset mining technique based on equivalence classes. Iqbal S, Shahid A, Roman M, Khan Z, Al-Otaibi S, Yu L. PeerJ Comput Sci; 2021; 7():e385. PubMed ID: 33817031 [Abstract] [Full Text] [Related]
3. The Mining Algorithm of Maximum Frequent Itemsets Based on Frequent Pattern Tree. Mi X. Comput Intell Neurosci; 2022; 2022():7022168. PubMed ID: 35634074 [Abstract] [Full Text] [Related]
12. Parallel and distributed methods for incremental frequent itemset mining. Otey ME, Parthasarathy S, Wang C, Veloso A, Meira W. IEEE Trans Syst Man Cybern B Cybern; 2004 Dec 01; 34(6):2439-50. PubMed ID: 15619944 [Abstract] [Full Text] [Related]
13. HUIL-TN & HUI-TN: Mining high utility itemsets based on pattern-growth. Wang L, Wang S. PLoS One; 2021 Dec 01; 16(3):e0248349. PubMed ID: 33711048 [Abstract] [Full Text] [Related]
15. An efficient algorithm for mining closed itemsets. Liu JQ, Pan YH. J Zhejiang Univ Sci; 2004 Jan 01; 5(1):8-15. PubMed ID: 14663846 [Abstract] [Full Text] [Related]
16. Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism. Hu YH, Chen YL. Decis Support Syst; 2006 Oct 01; 42(1):1-24. PubMed ID: 32287563 [Abstract] [Full Text] [Related]
19. Negative and positive association rules mining from text using frequent and infrequent itemsets. Mahmood S, Shahbaz M, Guergachi A. ScientificWorldJournal; 2014 Oct 01; 2014():973750. PubMed ID: 24955429 [Abstract] [Full Text] [Related]