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
Matroid Intersections, Polymatroid Inequalities, and Related Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
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,
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
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
An Algorithm for Dualization in Products of Lattices and Its Applications
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Dense Families and Key Functions of Database Relation Instances
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
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
An inequality for polymatroid functions and its applications
Discrete Applied Mathematics - Submodularity
ICDM '03 Proceedings of the Third IEEE International Conference on 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
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
Factoring boolean functions using graph partitioning
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
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
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
Density condensation of boolean formulas
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Optimizing hypergraph transversal computation with an anti-monotone constraint
Proceedings of the 2007 ACM symposium on Applied computing
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
Theoretical Computer Science
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
On the counting complexity of propositional circumscription
Information Processing Letters
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
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
A note on systems with max--min and max-product constraints
Fuzzy Sets and Systems
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
Scientific contributions of Leo Khachiyan (a short overview)
Discrete Applied Mathematics
Stability of two player game structures
Discrete Applied Mathematics
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
Tree-Shellability of Restricted DNFs
IEICE - Transactions on Information and Systems
Some Computational Problems Related to Pseudo-intents
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
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
Masking patterns in sequences: A new class of motif discovery with don't cares
Theoretical Computer Science
Towards the Complexity of Recognizing Pseudo-intents
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Factoring Boolean functions using graph partitioning
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Pareto-optimal patterns in logical analysis of data
Discrete Applied Mathematics
Latticized linear optimization on the unit interval
IEEE Transactions on Fuzzy Systems
An intersection inequality for discrete distributions and related generation problems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the boolean connectivity problem for horn relations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
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
Generating positive and negative exact rules using formal concept analysis: problems and solutions
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
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Lattice-based computation of Boolean functions
Proceedings of the 47th Design Automation Conference
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics
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
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
Enumerating minimal hypotheses and dualizing monotone boolean functions on lattices
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Nash-solvable two-person symmetric cycle game forms
Discrete Applied Mathematics
How to apply SAT-solving for the equivalence test of monotone normal forms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
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
The hitting set attack on anonymity protocols
IH'04 Proceedings of the 6th international conference on Information Hiding
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Enumerating minimal explanations by minimal hitting set computation
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
About the enumeration algorithms of closed sets
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Hardness of enumerating pseudo-intents in the lectic order
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
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
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
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
Finding all minimal infrequent multi-dimensional intervals
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Discovering all associations in discrete data using frequent minimally infrequent attribute sets
Discrete Applied Mathematics
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
Computing Implications with Negation from a Formal Context
Fundamenta Informaticae - Concept Lattices and Their Applications
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
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
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 |