Pages that link to "Item:Q2930341"
From MaRDI portal
The following pages link to Clustering for metric and nonmetric distance measures (Q2930341):
Displaying 31 items.
- Basic statistics for distributional symbolic variables: a new metric-based approach (Q95585) (← links)
- Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q477594) (← links)
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
- A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection (Q497691) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- Clustering reduced interval data using Hausdorff distance (Q880910) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- Some computational issues in cluster analysis with no a priori metric (Q1960467) (← links)
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139) (← links)
- An improved Bregman \(k\)-means++ algorithm via local search (Q2019501) (← links)
- Improved local search algorithms for Bregman \(k\)-means and its variants (Q2084627) (← links)
- Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem (Q2132392) (← links)
- Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
- A unified framework for clustering constrained data without locality property (Q2300724) (← links)
- Clustering with or without the approximation (Q2377383) (← links)
- Concentration of kernel matrices with application to kernel spectral clustering (Q2656607) (← links)
- Mathematical Programming Formulations and Algorithms for Discrete <i>k</i>-Median Clustering of Time-Series Data (Q2967621) (← links)
- (Q3005537) (← links)
- (Q3365927) (← links)
- A new nonparametric interpoint distance-based measure for assessment of clustering (Q3390607) (← links)
- (Q3498171) (← links)
- (Q4804944) (← links)
- A Pitman measure of similarity in <i><i>k</i></i>-means for clustering heavy-tailed data (Q5085951) (← links)
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
- SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search (Q5746249) (← links)
- SEND: a novel dissimilarity metric using ensemble properties of the feature space for clustering numerical data (Q6065963) (← links)
- A family of pairwise multi-marginal optimal transports that define a generalized metric (Q6097155) (← links)
- Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces (Q6103169) (← links)
- On the strong consistency of feature-weighted \(k\)-means clustering in a nearmetric space (Q6541502) (← links)