Efficient algorithms for mining top-rank- k erasable patterns using pruning strategies and the subsume concept

标题
Efficient algorithms for mining top-rank- k erasable patterns using pruning strategies and the subsume concept
作者
关键词
-
出版物
出版商
Elsevier BV
发表日期
2017-11-10
DOI
10.1016/j.engappai.2017.09.010

向作者/读者发起求助以获取更多资源

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now