A new network-based high-level data classification method using betweenness centrality.
problem Traditional data classification techniques focus on physical features, while high-level classification considers semantic meaning.
method Proposes a network-based high-level classification technique using betweenness centrality.
result Competent classification performance in nine real datasets compared to traditional models.
Neural networks improve functional data classification.
problem Lack of effective classification methods for functional data.
method Extended deep learning methodologies to functional data for classification.
result Demonstrated superior performance in spectrographic data classification.
Novel method converts time series data into functional data for high dimensional classification.
problem Small sample size problem in high dimensional time series data.
method Classwise Functional Principal Component Analysis (PCA) followed by Bayesian linear classifier.
result Demonstrated efficacy on synthetic and real data sets.
This paper discovers classification models from sequential data without prior knowledge.
problem Lack of prior knowledge in defining kernels for online classification.
method Adapts GP-based time-series structure discovery with SMC to learn new features from sequential data.
result Improves classification accuracy by 10% on real-world data.
Paper proposes fully Bayesian approach for RVM classification, improving accuracy especially in imbalanced data.
problem Difficulty in conducting RVM classification due to lack of closed-form solution for weight parameter posterior.
method Proposes Generic Bayesian and Fully Bayesian approaches with hierarchical hyperprior structure.
result Improves classification performance, especially in imbalanced data.
New method corrects skewed confidence for PbN classification.
problem Weakly supervised binary classification with biased negative data.
method Corrects skewed confidence in negative data to improve classifier.
result Reduces distortion in posterior probability for PbN classification.
Without any specific way for imbalance data classification, artificial intelligence algorithm cannot recognize data from minority classes easily. In general, modifying the existing algorithm by assuming that the training data is imbalanced, is the only way to handle imbalance data. However, for a normal data handling, …
Data in real-world application often exhibit skewed class distribution which poses an intense challenge for machine learning. Conventional classification algorithms are not effective in the case of imbalanced data distribution, and may fail when the data distribution is highly imbalanced. To address this issue, we prop…
A new classifier uses weighted orthogonal regression for robust classification with limited data.
problem Challenges in classification with insufficient training data.
method Exploits intrinsic structure of data through Eigen components with specific weights determined by eigenvalues.
result Robust learning in classification problems with limited data.
Improved spectroscopy classification with deep learning and synthetic data.
problem Identifying chlorinated solvents in Raman spectra.
method Locally-connected neural network (NN) for binary classification, autoencoder-based outlier detection, and synthetic training data.
result The proposed method outperforms existing algorithms in accuracy and robustness.
Enhances graph classification models on small datasets.
problem Over-fitting and undergeneralization on small-scale benchmark datasets.
method Data augmentation via graph structure transformation and model evolution framework.
result Average improvement of 3 - 13% accuracy on graph classification tasks.
Meta-learning method improves PU classification performance.
problem Improving binary classifiers from PU data in unseen tasks.
method Adapts model to PU data using related tasks and neural networks.
result Proposed method outperforms existing methods on synthetic and real-world datasets.
Proposes CBMI for missing data imputation using labels and input.
problem Missing data in practical data science settings.
method CBMI: imputes labels and input simultaneously; IUL: stacks label into input.
result CBMI improves classification accuracy, especially for imbalanced and categorical data.
Framework for few-shot relation classification with minimal training data.
problem Few-shot relation classification with limited training data.
method Meta-learning framework that combines instance and support knowledge.
result Framework outperforms state-of-the-art results and achieves competitive performance with large training data.
Ordinal data are often seen in real applications. Regular multicategory classification methods are not designed for this data type and a more proper treatment is needed. We consider a framework of ordinal classification which pools the results from binary classifiers together. An inherent difficulty of this framework i…
Improved 3D LiDAR data classification using product coefficients.
problem Enhancing accuracy in 3D LiDAR data classification.
method Introducing product coefficients derived from measure theory as additional features in the classification process, alongside PCA.
result Significant improvement in classification accuracy with product coefficients.
New method uses public data to achieve optimal nonparametric classification with privacy constraints.
problem Optimal nonparametric classification under local differential privacy constraints.
method Locally differentially private classification tree with data-driven pruning.
result Achieves mini-max optimal convergence rate with public data.
Alternative method improves SVM for data classification.
problem SVM's weaknesses in time processing, optimization, multi-class generalization, and unbalanced classes.
method Minimum distance to optimal subspaces containing mapped classes.
result Improved performance with fewer shortcomings.
A new network-based method for high-level data classification without normalization.
problem Evaluation and classification of data with hidden attribute interactions.
method A new network-building methodology based on attribute-attribute interactions, avoiding normalization.
result Improvement in accuracy of high-level classification using betweenness centrality.
Log messages are now widely used in software systems. They are important for classification as millions of logs are generated each day. Most logs are unstructured which makes classification a challenge. In this paper, Deep Learning (DL) methods called Auto-LSTM, Auto-BLSTM and Auto-GRU are developed for anomaly detecti…
New algorithm uses random projections for robust, sparse data classification.
problem Improving robustness and sparsity in data classification.
method Randomly projects data into a high-dimensional space, truncates small entries, and applies a cap operation.
result The method enhances classification accuracy with minimal loss, especially in noisy conditions.
Data stream classification methods demonstrate promising performance on a single data stream by exploring the cohesion in the data stream. However, multiple data streams that involve several correlated data streams are common in many practical scenarios, which can be viewed as multi-task data streams. Instead of handli…
End-to-end model for time series classification with missing data.
problem Time series classification with missing data.
method End-to-end neural network that unifies imputation and representation learning.
result Proposed model outperforms state-of-the-art approaches for incomplete time series classification.
New classifiers for HDLSS data classify without tuning, robustly.
problem Classification of high-dimensional data with small samples.
method Data-adaptive energy distance classifiers, free of tuning parameters.
result Perfect classification in HDLSS asymptotic regime under general conditions.
Proposes a new tree-based algorithm for class-imbalanced data.
problem Classification of imbalanced data.
method Precision-Recall Curve (PRC) classification tree algorithm.
result The PRC classification tree outperforms classic algorithms for class-imbalanced data.
When the training data in a two-class classification problem is overwhelmed by one class, most classification techniques fail to correctly identify the data points belonging to the underrepresented class. We propose Similarity-based Imbalanced Classification (SBIC) that learns patterns in the training data based on an …
As known, attribute selection is a method that is used before the classification of data mining. In this study, a new data set has been created by using attributes expressing overall satisfaction in Turkey Statistical Institute (TSI) Life Satisfaction Survey dataset. Attributes are sorted by Ranking search method using…
Study derives error decay rates for kernel classification under source and capacity conditions.
problem Understanding prediction error decay rates for real data sets.
method Derived decay rates for misclassification error under Gaussian design for SVM and ridge classification.
result Rates accurately describe learning curves for data sets satisfying source and capacity conditions.
Paper analyzes multiclass classification with high-dimensional data.
problem Understanding statistical properties and behavior of multiclass classification algorithms.
method Asymptotic analysis of linear multiclass classification.
result Test error varies significantly across different training algorithms and data distributions.
Realizations of stochastic process are often observed temporal data or functional data. There are growing interests in classification of dynamic or functional data. The basic feature of functional data is that the functional data have infinite dimensions and are highly correlated. An essential issue for classifying dyn…
New methods for ordinal classification of interval-valued data and functional data.
problem Ordinal classification of interval-valued data and functional data.
method Six ordinal classifiers are proposed, including parametric, binary decomposition, logistic regression, distance-based, k-nearest-neighbor, kernel PCA, and random forest methods.
result Considering ordering and interval-valued information improves the accuracy of ordinal classification.
A new algorithm efficiently selects features for functional data classification.
problem Feature selection and classification of functional data in high-dimensional spaces.
method Developed a novel optimization problem integrating logistic loss and functional features. Employed functional principal components and a new adaptive Dual Augmented Lagrangian algorithm for efficient minimization.
result FSFC outperforms other methods in computational time and classification accuracy.
A new kNN imputation method improves classification performance on datasets with missing data.
problem Missing data in classification problems.
method Class weighted grey distance with MI weighting for kNN imputation.
result Improved classification performance compared to existing methods.
Develops a data-driven fault diagnosis framework for time-series data.
problem Fault diagnosis of dynamic systems using imbalanced and unknown fault classes.
method Kullback-Leibler divergence, data-driven fault classification, open-set classification.
result Framework handles imbalanced datasets, class overlapping, and unknown faults.
Can we learn a binary classifier from only positive data, without any negative data or unlabeled data? We show that if one can equip positive data with confidence (positive-confidence), one can successfully learn a binary classifier, which we name positive-confidence (Pconf) classification. Our work is related to one-c…
Graph-based multi-label classifier extends CULP for multi-label data.
problem Solving multi-label classification problems.
method Extends CULP algorithm to handle multi-label data.
result Competitive results compared to cutting-edge multi-label classifiers.
This work refines Cover's theory for binary classification on low-dimensional data.
problem The challenge of analyzing how low-dimensional data structures affect classification models.
method Refines Cover's function-counting theory to account for low-dimensional data structure.
result Derives dichotomy counts and analyzes the impact of data structure on classification models.
Linear classification has been widely used in many high-dimensional applications like text classification. To perform linear classification for large-scale tasks, we often need to design distributed learning methods on a cluster of multiple machines. In this paper, we propose a new distributed learning method, called f…
In recent era prediction of enzyme class from an unknown protein is one of the challenging tasks in bioinformatics. Day to day the number of proteins is increases as result the prediction of enzyme class gives a new opportunity to bioinformatics scholars. The prime objective of this article is to implement the machine …
Develops an online federated learning framework for classification.
problem Handling streaming data from multiple clients while ensuring data privacy and efficiency.
method Leverages generalized distance-weighted discriminant technique and Majorization-Minimization principle.
result Achieves high classification accuracy, significant computational efficiency, and data security enhancements.
SVR-Tree improves classification trees for imbalanced and sparse data.
problem Classification difficulties in imbalanced and sparse data.
method Proposes SVR-Tree, penalizing the Surface-to-Volume Ratio of decision sets.
result SVR-Tree improves generalization error compared to other imbalance algorithms.
Study shows topological features improve time series classification.
problem Classifying stochastic processes with varying noise and sampling.
method Topological data analysis features compared to statistical and raw features.
result Topological features lead to better classification performance.
A new method for one-class classification using ellipsoidal encapsulation.
problem One-class classification for data optimization.
method Iterative transformation into an optimized subspace with regularization terms.
result Better results in one-class classification compared to existing methods.
In today's data driven world, storing, processing, and gleaning insights from large-scale data are major challenges. Data compression is often required in order to store large amounts of high-dimensional data, and thus, efficient inference methods for analyzing compressed data are necessary. Building on a recently desi…
A new robust time series distance metric for k-NN classification.
problem Robustness against arbitrary data contamination in time series classification.
method Proposes a novel distance metric with worst-case O(nlogn) complexity. result Demonstrates competitive classification accuracy in k-NN time series classification.
Set classification problems arise when classification tasks are based on sets of observations as opposed to individual observations. In set classification, a classification rule is trained with N sets of observations, where each set is labeled with class information, and the prediction of a class label is performed a…
Paper addresses class imbalance in disk SMART dataset using GANs and genetic algorithms.
problem Class imbalance in disk SMART dataset.
method Data synthesised by multivariate GANs mixed with genetic algorithms.
result Higher disk fault classification prediction accuracy.
Novel algorithm SAODE improves high-dimensional stream classification in seasonal data.
problem Handling seasonal concept drift in high-dimensional stream classification.
method SAODE classifier that includes time as a super parent to handle seasonal drift.
result SAODE consistently outperforms other methods in stream and concept drift classification.