Discovery of optimal factors in binary data via a novel method of matrix decomposition

DOI10.1016/j.jcss.2009.05.002zbMath1180.15026OpenAlexW2026235741WikidataQ113643215 ScholiaQ113643215MaRDI QIDQ131470

Vilem Vychodil, Radim Belohlavek, Vilem Vychodil, Radim Bělohlávek

Publication date: February 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.05.002

zbMATH Keywords

numerical examplesformal concept analysisconcept latticebinary databinary matrix decompositionBoolean factor analysisgreedy approximation algorithm

Mathematics Subject Classification ID

Related Items (55)

Pseudovarieties of algebras with fuzzy equalities. ⋮ Exploring users' preferences in a fuzzy setting ⋮ Optimal factorization of three-way binary data using triadic concepts ⋮ FCA2VEC: Embedding Techniques for Formal Concept Analysis ⋮ Formal Methods in FCA and Big Data ⋮ Complexity reduction and approximation of multidomain systems of partially ordered data ⋮ Handling noise in Boolean matrix factorization ⋮ A knowledge reduction approach for linguistic concept formal context ⋮ The spectra of irreducible matrices over completed idempotent semifields ⋮ Quantifying the conceptual error in dimensionality reduction ⋮ A heuristic concept construction approach to collaborative recommendation ⋮ Triadic formal concept analysis and triclustering: searching for optimal patterns ⋮ Systematic categorization and evaluation of CbO-based algorithms in FCA ⋮ Heterogeneous formal context and its decomposition by heterogeneous fuzzy subsets ⋮ A new algebraic structure for formal concept analysis ⋮ Data‐driven Q‐matrix learning based on Boolean matrix factorization in cognitive diagnostic assessment ⋮ Avoiding flatness in factoring ordinal data ⋮ Representing concept lattices with Euler diagrams ⋮ Factorization of matrices with grades ⋮ Toward quality assessment of Boolean matrix factorizations ⋮ Granularity of attributes in formal concept analysis ⋮ Characteristic matrix of covering and its application to Boolean matrix decomposition ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ Selection of appropriate bonds between \(\mathcal{L}\)-fuzzy formal contexts for recommendation tasks ⋮ Optimal decompositions of matrices with grades into binary and graded matrices ⋮ Parallel algorithm for computing fixpoints of Galois connections ⋮ Unnamed Item ⋮ Factorizing Boolean matrices using formal concepts and iterative usage of essential entries ⋮ Formal context coverage based on isolated labels: an efficient solution for text feature extraction ⋮ Parameterized low-rank binary matrix approximation ⋮ Knowledge reduction in formal contexts using non-negative matrix factorization ⋮ Parameterized Low-Rank Binary Matrix Approximation ⋮ Factorization with Hierarchical Classes Analysis and with Formal Concept Analysis ⋮ From-below approximations in Boolean matrix factorization: geometry and new algorithm ⋮ Low-Rank Binary Matrix Approximation in Column-Sum Norm. ⋮ Boolean factors as a means of clustering of interestingness measures of association rules ⋮ Computing minimal sets of descriptive conditions for binary data ⋮ Fuzzy logic programming reduced to reasoning with attribute implications ⋮ Optimal triangular decompositions of matrices with entries from residuated lattices ⋮ Impact of Boolean factorization as preprocessing methods for classification of Boolean data ⋮ Factor analysis of ordinal data via decomposition of matrices with grades ⋮ Possibility theory and formal concept analysis: characterizing independent sub-contexts ⋮ Factorizing three-way binary data ⋮ \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality ⋮ On the size of \(\exists \)-generalized concept lattices ⋮ From-below Boolean matrix factorization algorithm based on MDL ⋮ rBMF ⋮ A new algorithm for Boolean matrix factorization which admits overcovering ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ The spectra of reducible matrices over complete commutative idempotent semifields and their spectral lattices ⋮ Blocks of the Direct Product of Tolerance Relations ⋮ Factorization of matrices with grades via essential entries ⋮ Formal Concept Analysis from the Standpoint of Possibility Theory ⋮ On pruning techniques in map-reduce style CbO algorithms ⋮ An incremental recomputation of from-below Boolean matrix factorization

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mathematical analysis of human leukocyte antigen serology
• Non-dual fuzzy connections
• Concept lattices and order in fuzzy logic
• Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
• Comparing performance of algorithms for generating concept lattices
• Learning the parts of objects by non-negative matrix factorization
• Discovery Science
• Fast Access to Concepts in Concept Lattices via Bidirectional Associative Memories

This page was built for publication: Discovery of optimal factors in binary data via a novel method of matrix decomposition