TY - GEN
T1 - Behavioral constraint template-based sequence classification
AU - De Smedt, Johannes
AU - Deeva, Galina
AU - De Weerdt, Jochen
PY - 2017/12/30
Y1 - 2017/12/30
N2 - In this paper we present the interesting Behavioral Constraint Miner (iBCM), a new approach towards classifying sequences. The prevalence of sequential data, i.e., a collection of ordered items such as text, website navigation patterns, traffic management, and so on, has incited a surge in research interest towards sequence classification. Existing approaches mainly focus on retrieving sequences of itemsets and checking their presence in labeled data streams to obtain a classifier. The proposed iBCM approach, rather than focusing on plain sequences, is template-based and draws its inspiration from behavioral patterns used for software verification. These patterns have a broad range of characteristics and go beyond the typical sequence mining representation, allowing for a more precise and concise way of capturing sequential information in a database. Furthermore, it is possible to also mine for negative information, i.e., sequences that do not occur. The technique is benchmarked against other state-of-the-art approaches and exhibits a strong potential towards sequence classification.
AB - In this paper we present the interesting Behavioral Constraint Miner (iBCM), a new approach towards classifying sequences. The prevalence of sequential data, i.e., a collection of ordered items such as text, website navigation patterns, traffic management, and so on, has incited a surge in research interest towards sequence classification. Existing approaches mainly focus on retrieving sequences of itemsets and checking their presence in labeled data streams to obtain a classifier. The proposed iBCM approach, rather than focusing on plain sequences, is template-based and draws its inspiration from behavioral patterns used for software verification. These patterns have a broad range of characteristics and go beyond the typical sequence mining representation, allowing for a more precise and concise way of capturing sequential information in a database. Furthermore, it is possible to also mine for negative information, i.e., sequences that do not occur. The technique is benchmarked against other state-of-the-art approaches and exhibits a strong potential towards sequence classification.
KW - sequence mining
KW - sequence classification
KW - constraint-based mining
UR - http://ecmlpkdd2017.ijs.si/index.html
U2 - 10.1007/978-3-319-71246-8_2
DO - 10.1007/978-3-319-71246-8_2
M3 - Conference contribution
SN - 978-3-319-71245-1
VL - 10535
T3 - Lecture Notes in Computer Science
SP - 20
EP - 36
BT - Joint European Conference on Machine Learning and Knowledge Discovery in Databases
PB - Springer
ER -