
- From Local Pattern Mining to Relevant Bi-cluster Characterization
- A framework for frequent sequence mining under generalized regular expression constraints
- Nd'Ordre : presentee devant
- A Bi-clustering Framework for Categorical Data Ruggero G. Pensa1
- Il est chaque jour plus facile de collecter des donnes mais notre capacit en extraire des informations forte valeur ajoute reste limite. Pour rpondre ces
- Towards the Reverse Engineering of Denormalized Relational Databases
- -strong classification rules for characterizing chemical carcinogens
- Mining frequent sequential patterns under regular expressions: a highly adaptative strategy for pushing constraints
- Checking and Debugging of Two-level Sadegh SAIDI and Jean-Francois BOULICAUT
- Mining a New Fault-Tolerant Pattern Type as an Alternative to Formal Concept Discovery
- Optimization of Association Rule Mining Baptiste Jeudy Jean-Franois Boulicaut
- Looking for monotonicity properties of a similarity constraint on sequences
- In Silico Biology 7 (2007) 467483 467 Clustering Formal Concepts to Discover
- IDA 2009 website http://ida09.liris.cnrs.fr LyonFrance
- 2009. XIII, 418 p. (Information Systems and Applications, incl. Internet/Web, and HCI, Vol.
- If constraint-based mining is the answer: what is the constraint? (invited talk)
- Closed Patterns Meet n-ary Relations J ER EMY BESSON
- Extracting signature motifs from promoter sets of differentially expres... http://www.bioinfo.de/isb/2008/08/0043/main.html 1 sur 22 11/10/2009 21:54
- Supporting bi-cluster interpretation in 0/1 data by means of local patterns
- Data Mining and Knowledge Discovery, 7, 522, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands.
- Generalizing Itemset Mining in a Constraint Programming Setting
- Mining Constrained Cross-Graph Cliques in Dynamic Networks
- Constraint-driven co-clustering of Ruggero G. Pensa
- Mining Bi-sets in Numerical Data Jeremy Besson1,2
- Constraint-Based Mining of Fault-Tolerant Patterns from Boolean Data
- A Survey on Condensed Representations for Frequent Sets
- CONSTRAINT-BASEDDATA MINING Jean-Francois Boulicaut
- Condensed representations for data mining Jean-Franois Boulicaut
- Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
- Constraint-Based Discovery and Inductive Queries: Application to Association Rule Mining
- Constraint-Based Mining of Sets of Cliques Sharing Vertex Properties
- Discovering Relevant Cross-Graph Cliques in Dynamic Networks
- Application-Independent Feature Construction from Noisy Samples
- A Parameter-Free Associative Classification Loic Cerf1
- Constrained Co-clustering of Gene Expression Data Ruggero G. Pensa
- Pattern-Based Decision Tree Construction Dominique Gay, Nazha Selmaoui
- Feature Construction and -Free Sets in 0/1 Nazha Selmaoui1
- Towards Constrained Co-clustering in Ordered 0/1 Data Sets
- About softness for inductive querying on sequence Ieva Mitasiunaite
- Constraint-based mining of fault-tolerant patterns from Boolean data
- Towards Fault-Tolerant Formal Concept Analysis Ruggero G. Pensa and Jean-Francois Boulicaut
- A Methodology for Biologically Relevant Pattern Discovery from Gene Expression Data
- Mining alpha/beta concepts as relevant bi-sets from transactional data
- Comprehensive Log Compression with Frequent Patterns
- A Comparison between Query Languages for the Extraction of Association Rules
- Mining Frequent Sequential Patterns under a Similarity Constraint
- Approximation of Frequency Queries by Means of Free-Sets
- Modeling KDD Processes within the Inductive Database Framework
- A KDD Framework for Database Audit 1 Jean-Francois Boulicaut
- STARLET An Affix-Based Compiler Compiler designed as a Logic Programming System
- Using a Database Query Language to Specify and Generate Spreadsheets
- d'ordre 02 ISAL 0090 Annee 2002 presentee
- Actionability and Formal Concepts: A Data Mining Perspective
- Artificial Regulatory Networks Evolution Yolanda Sanchez-Dehesa1
- Mining bi-sets in numerical data Jeremy Besson1,2
- Constraint-based mining: a major step towards inductive databases
- Signing stock market situations by means of characteristic sequential patterns
- Tackling Closed Pattern Relevancy In n-ary Jeremy Besson1
- Optimizing subset queries: a step towards SQL-based inductive databases for itemsets
- Assessment of discretization techniques for relevant pattern discovery from gene expression data
- No d'ordre: 2009-ISAL-0036 Annee 2009 presentee devant
- Multidimensional Association Rules in Boolean Tensors Kim-Ngan T. Nguyen
- Querying Inductive Databases: a Case Study on the MINE RULE Operator
- Numerical Data Co-clustering via Sum-Squared Residue Minimization and User-dened
- Query Languages Supporting Descriptive Rule Mining: A Comparative Study
- Co-clustering Numerical Data under User-defined Constraints Ruggero G. Pensa1,3
- No d'ordre 2007-ISAL-0039 Annee 2007 Contributions aux techniques de Prise de
- BioMed Central Page 1 of 12
- Parameter Tuning for Differential Mining of String Patterns Jeremy Besson1
- 85 e 338 pages reli 2004 ISBN : 2-7462-0850-4 14, rue de Provigny 94236 Cachan cedex, France tl.:+33 (0)1 47 40 67 00 fax:+33 (0)1 47 40 67 02 Web: www.Lavoisier.fr
- Feature Construction Based on Closedness Properties Is Not That Simple
- No d'ordre 03 Annee 2003
- Comparing Intended and Real Usage in Web Portal: Temporal Logic and Data Mining
- Frequent Closures as a Concise Representation for Binary Data Mining
- Agglomerating Local Patterns Hierarchically with ALPHA Universit de Lyon, CNRS
- Boolean Property Encoding for Local Set Pattern Discovery: An Application to Gene
- Using Condensed Representations for Interactive Association Rule Mining
- Nd'ordre: 2005 ISAL 0042 Annee 2005 MEMOIRE DE TH`ESE
- GO-SPADE: Mining Sequential Patterns over Datasets with Consecutive Repetitions
- (' ' ' & ! 4 '' $ ' 5 ! )
- Constraint-Based Mining of Sequential Patterns over Datasets with Consecutive Repetitions
- Mining Free Itemsets under Constraints Jean-Francois Boulicaut Baptiste Jeudy
- Using transposition for pattern discovery from microarray data
- Using a solver over the string pattern domain to analyze gene promoter sequences
- Query driven knowledge discovery via OLAP manipulations Jean-Franois BOULICAUT
- Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
- Characterization of unsupervised clusters with the simplest association rules
- Nd'ordre : 2006-ISAL-0078 Annee 2006 presentee devant
- Using classification and visualization on pattern databases for gene expression data analysis
- No d'ordre : 2010-AAAA-0000 Anne 2010 prsente devant
- Discovering Inter-Dimensional Rules in Dynamic Kim-Ngan T. Nguyen1
- Bases de Donnes Inductives Des langages de requtes au service de
- N d'ordre : 2007-ISAL-0077 Anne 2007 prsente devant
- Jean-Francois Boulicaut and Saso Dzeroski, editors Proceedings of the 2nd International
- No d'ordre 04-ISAL-0095 Annee 2004 Recherche automatique des fen^etres
- Constraint-based concept mining and its application to microarray data analysis
- Data-Peeler: Constraint-Based Closed Pattern Mining in n-ary Relations
- Introducing Softness into Inductive Queries on String Databases
- Constraint-Based Mining of Formal Concepts in Transactional Data
- Iterative Bayesian Network Implementation by Using Annotated Association Rules
- Mining concepts from large SAGE gene expression matrices
- Spreadsheet generation from rule-based speci cations Jean-Francois Boulicaut
- Contribution to Gene Expression Data Analysis by Means of Set Pattern Mining
- DATA MINING QUERY LANGUAGES Jean-FrancoisBoulicaut
- Knowl Inf Syst (2012) 30:87111 DOI 10.1007/s10115-010-0369-x
- Discovering Descriptive Rules in Relational Dynamic Graphs