Novel techniques for improving NNetEn entropy calculation for short and noisy time series
Damghan University(达姆甘大学);Petrozavodsk State University(彼得罗扎沃茨克国立大学);Kuwait College of Science and Technology(科威特科学与技术学院);Vels Institute of Sciences, Technology, and Advanced Studies(韦尔斯科学技术与高等研究院);Universiti Malaysia Perlis(马来西亚玻璃市大学);Qatar University(卡塔尔大学)
Hanif Heidari, Andrei Velichko, Murugappan Murugappan, Muhammad E. H. Chowdhury
Entropy is a fundamental concept in the field of information theory. During measurement, conventional entropy measures are susceptible to length and amplitude changes in time series. A new entropy metric, neural network entropy (NNetEn), has been developed to overcome these limitations. NNetEn entropy is computed using a modified LogNNet neural network classification model. The algorithm contains a reservoir matrix of N=19625 elements that must be filled with the given data. The contribution of this paper is threefold. Firstly, this work investigates different methods of filling the reservoir with time series (signal) elements. The reservoir filling method determines the accuracy of the entropy estimation by convolution of the study time series and LogNNet test data. The present study proposes 6 methods for filling the reservoir for time series. Two of them (Method 3 and Method 6) employ the novel approach of stretching the time series to create intermediate elements that complement it, but do not change its dynamics. The most reliable methods for short time series are Method 3 and Method 5. The second part of the study examines the influence of noise and constant bias on entropy values. Our study examines three different time series data types (chaotic, periodic, and binary) with different dynamic properties, Signal to Noise Ratio (SNR), and offsets. The NNetEn entropy calculation errors are less than 10% when SNR is greater than 30 dB, and entropy decreases with an increase in the bias component. The third part of the article analyzes real-time biosignal EEG data collected from emotion recognition experiments. The NNetEn measures show robustness under low-amplitude noise using various filters. Thus, NNetEn measures entropy effectively when applied to real-world environments with ambient noise, white noise, and 1/f noise.
Improving clustering quality evaluation in noisy Gaussian mixtures
School of Computer Science and Electronic Engineering, University of Essex(埃塞克斯大学计算机科学与电子工程学院);Département d’informatique, Université du Québec à Montréal(魁北克大学蒙特利尔分校计算机科学系);Mila - Quebec AI Institute(魁北克AI研究院)
NoiLIn: Improving Adversarial Training and Correcting Stereotype of Noisy Labels
RIKEN Center for Advanced Intelligence Project(理化学研究所先进智能项目中心);National University of Singapore(新加坡国立大学);Hong Kong Baptist University(香港浸会大学);University of Sydney(悉尼大学);Shandong University(山东大学);the University of Tokyo(东京大学)
TaxDistill: Improving Metagenomic Taxonomic Annotation via Distilled Genomic Foundation Models
National Genomics Data Center, China National Center for Bioinformation(中国生物信息中心国家基因组数据中心);Beijing Key Laboratory of Intelligent Governance and Application of Biological Big Data, China National Center for Bioinformation(北京生物大数据智能治理与应用重点实验室,中国生物信息中心);Beijing Institute of Genomics, Chinese Academy of Sciences(北京基因组研究所,中国科学院);University of Chinese Academy of Sciences(中国科学院大学)
A Hybrid Approach of Transfer Learning and Physics-Informed Modeling: Improving Dissolved Oxygen Concentration Prediction in an Industrial Wastewater Treatment Plant
To Smooth or Not? When Label Smoothing Meets Noisy Labels
University of California, Santa Cruz(加州大学圣克鲁兹分校);Brown University(布朗大学);The University of Sydney(悉尼大学);RIKEN AIP(理化学研究所人工智能研究中心);University of Tokyo(东京大学)
Modelling Data Dispersion Degree in Automatic Robust Estimation for Multivariate Gaussian Mixture Models with an Application to Noisy Speech Processing
Probabilistic Random Forest: A machine learning algorithm for noisy datasets
Tel-Aviv University(特拉维夫大学)
机器学习(ML)算法在天文数据分析中变得越来越重要。然而,由于大多数ML算法的设计没有考虑到数据的不确定性,基于ML的研究主要限于高信噪比的数据。如此高质量的天文数据集并不常见。在这项工作中,我们修改了长期建立的随机森林(RF)算法,以考虑测量中的不确定性(即,特征)以及在所分配的类中(即,标签)。为此,概率随机森林(Probably Random Forest,PRF)算法将特征和标签视为概率分布函数,而不是确定性数量。我们进行了各种实验,我们注入不同类型的噪声的数据集,并比较的准确性的PRF的RF。PRF在所有情况下都优于RF,运行时间适度增加。我们发现,在噪声特征的情况下,分类精度提高了10%,在噪声标签的情况下,提高了30%。与干净的数据集相比,对于具有多达45%错误分类对象的数据集,PRF准确度降低了不到5%。除了提高噪声数据集的预测精度外,PRF还能自然地处理数据中的缺失值,并且在应用于训练集和测试集中具有不同噪声特征的数据集时,其性能优于RF,这表明它可以用于迁移学习。