Towards a Flexible and Scalable Data Stream Algorithm in FCA

cic.institucionOrigenLaboratorio de Investigación y Formación en Informática Avanzada (LIFIA)
cic.isFulltextSI
cic.isPeerReviewedSI
cic.lugarDesarrolloLaboratorio de Investigación y Formación en Informática Avanzada (LIFIA)
cic.parentTypeObjeto de conferencia
cic.versionAceptada
dc.date.accessioned2023-08-28T17:13:15Z
dc.date.available2023-08-28T17:13:15Z
dc.identifier.urihttps://digital.cic.gba.gob.ar/handle/11746/12034
dc.titleTowards a Flexible and Scalable Data Stream Algorithm in FCAen
dc.typeDocumento de conferencia
dcterms.abstractThe 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.en
dcterms.creator.authorLeutwyler, Nicolás
dcterms.creator.authorLezoche, Mario
dcterms.creator.authorTorres, Diego
dcterms.creator.authorPanetto, Hervé
dcterms.extent104–117
dcterms.identifier.otherISBN: 978-3-031-40960-8
dcterms.identifier.otherDOI: 10.1007/978-3-031-40960-8_9
dcterms.isPartOf.issue28th International Conference on Conceptual Structures, ICCS 2023 (Alemania, 11al 13 de 2023)
dcterms.issued2023-08
dcterms.languageInglés
dcterms.licenseAttribution-NonCommercial-ShareAlike 4.0 International (BY-NC-SA 4.0)
dcterms.subjectFormal Concept Analysisen
dcterms.subjectLattice Mergeen
dcterms.subjectScalabilityen
dcterms.subjectIncremental Algorithmen
dcterms.subjectData Streamen
dcterms.subject.materiaCiencias de la Computación e Información

Archivos

Bloque original

Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
Towards a Flexible and Scalable.pdf-PDFA.pdf
Tamaño:
417.67 KB
Formato:
Adobe Portable Document Format

Bloque de licencias

Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
license.txt
Tamaño:
3.46 KB
Formato:
Item-specific license agreed upon to submission
Descripción: