On the public citation graph
Constraint-Based Mining of Fault-Tolerant Patterns from Boolean Data
0 signed · 49 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/11552253_27openalex-snapshot
From Local Pattern Mining to Relevant Bi-cluster Characterization
inferredcites →https://doi.org/10.1007/11564126_68openalex-snapshot
A Bi-clustering Framework for Categorical Data
inferredcites →https://doi.org/10.1007/11564126_8openalex-snapshot
Interestingness is Not a Dichotomy: Introducing Softness in Constrained Pattern Mining
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/978-3-540-30116-5_18openalex-snapshot
Geometric and Combinatorial Tiles in 0–1 Data
inferredcites →https://doi.org/10.1007/978-3-540-31841-5_2openalex-snapshot
Constraint Relaxations for Discovering Unknown Sequential Patterns
inferredcites →https://doi.org/10.1007/978-3-540-31841-5_3openalex-snapshot
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
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-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/s0169-023x(02)00057-5openalex-snapshot
Computing iceberg concept lattices with Titanic
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.1023/a:1024076020895openalex-snapshot
DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints
inferredcites →https://doi.org/10.1080/09528130210164170openalex-snapshot
Comparing performance of algorithms for generating concept lattices
inferredcites →https://doi.org/10.1145/240455.240472openalex-snapshot
A database perspective on knowledge discovery
inferredcites →https://doi.org/10.1145/502512.502539openalex-snapshot
Efficient discovery of error-tolerant frequent itemsets in high dimensions
inferredcites →https://doi.org/10.1145/772862.772871openalex-snapshot
A perspective on inductive databases
inferredcites →https://doi.org/10.1145/956750.956764openalex-snapshot
Information-theoretic co-clustering
inferredcites →https://doi.org/10.3109/14639239008997663openalex-snapshot
Variables processing in expert system building: Application to the aetiological diagnosis of infantile meningitis
inferredcites →https://doi.org/10.3233/ida-2005-9105openalex-snapshot
Constraint-based concept mining and its application to microarray data analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11733492_12openalex-snapshot
Exploiting Virtual Patterns for Automatically Pruning the Search Space
inferred← citeshttps://doi.org/10.1007/978-3-030-93278-7_1openalex-snapshot
Formal Concept Analysis and Extensions for Complex Data Analytics
inferred← citeshttps://doi.org/10.1007/978-3-030-93278-7_11openalex-snapshot
Triclustering in Big Data Setting
inferred← citeshttps://doi.org/10.1007/978-3-319-05810-8_23openalex-snapshot
On Mining Proportional Fault-Tolerant Frequent Itemsets
inferred← citeshttps://doi.org/10.1007/978-3-540-75549-4_2openalex-snapshot
Mining Bi-sets in Numerical Data
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-642-01307-2_102openalex-snapshot
Application-Independent Feature Construction from Noisy Samples
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-017-1079-4openalex-snapshot
On mining approximate and exact fault-tolerant frequent itemsets
inferred← citeshttps://doi.org/10.1007/s10618-016-0480-zopenalex-snapshot
Survey on using constraints in data mining
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.035openalex-snapshot
On the size of ∃ -generalized concept lattices
inferred← citeshttps://doi.org/10.1016/j.eswa.2013.05.009openalex-snapshot
Formal concept analysis in knowledge processing: A survey on applications
inferred← citeshttps://doi.org/10.1016/j.eswa.2018.02.007openalex-snapshot
Fault-tolerant tile mining
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.113046openalex-snapshot
An efficient pattern growth approach for mining fault tolerant frequent itemsets
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.06.002openalex-snapshot
From-below approximations in Boolean matrix factorization: Geometry and new algorithm
inferred← citeshttps://doi.org/10.1109/bwcca.2015.29openalex-snapshot
Mining Approximate Frequent Patterns from Noisy Databases
inferred← citeshttps://doi.org/10.1109/icdm.2007.48openalex-snapshot
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
inferred← citeshttps://doi.org/10.1109/icdmw.2012.83openalex-snapshot
Mining Local Staircase Patterns in Noisy Data
inferred← citeshttps://doi.org/10.1109/ictai.2011.14openalex-snapshot
Itemset Mining in Noisy Contexts: A Hybrid Approach
inferred← citeshttps://doi.org/10.1145/1557019.1557097openalex-snapshot
Towards efficient mining of proportional fault-tolerant frequent itemsets
inferred← citeshttps://doi.org/10.17706/jcp.10.6.388-395openalex-snapshot
A Depth-First Search Approach for Mining Proportional Fault-Tolerant Frequent Patterns Efficiently in Large Database
inferred← citeshttps://doi.org/10.24451/arbor.6325openalex-snapshot
A similarity measure to generalize attributes
inferred← citeshttps://doi.org/10.3233/isi-2007-00321openalex-snapshot
Clustering Formal Concepts to Discover Biologically Relevant Knowledge from Gene Expression Data
inferred← citeshttps://doi.org/10.70675/e4ca6537z5926z484fz9de9z8ae5b1e1f63aopenalex-snapshot
Development of new computational methods for a synthetic gene set annotation
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.