On Mining Complex Sequential Data by Means of FCA and Pattern Structures

Aleksey Buzmakov (1) , Elias Egho (2) , Nicolas Jay (1) , Sergei O. Kuznetsov (3) , Amedeo Napoli (1) , Chedy Raïssi (1)

1 ORPAILLEUR - Knowledge representation, reasonning
2 Orange Labs [Lannion]
3 Department of Applied Mathematics - State University Higher School of Economics

Nowadays data sets are available in very complex and heterogeneous ways. Mining of such data collections is essential to support many real-world applications ranging from healthcare to marketing. In this work, we focus on the analysis of "complex" sequential data by means of interesting sequential patterns. We approach the problem using the elegant mathematical framework of Formal Concept Analysis (FCA) and its extension based on "pattern structure". Pattern structures are used for mining complex data (such as sequences or graphs) and are based on a subsumption operation, which in our case is defined with respect to the partial order on sequences. We show how pattern structures along with projections (i.e., a data reduction of sequential structures), are able to enumerate more meaningful patterns and increase the computing efficiency of the approach. Finally, we show the applicability of the presented method for discovering and analyzing interesting patient patterns from a French healthcare data set on cancer. The quantitative and qualitative results (with annotations and analysis from a physician) are reported in this use case which is the main motivation for this work.

Domaines: Intelligence artificielle [cs.AI]

Aleksey Buzmakov, Elias Egho, Nicolas Jay, Sergei O. Kuznetsov, Amedeo Napoli, et al.. On Mining Complex Sequential Data by Means of FCA and Pattern Structures. International Journal of General Systems, 2016, 45 (2), pp.135-159. ⟨10.1080/03081079.2015.1072925⟩. ⟨hal-01186715⟩