Pages that link to "Item:Q3810684"
From MaRDI portal
The following pages link to On stochastic complexity and nonparametric density estimation (Q3810684):
Displayed 16 items.
- Bin width selection in multivariate histograms by the combinatorial method (Q882926) (← links)
- Data compression and histograms (Q1203347) (← links)
- Density estimation for time series by histograms (Q1330219) (← links)
- Regression spline smoothing using the minimum description length principle (Q1567321) (← links)
- Detecting and evaluating intrinsic nonlinearity present in the mutual dependence between two variables (Q1590011) (← links)
- On histograms for linear processes (Q1923431) (← links)
- Test for homogeneity of several populations by stochastic complexity (Q1923433) (← links)
- Data driven versions of neyman's test for uniformity based on bayesian rule (Q2720216) (← links)
- Predictability, Complexity, and Learning (Q2784814) (← links)
- How many bins should be put in a regular histogram (Q3373752) (← links)
- How Many Clusters? An Information-Theoretic Perspective (Q4664508) (← links)
- An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle (Q4831995) (← links)
- Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection (Q4831996) (← links)
- Data driven versions of pearson's chisquare test for uniformity (Q4869590) (← links)
- Fluctuation-Dissipation Theorem and Models of Learning (Q5706657) (← links)
- A comparison of automatic histogram constructions (Q5851017) (← links)