Author:
Ghosh Sohom,Yadav Shefali,Wang Xin,Chakrabarty Bibhash,Kadıoğlu Serdar
Abstract
Sequential pattern mining remains a challenging task due to the large number of redundant candidate patterns and the exponential search space. In addition, further analysis is still required to map extracted patterns to different outcomes. In this paper, we introduce a pattern mining framework that operates on semi-structured datasets and exploits the dichotomy between outcomes. Our approach takes advantage of constraint reasoning to find sequential patterns that occur frequently and exhibit desired properties. This allows the creation of novel pattern embeddings that are useful for knowledge extraction and predictive modeling. Based on dichotomic pattern mining, we present two real-world applications for customer intent prediction and intrusion detection. Overall, our approach plays an integrator role between semi-structured sequential data and machine learning models, improves the performance of the downstream task, and retains interpretability.
Reference41 articles.
1. Mining sequential patterns,;Agrawal;Proceedings of the Eleventh International Conference on Data Engineering,1995
2. An efficient algorithm for mining frequent sequence with constraint programming,;Aoga;Joint European Conference on Machine Learning and Knowledge Discovery in Databases,2016
3. Mining time-constrained sequential patterns with constraint programming;Aoga;Constraints,2017
4. Subgroup discovery;Atzmueller;Wiley Int. Rev. Data Min. Knowl. Disc,2015
5. Sequential pattern mining using a bitmap representation,;Ayres;Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,2002
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献