A new algorithm for fast mining frequent itemsets using N-lists
type: Item
instance of: scholarly article
title: A new algorithm for fast mining frequent itemsets using N-lists
zbMATH Open document ID: 1270.68239
author: Zhonghui Wang
author: Zhihong Deng
author: Jia-Jian Jiang
publication date: 2013-08-20T00:00:00Z
full work available at URL: s11432-012-4638-z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6199717
zbMATH Keywords: data mining
zbMATH Keywords: frequent itemset mining
zbMATH Keywords: data structure
zbMATH Keywords: N-lists
zbMATH Keywords: algorithm
describes a project that uses: gSpan
describes a project that uses: CLOSET
Wikidata QID: Q61311896
MaRDI profile type: Publication
OpenAlex ID: W2256820277
cites work: An incremental data mining algorithm for compact realization of prototypes
DOI: 10.1007/S11432-012-4638-Z
published in: Science China Information Sciences
Recommended article: Q5319132
Recommended article: Q5867107
Recommended article: An efficient algorithm for mining frequent maximal and closed itemsets
Recommended article: Q5698263
description: scientific article; zbMATH DE number 6199717