The Minimal Hitting Set Generation Problem: Algorithms and Computation
TL;DR: A suite of implementations of these algorithms with a ready-to-use, platform-agnostic interface based on Docker containers and the AlgoRun framework are provided, so that interested computational scientists can easily perform similar tests with inputs from their own research areas on their own computers or through a convenient Web interface.
read more
Abstract: Finding inclusion-minimal hitting sets (MHSs) for a given family of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Although many algorithms are available in the literature to generate these MHSs, application papers typically consider only a few before selecting one (or introducing a novel algorithm), suggesting the need for a comprehensive survey and performance comparison. We introduce several of these applications, discussing how MHS generation is applied in each domain and which algorithms have been used, providing a unified view of these applications for researchers from diverse areas. We survey twenty-one algorithms for MHS generation from across a variety of domains, considering their history, classification, and useful features. We provide the results of a comprehensive suite of benchmarks of public software implementations of seventeen of these algorithms, including six we implemented ourselves in C++,...
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Implementing Efficient All Solutions SAT Solvers
Takahisa Toda,Takehide Soh +1 more
TL;DR: A survey and discussion of major techniques of AllSAT solvers can be found in this paper, where they faithfully implement them and conduct comprehensive experiments using a large number of instances and various types of solvers including one of the few public softwares.
72
Query-oriented text summarization based on hypergraph transversals
H. Van Lierde,Tommy W. S. Chow +1 more
TL;DR: A new method using the powerful theory of hypergraph transversals is proposed to address the issue of selecting non-redundant sentences jointly covering the main query-relevant topics of a corpus, and is cheaper than existing hypergraph-based summarizers in terms of computational time complexity.
Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networks
Shahaf Bassan,Guy Katz +1 more
TL;DR: In this article , the authors propose a verification-based method for finding minimal explanations, which constitute a provable approximation of the global, minimum explanation, and show how DNN verification can assist in calculating lower and upper bounds on the optimal explanation.
Explanations for Query Answers under Existential Rules
Ismail Ilkan Ceylan,Thomas Lukasiewicz,Enrico Malizia,Andrius Vaicenavičius +3 more
- 16 Aug 2019
TL;DR: This paper provides a thorough complexity analysis for several decision problems associated with minimal explanations under existential rules for ontology languages based on existential rules.
A Minimum Hitting Set Algorithm With Prejudging Mechanism for Model-Based Fault Diagnosis in Distribution Networks
TL;DR: An MHS algorithm with a prejudging mechanism that is constructed based on the distribution characteristics of MHS and can be picked out directly through the HS fitness function and the HS criterion and by avoiding the participation of the MHS ensured strategy (MHSES).
20
References
Mining association rules between sets of items in large databases
Rakesh Agrawal,Tomasz Imielinski,Arun N. Swami +2 more
- 01 Jun 1993
TL;DR: An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
8.7K
Mining association rules between sets of items in large databases
TL;DR: An efficient algorithm is presented that generates all significant transactions in a large database of customer transactions that consists of items purchased by a customer in a visit.
4.5K