Pages that link to "Item:Q1711231"
From MaRDI portal
The following pages link to Survey on distance metric learning and dimensionality reduction in data mining (Q1711231):
Displaying 15 items.
- Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD) (Q493732) (← links)
- Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms (Q669282) (← links)
- Generalized iterative RELIEF for supervised distance metric learning (Q975216) (← links)
- Distance metric learning by knowledge embedding (Q1886634) (← links)
- A novel text clustering approach using deep-learning vocabulary network (Q1993206) (← links)
- Evaluating prior predictions of production and seismic data (Q2009872) (← links)
- Unsupervised representation learning with minimax distance measures (Q2217399) (← links)
- A new class of metrics for learning on real-valued and structured data (Q2218351) (← links)
- A comparative study of data-dependent approaches without learning in measuring similarities of data objects (Q2218403) (← links)
- Supervised distance metric learning through maximization of the Jeffrey divergence (Q2290334) (← links)
- PCA-KL: a parametric dimensionality reduction approach for unsupervised metric learning (Q2673341) (← links)
- Metric learning: a survey (Q2872494) (← links)
- (Q5214268) (← links)
- (Q5309494) (← links)
- A multi-birth metric learning framework based on binary constraints (Q6052417) (← links)
