UCI

swMATH4074MaRDI QIDQ16261FDOQ16261

The UCI Machine Learning Repository is a collection of databases, domain theories, and data generators that are used by the machine learning community for the empirical analysis of machine learning algorithms.

D. E. Newman, Eamonn J. Keogh

Official website: https://archive.ics.uci.edu/

Description

The UCI Machine Learning Repository is a collection of databases, domain theories, and data generators that are used by the machine learning community for the empirical analysis of machine learning algorithms.

Cited In (only showing first 100 items - show all)

• Least angle regression. (With discussion)
• Induction of association rules: apriori implementation
• Model-based clustering of high-dimensional data: a review
• Deep Gaussian process autoencoders for novelty detection
• ASD+M: automatic parameter tuning in stochastic optimization and on-line learning
• \texttt{OpenML}: an \texttt{R} package to connect to the machine learning platform OpenML
• Oblique random survival forests
• Certifiably optimal sparse principal component analysis
• Prediction based on conditional distributions of vine copulas
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Nuclear discrepancy for single-shot batch active learning
• Sparse kernel deep stacking networks
• Shrinkage priors for Bayesian penalized regression
• TreeSOM: cluster analysis in the self-organizing map
• SIRUS: stable and interpretable RUle set for classification
• Interactive visualization in multiclass learning: integrating the SASSC algorithm with KLIMT
• On outliers detection and prior distribution sensitivity in standard skew-probit regression models
• Unsupervised feature selection with ensemble learning
• A new variable selection approach using random forests
• ASKIT: an efficient, parallel library for high-dimensional kernel summations
• A general framework for constrained Bayesian optimization using information-based search
• Bayesian network structure learning by recursive autonomy identification
• Quadratic boosting
• A new approach to Cholesky-based covariance regularization in high dimensions
• A new semi-supervised classifier based on maximum vector-angular margin
• Variable Selection for Clustering with Gaussian Mixture Models
• Rough Sets and Current Trends in Computing
• D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
• Title not available (Why is that?)
• Multivariate mixture modeling using skew-normal independent distributions
• Title not available (Why is that?)
• Fast nonparametric classification based on data depth
• A semiparametric method for clustering mixed data
• Modelling High-Dimensional Categorical Data using Nonconvex Fusion Penalties
• Gradient projection methods for quadratic programs and applications in training support vector machines
• AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subsemble: an ensemble method for combining subset-specific algorithm fits
• Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
• A feature group weighting method for subspace clustering of high-dimensional data
• Ensemble of optimal trees, random forest and random projection ensemble classification
• Clustering multivariate data using factor analytic Bayesian mixtures with an unknown number of components
• Overfitting Bayesian mixtures of factor analyzers with an unknown number of components
• Ensemble classification based on generalized additive models
• Fully robust one-sided cross-validation for regression functions
• An angle-based multivariate functional pseudo-depth for shape outlier detection
• Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inducer: a public domain workbench for data mining
• Robust archetypoids for anomaly detection in big functional data
• GPUSVM: a comprehensive CUDA based support vector machine package
• Concept Lattices
• Calibrating covariate informed product partition models
• LFOIL: linguistic rule induction in the label semantics framework
• SSVM: A smooth support vector machine for classification
• SpectralCAT: categorical spectral clustering of numerical and nominal data
• Improved classification for compositional data using the \(\alpha\)-transformation
• MSAFC: matrix subspace analysis with fuzzy clustering ability
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index
• Joint maximization of accuracy and information for learning the structure of a Bayesian network classifier
• DIVCLUS-T: a monothetic divisive hierarchical clustering method
• Clustering bivariate mixed-type data via the cluster-weighted model
• O-PCF algorithm for one-class classification
• Boosting algorithms: regularization, prediction and model fitting
• A fast dual algorithm for kernel logistic regression
• Learn\(^{++}\).MF: A random subspace approach for the missing feature problem
• Separation index and partial membership for clustering
• A stochastic approximation view of boosting
• The Bayesian additive classification tree applied to credit risk modelling
• Wrappers for feature subset selection
• Theoretical and empirical analysis of ReliefF and RReliefF
• A gradient descent algorithm for LASSO
• DESPOTA: an algorithm to detect the partition in the extended hierarchy of a dendrogram
• Equi-Clustream: a framework for clustering time evolving mixed data
• Hierarchical independent component analysis: a multi-resolution non-orthogonal data-driven basis
• A multi-class large margin classifier
• Langevin incremental mixture importance sampling
• CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
• Learning customized and optimized lists of rules with mathematical programming
• RHSBoost: improving classification performance in imbalance data
• HHCART: an oblique decision tree
• Accelerating cross-validation in multinomial logistic regression with \(\ell_1\)-regularization
• A one-step method for modelling longitudinal data with differential equations
• SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch collapse
• A correction on TangentBoost algorithm
• Random feature-based online multi-kernel learning in environments with unknown dynamics
• Semi-analytic resampling in Lasso
• Nonlinear function-on-function additive model with multiple predictor curves
• A unified framework for structured graph learning via spectral constraints
• An introduction to clustering with R
• Learning from incomplete data via parameterized \(t\) mixture models through eigenvalue decomposition
• Simple algorithms for frequent item set mining
• Learning a symbolic representation for multivariate time series classification
• The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
• Neural autoregressive distribution estimation

This page was built for software: UCI