arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1311.6907cs.AIcs.DB
收藏

序列数据库中挖掘序列模式的约束程序设计方法

A Constraint Programming Approach for Mining Sequential Patterns in a Sequence Database

University of Caen(卡昂大学);University PARIS 13(巴黎第十三大学)

Jean-Philippe Métivier, Samir Loudni, Thierry Charnois

摘要:

基于约束的模式发现是众多数据采掘任务的核心。模式是相对于一组给定的约束(频率,封闭性,大小等)提取的。在序列模式挖掘的背景下,已经开发了大量专门的技术来解决特定类别的约束。本文的目的是研究使用约束编程(CP)的建模和挖掘序列数据库中的序列模式。我们的CP方法提供了一种自然的方式,在同一个框架中同时结合了来自不同来源的大量约束。实验结果表明,我们的方法的可行性和利益。

英文摘要:

Constraint-based pattern discovery is at the core of numerous data mining tasks. Patterns are extracted with respect to a given set of constraints (frequency, closedness, size, etc). In the context of sequential pattern mining, a large number of devoted techniques have been developed for solving particular classes of constraints. The aim of this paper is to investigate the use of Constraint Programming (CP) to model and mine sequential patterns in a sequence database. Our CP approach offers a natural way to simultaneously combine in a same framework a large set of constraints coming from various origins. Experiments show the feasibility and the interest of our approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑