PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children-Parent Equivalence pruning.


https://doi.org/10.1016/j.eswa.2015.03.004
@article{DBLP:journals/eswa/DengL15, author = {Zhi{-}Hong Deng and Sheng{-}Long Lv}, title = {PrePost\({}^{\mbox{+}}\): An efficient N-lists-based algorithm for mining frequent itemsets via Children-Parent Equivalence pruning}, journal = {Expert Syst. Appl.}, volume = {42}, number = {13}, pages = {5424--5432}, year = {2015}, url = {https://doi.org/10.1016/j.eswa.2015.03.004}, doi = {10.1016/j.eswa.2015.03.004}, timestamp = {Fri, 26 May 2017 22:54:19 +0200}, biburl = {https://dblp.org/rec/journals/eswa/DengL15.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