On the public citation graph
The Discrete Basis Problem
0 signed · 86 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.1002/env.3170050203openalex-snapshot
Positive matrix factorization: A non‐negative factor model with optimal utilization of error estimates of data values
inferredcites →https://doi.org/10.1006/jagm.1998.0964openalex-snapshot
Approximating Clique and Biclique Problems
inferredcites →https://doi.org/10.1007/11733492_4openalex-snapshot
Constraint-Based Mining of Fault-Tolerant Patterns from Boolean Data
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-36755-1_3openalex-snapshot
Variational Extensions to EM and Multinomial PCA
inferredcites →https://doi.org/10.1007/3-540-45650-3_28openalex-snapshot
Effcient Local Search in Conceptual Clustering
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_3openalex-snapshot
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional 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-540-45167-9_33openalex-snapshot
On Finding Large Conjunctive Clusters
inferredcites →https://doi.org/10.1007/s10044-007-0096-4openalex-snapshot
The aspect Bernoulli model: multiple causes of presences and absences
inferredcites →https://doi.org/10.1016/0024-3795(93)90224-copenalex-snapshot
Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
inferredcites →https://doi.org/10.1016/b978-1-55860-377-6.50048-7openalex-snapshot
NewsWeeder: Learning to Filter Netnews
inferredcites →https://doi.org/10.1016/j.csda.2006.11.006openalex-snapshot
Algorithms and applications for approximate nonnegative matrix factorization
inferredcites →https://doi.org/10.1016/s0166-218x(03)00333-0openalex-snapshot
The maximum edge biclique problem is NP-complete
inferredcites →https://doi.org/10.1016/s0898-1221(00)90183-4openalex-snapshot
Complexity and approximation: Combinatorial optimization problems and their approximability properties
inferredcites →https://doi.org/10.1016/s0925-2312(97)90018-7openalex-snapshot
Advances in neural information processing systems 7
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1023/b:mach.0000033117.77257.41openalex-snapshot
A New Conceptual Clustering Framework
inferredcites →https://doi.org/10.1038/44565openalex-snapshot
Learning the parts of objects by non-negative matrix factorization
inferredcites →https://doi.org/10.1080/01621459.1972.10481214openalex-snapshot
Direct Clustering of a Data Matrix
inferredcites →https://doi.org/10.1109/icde.2008.4497438openalex-snapshot
Optimal Boolean Matrix Decomposition: Application to Role Engineering
inferredcites →https://doi.org/10.1109/sffcs.1999.814571openalex-snapshot
Primal-dual approximation algorithms for metric facility location and k-median problems
inferredcites →https://doi.org/10.1109/sffcs.1999.814609openalex-snapshot
Improved combinatorial algorithms for the facility location and k-median problems
inferredcites →https://doi.org/10.1109/tcbb.2004.2openalex-snapshot
Biclustering algorithms for biological data analysis: a survey
inferredcites →https://doi.org/10.1109/tcom.1983.1095823openalex-snapshot
Digital Image Compression by Outer Product Expansion
inferredcites →https://doi.org/10.1109/tkde.2005.55openalex-snapshot
Compression, clustering, and pattern discovery in very high-dimensional discrete-attribute data sets
inferredcites →https://doi.org/10.1137/0137041openalex-snapshot
An Algorithmic Approach to Network Location Problems. II: The p -Medians
inferredcites →https://doi.org/10.1137/0210040openalex-snapshot
Worst-Case and Probabilistic Analysis of a Geometric Location Problem
inferredcites →https://doi.org/10.1137/0213014openalex-snapshot
On the Complexity of Some Common Geometric Location Problems
inferredcites →https://doi.org/10.1137/0403025openalex-snapshot
On Approximate Solutions for Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1137/07070471xopenalex-snapshot
Relative-Error $CUR$ Matrix Decompositions
inferredcites →https://doi.org/10.1137/1.9781611972740.47openalex-snapshot
Learning to Read Between the Lines: The Aspect Bernoulli Model
inferredcites →https://doi.org/10.1137/s0097539702416402openalex-snapshot
Local Search Heuristics for k -Median and Facility Location Problems
inferredcites →https://doi.org/10.1137/s0097539704442702openalex-snapshot
Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
inferredcites →https://doi.org/10.1145/1014052.1014111openalex-snapshot
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
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/291128.291131openalex-snapshot
A semidiscrete matrix decomposition for latent semantic indexing information retrieval
inferredcites →https://doi.org/10.1145/312624.312649openalex-snapshot
Probabilistic latent semantic indexing
inferredcites →https://doi.org/10.1145/3130348.3130370openalex-snapshot
Probabilistic Latent Semantic Indexing
inferredcites →https://doi.org/10.1162/089976699300016728openalex-snapshot
Mixtures of Probabilistic Principal Component Analyzers
inferredcites →https://doi.org/10.1162/jmlr.2003.3.4-5.993openalex-snapshot
10.1162/jmlr.2003.3.4-5.993
inferredcites →https://doi.org/10.5555/1036843.1036851openalex-snapshot
Applying discrete PCA in data analysis
inferredcites →https://doi.org/10.7551/mitpress/1120.001.0001openalex-snapshot
Advances in Neural Information Processing Systems 14
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-3-030-04834-1_2openalex-snapshot
Policy Engineering in RBAC and ABAC
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_3openalex-snapshot
Critical Rows of Almost-Factorable Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-01815-2_8openalex-snapshot
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-03915-7_29openalex-snapshot
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-15387-7_51openalex-snapshot
Factorizing Three-Way Binary Data with Triadic Formal Concepts
inferred← citeshttps://doi.org/10.1007/978-3-642-24764-4_35openalex-snapshot
Factorizing Three-Way Ordinal Data Using Triadic Formal Concepts
inferred← citeshttps://doi.org/10.1007/978-3-642-35632-2_9openalex-snapshot
Sparse Coding for Specification Mining and Error Localization
inferred← citeshttps://doi.org/10.1007/s10472-010-9185-yopenalex-snapshot
Optimal decompositions of matrices with grades into binary and graded matrices
inferred← citeshttps://doi.org/10.1016/j.ijar.2009.05.006openalex-snapshot
Optimal triangular decompositions of matrices with entries from residuated lattices
inferred← citeshttps://doi.org/10.1016/j.ijar.2024.109247openalex-snapshot
Semantic explorations in factorizing Boolean data via formal concepts
inferred← citeshttps://doi.org/10.1016/j.ins.2011.09.023openalex-snapshot
Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
inferred← citeshttps://doi.org/10.1093/logcom/exr023openalex-snapshot
Optimal decompositions of matrices with entries from residuated lattices
inferred← citeshttps://doi.org/10.1109/besc.2014.7059511openalex-snapshot
Maximum likelihood estimation based DINA model and Q-matrix learning
inferred← citeshttps://doi.org/10.1109/grc.2010.181openalex-snapshot
Optimal Factorization of Three-Way Binary Data
inferred← citeshttps://doi.org/10.1109/icde.2008.4497438openalex-snapshot
Optimal Boolean Matrix Decomposition: Application to Role Engineering
inferred← citeshttps://doi.org/10.1109/icdm.2006.167openalex-snapshot
What is the Dimension of Your Binary Data?
inferred← citeshttps://doi.org/10.1109/icdm.2007.99openalex-snapshot
Binary Matrix Factorization with Applications
inferred← citeshttps://doi.org/10.1109/icdm.2011.154openalex-snapshot
Using Frequent Closed Itemsets for Data Dimensionality Reduction
inferred← citeshttps://doi.org/10.1109/icdmw.2013.154openalex-snapshot
Pattern Discovery in High Dimensional Binary Data
inferred← citeshttps://doi.org/10.1109/icdmw.2013.46openalex-snapshot
Mining Discrete Patterns via Binary Matrix Factorization
inferred← citeshttps://doi.org/10.1109/jstsp.2018.2875674openalex-snapshot
Binary Matrix Factorization via Dictionary Learning
inferred← citeshttps://doi.org/10.1109/padsw.2018.8644574openalex-snapshot
cuBool: Bit-Parallel Boolean Matrix Factorization on CUDA-Enabled Accelerators
inferred← citeshttps://doi.org/10.1145/1455770.1455809openalex-snapshot
A class of probabilistic models for role engineering
inferred← citeshttps://doi.org/10.1145/1553374.1553498openalex-snapshot
Multi-assignment clustering for Boolean data
inferred← citeshttps://doi.org/10.1145/2445566.2445567openalex-snapshot
Role Mining with Probabilistic Models
inferred← citeshttps://doi.org/10.1287/moor.2023.1386openalex-snapshot
Binary Matrix Factorization and Completion via Integer Programming
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16500openalex-snapshot
Binary Matrix Factorisation via Column Generation
inferred← citeshttps://doi.org/10.22028/d291-26602openalex-snapshot
Topics in learning sparse and low-rank models of non-negative data
inferred← citeshttps://doi.org/10.24963/ijcai.2017/198openalex-snapshot
Handling Noise in Boolean Matrix Factorization
inferred← citeshttps://doi.org/10.24963/ijcai.2020/685openalex-snapshot
Recent Developments in Boolean Matrix Factorization
inferred← citeshttps://doi.org/10.25046/aj070207openalex-snapshot
On the Construction of Symmetries and Retaining Lifted Representations in Dynamic Probabilistic Relational Models
inferred← citeshttps://doi.org/10.3233/jcs-2009-0341openalex-snapshot
Edge-RMP: Minimizing administrative assignments for role-based access control
inferred← citeshttps://doi.org/10.48550/arxiv.1401.6024openalex-snapshot
Matrix factorization with Binary Components
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.