Sequence mining in categorical domains: incorporating constraints
Proceedings of the ninth international conference on Information and knowledge management
SPADE: an efficient algorithm for mining frequent sequences
Machine Learning
Discovery of frequent DATALOG patterns
Data Mining and Knowledge Discovery
Mining Sequential Patterns with Regular Expression Constraints
IEEE Transactions on Knowledge and Data Engineering
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Scalability and efficiency in multi-relational data mining
ACM SIGKDD Explorations Newsletter
Propositionalization-based relational subgroup discovery with RSD
Machine Learning
Multi-Dimensional Relational Sequence Mining
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
The Life of a Logic Programming System
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
The Journal of Machine Learning Research
View learning for statistical relational learning: with an application to mammography
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Sequential pattern mining in multi-relational datasets
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
| Hi-index | 0.00 |
This work presents an optimized version of XMuSer, an ILP based framework suitable to explore temporal patterns available in multi-relational databases. XMuSer's main idea consists of exploiting frequent sequence mining, an efficient method to learn temporal patterns in the form of sequences. XMuSer framework efficiency is grounded on a new coding methodology for temporal data and on the use of a predictive sequence miner. The frameworks selects and map the most interesting sequential patterns into a new table, the sequence relation. In the last step of our framework, we use an ILP algorithm to learn a classification theory on the enlarged relational database that consists of the original multi-relational database and the new sequence relation. We evaluate our framework by addressing three classification problems and map each one of three different types of sequential patterns: frequent, closed or maximal. The experiments show that our ILP based framework gains both from the descriptive power of the ILP algorithms and the efficiency of the sequential miners.