New datasets improve fairness research by revealing UCI Adult's limitations.
problem Limitations of UCI Adult dataset in fairness research.
method Reconstructed a superset of UCI Adult data from US Census sources.
result New datasets reveal trade-offs between fairness criteria and performance.
This study observes accuracy variations of KNN, SVM, LMNN, and ENN on 11 UCI datasets.
problem To observe the variation of accuracies of KNN, SVM, LMNN, and ENN algorithms on different datasets.
method Implemented KNN, SVM, LMNN, and ENN on 11 UCI datasets and analyzed their accuracy.
result Comparison of algorithm performances on each dataset.
Neural linear model performs well on simple regression tasks but requires tuning.
problem Characterizing the neural linear model's performance on simple regression tasks.
method Characterized the neural linear model on UCI and gap datasets.
result The neural linear model shows good performance but requires good hyperparameter tuning.
Interpretable ML models for missing data and visualisation.
problem Understanding and evaluating fairness in ML models.
method Introduced angle-based variants of Learning Vector Quantization (LVQ) models.
result Models can handle missing values and extract knowledge from datasets.
Proposes a new network for accurate predictions and uncertainty estimation.
problem Uncertainty estimation in regression predictions without sacrificing accuracy.
method Decoupled two-stage training process with custom loss function.
result Reduces prediction error by 23-34% while maintaining 95% PICP.
Combines k-NN and RVM for improved classification accuracy.
problem Improving k-NN's performance by considering relevancy.
method Integrates k-NN and RVM in kernel space, introduces a new stopping parameter.
result Significantly prunes irrelevant attributes and improves classification accuracy.
Paper optimizes TSK fuzzy systems for large datasets with MBGD and novel regularization.
problem Optimizing TSK fuzzy systems for large datasets with high dimensionality.
method Proposes MBGD with UR and BN for TSK fuzzy classifiers.
result UR and BN improve classification performance on various UCI datasets.
Data mining techniques predict breast cancer types with high accuracy.
problem Early detection of breast cancer to reduce mortality rates.
method Twelve classification algorithms applied to the Breast Cancer Wisconsin dataset.
result High accuracy in predicting malignant and benign breast cancer.
Gaussian Processes improve missing value imputation in datasets.
problem Handling missing values in large datasets.
method Sparse Gaussian Processes combined with stochastic variational inference.
result MGP significantly outperforms other imputation methods.
Evolutionary algorithms improve decision tree ensembles.
problem Improving predictive performance of decision trees.
method Real-valued vector representation of decision trees, evolutionary algorithms (Differential evolution, Evolution strategies).
result Proposed methods outperform classical decision tree induction algorithms.
New NHCAs improve multi-category classification efficiency.
problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.
Bayesian Deep Learning experiments often use weak baselines, leading to misleading conclusions.
problem Misleading conclusions in Bayesian Deep Learning due to weak baselines in experiments.
method Used a fixed number of iterations for baselines and compared them with models trained to convergence.
result Monte Carlo dropout baseline outperforms or performs competitively with superior methods.
FLDCRF improves sequence labeling performance with latent dynamics interactions.
problem Sequence labeling with improved performance and latent dynamics interactions.
method Factored Latent-Dynamic Conditional Random Fields (FLDCRF) with multiple latent dynamics interactions.
result FLDCRF outperforms state-of-the-art models across multiple datasets.
Study uses machine learning to predict income levels, achieving 88.16% accuracy.
problem Predicting income levels to reduce economic inequality.
method Used Gradient Boosting Classifier Model on UCI Adult Dataset.
result Achieved 88.16% accuracy in predicting income categories.
Paper compares three regularization-based methods for HAR, highlighting their strengths and limitations.
problem Challenges in evolving ML models for dynamic health and well-being applications.
method Evaluation of three regularization-based continual learning approaches for Human Activity Recognition (HAR).
result No single technique outperformed all others in all scenarios considered.
In this paper we explore different regression models based on Clusterwise Linear Regression (CLR). CLR aims to find the partition of the data into k clusters, such that linear regressions fitted to each of the clusters minimize overall mean squared error on the whole data. The main obstacle preventing to use found re…
To improve accuracy and speed of regressions and classifications, we present a data-based prediction method, Random Bits Regression (RBR). This method first generates a large number of random binary intermediate/derived features based on the original input matrix, and then performs regularized linear/logistic regressio…
HAR-Net combines deep features with traditional hand-crafted features for better human activity recognition.
problem Challenges in traditional HAR methods, especially feature extraction.
method Combines deep learning and traditional feature engineering.
result Performance improvement of 0.9% compared to traditional SVM.
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown parent datum. The latent graph structure is assumed to lie in the family of directed out-tree graphs which leads to efficient Bayesian inferen…
Stochastic Bayesian Neural Network improves scalability and performance.
problem Challenges in calculating posterior distribution in Bayesian Neural Networks.
method Maximizes Evidence Lower Bound using Stochastic Evidence Lower Bound objective function.
result Demonstrates improved performance and scalability over previous algorithms.
Random forests perform bootstrap-aggregation by sampling the training samples with replacement. This enables the evaluation of out-of-bag error which serves as a internal cross-validation mechanism. Our motivation lies in using the unsampled training samples to improve each decision tree in the ensemble. We study the e…
Optimal transport distances help impute missing data.
problem Missing data in real-world datasets.
method Use optimal transport distances as a loss function to impute missing data values.
result OT-based methods match or outperform state-of-the-art imputation methods.
FineMorphs models smooth transformations for multivariate regression.
problem Efficiently modeling complex transformations for multivariate regression.
method Optimal control of affine and diffeomorphic transformations using smooth vector fields.
result FineMorphs can reduce dimensionality and adapt to large datasets.
Choosing optimal (or at least better) policies is an important problem in domains from medicine to education to finance and many others. One approach to this problem is through controlled experiments/trials - but controlled experiments are expensive. Hence it is important to choose the best policies on the basis of obs…
We develop an approximate formula for evaluating a cross-validation estimator of predictive likelihood for multinomial logistic regression regularized by an ℓ1-norm. This allows us to avoid repeated optimizations required for literally conducting cross-validation; hence, the computational time can be significantl…
We introduce a novel incremental decision tree learning algorithm, Hoeffding Anytime Tree, that is statistically more efficient than the current state-of-the-art, Hoeffding Tree. We demonstrate that an implementation of Hoeffding Anytime Tree---"Extremely Fast Decision Tree", a minor modification to the MOA implementat…
A new algorithm enhances minority class representation in imbalanced datasets.
problem Improving classification performance on imbalanced datasets.
method PO-QG algorithm using Proxima-Orion neighbors and q-Gaussian weighting.
result The PO-QG algorithm improves overall classification performance.
The ability to interpret machine learning models has become increasingly important now that machine learning is used to inform consequential decisions. We propose an approach called model extraction for interpreting complex, blackbox models. Our approach approximates the complex model using a much more interpretable mo…
The paper proposes a semi-parametric Bayesian network model using Gaussian Processes and Horseshoe priors.
problem Learning semi-parametric relationships in Expert Bayesian Networks with minimal nonlinear components.
method Uses Gaussian Processes and Horseshoe priors to model relationships, prioritizes modifying expert graphs, and generates diverse graphs.
result Models outperform state-of-the-art semi-parametric Bayesian Network models in synthetic and real-world datasets.
Multithreshold Entropy Linear Classifier (MELC) is a density based model which searches for a linear projection maximizing the Cauchy-Schwarz Divergence of dataset kernel density estimation. Despite its good empirical results, one of its drawbacks is the optimization speed. In this paper we analyze how one can speed it…
Paper presents a method to extract and interpret knowledge from a spiking neural classifier.
problem Extracting and interpreting knowledge from a spiking neural classifier with time-varying synaptic weights.
method The method involves encoding real-valued input data into spike patterns, training the classifier, and mapping the weighted postsynaptic potential to feature strength functions (FSFs).
result The FSFs represent the extracted knowledge from the classifier and can be used for classification and interpretation.
MDFS selects important variables considering variable interactions, improving over simple filtering.
problem Discarding variable interactions leads to loss of relevant variables.
method MultiDimensional Feature Selection (MDFS) using information theory and CUDA C.
result Multidimensional analysis provides more reliable rankings of variable importance.
Paper proposes methods to improve SVM classifiers in noisy data scenarios.
problem Improving SVM classifiers when training data contains label noise.
method Mixed Integer Linear and Non Linear models with relabeling and clustering.
result Effective methods improve SVM performance in noisy data scenarios.
AP-Perf integrates custom metrics into neural networks.
problem Incorporating non-decomposable performance metrics into differentiable learning.
method Adversarial prediction framework optimizing metrics in worst-case distribution.
result Demonstrated effectiveness on various classification tasks.
The recently proposed Minimal Complexity Machine (MCM) finds a hyperplane classifier by minimizing an exact bound on the Vapnik-Chervonenkis (VC) dimension. The VC dimension measures the capacity of a learning machine, and a smaller VC dimension leads to improved generalization. On many benchmark datasets, the MCM gene…
Large deep neural networks are powerful, but exhibit undesirable behaviors such as memorization and sensitivity to adversarial examples. In this work, we propose mixup, a simple learning principle to alleviate these issues. In essence, mixup trains a neural network on convex combinations of pairs of examples and their …
In the classical Gaussian SVM classification we use the feature space projection transforming points to normal distributions with fixed covariance matrices (identity in the standard RBF and the covariance of the whole dataset in Mahalanobis RBF). In this paper we add additional information to Gaussian SVM by considerin…
This study evaluates clustering algorithms on high-dimensional data.
problem Comparing clustering algorithms on high-dimensional datasets.
method Evaluation of K-means, DBSCAN, and Spectral Clustering using PCA, t-SNE, UMAP, and multiple metrics.
result UMAP preprocessing improves clustering quality across all algorithms, with Spectral Clustering excelling.
Improved natural gradient boosting with leaf number clipping for faster and better performance.
problem Slower training speed and poor performance on large datasets for natural gradient boosting.
method Leaf number clipping regularization to optimize hyperparameters and improve performance.
result Significant improvement in performance and up to 4.85x speed up on various datasets.
MOD improves ensemble-based uncertainty estimates by encouraging larger diversity.
problem Improving model uncertainty estimates for inputs not seen during training.
method Maximize Overall Diversity (MOD) approach to encourage larger diversity in ensemble predictions.
result Significantly improves predictive performance for out-of-distribution test examples.
Under covariate shift, training (source) data and testing (target) data differ in input space distribution, but share the same conditional label distribution. This poses a challenging machine learning task. Robust Bias-Aware (RBA) prediction provides the conditional label distribution that is robust to the worstcase lo…
Two binary Sine Cosine Algorithms improve feature selection in medical datasets.
problem Optimizing feature selection from medical datasets to enhance model accuracy.
method Proposed SBSCA and VBSCA algorithms using S-shaped and V-shaped transfer functions.
result SBSCA and VBSCA outperform four other binary optimization algorithms in medical datasets.
This paper evaluates t-SNE and MDS for reducing dimensions in datasets and classifying them with KNN, ENN, and SVM.
problem Reducing dimensions in datasets for better classification performance.
method t-SNE and MDS applied to nine datasets, followed by KNN, ENN, and SVM classification.
result Performance comparison of t-SNE and MDS with KNN, ENN, and SVM.
New method predicts graph structure changes over time.
problem Existing graph prediction methods assume static vertices, limiting their applicability.
method Combines time series prediction with adapted FBA for growing graphs.
result Efficacy demonstrated on synthetic and real datasets.
PEF identifies the best subgroup performance balance for fairness.
problem Fairness constraints can degrade performance in skewed datasets.
method PEF identifies the closest operating point on the Pareto curve of subgroup performances.
result PEF achieves Pareto levels in accuracy for all subgroups.
New fairness approach removes direct effects of unprivileged groups through causal regularization.
problem Ensuring fairness in machine learning models for unprivileged groups.
method Proposes a new fairness definition based on causal effects and develops regularizations to remove the impact of unprivileged groups on model outcomes.
result Demonstrates effectiveness of the approach on various datasets, reducing unfairness with minimal performance loss.
Dataset2Vec learns dataset meta-features without expert knowledge.
problem Learning meta-features for datasets requires expert domain knowledge.
method Dataset2Vec combines DeepSet architecture with hierarchical sets to learn meta-features.
result Meta-features learned by Dataset2Vec outperform engineered features.
Deep heteroskedastic models overfit, showing a phase transition with regularization strength.
problem Overfitting in deep heteroskedastic regression models.
method Theoretical framework based on statistical field theory, empirical verification, and hyperparameter simplification.
result A phase transition in model behavior with varying regularization strength.