Distributed computation of generalized one-sided concept lattices on sparse data tables

MaRDI QIDQ4557999zbMATH OpenFDO

Authors Peter Butka, Jozef Pócs, Jana Pócsová

Publication date 27 November 2018

zbMATH Keywords

distributed algorithmformal concept analysisone-sided concept latticessparse datatext-mining

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Complete lattices, completions (06B23) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Distributed algorithms (68W15)

Recommendations

• Distributed formal concept analysis algorithms based on an iterative MapReduce framework
• Note on formal contexts of generalized one-sided concept lattices
• A parallel algorithm for constructing concept lattice based on hierarchical concept under MapReduce
• A new parallel algorithm of concept lattices
• Concept Lattices

Cited in

(5)

• On stability of fuzzy formal concepts over randomized one-sided formal context
• Revising the link between L-Chu correspondences and completely lattice L-ordered sets.
• Distributed formal concept analysis algorithms based on an iterative MapReduce framework
• On fuzzy generalizations of concept lattices
• Heterogeneous formal context and its decomposition by heterogeneous fuzzy subsets

This page was built for publication: Distributed computation of generalized one-sided concept lattices on sparse data tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557999)