·2,447,543篇论文数据,部分数据来源于NoteExpress
该算法简单、新颖,运行快速,简化了子序列支持数的计算。
The algorithm is simple and new, runs so fast, and reduces the cost of computing support counts of subsequences.
如何确定候选频繁序列模式以及如何计算它们的支持数是序列模式挖掘中的两个关键问题。
How to generate candidate frequent sequential pattern and calculate its support is a key problem in mining frequent sequential patterns.
数据流最频繁K项挖掘是指在数据流中找出K个项,它们的支持数大于数据流中的其他项。
Mining most frequent K items in data streams means finding K items whose frequencies are larger than other items in data streams.
应用推荐