Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing.


https://doi.org/10.3233/FI-2011-568
@article{DBLP:journals/fuin/DengGX11, author = {Zhi{-}Hong Deng and Ning Gao and Xiaoran Xu}, title = {Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing}, journal = {Fundam. Inform.}, volume = {111}, number = {4}, pages = {373--390}, year = {2011}, url = {https://doi.org/10.3233/FI-2011-568}, doi = {10.3233/FI-2011-568}, timestamp = {Sat, 20 May 2017 00:23:05 +0200}, biburl = {https://dblp.org/rec/journals/fuin/DengGX11.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