Approximate frequent itemsets mining on data streams using hashing and lexicographie order in hardware

2017 IEEE 8th Latin American Symposium on Circuits & Systems (LASCAS)(2017)

引用 2|浏览16
暂无评分
摘要
Frequent Itemsets Mining is a Data Mining technique that has been employed to extract useful knowledge from datasets; and recently, from data streams. Data streams are an unbounded and infinite flow of data arriving at high rates; therefore, traditional Data Mining approaches for Frequent Itemsets Mining cannot be used straightforwardly. Finding alternatives to improve the discovery of frequent itemsets on data streams is an active research topic. This paper introduces the first hardware-based algorithm for such task. It uses the top-k frequent 1-itemsets detection, hashing and the lexicographic order of received items. Experimental results demonstrate the viability of the proposed method.
更多
查看译文
关键词
approximate frequent itemset mining,data streams,lexicographie order,hashing,data mining technique,infinite flow,unbounded flow,hardware-based algorithm,top-k frequent 1-itemset detection,lexicographic order
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要