Pages that link to "Item:Q1856632"
From MaRDI portal
The following pages link to Characterizing the scale dimension of a high-dimensional classification problem (Q1856632):
Displaying 19 items.
- Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family (Q82973) (← links)
- On two simple and effective procedures for high dimensional classification of general populations (Q284189) (← links)
- Comparison of relative density of two random geometric digraph families in testing spatial clustering (Q464444) (← links)
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data (Q715495) (← links)
- A general SLLN for the one-dimensional class cover problem (Q930087) (← links)
- Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays (Q951958) (← links)
- Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association (Q959283) (← links)
- Extension of one-dimensional proximity regions to higher dimensions (Q991185) (← links)
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data (Q998418) (← links)
- A CLT for a one-dimensional class cover problem (Q1003427) (← links)
- A new inductive approach for counting dimension in large scale (Q1742508) (← links)
- An investigation of new graph invariants related to the domination number of random proximity catch digraphs (Q2276421) (← links)
- A new family of proximity graphs: class cover catch digraphs (Q2506361) (← links)
- The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association (Q2573988) (← links)
- Scale adjustments for classifiers in high-dimensional, low sample size settings (Q3633167) (← links)
- (Q3730839) (← links)
- Noise accumulation in high dimensional classification and total signal index (Q4969076) (← links)
- Law of large numbers for a two-dimensional class cover problem (Q5030235) (← links)
- A new family of random graphs for testing spatial segregation (Q5421209) (← links)