
ISSA is a system integrating different structural mining tasks (only the sequencial case for the moment) by using a common unifying framework: a Galois lattice adapted to sequential data. After characterizing the Galois lattice, it is possible to calculate either partial orders, or frequent sequential patterns, or also a new notion of association rules with order by just traversing its nodes. Our aim is providing a visual tool based on a sound theory that can be useful in different contexts of the analys of structures.
Publications
Summarizing sequential data with closed partial orders. [ps] G.C.Garriga. In 2005 SIAM International Conference on Data Mining (SDM'05), pages 380-391. Newport Beach, California. |
On Horn axiomatizations for sequential data. [ps] J.L.Balcázar and G.C.Garriga. In 10th International Conference on Database Theory (ICDT'05), pages 215-229. Edinburgh, Scotland. |
Galois connections for mining structured objects. [ps] G.C.Garriga and J.L.Balcázar. In 4th Learning Conference 2004, pages 91-96. Elx, Spain. |
Coproduct transformations on lattices of closed partial orders. [ps] G.C.Garriga and J.L.Balcázar. In 2nd International Conference on Graph Transformation (ICGT'04), pages 336-352. Rome, Italy. |
A lattice-based method for structural analysis. G.C.Garriga, P. Díaz-López and J.L.Balcázar. Pascal Research Report 2005 |
people
Academic Staff
The following are academic staff that have been involved in the ISSA project.