Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
The design of relational databases
The design of relational databases
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Algorithms for inferring functional dependencies from relations
Data & Knowledge Engineering
First-order jk-clausal theories are PAC-learnable
Artificial Intelligence
Elements of machine learning
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
From data mining to knowledge discovery: an overview
Advances in knowledge discovery and data mining
Fast discovery of association rules
Advances in knowledge discovery and data mining
Machine Learning
Machine Learning
Discovering All Most Specific Sentences by Randomized Algorithms
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
PlanMine: Predicting Plan Failures Using Sequence Mining
Artificial Intelligence Review - Issues on the application of data mining
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
A Microeconomic View of Data Mining
Data Mining and Knowledge Discovery
A lattice-based approach for I/O efficient association rule mining
Information Systems - Databases: Creation, management and utilization
High-performance data mining with skeleton-based structured parallel programming
Parallel Computing - Parallel data-intensive algorithms and applications
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set
IEEE Transactions on Knowledge and Data Engineering
Monotone boolean dualization is in co-NP[log2n]
Information Processing Letters
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,
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
Mining of Association Rules in Very Large Databases: A Structured Parallel Approach
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Evaluation of an Algorithm for the Transversal Hypergraph Problem
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Bounding Negative Information in Frequent Sets Algorithms
DS '01 Proceedings of the 4th International Conference on Discovery Science
An Algorithm for Dualization in Products of Lattices and Its Applications
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Feasible itemset distributions in data mining: theory and application
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DualMiner: a dual-pruning algorithm for itemsets with constraints
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
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
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
Information Systems - Databases: Creation, management and utilization
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
A New Conceptual Clustering Framework
Machine Learning
Support envelopes: a technique for exploring the structure of association patterns
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Pruning and Visualizing Generalized Association Rules in Parallel Coordinates
IEEE Transactions on Knowledge and Data Engineering
Automatic Subspace Clustering of High Dimensional Data
Data Mining and Knowledge Discovery
Summarizing itemset patterns: a profile-based approach
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Summarizing itemset patterns using probabilistic models
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
On compressing frequent patterns
Data & Knowledge Engineering
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
World Wide Web
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
The minimum consistent subset cover problem and its applications in data mining
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
On the counting complexity of propositional circumscription
Information Processing Letters
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
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
Visual Exploration of Frequent Itemsets and Association Rules
Visual Data Mining
Upper Borders for Emerging Cubes
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Blind paraunitary equalization
Signal Processing
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
Emerging Cubes: Borders, size estimations and lossless reductions
Information Systems
Mining constraint-based patterns using automatic relaxation
Intelligent Data Analysis
CP-summary: a concise representation for browsing frequent itemsets
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
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
Closed Non Derivable Data Cubes Based on Non Derivable Minimal Generators
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Visualizing frequent itemsets, association rules, and sequential patterns in parallel coordinates
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Computational aspects of data mining
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
An intersection inequality for discrete distributions and related generation problems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Computational science and data mining
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
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
Mining correct properties in incomplete databases
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
About keys of formal context and conformal hypergraph
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Research on properties of level space in the level wise search algorithm
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 1
Computing minimal models by positively minimal disjuncts
JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
Visualizing transactional data with multiple clusterings for knowledge discovery
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Enumerating minimal explanations by minimal hitting set computation
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Enumerating minimally revised specifications using dualization
JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Finding all minimal infrequent multi-dimensional intervals
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
Emerging cubes for trends analysis in OLAP databases
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
OpenPsi: A novel computational affective model and its application in video games
Engineering Applications of Artificial Intelligence
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
ACM Transactions on Knowledge Discovery from Data (TKDD)
| Hi-index | 0.00 |