A new algorithm for fast mining frequent itemsets using N-lists.


https://doi.org/10.1007/s11432-012-4638-z
@article{DBLP:journals/chinaf/DengWJ12, author = {Zhi{-}Hong Deng and Zhonghui Wang and Jia{-}Jian Jiang}, title = {A new algorithm for fast mining frequent itemsets using N-lists}, journal = {Sci. China Inf. Sci.}, volume = {55}, number = {9}, pages = {2008--2030}, year = {2012}, url = {https://doi.org/10.1007/s11432-012-4638-z}, doi = {10.1007/s11432-012-4638-z}, timestamp = {Mon, 02 Mar 2020 16:30:26 +0100}, biburl = {https://dblp.org/rec/journals/chinaf/DengWJ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21