Discovery Science

DOI10.1007/b100845zbMath1110.68373OpenAlexW4253950044MaRDI QIDQ5464542

Floris Geerts, Taneli Mielikäinen, Bart Goethals

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100845

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (30)

Weighted 2-sections and hypergraph reconstruction ⋮ Handling noise in Boolean matrix factorization ⋮ The augmentation property of binary matrices for the binary and Boolean rank ⋮ A divide-and-conquer algorithm for binary matrix completion ⋮ Krimp: mining itemsets that compress ⋮ Summarizing transactional databases with overlapped hyperrectangles ⋮ Maximum entropy models and subjective interestingness: an application to tiles in binary databases ⋮ An inductive database system based on virtual mining views ⋮ Toward quality assessment of Boolean matrix factorizations ⋮ Comparing apples and oranges: measuring differences between exploratory data mining results ⋮ Relational data factorization ⋮ Unnamed Item ⋮ Factorizing Boolean matrices using formal concepts and iterative usage of essential entries ⋮ Parameterized low-rank binary matrix approximation ⋮ From-below approximations in Boolean matrix factorization: geometry and new algorithm ⋮ The PRIMPING routine -- tiling through proximal alternating linearized minimization ⋮ Flexible constrained sampling with guarantees for pattern mining ⋮ Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems ⋮ Impact of Boolean factorization as preprocessing methods for classification of Boolean data ⋮ Factor analysis of ordinal data via decomposition of matrices with grades ⋮ The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives ⋮ Actionability and Formal Concepts: A Data Mining Perspective ⋮ From-below Boolean matrix factorization algorithm based on MDL ⋮ Discovery of optimal factors in binary data via a novel method of matrix decomposition ⋮ Hybrid ASP-based Approach to Pattern Mining ⋮ A new algorithm for Boolean matrix factorization which admits overcovering ⋮ Interesting pattern mining in multi-relational data ⋮ Mining Compressing Sequential Patterns ⋮ Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach ⋮ An incremental recomputation of from-below Boolean matrix factorization

This page was built for publication: Discovery Science