The following pages link to UCI-ml (Q16261):
Displaying 50 items.
- Wasserstein-based fairness interpretability framework for machine learning models (Q2102385) (← links)
- Explainable online ensemble of deep neural network pruning for time series forecasting (Q2102399) (← links)
- Large-scale pinball twin support vector machines (Q2102403) (← links)
- A hybrid quantum-classical generative adversarial networks algorithm based on inherited layerwise learning with circle-connectivity circuit (Q2102798) (← links)
- Constrained Naïve Bayes with application to unbalanced data classification (Q2103945) (← links)
- Model-free global likelihood subsampling for massive data (Q2104012) (← links)
- Generalization bounds for sparse random feature expansions (Q2105118) (← links)
- A stochastic first-order trust-region method with inexact restoration for finite-sum minimization (Q2111466) (← links)
- An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems (Q2112678) (← links)
- Optimization hierarchy for fair statistical decision problems (Q2112802) (← links)
- Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method (Q2114817) (← links)
- Data clustering based on the modified relaxation Cheeger cut model (Q2115038) (← links)
- Applications of rough sets in big data analysis: an overview (Q2115921) (← links)
- A weighted wrapper approach to feature selection (Q2115924) (← links)
- Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis (Q2117120) (← links)
- Approximate computation of exact association rules (Q2117123) (← links)
- An incremental recomputation of from-below Boolean matrix factorization (Q2117125) (← links)
- Clustering and identification of core implications (Q2117127) (← links)
- Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- A matrix-free trust-region Newton algorithm for convex-constrained optimization (Q2119752) (← links)
- Distributed adaptive Newton methods with global superlinear convergence (Q2123229) (← links)
- A guided FP-growth algorithm for mining multitude-targeted item-sets and class association rules in imbalanced data (Q2123567) (← links)
- Graph, clique and facet of Boolean logical polytope (Q2124813) (← links)
- An adaptive trust-region method without function evaluations (Q2125064) (← links)
- MBSVR: multiple birth support vector regression (Q2126271) (← links)
- Parallel multipopulation optimization for belief rule base learning (Q2127064) (← links)
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint (Q2127074) (← links)
- CTSVM: a robust twin support vector machine with correntropy-induced loss function for binary classification problems (Q2127104) (← links)
- Multiway \(p\)-spectral graph cuts on Grassmann manifolds (Q2127266) (← links)
- A unified formulation of entropy and its application (Q2128745) (← links)
- FCM-DNN: diagnosing coronary artery disease by deep accuracy fuzzy C-means clustering model (Q2130428) (← links)
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
- Tensor decomposition for learning Gaussian mixtures from moments (Q2133926) (← links)
- Efficient binary embedding of categorical data using BinSketch (Q2134033) (← links)
- An eager splitting strategy for online decision trees in ensembles (Q2134037) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Robust regression via error tolerance (Q2134056) (← links)
- Bayesian sparse convex clustering via global-local shrinkage priors (Q2135928) (← links)
- Weighted approximate Bayesian computation via Sanov's theorem (Q2135932) (← links)
- Intuitionistic fuzzy Laplacian twin support vector machine for semi-supervised classification (Q2136510) (← links)
- Convergence rates of deep ReLU networks for multiclass classification (Q2137813) (← links)
- Stochastic approximation method using diagonal positive-definite matrices for convex optimization with fixed point constraints (Q2138441) (← links)
- Optimal energy consuming planning for a home-based microgrid with mobility constraint of electric vehicles and tractors (Q2138936) (← links)
- Robust optimization and data classification for characterization of Huntington disease onset via duality methods (Q2139276) (← links)
- Efficiently mining large gradual patterns using chunked storage layout (Q2140445) (← links)
- Quadratic discriminant analysis by projection (Q2140867) (← links)
- Global optimal solutions for proximal fuzzy contractions (Q2141101) (← links)
- Fractional Tikhonov regularization to improve the performance of extreme learning machines (Q2141124) (← links)
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms (Q2141355) (← links)
