The following pages link to Marina Meilă (Q169561):
Displaying 19 items.
- (Q420919) (redirect page) (← links)
- Local equivalences of distances between clusterings -- a geometric perspective (Q420920) (← links)
- Experiments with Kemeny ranking: What works when? (Q449040) (← links)
- (Q587251) (redirect page) (← links)
- Recursive inversion models for permutations (Q2152564) (← links)
- Good (K-means) clusterings are unique (up to small perturbations) (Q2274925) (← links)
- Comparing clusterings -- an information based distance (Q2372133) (← links)
- Learning with mixtures of trees. (Q2782276) (← links)
- Megaman: scalable manifold learning in Python (Q2834476) (← links)
- An exponential model for infinite rankings (Q2896195) (← links)
- On the gravitational inverse problem (Q2908226) (← links)
- (Q4576262) (← links)
- (Q4576268) (← links)
- (Q4576291) (← links)
- How the initialization affects the stability of the қ-means algorithm (Q4921839) (← links)
- Learning Theory and Kernel Machines (Q5305850) (← links)
- An experimental comparison of model-based clustering methods (Q5928968) (← links)
- Refinement: Measuring informativeness of ratings in the absence of a gold standard (Q6127020) (← links)
- Double diffusion maps and their latent harmonics for scientific computations in latent space (Q6158080) (← links)
