The following pages link to Discovery Science (Q5464542):
Displaying 34 items.
- Discovery of optimal factors in binary data via a novel method of matrix decomposition (Q131470) (← links)
- Krimp: mining itemsets that compress (Q408645) (← links)
- Summarizing transactional databases with overlapped hyperrectangles (Q408648) (← links)
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases (Q408667) (← links)
- An inductive database system based on virtual mining views (Q408697) (← links)
- Towards a theory of patches (Q414472) (← links)
- From-below approximations in Boolean matrix factorization: geometry and new algorithm (Q494072) (← links)
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems (Q511763) (← links)
- Interesting pattern mining in multi-relational data (Q740605) (← links)
- Handling noise in Boolean matrix factorization (Q1644808) (← links)
- The augmentation property of binary matrices for the binary and Boolean rank (Q1668986) (← links)
- Relational data factorization (Q1699908) (← links)
- The PRIMPING routine -- tiling through proximal alternating linearized minimization (Q1741169) (← links)
- Flexible constrained sampling with guarantees for pattern mining (Q1741334) (← links)
- A new algorithm for Boolean matrix factorization which admits overcovering (Q1800383) (← links)
- Comparing apples and oranges: measuring differences between exploratory data mining results (Q1944984) (← links)
- From-below Boolean matrix factorization algorithm based on MDL (Q2036139) (← links)
- Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach (Q2060395) (← links)
- An incremental recomputation of from-below Boolean matrix factorization (Q2117125) (← links)
- Weighted 2-sections and hypergraph reconstruction (Q2143117) (← links)
- A divide-and-conquer algorithm for binary matrix completion (Q2187387) (← 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)
- 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)
- The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives (Q2260922) (← links)
- On parsimonious explanations for 2-D tree- and linearly-ordered data (Q3113698) (← links)
- Hybrid ASP-based Approach to Pattern Mining (Q4957187) (← links)
- Mining Compressing Sequential Patterns (Q4969924) (← links)
- Actionability and Formal Concepts: A Data Mining Perspective (Q5445320) (← links)
- (Q6068263) (← links)
- Column-coherent matrix decomposition (Q6535177) (← links)
- Semantic explorations in factorizing Boolean data via formal concepts (Q6596701) (← links)
