On the public citation graph
Learning mixtures of product distributions over discrete domains
0 signed · 57 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-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-3-540-30576-7_20openalex-snapshot
Toward Privacy in Public Databases
inferredcites →https://doi.org/10.1007/978-3-540-45167-9_54openalex-snapshot
Learning a Function of r Relevant Variables
inferredcites →https://doi.org/10.1016/0020-0190(92)90237-popenalex-snapshot
Rank-r decision trees are a subclass of r-decision lists
inferredcites →https://doi.org/10.1016/0890-5401(89)90001-1openalex-snapshot
Learning decision trees from random examples
inferredcites →https://doi.org/10.1016/s0024-3795(96)00301-1openalex-snapshot
A theory of pseudoskeleton approximations
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1109/sfcs.2002.1181888openalex-snapshot
A spectral algorithm for learning mixtures of distributions
inferredcites →https://doi.org/10.1109/sffcs.1999.814639openalex-snapshot
Learning mixtures of Gaussians
inferredcites →https://doi.org/10.1137/060670705openalex-snapshot
Learning Mixtures of Product Distributions over Discrete Domains
inferredcites →https://doi.org/10.1137/1026034openalex-snapshot
Mixture Densities, Maximum Likelihood and the EM Algorithm
inferredcites →https://doi.org/10.1137/s0097539798342496openalex-snapshot
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
inferredcites →https://doi.org/10.1145/1007352.1007378openalex-snapshot
Multilinear formulas and skepticism of quantum computing
inferredcites →https://doi.org/10.1145/1060590.1060645openalex-snapshot
Learning nonsingular phylogenies and hidden Markov models
inferredcites →https://doi.org/10.1145/195058.195147openalex-snapshot
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
inferredcites →https://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferredcites →https://doi.org/10.1145/293347.293351openalex-snapshot
Efficient noise-tolerant learning from statistical queries
inferredcites →https://doi.org/10.1145/307400.307412openalex-snapshot
Estimating a mixture of two product distributions
inferredcites →https://doi.org/10.1145/380752.380808openalex-snapshot
Learning mixtures of arbitrary gaussians
inferredcites →https://doi.org/10.2307/2289504openalex-snapshot
Statistical Analysis of Finite Mixture Distributions.
inferredcites →https://doi.org/10.2307/2531224openalex-snapshot
Statistical Analysis of Finite Mixture Distributions.
inferredcites →https://doi.org/10.48550/arxiv.1301.3850openalex-snapshot
A Two-round Variant of EM for Gaussian Mixtures
inferredcites →https://doi.org/10.48550/arxiv.cs/0609093openalex-snapshot
PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption
inferredcites →https://doi.org/10.82444/warw.33642094openalex-snapshot
Learning and approximation algorithms for problems motivated by evolutionary trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11776420_5openalex-snapshot
PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_39openalex-snapshot
Separating Populations with Wide Data: A Spectral Analysis
inferred← citeshttps://doi.org/10.1007/s10994-010-5179-6openalex-snapshot
Polynomial regression under arbitrary product distributions
inferred← citeshttps://doi.org/10.1016/j.neucom.2007.12.023openalex-snapshot
Causal reasoning by evaluating the complexity of conditional densities with kernel methods
inferred← citeshttps://doi.org/10.1017/s0963548309990277openalex-snapshot
Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles
inferred← citeshttps://doi.org/10.1109/focs.2013.31openalex-snapshot
Learning Sums of Independent Integer Random Variables
inferred← citeshttps://doi.org/10.1109/focs.2016.85openalex-snapshot
Robust Estimators in High Dimensions without the Computational Intractability
inferred← citeshttps://doi.org/10.1109/focs.2018.00066openalex-snapshot
Efficiently Learning Mixtures of Mallows Models
inferred← citeshttps://doi.org/10.1109/tit.2024.3462937openalex-snapshot
Support Recovery in Mixture Models With Sparse Parameters
inferred← citeshttps://doi.org/10.1117/12.872660openalex-snapshot
A randomized framework for discovery of heterogeneous mixtures
inferred← citeshttps://doi.org/10.1137/1.9781611973105.100openalex-snapshot
Learning mixtures of structured distributions over discrete domains
inferred← citeshttps://doi.org/10.1137/1.9781611973730.122openalex-snapshot
Testing Poisson Binomial Distributions
inferred← citeshttps://doi.org/10.1137/1.9781611974782.83openalex-snapshot
Sample-Optimal Density Estimation in Nearly-Linear Time
inferred← citeshttps://doi.org/10.1145/1060590.1060645openalex-snapshot
Learning nonsingular phylogenies and hidden Markov models
inferred← citeshttps://doi.org/10.1145/1143844.1143878openalex-snapshot
Efficient learning of Naive Bayes classifiers under class-conditional classification noise
inferred← citeshttps://doi.org/10.1145/2591796.2591848openalex-snapshot
Efficient density estimation via piecewise polynomial approximation
inferred← citeshttps://doi.org/10.1145/3313276.3316375openalex-snapshot
Beyond the low-degree algorithm: mixtures of subcubes and their applications
inferred← citeshttps://doi.org/10.1145/3357713.3384337openalex-snapshot
Efficiently learning structured distributions from untrusted batches
inferred← citeshttps://doi.org/10.1184/r1/6619763openalex-snapshot
Routing, Disjoint Paths, and Classification (CMU-PDL-06-109)
inferred← citeshttps://doi.org/10.1214/08-ejs289openalex-snapshot
Separating populations with wide data: A spectral analysis
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.28openalex-snapshot
Efficient Robust Proper Learning of Log-concave Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.0802.1244openalex-snapshot
Learning Balanced Mixtures of Discrete Distributions with Small Sample
inferred← citeshttps://doi.org/10.48550/arxiv.0804.3817openalex-snapshot
Multiple Random Oracles Are Better Than One
inferred← citeshttps://doi.org/10.48550/arxiv.1203.0683openalex-snapshot
A Method of Moments for Mixture Models and Hidden Markov Models
inferred← citeshttps://doi.org/10.48550/arxiv.1402.4746openalex-snapshot
Near-optimal-sample estimators for spherical Gaussian mixtures
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00662openalex-snapshot
Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables
inferred← citeshttps://doi.org/10.48550/arxiv.1506.02975openalex-snapshot
Stagewise Learning for Sparse Clustering of Discretely-Valued Data
inferred← citeshttps://doi.org/10.48550/arxiv.1511.04066openalex-snapshot
Properly Learning Poisson Binomial Distributions in Almost Polynomial Time
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0609093openalex-snapshot
PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption
inferred← citeshttps://doi.org/10.82444/warw.33485164openalex-snapshot
Pattern classification via unsupervised learners
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.