UCI
From MaRDI portal
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)- Optimal kernel selection in twin support vector machines
- Optimizing logistic regression coefficients for discrimination and calibration using estimation of distribution algorithms
- An incremental algorithm to construct a lattice of set intersections
- A new feature selection method for Gaussian mixture clustering
- Learning from partially supervised data using mixture models and belief functions
- Subspace projection: A unified framework for a class of partition-based dimension reduction techniques
- Moving towards efficient decision tree construction
- A new measure of uncertainty based on knowledge granulation for rough sets
- Data gravitation based classification
- On kernel difference-weighted \(k\)-nearest neighbor classification
- Distance-based discriminant analysis method and its applications
- Efficient tree traversal to reduce code growth in tree-based genetic programming
- Feature selection via sensitivity analysis of SVM probabilistic outputs
- Joint feature re-extraction and classification using an iterative semi-supervised support vector machine algorithm
- A \(k\)-norm pruning algorithm for decision tree classifiers based on error rate estimation
- Layered critical values: a powerful direct-adjustment approach to discovering significant patterns
- On reoptimizing multi-class classifiers
- Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning
- Boosted Bayesian network classifiers
- Discretization for Naive-Bayes learning: managing discretization bias and variance
- Classifying under computational resource constraints: anytime classification using probabilistic estimators
- Novel approaches to probabilistic neural networks through bagging and evolutionary estimating of prior probabilities
- A generalized adaptive ensemble generation and aggregation approach for multiple classifier systems
- Exploring the boundary region of tolerance rough sets for feature selection
- A scalable framework for cluster ensembles
- A multi-prototype clustering algorithm
- An efficient discriminant-based solution for small sample size problem
- Efficient single-pass frequent pattern mining using a prefix-tree
- Nonparallel plane proximal classifier
- Data analysis with fuzzy clustering methods
- Analysis of new variable selection methods for discriminant analysis
- Gaussian kernel optimization for pattern classification
- A simultaneous learning framework for clustering and classification
- Data dependency in multiple classifier systems
- Feature selection with dynamic mutual information
- A closed-form reduction of multi-class cost-sensitive learning to weighted multi-class learning
- A method for improving the accuracy of data mining classification algorithms
- On universal transfer learning
- Parallelizing AdaBoost by weights dynamics
- A stochastic approximation view of boosting
- Model selection for support vector machines via uniform design
- DIVCLUS-T: a monothetic divisive hierarchical clustering method
- A local boosting algorithm for solving classification problems
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
- Negative correlation in incremental learning
- A confidence voting process for ranking problems based on support vector machines
- A robust approach based on conditional value-at-risk measure to statistical learning problems
- Methods and algorithms of collective recognition
- Using a similarity measure for credible classification
- MILP approach to pattern generation in logical analysis of data
- Feature selection using fuzzy support vector machines
- Innovation in the cluster validating techniques
- A Real generalization of discrete AdaBoost
- Argument based machine learning
- Mining competent case bases for case-based reasoning
- Convergence analysis of convex incremental neural networks
- Risk-sensitive loss functions for sparse multi-category classification problems
- On generalization performance and non-convex optimization of extended \(\nu \)-support vector machine
- Computational load reduction in decision functions using support vector machines
- Classification of cancer recurrence with alpha-beta BAM
- Design of interpretable fuzzy rule-based classifiers using spectral analysis with structure and parameters optimization
- Fuzzy connectivity clustering with radial basis kernel functions
- A graph b-coloring framework for data clustering
- Interval regression analysis using support vector networks
- A variable selection method based on Tabu search for logistic regression models
- New variants of pairwise classification
- A reference model for customer-centric data mining with support vector machines
- Naïve possibilistic network classifiers
- Support vector machine classification with indefinite kernels
- A multi-class large margin classifier
- Learning the optimal kernel for Fisher discriminant analysis via second order cone programming
- Is an ordinal class structure useful in classifier learning?
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Newton's method for nonparallel plane proximal classifier with unity norm hyperplanes
- Large margin nearest local mean classifier
- SVM-Maj: a majorization approach to linear support vector machines with different hinge errors
- Learning mixtures of truncated basis functions from data
- Parameter learning in hybrid Bayesian networks using prior knowledge
- Fast nonparametric classification based on data depth
- Wrappers for feature subset selection
- Testing conditional independence in supervised learning algorithms
- Subsemble: an ensemble method for combining subset-specific algorithm fits
- Multi-class AdaBoost
- Classification trees with soft splits optimized for ranking
- Multivariate mixture modeling using skew-normal independent distributions
- The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
- Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
- Boundary search procedure for the design and training of an ontogenic neural network classifier
- Achieving superior generalisation with a high order neural network
- Top-down induction of first-order logical decision trees
- A probabilistic framework for memory-based reasoning
- Learning criteria for training neural network classifiers
- Learning by discovering concept hierarchies
- CViz
- FL-GrCCA
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- MapReduce
- mclust
- TextRank
- Sherlock
This page was built for software: UCI
