基于事件的时空数据Top-K序列模式的高效发现
Efficient Discovering of Top-K Sequential Patterns in Event-Based Spatio-Temporal Data
摘要:
我们考虑从基于事件的时空数据中发现序列模式的问题。数据集由一组事件类型及其实例描述。基于给定的数据集,任务是发现所有重要的序列模式,表示发生在模式中的事件类型之间的某种吸引关系。已经提出的算法发现所有重要的序列模式的重要性阈值的基础上,最小值是由专家。由于所描述的数据的性质和所发现的模式的复杂性,可能很难提供合理的显著性阈值值。我们考虑的问题,有效地发现K个最重要的模式在一个给定的数据集(即发现Top-K模式)。
英文摘要:
We consider the problem of discovering sequential patterns from event-based spatio-temporal data. The dataset is described by a set of event types and their instances. Based on the given dataset, the task is to discover all significant sequential patterns denoting some attraction relation between event types occurring in a pattern. Already proposed algorithms discover all significant sequential patterns based on the significance threshold, which minimal value is given by an expert. Due to the nature of described data and complexity of discovered patterns, it may be very difficult to provide reasonable value of significance threshold. We consider the problem of effective discovering of K most important patterns in a given dataset (that is discovering of Top-K patterns).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。