Towards a Flexible and Scalable Data Stream Algorithm in FCA

• Autores: Leutwyler, Nicolás; Lezoche, Mario; Torres, Diego; Panetto, Hervé
• Año de publicación: 2023
• Idioma: inglés
• Tipo de recurso: documento de conferencia
• Materia: Ciencias de la Computación e Información; Formal Concept Analysis; Lattice Merge; Scalability; Incremental Algorithm; Data Stream
• Institución: Comisión de Investigaciones Científicas de la Provincia de Buenos Aires

The amount of different environments where data can be exploited have increased partly because of the massive adoption of technologies such as microservices and distributed architectures. Accordingly, approaches to treat data are in constant improvement. An example of this is the Formal Concept Analysis framework that has seen an increase in the methods carried out to increment its capabilities in the mentioned environments. However, on top of the exponential nature of the output that the framework produces, the data stream processing environment still poses challenges regarding the flexibility in the usage of FCA and its extensions. Consequently, several approaches have been proposed to deal with them considering different constraints, such as receiving unsorted elements or unknown attributes. In this work, the notion of flexibly scalable for FCA distributed algorithms consuming data streams is defined. Additionally, the meaning of different scenarios of lattice merge in a particular data stream model is discussed. Finally, a pseudo-algorithm for merging lattices in the case of disjoint objects is presented. The presented work is a preliminary result and, in the future, it is expected to cover the other aspects of the problem with real data for validation.