On the public citation graph
A Unifying Framework for Mining Approximate Top- $k$ Binary Patterns
0 signed · 85 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/978-3-540-30116-5_18openalex-snapshot
Geometric and Combinatorial Tiles in 0–1 Data
inferredcites →https://doi.org/10.1007/978-3-540-39804-2_38openalex-snapshot
A Simple Algorithm for Topic Identification in 0–1 Data
inferredcites →https://doi.org/10.1007/978-3-642-23808-6_26openalex-snapshot
Comparing Apples and Oranges
inferredcites →https://doi.org/10.1007/s10618-009-0145-2openalex-snapshot
Binary matrix factorization for analyzing gene expression data
inferredcites →https://doi.org/10.1007/s10618-010-0202-xopenalex-snapshot
Krimp: mining itemsets that compress
inferredcites →https://doi.org/10.1007/s10618-010-0203-9openalex-snapshot
Summarizing transactional databases with overlapped hyperrectangles
inferredcites →https://doi.org/10.1016/0005-1098(78)90005-5openalex-snapshot
Modeling by shortest data description
inferredcites →https://doi.org/10.1109/icdm.2004.10086openalex-snapshot
Dependencies between Transcription Factor Binding Sites: Comparison between ICA, NMF, PLSA and Frequent Sets
inferredcites →https://doi.org/10.1109/icdm.2006.10openalex-snapshot
AC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery
inferredcites →https://doi.org/10.1109/icdm.2012.118openalex-snapshot
Dynamic Boolean Matrix Factorizations
inferredcites →https://doi.org/10.1109/tkde.2005.60openalex-snapshot
Efficient algorithms for mining closed itemsets and their lattice structure
inferredcites →https://doi.org/10.1137/1.9781611972801.15openalex-snapshot
Mining Top-K Patterns from Binary Datasets in presence of Noise
inferredcites →https://doi.org/10.1145/1081870.1081894openalex-snapshot
A general model for clustering binary data
inferredcites →https://doi.org/10.1145/1401890.1401922openalex-snapshot
Direct mining of discriminative and essential frequent patterns via model-based search tree
inferredcites →https://doi.org/10.1145/1401890.1401930openalex-snapshot
Quantitative evaluation of approximate frequent pattern mining algorithms
inferredcites →https://doi.org/10.1145/1401890.1401981openalex-snapshot
Succinct summarization of transactional databases
inferredcites →https://doi.org/10.1145/1557019.1557065openalex-snapshot
Tell me something I don't know
inferredcites →https://doi.org/10.1145/1774088.1774320openalex-snapshot
A generative pattern model for mining binary datasets
inferredcites →https://doi.org/10.1145/2020408.2020424openalex-snapshot
Model order selection for boolean matrix factorization
inferredcites →https://doi.org/10.1145/312624.312649openalex-snapshot
Probabilistic latent semantic indexing
inferredcites →https://doi.org/10.1145/502512.502539openalex-snapshot
Efficient discovery of error-tolerant frequent itemsets in high dimensions
inferredcites →https://doi.org/10.4135/9781412973380.n22openalex-snapshot
An Introduction to Data Mining
inferredcites →https://doi.org/10.48550/arxiv.2006.09467openalex-snapshot
Tell Me Something I Don't Know: Randomization Strategies for Iterative Data Mining
inferredcites →https://doi.org/10.7551/mitpress/1120.003.0082openalex-snapshot
Latent Dirichlet Allocation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4471-5571-3_12openalex-snapshot
Principal Component Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4471-7452-3_13openalex-snapshot
Principal Component Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-00202-2_14openalex-snapshot
Basic Level Concepts as a Means to Better Interpretability of Boolean Matrix Factors and Their Application to Clustering
inferred← citeshttps://doi.org/10.1007/978-3-030-21462-3_14openalex-snapshot
Parallelization of the GreConD Algorithm for Boolean Matrix Factorization
inferred← citeshttps://doi.org/10.1007/978-3-030-21462-3_24openalex-snapshot
A Study of Boolean Matrix Factorization Under Supervised Settings
inferred← citeshttps://doi.org/10.1007/978-3-030-74251-5_29openalex-snapshot
Reducing Negative Impact of Noise in Boolean Matrix Factorization with Association Rules
inferred← citeshttps://doi.org/10.1007/978-3-030-77867-5_8openalex-snapshot
An Incremental Recomputation of From-Below Boolean Matrix Factorization
inferred← citeshttps://doi.org/10.1007/978-3-030-91702-9_25openalex-snapshot
A Co-occurrence Based Approach for Mining Overlapped Co-clusters in Binary Data
inferred← citeshttps://doi.org/10.1007/978-3-319-22729-0_7openalex-snapshot
Supervised Evaluation of Top-k Itemset Mining Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-23525-7_3openalex-snapshot
Generalized Matrix Factorizations as a Unifying Framework for Pattern Set Mining: Complexity Beyond Blocks
inferred← citeshttps://doi.org/10.1007/978-3-319-43862-7_4openalex-snapshot
RDF Graph Summarization Based on Approximate Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-43946-4_8openalex-snapshot
Evaluating Top-K Approximate Patterns via Text Clustering
inferred← citeshttps://doi.org/10.1007/s00778-018-0528-3openalex-snapshot
Summarizing semantic graphs: a survey
inferred← citeshttps://doi.org/10.1007/s00778-021-00717-xopenalex-snapshot
A survey on semantic schema discovery
inferred← citeshttps://doi.org/10.1007/s10618-017-0508-zopenalex-snapshot
The PRIMPING routine—Tiling through proximal alternating linearized minimization
inferred← citeshttps://doi.org/10.1007/s10618-018-0599-1openalex-snapshot
Algorithms for approximate subtropical matrix factorization
inferred← citeshttps://doi.org/10.1007/s10618-022-00846-zopenalex-snapshot
The minimum description length principle for pattern mining: a survey
inferred← citeshttps://doi.org/10.1007/s11634-019-00383-6openalex-snapshot
From-below Boolean matrix factorization algorithm based on MDL
inferred← citeshttps://doi.org/10.1007/s13042-024-02226-zopenalex-snapshot
Revisiting data reduction for boolean matrix factorization algorithms based on formal concept analysis
inferred← citeshttps://doi.org/10.1016/j.dam.2017.12.044openalex-snapshot
A new algorithm for Boolean matrix factorization which admits overcovering
inferred← citeshttps://doi.org/10.1016/j.ijar.2018.03.006openalex-snapshot
Handling noise in Boolean matrix factorization
inferred← citeshttps://doi.org/10.1016/j.ijar.2026.109668openalex-snapshot
Boolean matrix factorization in the framework of formal concept analysis with the help of biclustering
inferred← citeshttps://doi.org/10.1016/j.ijar.2026.109747openalex-snapshot
Effective greedy Boolean matrix factorization via the Rice-Siff algorithm
inferred← citeshttps://doi.org/10.1016/j.ins.2018.05.016openalex-snapshot
Toward quality assessment of Boolean matrix factorizations
inferred← citeshttps://doi.org/10.1016/j.is.2020.101551openalex-snapshot
SchemaDecrypt++: Parallel on-line Versioned Schema Inference for Large Semantic Web Data sources
inferred← citeshttps://doi.org/10.1016/j.knosys.2018.05.035openalex-snapshot
Data reduction for Boolean matrix factorization algorithms based on formal concept analysis
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.108261openalex-snapshot
Boolean matrix factorization with background knowledge
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.108895openalex-snapshot
Revisiting the GreCon algorithm for Boolean matrix factorization
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.110944openalex-snapshot
Boolean matrix factorization for symmetric binary variables
inferred← citeshttps://doi.org/10.1016/j.matpr.2021.04.104openalex-snapshot
Attributes relation pattern construction using relation weightage prediction for information neural classification
inferred← citeshttps://doi.org/10.1016/j.neunet.2022.06.006openalex-snapshot
Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines
inferred← citeshttps://doi.org/10.1109/ccem48484.2019.00015openalex-snapshot
Compressing Closed Frequent Itemsets with Controlled Information Loss
inferred← citeshttps://doi.org/10.1109/icdm.2016.0139openalex-snapshot
Factorizing Complex Discrete Data “with Finesse”
inferred← citeshttps://doi.org/10.1109/icdm.2018.00039openalex-snapshot
Summarizing Network Processes with Network-Constrained Boolean Matrix Factorization
inferred← citeshttps://doi.org/10.1109/icdm54844.2022.00123openalex-snapshot
Boolean Matrix Factorization for Data with Symmetric Variables
inferred← citeshttps://doi.org/10.1109/ijcnn.2016.7727771openalex-snapshot
Summarizing uncertain transaction databases by Probabilistic Tiles
inferred← citeshttps://doi.org/10.1109/mdm55031.2022.00048openalex-snapshot
SS-OCoClus: A contiguous order-aware method for semantic trajectory co-clustering
inferred← citeshttps://doi.org/10.1109/mis.2015.1openalex-snapshot
Does Summarization Help Stock Prediction? A News Impact Analysis
inferred← citeshttps://doi.org/10.1109/tkde.2021.3095309openalex-snapshot
BANDAR: Benchmarking Snippet Generation Algorithms for (RDF) Dataset Search
inferred← citeshttps://doi.org/10.1109/tnnls.2015.2412686openalex-snapshot
Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain
inferred← citeshttps://doi.org/10.1109/tsp.2023.3238281openalex-snapshot
The Discriminative Discrete Basis Problem: Definitions, Algorithms, Benchmarking, and Application to Brain's Functional Dynamics
inferred← citeshttps://doi.org/10.1137/1.9781611974010.37openalex-snapshot
Getting to Know the Unknown Unknowns: Destructive-Noise Resistant Boolean Matrix Factorization
inferred← citeshttps://doi.org/10.1145/3428078openalex-snapshot
The 8M Algorithm from Today’s Perspective
inferred← citeshttps://doi.org/10.1145/3626726openalex-snapshot
Efficient Approximation Framework for Attribute Recommendation
inferred← citeshttps://doi.org/10.1186/s12864-017-4132-5openalex-snapshot
Semantic biclustering for finding local, interpretable and predictive expression patterns
inferred← citeshttps://doi.org/10.14778/3401960.3401968openalex-snapshot
Biclustering and boolean matrix factorization in data streams
inferred← citeshttps://doi.org/10.3844/jcssp.2022.382.395openalex-snapshot
A Novel Approach for Discovering the Patterns by using PDBD Model in Big Data
inferred← citeshttps://doi.org/10.48550/arxiv.2007.15821openalex-snapshot
Geometric All-Way Boolean Tensor Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.2012.03127openalex-snapshot
Recent Developments in Boolean Matrix Factorization
inferred← citeshttps://doi.org/10.48550/arxiv.2012.03138openalex-snapshot
Biclustering and Boolean Matrix Factorization in Data Streams
inferred← citeshttps://doi.org/10.48550/arxiv.2110.14110openalex-snapshot
Mining frequency-based sequential trajectory co-clusters
inferred← citeshttps://doi.org/10.70675/04773307z1b1cz4b40z8052zf54a83f57997openalex-snapshot
Querying semantic web/linked data graphs using summarization
inferred← citeshttps://doi.org/10.70675/19e3be83zb7aez4284zb761z2023c792fb23openalex-snapshot
Keyword Search and Summarization Approaches for RDF Dataset Exploration
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.