On the public citation graph
A Survey on Condensed Representations for Frequent Sets
0 signed · 169 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-44957-4_65openalex-snapshot
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
inferredcites →https://doi.org/10.1007/3-540-45372-5_8openalex-snapshot
Approximation of Frequency Queries by Means of Free-Sets
inferredcites →https://doi.org/10.1007/3-540-45571-x_9openalex-snapshot
Frequent Closures as a Concise Representation for Binary Data Mining
inferredcites →https://doi.org/10.1007/3-540-45681-3_19openalex-snapshot
Using Condensed Representations for Interactive Association Rule Mining
inferredcites →https://doi.org/10.1007/3-540-45681-3_7openalex-snapshot
Mining All Non-derivable Frequent Itemsets
inferredcites →https://doi.org/10.1007/3-540-47887-6_15openalex-snapshot
Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators
inferredcites →https://doi.org/10.1007/978-1-4419-7738-0_4openalex-snapshot
A Theory of Inductive Query Answering
inferredcites →https://doi.org/10.1007/978-1-4471-0651-7_3openalex-snapshot
Simplest Rules Characterizing Classes Generated by δ-Free Sets
inferredcites →https://doi.org/10.1007/978-3-540-39804-2_9openalex-snapshot
Minimal k-Free Representations of Frequent Sets
inferredcites →https://doi.org/10.1007/978-3-540-44497-8_1openalex-snapshot
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
inferredcites →https://doi.org/10.1007/978-3-540-44497-8_11openalex-snapshot
Deducing Bounds on the Support of Itemsets
inferredcites →https://doi.org/10.1007/978-3-540-44497-8_13openalex-snapshot
Condensed Representations for Sets of Mining Queries
inferredcites →https://doi.org/10.1007/978-3-540-44497-8_16openalex-snapshot
Integrity Constraints over Association Rules
inferredcites →https://doi.org/10.1007/978-3-540-44497-8_6openalex-snapshot
Towards Query Evaluation in Inductive Databases Using Version Spaces
inferredcites →https://doi.org/10.1007/978-3-642-01815-2_23openalex-snapshot
RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_15openalex-snapshot
Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts
inferredcites →https://doi.org/10.1016/s0306-4379(03)00002-4openalex-snapshot
DBC: a condensed representation of frequent patterns for efficient mining
inferredcites →https://doi.org/10.1016/s0306-4379(99)00003-4openalex-snapshot
Efficient mining of association rules using closed itemset lattices
inferredcites →https://doi.org/10.1023/a:1009796218281openalex-snapshot
Levelwise Search and Borders of Theories in Knowledge Discovery
inferredcites →https://doi.org/10.1023/a:1021571501451openalex-snapshot
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
inferredcites →https://doi.org/10.1109/icde.2004.1319986openalex-snapshot
BIDE: efficient mining of frequent closed sequences
inferredcites →https://doi.org/10.1109/icdm.2001.989533openalex-snapshot
Concise representation of frequent patterns based on disjunction-free generators
inferredcites →https://doi.org/10.1109/icdm.2002.1183894openalex-snapshot
A theory of inductive query answering
inferredcites →https://doi.org/10.1109/icdm.2004.10093openalex-snapshot
On Closed Constrained Frequent Pattern Mining
inferredcites →https://doi.org/10.1109/ideas.2001.938100openalex-snapshot
Mining free itemsets under constraints
inferredcites →https://doi.org/10.1109/ssdbm.2004.47openalex-snapshot
LCGMiner: levelwise closed graph pattern mining from large databases
inferredcites →https://doi.org/10.1137/1.9781611972726.27openalex-snapshot
CHARM: An Efficient Algorithm for Closed Itemset Mining
inferredcites →https://doi.org/10.1137/1.9781611972757.22openalex-snapshot
Mining Non-Derivable Association Rules
inferredcites →https://doi.org/10.1137/1.9781611972757.23openalex-snapshot
Depth-First Non-Derivable Itemset Mining
inferredcites →https://doi.org/10.1145/1007730.1007744openalex-snapshot
Advances in frequent itemset mining implementations
inferredcites →https://doi.org/10.1145/170035.170072openalex-snapshot
Mining association rules between sets of items in large databases
inferredcites →https://doi.org/10.1145/240455.240472openalex-snapshot
A database perspective on knowledge discovery
inferredcites →https://doi.org/10.1145/253260.253325openalex-snapshot
Dynamic itemset counting and implication rules for market basket data
inferredcites →https://doi.org/10.1145/253262.253325openalex-snapshot
Dynamic itemset counting and implication rules for market basket data
inferredcites →https://doi.org/10.1145/276304.276313openalex-snapshot
Efficiently mining long patterns from databases
inferredcites →https://doi.org/10.1145/276305.276313openalex-snapshot
Efficiently mining long patterns from databases
inferredcites →https://doi.org/10.1145/335191.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/347090.347101openalex-snapshot
Generating non-redundant association rules
inferredcites →https://doi.org/10.1145/375551.375604openalex-snapshot
A condensed representation to find frequent patterns
inferredcites →https://doi.org/10.1145/380995.381017openalex-snapshot
Mining frequent patterns with counting inference
inferredcites →https://doi.org/10.1145/772862.772871openalex-snapshot
A perspective on inductive databases
inferredcites →https://doi.org/10.1186/gb-2002-3-12-research0067openalex-snapshot
Strong-association-rule mining for large-scale gene-expression data analysis: a case study on human SAGE data
inferredcites →https://doi.org/10.2307/2534031openalex-snapshot
Bonferroni-Type Inequalities with Applications.
inferredcites →https://doi.org/10.3233/ida-2005-9105openalex-snapshot
Constraint-based concept mining and its application to microarray data analysis
inferredcites →https://doi.org/10.48550/arxiv.cs/0505071openalex-snapshot
Summarization Techniques for Pattern Collections in Data Mining
inferredcites →https://doi.org/10.5555/140629.140633openalex-snapshot
Knowledge discovery in databases
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470892107.ch41openalex-snapshot
Unsupervised Learning for Gene Regulation Network Inference from Expression Data: A Review
inferred← citeshttps://doi.org/10.1002/9781118617151.ch35openalex-snapshot
Galois Closure Based Association Rule Mining From Biological Data
inferred← citeshttps://doi.org/10.1002/sam.10004openalex-snapshot
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
inferred← citeshttps://doi.org/10.1002/sam.10005openalex-snapshot
Controlling the False Discovery Rate for Feature Selection in High‐resolution NMR Spectra
inferred← citeshttps://doi.org/10.1002/wics.1242openalex-snapshot
Selection of multinomial logit models via association rules analysis
inferred← citeshttps://doi.org/10.1007/11893318_18openalex-snapshot
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations
inferred← citeshttps://doi.org/10.1007/978-1-4419-7738-0_1openalex-snapshot
Inductive Databases and Constraint-based Data Mining: Introduction and Overview
inferred← citeshttps://doi.org/10.1007/978-1-4419-7738-0_5openalex-snapshot
Generalizing Itemset Mining in a Constraint Programming Setting
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_66openalex-snapshot
Closed Itemset Mining and Nonredundant Association Rule Mining
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_66-2openalex-snapshot
Closed Itemset Mining and Non-redundant Association Rule Mining
inferred← citeshttps://doi.org/10.1007/978-3-030-10925-7_23openalex-snapshot
How Your Supporters and Opponents Define Your Interestingness
inferred← citeshttps://doi.org/10.1007/978-3-030-12079-5_6openalex-snapshot
Items2Data: Generating Synthetic Boolean Datasets from Itemsets
inferred← citeshttps://doi.org/10.1007/978-3-031-60597-0_4openalex-snapshot
Efficiently Mining Closed Interval Patterns with Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-032-03028-3_1openalex-snapshot
A Subjective Pattern Mining Literature Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-05461-2_1openalex-snapshot
Introduction to Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-06608-0_3openalex-snapshot
Efficiently Depth-First Minimal Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-06608-0_5openalex-snapshot
Balancing the Analysis of Frequent Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-07821-2_1openalex-snapshot
An Introduction to Frequent Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-45763-5_4openalex-snapshot
Exact and Approximate Minimal Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-57454-7_42openalex-snapshot
Learning What Matters – Sampling Interesting Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-61164-8_3openalex-snapshot
Two Decades of Pattern Mining: Principles and Methods
inferred← citeshttps://doi.org/10.1007/978-3-540-68125-0_12openalex-snapshot
Feature Construction Based on Closedness Properties Is Not That Simple
inferred← citeshttps://doi.org/10.1007/978-3-540-69848-7_99openalex-snapshot
Discovering Knowledge from Local Patterns with Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-70901-5_9openalex-snapshot
About the Lossless Reduction of the Minimal Generator Family of a Context
inferred← citeshttps://doi.org/10.1007/978-3-540-75549-4_16openalex-snapshot
Towards a General Framework for Data Mining
inferred← citeshttps://doi.org/10.1007/978-3-540-78137-0_2openalex-snapshot
Actionability and Formal Concepts: A Data Mining Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-78921-5_5openalex-snapshot
Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions
inferred← citeshttps://doi.org/10.1007/978-3-540-88411-8_15openalex-snapshot
Constructing Iceberg Lattices from Frequent Closures Using Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-03915-7_14openalex-snapshot
Condensed Representation of Sequential Patterns According to Frequency-Based Measures
inferred← citeshttps://doi.org/10.1007/978-3-642-04180-8_29openalex-snapshot
Non-redundant Subgroup Discovery Using a Closure System
inferred← citeshttps://doi.org/10.1007/978-3-642-12165-4_35openalex-snapshot
Combining CSP and Constraint-Based Mining for Pattern Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-14640-4_6openalex-snapshot
Two Measures of Objective Novelty in Association Rule Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-15280-1_5openalex-snapshot
Finding Minimal Rare Itemsets and Rare Association Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_44openalex-snapshot
Constraint Programming for Mining n-ary Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-20514-9_1openalex-snapshot
Inductive Databases and Constraint-Based Data Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-25838-1_5openalex-snapshot
Combining Constraint Programming and Constraint-Based Mining for Pattern Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-33074-2_21openalex-snapshot
Tractable Reasoning Problems with Fully-Characterized Association Rules
inferred← citeshttps://doi.org/10.1007/s00236-007-0060-1openalex-snapshot
The complexity of satisfying constraints on databases of transactions
inferred← citeshttps://doi.org/10.1007/s10115-010-0329-5openalex-snapshot
Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression
inferred← citeshttps://doi.org/10.1007/s10115-010-0343-7openalex-snapshot
Non-derivable itemsets for fast outlier detection in large high-dimensional categorical data
inferred← citeshttps://doi.org/10.1007/s10115-010-0369-xopenalex-snapshot
Application-independent feature construction based on almost-closedness properties
inferred← citeshttps://doi.org/10.1007/s10115-013-0660-8openalex-snapshot
Mining non-derivable hypercliques
inferred← citeshttps://doi.org/10.1007/s10115-020-01478-9openalex-snapshot
Mining evolutions of complex spatial objects using a single-attributed Directed Acyclic Graph
inferred← citeshttps://doi.org/10.1007/s10115-023-01852-3openalex-snapshot
Mining frequent generators and closures in data streams with FGC-Stream
inferred← citeshttps://doi.org/10.1007/s10472-013-9372-8openalex-snapshot
A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
inferred← citeshttps://doi.org/10.1007/s10618-008-0108-zopenalex-snapshot
Mining conjunctive sequential patterns
inferred← citeshttps://doi.org/10.1007/s10618-009-0148-zopenalex-snapshot
A fast outlier detection strategy for distributed high-dimensional data sets with mixed attributes
inferred← citeshttps://doi.org/10.1007/s10618-012-0284-8openalex-snapshot
Closed and noise-tolerant patterns in n-ary relations
inferred← citeshttps://doi.org/10.1007/s10618-017-0501-6openalex-snapshot
Flexible constrained sampling with guarantees for pattern mining
inferred← citeshttps://doi.org/10.1007/s10844-011-0168-1openalex-snapshot
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
inferred← citeshttps://doi.org/10.1007/s10844-016-0409-4openalex-snapshot
An approximate representation of hypercliques
inferred← citeshttps://doi.org/10.1007/s10844-024-00866-9openalex-snapshot
Heuristic approaches for non-exhaustive pattern-based change detection in dynamic networks
inferred← citeshttps://doi.org/10.1007/springerreference_63217openalex-snapshot
Closed Itemset Mining and Non-redundant Association Rule Mining
inferred← citeshttps://doi.org/10.1016/j.artint.2015.04.003openalex-snapshot
Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.asoc.2009.11.004openalex-snapshot
A fast pruning redundant rule method using Galois connection
inferred← citeshttps://doi.org/10.1016/j.cose.2018.12.004openalex-snapshot
A three-phase approach to differentially private crucial patterns mining over data streams
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.080openalex-snapshot
Parallel algorithms for enumerating closed patterns from multi-relational data
inferred← citeshttps://doi.org/10.1016/j.datak.2009.05.001openalex-snapshot
Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets
inferred← citeshttps://doi.org/10.1016/j.datak.2011.02.003openalex-snapshot
Reliable representations for association rules
inferred← citeshttps://doi.org/10.1016/j.eswa.2008.08.046openalex-snapshot
Post-processing of associative classification rules using closed sets
inferred← citeshttps://doi.org/10.1016/j.eswa.2014.12.031openalex-snapshot
EXPEDITE: EXPress closED ITemset Enumeration
inferred← citeshttps://doi.org/10.1016/j.ins.2012.08.005openalex-snapshot
Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts
inferred← citeshttps://doi.org/10.1016/j.is.2021.101908openalex-snapshot
Pattern on demand in transactional distributed databases
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.11.003openalex-snapshot
Itemset frequency satisfiability: Complexity and axiomatization
inferred← citeshttps://doi.org/10.1080/03081079.2011.634410openalex-snapshot
Knowledge reduction in formal decision contexts based on an order-preserving mapping
inferred← citeshttps://doi.org/10.1109/dexa.2007.141openalex-snapshot
Using Description Logic and Rules to Determine XML Access Control
inferred← citeshttps://doi.org/10.1109/dexa.2007.41openalex-snapshot
Towards a Finer Assessment of Extraction Contexts Sparseness
inferred← citeshttps://doi.org/10.1109/icbk.2017.32openalex-snapshot
Privacy-Preserving Pattern Mining on Online Density Estimates
inferred← citeshttps://doi.org/10.1109/icdm.2007.45openalex-snapshot
ORIGAMI: Mining Representative Orthogonal Graph Patterns
inferred← citeshttps://doi.org/10.1109/icdm.2011.100openalex-snapshot
Mining Dominant Patterns in the Sky
inferred← citeshttps://doi.org/10.1109/icdm.2011.69openalex-snapshot
Finding Robust Itemsets under Subsampling
inferred← citeshttps://doi.org/10.1109/icdmw.2011.11openalex-snapshot
A Constraint-Based Language for Declarative Pattern Discovery
inferred← citeshttps://doi.org/10.1109/icdmw.2011.48openalex-snapshot
CLIM: Closed Inclusion Dependency Mining in Databases
inferred← citeshttps://doi.org/10.1109/ictai.2011.80openalex-snapshot
Mining Non-derivable Hypercliques
inferred← citeshttps://doi.org/10.1109/iscmi.2014.10openalex-snapshot
A Vectorized Implementation for Maximum Entropy Based Associative Regression
inferred← citeshttps://doi.org/10.1109/iwcia.2015.7449471openalex-snapshot
Towards parallel mining of closed patterns from multi-relational data
inferred← citeshttps://doi.org/10.1109/wi-iat.2014.125openalex-snapshot
Maximum Entropy Based Associative Regression for Sparse Datasets
inferred← citeshttps://doi.org/10.1137/1.9781611972771.22openalex-snapshot
Constraint-Based Pattern Set Mining
inferred← citeshttps://doi.org/10.1137/1.9781611972795.56openalex-snapshot
M usk : Uniform Sampling of k Maximal Patterns
inferred← citeshttps://doi.org/10.1137/1.9781611974348.65openalex-snapshot
Fast Lossless Frequent Itemset Mining in Data Streams using Crucial Patterns
inferred← citeshttps://doi.org/10.1142/9789812771667_0008openalex-snapshot
Faster Algorithms for Constructing a Concept (Galois) Lattice
inferred← citeshttps://doi.org/10.1142/s0129054108005681openalex-snapshot
SUCCINCT MINIMAL GENERATORS: THEORETICAL FOUNDATIONS AND APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0218213014500018openalex-snapshot
Towards Faster Mining of Disjunction-Based Concise Representations of Frequent Patterns
inferred← citeshttps://doi.org/10.1145/1147234.1147248openalex-snapshot
Frequent closed itemset based algorithms
inferred← citeshttps://doi.org/10.1145/1189769.1189770openalex-snapshot
Expressive power of an algebra for data mining
inferred← citeshttps://doi.org/10.1145/1644873.1644877openalex-snapshot
Mining multidimensional and multilevel sequential patterns
inferred← citeshttps://doi.org/10.1145/1816112.1816119openalex-snapshot
Margin-closed frequent sequential pattern mining
inferred← citeshttps://doi.org/10.1145/1835804.1835840openalex-snapshot
Frequent regular itemset mining
inferred← citeshttps://doi.org/10.1145/2245276.2245302openalex-snapshot
A constraint language for declarative pattern discovery
inferred← citeshttps://doi.org/10.1145/2339530.2339756openalex-snapshot
An enhanced relevance criterion for more concise supervised pattern discovery
inferred← citeshttps://doi.org/10.1145/2541268.2541271openalex-snapshot
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
inferred← citeshttps://doi.org/10.1145/2629586openalex-snapshot
Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees
inferred← citeshttps://doi.org/10.1145/2656261openalex-snapshot
Finding Robust Itemsets under Subsampling
inferred← citeshttps://doi.org/10.17048/futurerfid.1.2014.161openalex-snapshot
CGT : A vertical miner for frequent equivalence classes of itemsets
inferred← citeshttps://doi.org/10.2168/lmcs-6(2:4)2010openalex-snapshot
Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
inferred← citeshttps://doi.org/10.3233/ida-2009-0384openalex-snapshot
A new generic basis of “factual” and “implicative” association rules1
inferred← citeshttps://doi.org/10.3233/ida-2012-0540openalex-snapshot
Key roles of closed sets and minimal generators in concise representations of frequent patterns
inferred← citeshttps://doi.org/10.37070/aml.2020.37.1.03openalex-snapshot
Egy gyakori zárt mintákat és gyakori generátorokat kereső vertikális algoritmus
inferred← citeshttps://doi.org/10.4000/msh.12081openalex-snapshot
Construction efficace du treillis des motifs fermés fréquents et extraction simultanée des bases génériques de règles
inferred← citeshttps://doi.org/10.4018/978-1-4666-1900-5.ch004openalex-snapshot
An Analytical Survey of Current Approaches to Mining Logical Rules from Data
inferred← citeshttps://doi.org/10.4018/978-1-60566-218-3.ch012openalex-snapshot
Discovering Knowledge from Local Patterns in SAGE Data
inferred← citeshttps://doi.org/10.4018/978-1-60566-404-0.ch005openalex-snapshot
Post-Processing for Rule Reduction Using Closed Set
inferred← citeshttps://doi.org/10.4230/dagsemproc.07181.3openalex-snapshot
Discovering Knowledge from Local Patterns with Global Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1107.3407openalex-snapshot
Discovering Knowledge using a Constraint-based Language
inferred← citeshttps://doi.org/10.48550/arxiv.1111.6937openalex-snapshot
Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees
inferred← citeshttps://doi.org/10.48550/arxiv.1810.07116openalex-snapshot
Motifs corrélés rares : Caractérisation et nouvelles représentations concises
inferred← citeshttps://doi.org/10.48550/arxiv.1911.00524openalex-snapshot
Contributions to the Formalization and Extraction of Generic Bases of Association Rules
inferred← citeshttps://doi.org/10.5121/ijcsa.2020.10401openalex-snapshot
Opti2I and ε-precis Methods Selection Algorithm
inferred← citeshttps://doi.org/10.5244/c.26.105openalex-snapshot
Finding Groups of Duplicate Images In Very Large Dataset
inferred← citeshttps://doi.org/10.5441/002/edbt.2014.17openalex-snapshot
COLARM: Cost-based Optimization for Localized Association Rule Mining
inferred← citeshttps://doi.org/10.70675/07c087ecz3cdbz4a6az8c57z5a437d46aab8openalex-snapshot
Fouille de données par contraintes
inferred← citeshttps://doi.org/10.70675/176d6c8dz7a79z4e45z828cz91d258285d96openalex-snapshot
Anytime discovery of a diverse set of patterns with Monte Carlo tree search
inferred← citeshttps://doi.org/10.70675/22310761zc9c1z4e58za10bz9a14adfbb18bopenalex-snapshot
Trouver des Solutions Diverses en Programmation par Contraintes avec des Approches Probabilistes
inferred← citeshttps://doi.org/10.70675/2f95b588z0c67z4adcz825azf5ac1c14e773openalex-snapshot
Exploration de grands ensembles de motifs.
inferred← citeshttps://doi.org/10.70675/b54520eeze245z411azbc6bzcc89958b0482openalex-snapshot
Un cadre générique pour les modèles globaux fondés sur les motifs locaux
inferred← citeshttps://doi.org/10.70675/bd136949z93b4z422fz9252z7fff5fc5da11openalex-snapshot
Contribution à la découverte de sous-groupes corrélés : Application à l’analyse des systèmes territoriaux et des réseaux alimentaires
inferred← citeshttps://doi.org/10.70675/ee5cd02dzba96z488dzb520z3546b3c215e1openalex-snapshot
Exceptional model mining meets multi-objective optimization : Application to plant growth recipes in controlled environments
inferred← citeshttps://doi.org/10.70675/f7c24167ze759z4fecz97f5z8aa641dfc7f6openalex-snapshot
Contribution à la fouille de données spatio-temporelles : application à l'étude de l'érosion
inferred← citeshttps://doi.org/10.70675/ff1177e0z96a3z42fdz928ez32ed0653d598openalex-snapshot
Explaining machine learning models on graphs by identifying hidden structures built by GNNs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.