Pages that link to "Item:Q494072"
From MaRDI portal
The following pages link to From-below approximations in Boolean matrix factorization: geometry and new algorithm (Q494072):
Displaying 13 items.
- Handling noise in Boolean matrix factorization (Q1644808) (← links)
- On stability of fuzzy formal concepts over randomized one-sided formal context (Q1697981) (← links)
- A new algorithm for Boolean matrix factorization which admits overcovering (Q1800383) (← links)
- From-below Boolean matrix factorization algorithm based on MDL (Q2036139) (← links)
- An incremental recomputation of from-below Boolean matrix factorization (Q2117125) (← links)
- Toward quality assessment of Boolean matrix factorizations (Q2198096) (← links)
- Factorizing Boolean matrices using formal concepts and iterative usage of essential entries (Q2212569) (← links)
- Impact of Boolean factorization as preprocessing methods for classification of Boolean data (Q2254610) (← links)
- \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality (Q2279533) (← links)
- Factorization of matrices with grades via essential entries (Q2328899) (← links)
- A knowledge reduction approach for linguistic concept formal context (Q2663561) (← links)
- FCA2VEC: Embedding Techniques for Formal Concept Analysis (Q5054975) (← links)
- Generalized inverses of Boolean tensors via the Einstein product (Q5862372) (← links)
