Decomposition Methods for Machine Learning with Small, Incomplete or Noisy Datasets
Open accessThe DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.
Abstract
In many machine learning applications, measurements are sometimes incomplete or noisy resulting in missing features. In other cases, and for different reasons, the datasets are originally small, and therefore, more data samples are required to derive useful supervised or unsupervised classification methods. Correct handling of incomplete, noisy or small datasets in machine learning is a fundamental and classic challenge. In this article, we provide a unified review of recently proposed methods based on signal decomposition for missing features imputation (data completion), classification of noisy samples and artificial generation of new data samples (data augmentation). We illustrate the application of these signal decomposition methods in diverse selected practical machine learning examples including: brain computer interface, epileptic intracranial electroencephalogram signals classification, face recognition/verification and water networks data analysis. We show that a signal decomposition approach can provide valuable tools to improve machine learning performance with low quality datasets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Huang, N. E., Shen, Z., Long, S. R., Wu, M. C., Shih, H. H., Zheng, Q., Yen, N.-C., Tung, C. C., & Liu, H. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0193 · Cited by 23,564 · cited 1×
“in [45] as a new method to analyze nonlinear and non-stationary signals.”
MethodLIII. On lines and planes of closest fit to systems of points in space
Pearson, K. (1901) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440109462720 · Cited by 11,934
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301 · cited 2×
“As a particular case, when core tensor is diagonal with R = R1 = R2 = R3 this model is reduced to the CANDECOMP/PARAFAC or CP(R) decomposition model (see Figure 1f), which has demonstrated to be very useful in a wide range of applications [47,48].”
BackgroundMethodAn Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017 · cited 1×
“Sparse coding has to date a large record of successful applications in signal processing tasks like compressed sensing [41,42], blind source separation [43], denoising [39], inpainting [44] and others.”
BackgroundSignal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653 · cited 4×
“TK (Tucker) and CP (CANDECOMP/PARAFAC) indicate the decomposition model used by the algorithms.”
MethodInfluentialImage Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
ADASYN: Adaptive synthetic sampling approach for imbalanced learning
He, H., Bai, Y., Garcia, E. A., & Li, S. (2008) · 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence) · doi:10.1109/ijcnn.2008.4633969 · Cited by 4,521 · cited 2×
“Akter et al. [56] successfully applied data augmentation based on an adaptive synthetic oversampling approach (ADASYN) [66] to balance an in-hospital dataset of epileptic interictal iEEG signals to identify the seizure onset zones automatically.”
MethodCoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Leys, C., Ley, C., Klein, O., Bernard, P., & Licata, L. (2013) · Journal of Experimental Social Psychology · doi:10.1016/j.jesp.2013.03.013 · Cited by 4,147 · cited 1×
“The performance of each classifier was validated trough the median absolute deviation (MAD) method to detect outliers [64], and the dispersion ratio R was calculated as”
MethodSome Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492 · cited 1×
“Matrix factorization models, such as PCA in Equation (3), can be generalized to tensors by means of the Tucker(R1, R2, R3) decomposition [46].”
MethodGenerative Image Inpainting with Contextual Attention
Yu, J., Lin, Z., Yang, J., Shen, X., Lu, X., & Huang, T. S. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00577 · Cited by 2,527
Optimal spatial filtering of single trial EEG during imagined hand movement
Ramoser, H., Muller-Gerking, J., & Pfurtscheller, G. (2000) · IEEE Transactions on Rehabilitation Engineering · doi:10.1109/86.895946 · Cited by 2,457 · cited 2×
“Since the quality of the classifier can be greatly improved by using a large number of frames from each type of MI [63], it is habitual to record 100 or more frames, in total.”
BackgroundMethodFrom Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183 · cited 1×
“This approach is usually referred as “sparse coding” or “sparse representation” of signals and matrix Φ ∈ RN×I is called a “dictionary” [32,33] (see Figure 1c).”
Online dictionary learning for sparse coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553463 · Cited by 2,114 · cited 1×
“To that end, some dictionary learning algorithms are proposed in the literature [39,40].”
BackgroundTensor Completion for Estimating Missing Values in Visual Data
Liu, J., Musialski, P., Wonka, P., & Ye, J. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.39 · Cited by 2,063 · cited 1×
“the High accuracy Low Rank Tensor Completion (HaLRTC) [59] and the Bayesian CP factorization (BCPF) for tensor completion [60]; and one method that uses the Sparse Tucker decomposition of every 6× 6× 6 tensor patch (subtensors), the 3D Patch-based Tensor Completion (3DPB-TC) [50].”
MethodCichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384 · cited 2×
“As a particular case, when core tensor is diagonal with R = R1 = R2 = R3 this model is reduced to the CANDECOMP/PARAFAC or CP(R) decomposition model (see Figure 1f), which has demonstrated to be very useful in a wide range of applications [47,48].”
BackgroundMethodSelf-citationDeep, Big, Simple Neural Nets for Handwritten Digit Recognition
Cireşan, D. C., Meier, U., Gambardella, L. M., & Schmidhuber, J. (2010) · Neural Computation · doi:10.1162/neco_a_00052 · Cited by 1,078 · cited 1×
“35%) by using deep neural networks [9].”
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046 · cited 1×
“For general overcomplete (I ≥ N) dictionaries, the sparse vector of coefficients can be obtained by applying some of the available algorithms that were designed to solve the sparse coding problem, which includes greedy methods such as matching pursuit (MP) [34], orthogonal matching pursuit (OMP) [35], compressive samp…”
Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
Elad, M., Starck, J.-L., Querre, P., & Donoho, D. L. (2005) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2005.03.005 · Cited by 904 · cited 1×
“Sparse coding has to date a large record of successful applications in signal processing tasks like compressed sensing [41,42], blind source separation [43], denoising [39], inpainting [44] and others.”
BackgroundDiscriminative Unsupervised Feature Learning with Exemplar Convolutional Neural Networks
Dosovitskiy, A., Fischer, P., Springenberg, J. T., Riedmiller, M., & Brox, T. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2496141 · Cited by 762
Pattern classification with missing data: a review
García-Laencina, P. J., Sancho-Gómez, J.-L., & Figueiras-Vidal, A. R. (2010) · Neural Computing and Applications · doi:10.1007/s00521-009-0295-6 · Cited by 759 · cited 1×
“The classical approach to supervised learning with missing or noisy data is to preprocess the available data in order to infer missing/corrupted values such that standard ML algorithms can be used on the corrected dataset [18,19].”
MethodConvolutional Neural Network With Data Augmentation for SAR Target Recognition
Ding, J., Chen, B., Liu, H., & Huang, M. (2016) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2015.2513754 · Cited by 708 · cited 1×
“Other application domains where data augmentation improved the discriminative power of classifiers include: biometrics [13], fault diagnosis in industry [14], radio frequency fingerprint identification [15], synthetic aperture radar (SAR) target recognition [16], and others.”
BackgroundOn the Role of Sparse and Redundant Representations in Image Processing
Elad, M., Figueiredo, M. A. T., & Ma, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2037655 · Cited by 663 · cited 1×
“This approach is usually referred as “sparse coding” or “sparse representation” of signals and matrix Φ ∈ RN×I is called a “dictionary” [32,33] (see Figure 1c).”
Supervised learning from incomplete data via an EM approach
Ghahramani, Z., & Jordan, M. I. (1993) · neural information processing systems · Cited by 642
EMG and EOG artifacts in brain computer interface systems: A survey
Fatourechi, M., Bashashati, A., Ward, R. K., & Birch, G. E. (2007) · Clinical Neurophysiology · doi:10.1016/j.clinph.2006.10.019 · Cited by 638 · cited 1×
“For example, when recording electroencephalographic (EEG) signals, corrupted data can be originated from impedance mismatching, electrode disconnection, body movements, etc [3].”
BackgroundScalable tensor factorizations for incomplete data
Acar, E., Dunlavy, D. M., Kolda, T. G., & Mørup, M. (2011) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2010.08.004 · Cited by 602 · cited 2×
“cat/data-signal-processing/software/) in [57], which are based on the CP model of the whole tensor, such as the CP Weighted Optimization (CP-WOPT) [58],”
MethodTraining Invariant Support Vector Machines
Decoste, D., & Schölkopf, B. (2002) · Machine Learning · doi:10.1023/a:1012454411458 · Cited by 588
Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
Zhao, Q., Zhang, L., & Cichocki, A. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2392756 · Cited by 587 · cited 1×
“the High accuracy Low Rank Tensor Completion (HaLRTC) [59] and the Bayesian CP factorization (BCPF) for tensor completion [60]; and one method that uses the Sparse Tucker decomposition of every 6× 6× 6 tensor patch (subtensors), the 3D Patch-based Tensor Completion (3DPB-TC) [50].”
MethodSingle-Image Noise Level Estimation for Blind Denoising
Liu, X., Tanaka, M., & Okutomi, M. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2283400 · Cited by 420 · cited 3×
“To this end, several strategies can be implemented, for example using classical filters such as a Gaussian [67], bilateral [68], arithmetic [69], median [70] or Wiener filters [71].”
MethodAndrzejak, R. G., Schindler, K., & Rummel, C. (2012) · Physical Review E · doi:10.1103/physreve.86.046206 · Cited by 412 · cited 1×
“constructed an efficient and sophisticated method for the data augmentation based on the DCT [54] and applied to the Bern-Barcelona dataset [65], which is a well-known dataset”
MethodAdaptive time-frequency decompositions
Mallat, S. G. (1994) · Optical Engineering · doi:10.1117/12.173207 · Cited by 358 · cited 1×
“For general overcomplete (I ≥ N) dictionaries, the sparse vector of coefficients can be obtained by applying some of the available algorithms that were designed to solve the sparse coding problem, which includes greedy methods such as matching pursuit (MP) [34], orthogonal matching pursuit (OMP) [35], compressive samp…”
MethodA Study of K-Nearest Neighbour as an Imputation Method.
Batista, G. E. A. P. A., & Monard, M. C. (2002) · Cited by 329
Incorporating invariances in support vector learning machines
Schölkopf, B., Burges, C., & Vapnik, V. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61510-5_12 · Cited by 282 · cited 1×
“Artificial generation of training samples for machine learning has been used for many years, for example, in the form of virtual examples for training support vector machines in supervised learning [7,8].”
MethodInductive Matrix Completion Based on Graph Neural NetworksPreprint
Zhang, M., & Chen, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.12058 · Cited by 265 · cited 1×
“Other practical problems where data samples can be incomplete include: computer vision systems where objects in the view field can be partially occluded [4]; recommendation systems built from the information gathered by different users where not all the users have fully completed their forms [5]; or medical datasets w…”
BackgroundSparsity and Morphological Diversity in Blind Source Separation
Bobin, J., Starck, J.-L., Fadili, J., & Moudden, Y. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.906256 · Cited by 209
A Novel Deep Learning Approach With Data Augmentation to Classify Motor Imagery Signals
Zhang, Z., Duan, F., Sole-Casals, J., Dinares-Ferran, J., Cichocki, A., Yang, Z., & Sun, Z. (2019) · IEEE Access · doi:10.1109/access.2019.2895133 · Cited by 193 · cited 2×
“Another application based on the same idea, but for deep neural network classifiers purposes, was proposed in [53].”
BackgroundSelf-citationUhlich, S., Porcu, M., Giron, F., Enenkl, M., Kemp, T., Takahashi, N., & Mitsufuji, Y. (2017) · 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2017.7952158 · Cited by 192 · cited 1×
“Data augmentation was also applied in machine applications other than image classification, for example, in music source separation [12].”
MethodTransduction with Matrix Completion: Three Birds with One Stone
Goldberg, A. B., Recht, B., Xu, J., Nowak, R. D., & Zhu, X. (2010) · Cited by 188
Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
Caiafa, C. F., & Cichocki, A. (2013) · Neural Computation · doi:10.1162/neco_a_00385 · Cited by 184
Self-citationLearning to Compose Domain-Specific Transformations for Data Augmentation
Ratner, A., Ehrenberg, H. R., Hussain, Z., Dunnmon, J., & Ré, C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.01643 · Cited by 180 · cited 1×
“Motivated by this, in [11], the authors proposed a method for automating data augmentation by learning a generative sequence model”
MethodHarari, Y. N. (2017) · Nature · doi:10.1038/550324a · Cited by 161 · cited 1×
“AI continues changing our daily lives contributing with extraordinary advances in scientific data analysis and new technological applications [2].”
BackgroundMultidimensional compressed sensing and their applications
Caiafa, C. F., & Cichocki, A. S. (2013) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1108 · Cited by 115 · cited 1×
“A Kronecker dictionary learning algorithm was introduce in [50] and later a variant with orthogonality constraints was proposed in [51].”
MethodSelf-citationRecurrent Neural Networks for Missing or Asynchronous Data
Bengio, Y., & Gingras, F. (1995) · neural information processing systems · Cited by 109
A Kernel Theory of Modern Data Augmentation
Dao, T., Gu, A., Ratner, A., Smith, V., De, C., & Ré, C. (2018) · PubMed · doi:10.48550/arxiv.1803.06084 · Cited by 94 · cited 1×
“In [17], the authors provide a general model of augmentation as a Markov process and show that, combined with a k-nearest neighbor (k-NN) rule, is asymptotically equivalent to a kernel classifier.”
BackgroundSelf-Organising Map for Data Imputation and Correction in Surveys
Fessant, F., & Midenet, S. (2002) · Neural Computing and Applications · doi:10.1007/s005210200002 · Cited by 90 · cited 1×
“Other imputation methods are based on machine learning ideas by estimating missing entries through the k-nearest neighbor [20], Self Organization Maps (SOM) [21], multilayer or recurrent neural networks [22,23], and others.”
MethodProcessing of missing data by neural networks
Śmieja, M., Struski, Ł., Tabor, J., Zieliński, B., & Spurek, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.07405 · Cited by 69 · cited 1×
“, a GMM, for every missing value, which is trained together with the NN weights [28].”
MethodLee, M. B., Kim, Y. H., & Park, K. R. (2019) · IEEE Access · doi:10.1109/access.2019.2937809 · Cited by 60 · cited 1×
“Other application domains where data augmentation improved the discriminative power of classifiers include: biometrics [13], fault diagnosis in industry [14], radio frequency fingerprint identification [15], synthetic aperture radar (SAR) target recognition [16], and others.”
BackgroundHandling missing data in large healthcare dataset: A case study of unknown trauma outcomes
Mirkes, E. M., Coats, T., Levesley, J., & Gorban, A. N. (2016) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2016.06.004 · Cited by 57 · cited 1×
“Other practical problems where data samples can be incomplete include: computer vision systems where objects in the view field can be partially occluded [4]; recommendation systems built from the information gathered by different users where not all the users have fully completed their forms [5]; or medical datasets w…”
BackgroundDinarès-Ferran, J., Ortner, R., Guger, C., & Solé-Casals, J. (2018) · Frontiers in Neuroscience · doi:10.3389/fnins.2018.00308 · Cited by 57 · cited 3×
“Using this method, authors in [52] were able to diminish the amount of acquired data for the calibration step in a BCI scenario while maintaining the performance.”
BackgroundMethodSelf-citationAkter, M. S., Islam, M. R., Iimura, Y., Sugano, H., Fukumori, K., Wang, D., Tanaka, T., & Cichocki, A. S. (2020) · Scientific Reports · doi:10.1038/s41598-020-62967-z · Cited by 54 · cited 3×
“The second method is the data augmentation in the feature domain [56].”
BackgroundMethodSelf-citationBrain-Computer Interface with Corrupted EEG Data: a Tensor Completion Approach
Solé‐Casals, J., Caiafa, C. F., Zhao, Q., & Cichocki, A. S. (2018) · Cognitive Computation · doi:10.1007/s12559-018-9574-9 · Cited by 46 · cited 2×
“cat/data-signal-processing/software/) in [57], which are based on the CP model of the whole tensor, such as the CP Weighted Optimization (CP-WOPT) [58],”
BackgroundMethodSelf-citationTraining Algorithm with Incomplete Data for Feed-Forward Neural Networks
Yoon, S.-Y., & Lee, S.-Y. (1999) · Neural Processing Letters · doi:10.1023/a:1018772122605 · Cited by 44 · cited 1×
“Other imputation methods are based on machine learning ideas by estimating missing entries through the k-nearest neighbor [20], Self Organization Maps (SOM) [21], multilayer or recurrent neural networks [22,23], and others.”
MethodActive Feature Acquisition with Supervised Matrix Completion
Huang, S.-J., Xu, M., Xie, M.-K., Sugiyama, M., Niu, G., & Chen, S. (2018) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3219819.3220084 · Cited by 44
Classification with Low Rank and Missing DataPreprint
Hazan, E., Livni, R., & Mansour, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1501.03273 · Cited by 37
Hu, T., Tang, T., & Chen, M. (2019) · IEEE Access · doi:10.1109/access.2019.2937838 · Cited by 36 · cited 1×
“Other application domains where data augmentation improved the discriminative power of classifiers include: biometrics [13], fault diagnosis in industry [14], radio frequency fingerprint identification [15], synthetic aperture radar (SAR) target recognition [16], and others.”
BackgroundData Augmentation for Radio Frequency Fingerprinting via Pseudo-Random Integration
Xie, F., Wen, H., Wu, J., Hou, W., Song, H., Zhang, T., Liao, R., & Jiang, Y. (2019) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2019.2907740 · Cited by 36 · cited 1×
“Other application domains where data augmentation improved the discriminative power of classifiers include: biometrics [13], fault diagnosis in industry [14], radio frequency fingerprint identification [15], synthetic aperture radar (SAR) target recognition [16], and others.”
BackgroundClassification of Epileptic IEEG Signals by CNN and Data Augmentation
Zhao, X., Solé‐Casals, J., Li, B., Huang, Z., Wang, A., Cao, J., Tanaka, T., & Zhao, Q. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9052948 · Cited by 30
Self-citationLittle, R. J. A. (2014) · Wiley eBooks · doi:10.1002/9781118445112.stat05051 · Cited by 24
A green’s function-based Bi-dimensional empirical mode decomposition
Al-Baddai, S., Al-Subari, K., Tomé, A. M., Solé‐Casals, J., & Lang, E. W. (2016) · Information Sciences · doi:10.1016/j.ins.2016.01.089 · Cited by 19
Self-citationDifferent Approaches to SCADA Data Completion in Water Networks
Martí-Puig, P., Martí-Sarri, A., & Serra-Serra, M. (2019) · Water · doi:10.3390/w11051023 · Cited by 8 · cited 3×
“The Mean Square Error (MSE) per sample was used as a measure to check the accuracy of the reconstructed data In [61], besides of taking advantage of the classical methods, an additional improvement was achieved by performing a tensorization of the data and applying tensor decomposition to recover missing data.”
BackgroundMethodActive Feature Acquisition with Supervised Matrix CompletionPreprint
Huang, S.-J., Xu, M., Xie, M.-K., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.05380 · Cited by 8
Al-Baddai, S., Martí-Puig, P., Gallego-Jutglà, E., Al-Subari, K., Tomé, A. M., Ludwig, B., Lang, E. W., & Solé‐Casals, J. (2019) · Soft Computing · doi:10.1007/s00500-019-04150-9 · Cited by 6 · cited 2×
“The method used in [55] is depicted in Figure 5, in which we can see that the image is decomposed by means of the GiT-BEMD algorithm, the first IMF is discarded, the image is later reconstructed without the contribution of the noise and used to feed a classifier.”
MethodSelf-citationOrthogonal tensor dictionary learning for accelerated dynamic MRI
Huang, J., Zhou, G., & Yu, G. (2019) · Medical & Biological Engineering & Computing · doi:10.1007/s11517-019-02005-x · Cited by 5 · cited 1×
“A Kronecker dictionary learning algorithm was introduce in [50] and later a variant with orthogonality constraints was proposed in [51].”
MethodDouble Tensor-Decomposition for SCADA Data Completion in Water Networks
Martí-Puig, P., Martí-Sarri, A., & Serra-Serra, M. (2019) · Water · doi:10.3390/w12010080 · Cited by 3 · cited 3×
“In [62], a new approach was developed that improved the performance of the previous method by performing two concatenated tensor decompositions.”
BackgroundMethod
Research works printed but not linked: 4
- 1. Goodfellow, I.; Bengio, Y.; Courville, A. Deep Learning; MIT Press: Cambridge, MA, USA, 2016.
- 68. Tomasi, C.; Manduchi, R. Bilateral filtering for gray and color images. In Proceedings of the Sixth International Conference on Computer Vision, Washington, DC, USA, 4-7 January 1998; pp. 839-846.
- 69. Gonzalez, R.C.; Woods, R.E. Digital Image Processing; Prentice Hall: Upper Saddle River, NJ, USA, 2008.
- 70. Tukey, J.W. Exploratory Data Analysis; Addison-Wesley: Reading, MA, USA, 1977.
Cited by
Machine Learning for Perovskite Solar Cells and Component Materials: Key Technologies and Prospects
Liu, Y., Tan, X., Liang, J., Han, H., Xiang, P., & Yan, W. (2023) · Advanced Functional Materials · doi:10.1002/adfm.202214271 · Cited by 174
A Comprehensive Survey of Machine Learning Methodologies with Emphasis in Water Resources Management
Drogkoula, M., Kokkinos, K., & Samaras, N. (2023) · Applied Sciences · doi:10.3390/app132212147 · Cited by 209
“Our findings are depicted in the PRISMA diagram (Figure 3).”
MethodA Comparison of Machine Learning Methods to Forecast Tropospheric Ozone Levels in Delhi
Juarez, E. K., & Petersen, M. (2021) · Atmosphere · doi:10.3390/atmos13010046 · Cited by 64
“Additional preprocessing could also compensate for missing data with decomposition methods [43].”
MethodTower crane safety technologies: A synthesis of academic research and industry insights
Ali, A. H., Zayed, T. M., Wang, R. D., & Kit, M. Y. S. (2024) · Automation in Construction · doi:10.1016/j.autcon.2024.105429 · Cited by 58
Machine Learning Methods with Noisy, Incomplete or Small Datasets
Caiafa, C. F., Sun, Z., Tanaka, T., Martí-Puig, P., & Solé‐Casals, J. (2021) · Applied Sciences · doi:10.3390/app11094132 · Cited by 39
“In [1], the EMD method was applied to remove noise in face images, thus improving the classification accuracy of a machine learning classifier.”
BackgroundMethodSelf-citation
Metadata
- Authors
- Caiafa, C. F., Solé-Casals, J., Marti-Puig, P., Zhe, S., & Tanaka, T.
- Affiliations
- Consejo Nacional de Investigaciones Científicas y Técnicas (AR)
- Data and Signal Processing Research Group, University of Vic-Central University of Catalonia, 08500 Vic, Catalonia, Spain
- Computational Engineering Applications Unit, Head Office for Information Systems and Cybersecurity, RIKEN, Wako-Shi 351-0198, Japan
- Tokyo University of Agriculture and Technology (JP)
- Corresponding author
- Caiafa, Cesar Federico
- Venue
- Applied Sciences
- Publisher
- MDPI AG
- Published
- 2020-11-27
- Volume
- 10
- Issue
- 23
- Pages
- 8481
- ISSN
- 2076-3417 (ISSN-L)
- OpenAlex
- W3109443741
- Cited by
- 33
- References
- 66
- Citations by year
- 2026: 4 · 2025: 9 · 2024: 5 · 2023: 10 · 2022: 1 · 2021: 4
- FWCI
- 1.47
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Applied Sciences (publishedVersion, cc-by)
- LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) (submittedVersion, cc-by-nc-sa)
- CONICET Digital (CONICET) (submittedVersion, cc-by-nc-sa)
- Funders
- Japan Science and Technology Agency (JPMJCR1784)
- University of Vic (R0947)
- European Cooperation in Science and Technology (CA18106)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Imbalanced Data Classification Techniques
- Keywords
- signal decomposition, missing data imputation, noisy data classification, data augmentation, small datasets, missing data, brain-computer interface, epileptic EEG, face recognition, face verification, water networks
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.