Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Dualization, decision lists and identification of monotone discrete functions
Annals of Mathematics and Artificial Intelligence
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
Monotone boolean dualization is in co-NP[log2n]
Information Processing Letters
Translation among CNFs, characteristic models and ordered binary decision diagrams
Information Processing Letters
On the Analysis of On-Line Database Reorganization
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Local and Global Methods in Data Mining: Basic Techniques and Open Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Generating Partial and Multiple Transversals of a Hypergraph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On Dualization in Products of Forests
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Evaluation of an Algorithm for the Transversal Hypergraph Problem
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
On the Hardness of Learning Acyclic Conjunctive Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Rough Sets and Ordinal Classification
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices
Annals of Mathematics and Artificial Intelligence
Interior and exterior functions of positive Boolean functions
Discrete Applied Mathematics
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Zigzag: a new algorithm for mining large inclusion dependencies in databases
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Extracting semantics from data cubes using cube transversals and closures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On the complexity of inducing categorical and quantitative association rules
Theoretical Computer Science
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
Version spaces and the consistency problem
Artificial Intelligence
Combining probabilistic logic programming with the power of maximum entropy
Artificial Intelligence - Special issue on nonmonotonic reasoning
Pareto-optimal patterns in logical analysis of data
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
On automating Web services discovery
The VLDB Journal — The International Journal on Very Large Data Bases
Information Systems - Special issue: The semantic web and web services
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Tractable database design through bounded treewidth
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimum implicational basis for ∧-semidistributive lattices
Information Processing Letters
Prediction-hardness of acyclic conjunctive queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
Horn axiomatizations for sequential data
Theoretical Computer Science
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
On the fixed-parameter tractability of the equivalence test of monotone normal forms
Information Processing Letters
On the complexity of the multiplication method for monotone CNF/DNF dualization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Enumerating spanning and connected subsets in graphs and matroids
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
A framework for incremental generation of closed itemsets
Discrete Applied Mathematics
On the counting complexity of propositional circumscription
Information Processing Letters
Unifying Framework for Rule Semantics: Application to Gene Expression Data
Fundamenta Informaticae - Special issue ISMIS'05
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
Self-duality of bounded monotone boolean functions and related problems
Discrete Applied Mathematics
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
Inductive Logic Programming
Pinpointing in the Description Logic $\mathcal {EL}^+$
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Constructing Iceberg Lattices from Frequent Closures Using Generators
DS '08 Proceedings of the 11th International Conference on Discovery Science
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
Emerging Cubes: Borders, size estimations and lossless reductions
Information Systems
Some Computational Problems Related to Pseudo-intents
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
Journal on Data Semantics XII
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Data & Knowledge Engineering
Towards the Complexity of Recognizing Pseudo-intents
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Automatic Generation of P2P Mappings between Sources Schemas
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
Ranking Approximate Query Rewritings Based on Views
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Pareto-optimal patterns in logical analysis of data
Discrete Applied Mathematics
On the fractional chromatic number of monotone self-dual Boolean functions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Lower bounds for three algorithms for the transversal hypergraph generation
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
About keys of formal context and conformal hypergraph
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Version spaces without boundary sets
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Computing minimal models by positively minimal disjuncts
JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
Computational Geometry: Theory and Applications
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
Automatic Web service composition based on Horn clauses and Petri nets
Expert Systems with Applications: An International Journal
Toward a fair review-management system
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Visualizing transactional data with multiple clusterings for knowledge discovery
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Polynomial time SAT decision, hypergraph transversals and the hermitian rank
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimization of XSLT by compact specialization and combination
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Generating cut conjunctions and bridge avoiding extensions in graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Complexity of DNF and isomorphism of monotone formulas
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Towards ad-hoc rule semantics for gene expression data
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
On finding acyclic subhypergraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Mining frequent δ-free patterns in large databases
DS'05 Proceedings of the 8th international conference on Discovery Science
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
The parameterized complexity of maximality and minimality problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
About the family of closure systems preserving non-unit implications in the guigues-duquenne base
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Discovery of keys from SQL tables
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Estimating entity importance via counting set covers
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Unifying Framework for Rule Semantics: Application to Gene Expression Data
Fundamenta Informaticae - Special issue ISMIS'05
Emerging cubes for trends analysis in OLAP databases
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Information Sciences: an International Journal
Mathematical morphology on hypergraphs, application to similarity and positive kernel
Computer Vision and Image Understanding
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
APCCM '12 Proceedings of the Eighth Asia-Pacific Conference on Conceptual Modelling - Volume 130
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Letting keys and functional dependencies out of the bag
APCCM '13 Proceedings of the Ninth Asia-Pacific Conference on Conceptual Modelling - Volume 143
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
ACM Transactions on Knowledge Discovery from Data (TKDD)
Hi-index | 0.01 |
The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation (i.e., given a hypergraph $\cal H$, decide if every subset of vertices is contained in or contains some edge of $\cal H$) is shown to be co-NP-complete. A certain subproblem of hypergraph saturation, the saturation of simple hypergraphs (i.e., Sperner families), is shown to be under polynomial transformation equivalent to transversal hypergraph recognition; i.e., given two hypergraphs ${\cal H}_{1}, {\cal H}_{2}$, decide if the sets in ${\cal H}_{2}$ are all the minimal transversals of ${\cal H}_{1}$. The complexity of the search problem related to the recognition of the transversal hypergraph, the computation of the transversal hypergraph, is an open problem. This task needs time exponential in the input size; it is unknown whether an output-polynomial algorithm exists. For several important subcases, for instance if an upper or lower bound is imposed on the edge size or for acyclic hypergraphs, output-polynomial algorithms are presented. Computing or recognizing the minimal transversals of a hypergraph is a frequent problem in practice, which is pointed out by identifying important applications in database theory, Boolean switching theory, logic, and artificial intelligence (AI), particularly in model-based diagnosis.