Pages that link to "Item:Q131470"
From MaRDI portal
The following pages link to Discovery of optimal factors in binary data via a novel method of matrix decomposition (Q131470):
Displayed 50 items.
- rBMF (Q131474) (← links)
- Pseudovarieties of algebras with fuzzy equalities. (Q277570) (← links)
- Exploring users' preferences in a fuzzy setting (Q280189) (← links)
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
- Formal context coverage based on isolated labels: an efficient solution for text feature extraction (Q454948) (← links)
- From-below approximations in Boolean matrix factorization: geometry and new algorithm (Q494072) (← links)
- Fuzzy logic programming reduced to reasoning with attribute implications (Q529051) (← links)
- A new algebraic structure for formal concept analysis (Q621606) (← links)
- Triadic formal concept analysis and triclustering: searching for optimal patterns (Q890322) (← links)
- Granularity of attributes in formal concept analysis (Q903595) (← links)
- Characteristic matrix of covering and its application to Boolean matrix decomposition (Q903648) (← links)
- Optimal triangular decompositions of matrices with entries from residuated lattices (Q962936) (← links)
- Handling noise in Boolean matrix factorization (Q1644808) (← links)
- The spectra of irreducible matrices over completed idempotent semifields (Q1677639) (← links)
- Factorization of matrices with grades (Q1697335) (← links)
- Possibility theory and formal concept analysis: characterizing independent sub-contexts (Q1759696) (← links)
- A new algorithm for Boolean matrix factorization which admits overcovering (Q1800383) (← links)
- Using congruence relations to extract knowledge from concept lattices (Q1800395) (← links)
- From-below Boolean matrix factorization algorithm based on MDL (Q2036139) (← links)
- On pruning techniques in map-reduce style CbO algorithms (Q2107482) (← links)
- An incremental recomputation of from-below Boolean matrix factorization (Q2117125) (← links)
- Complexity reduction and approximation of multidomain systems of partially ordered data (Q2143036) (← links)
- Toward quality assessment of Boolean matrix factorizations (Q2198096) (← links)
- Factorizing Boolean matrices using formal concepts and iterative usage of essential entries (Q2212569) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Knowledge reduction in formal contexts using non-negative matrix factorization (Q2228586) (← links)
- Boolean factors as a means of clustering of interestingness measures of association rules (Q2248543) (← links)
- Impact of Boolean factorization as preprocessing methods for classification of Boolean data (Q2254610) (← links)
- Factor analysis of ordinal data via decomposition of matrices with grades (Q2254612) (← links)
- \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality (Q2279533) (← links)
- On the size of \(\exists \)-generalized concept lattices (Q2286401) (← links)
- Factorization of matrices with grades via essential entries (Q2328899) (← links)
- Optimal factorization of three-way binary data using triadic concepts (Q2376908) (← links)
- Optimal decompositions of matrices with grades into binary and graded matrices (Q2430346) (← links)
- Parallel algorithm for computing fixpoints of Galois connections (Q2430355) (← links)
- A knowledge reduction approach for linguistic concept formal context (Q2663561) (← links)
- Quantifying the conceptual error in dimensionality reduction (Q2670897) (← links)
- A heuristic concept construction approach to collaborative recommendation (Q2671765) (← links)
- The spectra of reducible matrices over complete commutative idempotent semifields and their spectral lattices (Q2817078) (← links)
- Factorization with Hierarchical Classes Analysis and with Formal Concept Analysis (Q3003412) (← links)
- Blocks of the Direct Product of Tolerance Relations (Q3388218) (← links)
- Factorizing three-way binary data (Q4932640) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- (Q5005143) (← links)
- FCA2VEC: Embedding Techniques for Formal Concept Analysis (Q5054975) (← links)
- Formal Methods in FCA and Big Data (Q5054986) (← links)
- Computing minimal sets of descriptive conditions for binary data (Q5166463) (← links)
- Formal Concept Analysis from the Standpoint of Possibility Theory (Q5255641) (← links)
- Low-Rank Binary Matrix Approximation in Column-Sum Norm. (Q6062156) (← links)
- Systematic categorization and evaluation of CbO-based algorithms in FCA (Q6065995) (← links)