DiffNodesets: An efficient structure for fast mining frequent itemsets.


https://doi.org/10.1016/j.asoc.2016.01.010
@article{DBLP:journals/asc/Deng16, author = {Zhi{-}Hong Deng}, title = {DiffNodesets: An efficient structure for fast mining frequent itemsets}, journal = {Appl. Soft Comput.}, volume = {41}, pages = {214--223}, year = {2016}, url = {https://doi.org/10.1016/j.asoc.2016.01.010}, doi = {10.1016/j.asoc.2016.01.010}, timestamp = {Fri, 26 May 2017 22:54:23 +0200}, biburl = {https://dblp.org/rec/journals/asc/Deng16.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