A Highly Accurate Dysphonia Detection System Using Linear Discriminant Analysis

The recognition of pathological voice is considered a difficult task for speech analysis.Moreover,otolaryngologists needed to rely on oral communication with patients to discover traces of voice pathologies like dysphonia that are caused by voice alteration of vocal folds and their accuracy is between 60%–70%.To enhance detection accuracy and reduce processing speed of dysphonia detection,a novel approach is proposed in this paper.We have leveraged Linear Discriminant Analysis(LDA)to train multiple Machine Learning(ML)models for dysphonia detection.Several ML models are utilized like Support Vector Machine(SVM),Logistic Regression,and K-nearest neighbor(K-NN)to predict the voice pathologies based on features like Mel-Frequency Cepstral Coefficients(MFCC),Fundamental Frequency(F0),Shimmer(%),Jitter(%),and Harmonic to Noise Ratio(HNR).The experiments were performed using Saarbrucken Voice Data-base(SVD)and a privately collected dataset.The K-fold cross-validation approach was incorporated to increase the robustness and stability of the ML models.According to the experimental results,our proposed approach has a 70%increase in processing speed over Principal Component Analysis(PCA)and performs remarkably well with a recognition accuracy of 95.24%on the SVD dataset surpassing the previous best accuracy of 82.37%.In the case of the private dataset,our proposed method achieved an accuracy rate of 93.37%.It can be an effective non-invasive method to detect dysphonia.

Direct linear discriminant analysis based on column pivoting QR decomposition and economic SVD

A direct linear discriminant analysis algorithm based on economic singular value decomposition （DLDA/ESVD） is proposed to address the computationally complex problem of the conventional DLDA algorithm, which directly uses ESVD to reduce dimension and extract eigenvectors corresponding to nonzero eigenvalues. Then a DLDA algorithm based on column pivoting orthogonal triangular （QR） decomposition and ESVD （DLDA/QR-ESVD） is proposed to improve the performance of the DLDA/ESVD algorithm by processing a high-dimensional low rank matrix, which uses column pivoting QR decomposition to reduce dimension and ESVD to extract eigenvectors corresponding to nonzero eigenvalues. The experimental results on ORL, FERET and YALE face databases show that the proposed two algorithms can achieve almost the same performance and outperform the conventional DLDA algorithm in terms of computational complexity and training time. In addition, the experimental results on random data matrices show that the DLDA/QR-ESVD algorithm achieves better performance than the DLDA/ESVD algorithm by processing high-dimensional low rank matrices.

Balanced multiple weighted linear discriminant analysis and its application to visual process monitoring

Visual process monitoring is important in complex chemical processes.To address the high state separation of industrial data,we propose a new criterion for feature extraction called balanced multiple weighted linear discriminant analysis(BMWLDA).Then,we combine BMWLDA with self-organizing map(SOM)for visual monitoring of industrial operation processes.BMWLDA can extract the discriminative feature vectors from the original industrial data and maximally separate industrial operation states in the space spanned by these discriminative feature vectors.When the discriminative feature vectors are used as the input to SOM,the training result of SOM can differentiate industrial operation states clearly.This function improves the performance of visual monitoring.Continuous stirred tank reactor is used to verify that the class separation performance of BMWLDA is more effective than that of traditional linear discriminant analysis,approximate pairwise accuracy criterion,max–min distance analysis,maximum margin criterion,and local Fisher discriminant analysis.In addition,the method that combines BMWLDA with SOM can effectively perform visual process monitoring in real time.

Emotion recognition of Uyghur speech using uncertain linear discriminant analysis

To achieve efficient a d compact low-dimensional features for speech emotion recognition,a novel featurereduction method using uncertain linear discriminant analysis is proposed.Using the same principles as for conventional linear discriminant analysis(LDA),uncertainties of the noisy or distorted input data ae employed in order to estimate maximaiy discriminant directions.The effectiveness of the proposed uncertain LDA(ULDA)is demonstrated in the Uyghur speech emotion recognition task.The emotional features of Uyghur speech,especially,the fundamental fequency and formant,a e analyzed in the collected emotional data.Then,ULDA is employed in dimensionality reduction of emotional features and better performance is achieved compared with other dimensionality reduction techniques.The speech emotion recognition of Uyghur is implemented by feeding the low-dimensional data to support vector machine(SVM)based on the proposed ULDA.The experimental results show that when employing a appropriate uncertainty estimation algorithm,uncertain LDA outperforms the conveetional LDA counterpart on Uyghur speech emotion recognition.

Linear Discriminant Analysis and Kernel Vector Quantization for Mandarin Digits Recognition

Linear discriminant analysis and kernel vector quantization are integrated into vector quantization based speech recognition system for improving the recognition accuracy of Mandarin digits. These techniques increase the class separability and optimize the clustering procedure. Speaker-dependent (SD) and speaker-independent (SI) experiments are performed to evaluate the performance of the proposed method. The experiment results show that the proposed method is capable of reaching the word error rate of 3.76% in SD case and 6.60 % in SI case. Such a system can be suitable for being embedded in personal digital assistant(PDA), mobile phone and so on to perform voice controlling such as digit dialing, calculating, etc.

Unsupervised Linear Discriminant Analysis

An algorithm for unsupervised linear discriminant analysis was presented. Optimal unsupervised discriminant vectors are obtained through maximizing covariance of all samples and minimizing covariance of local k-nearest neighbor samples. The experimental results show our algorithm is effective.

Incremental Linear Discriminant Analysis Dimensionality Reduction and 3D Dynamic Hierarchical Clustering WSNs

Optimizing the sensor energy is one of the most important concern in Three-Dimensional(3D)Wireless Sensor Networks(WSNs).An improved dynamic hierarchical clustering has been used in previous works that computes optimum clusters count and thus,the total consumption of energy is optimal.However,the computational complexity will be increased due to data dimension,and this leads to increase in delay in network data transmission and reception.For solving the above-mentioned issues,an efficient dimensionality reduction model based on Incremental Linear Discriminant Analysis(ILDA)is proposed for 3D hierarchical clustering WSNs.The major objective of the proposed work is to design an efficient dimensionality reduction and energy efficient clustering algorithm in 3D hierarchical clustering WSNs.This ILDA approach consists of four major steps such as data dimension reduction,distance similarity index introduction,double cluster head technique and node dormancy approach.This protocol differs from normal hierarchical routing protocols in formulating the Cluster Head(CH)selection technique.According to node’s position and residual energy,optimal cluster-head function is generated,and every CH is elected by this formulation.For a 3D spherical structure,under the same network condition,the performance of the proposed ILDA with Improved Dynamic Hierarchical Clustering(IDHC)is compared with Distributed Energy-Efficient Clustering(DEEC),Hybrid Energy Efficient Distributed(HEED)and Stable Election Protocol(SEP)techniques.It is observed that the proposed ILDA based IDHC approach provides better results with respect to Throughput,network residual energy,network lifetime and first node death round.

A Comparison of Two Linear Discriminant Analysis Methods That Use Block Monotone Missing Training Data

We revisit a comparison of two discriminant analysis procedures, namely the linear combination classifier of Chung and Han (2000) and the maximum likelihood estimation substitution classifier for the problem of classifying unlabeled multivariate normal observations with equal covariance matrices into one of two classes. Both classes have matching block monotone missing training data. Here, we demonstrate that for intra-class covariance structures with at least small correlation among the variables with missing data and the variables without block missing data, the maximum likelihood estimation substitution classifier outperforms the Chung and Han (2000) classifier regardless of the percent of missing observations. Specifically, we examine the differences in the estimated expected error rates for these classifiers using a Monte Carlo simulation, and we compare the two classifiers using two real data sets with monotone missing data via parametric bootstrap simulations. Our results contradict the conclusions of Chung and Han (2000) that their linear combination classifier is superior to the MLE classifier for block monotone missing multivariate normal data.

A positioning method for maize seed laser-cutting slice using linear discriminant analysis based on isometric distance measurement

It is necessary that vision system should aid laser-cutting manipulator to position the specified part of each maize seed for getting the slice breeding genotype analysis with high throughput.Each of trivial maize seeds should be recognized and positioned in a certain posture.Correlation area ratio(CAR)is defined as the metric of pixel attribute.A large template of round mask is adopted for seed morphological detection to measure the CAR values.We get the feature points extracted from the seed image through the isometric mapping operation.Iterative processes of linear discriminant analysis search the morphological data space to learn non-linear transformations to the space where data are linearly separable.Linear discriminant analysis utilizes the data directional distribution to position the major axis and distinguish different parts of maize seed.The labeling partition operation is applied for picking out the scattered pieces to be finely clustered.Without denoising process,the feature region could be recognized with accuracies by the synthetical methods.Extensive experiments on a large amount of seeds demonstrate the effectiveness of proposed methods.

Kernel Model Applied in Kernel Direct Discriminant Analysis for the Recognition of Face with Nonlinear Variations

A kernel-based discriminant analysis method called kernel direct discriminant analysis is employed, which combines the merit of direct linear discriminant analysis with that of kernel trick. In order to demonstrate its better robustness to the complex and nonlinear variations of real face images, such as illumination, facial expression, scale and pose variations, experiments are carried out on the Olivetti Research Laboratory, Yale and self-built face databases. The results indicate that in contrast to kernel principal component analysis and kernel linear discriminant analysis, the method can achieve lower （7%） error rate using only a very small set of features. Furthermore, a new corrected kernel model is proposed to improve the recognition performance. Experimental results confirm its superiority （1% in terms of recognition rate） to other polynomial kernel models.

Moving-window bis-correlation coefficients method for visible and near-infrared spectral discriminant analysis with applications

The moving window bis corelation coefficients(MW BiCC)was proposed and employed for the discriminant analysis of transgenic sugarcane leaves and B-thalassemia with visible and near-infrared(Vis NIR)spectroscopy.The well-performed moving window principal component analysis linear discriminant analysis(MWPCA-LDA)was also conducted for comparison.A total of 306 transgenic(positive)and 150 nont ransgenic(negative)leave samples of sugarcane were collected and divided to calibration,prediction,and validation.The diffuse reflection spectra were corected using Savitzky-Golay(SG)smoothing with first-order derivative(d=1),third-degree polynomial(p=3)and 25 smpothing points(m=25).The selected waveband was 736-1054nm with MW-BiCC,and the positive and negative validation recognition rates(V_REC^(+),VREC^(-))were 100%,98.0%,which achieved the same effect as MWPCA-LDA.Another example,the 93 B-thalassemia(positive)and 148 nonthalassemia(negative)of human hemolytic samples were colloctod.The transmission spectra were corrected using SG smoothing withd=1,p=3 and m=53.Using M W-BiCC,many best wavebands were selected(e.g.,1116-1146,17941848 and 22842342nm).The V_REC^(+)and V_REC^(-)were both 100%,which achieved the same effect as MW-PCA-LDA.Importantly,the BICC only required ca lculating correlation cofficients between the spectrum of prediction sample and the average spectra of two types of calibration samples.Thus,BiCC was very simple in algorithm,and expected to obtain more applications.The results first confirmed the feasibility of distinguishing B-thalassemia and normal control samples by NIR spectroscopy,and provided a promising simple tool for large population thalassemia screening.

Face Recognition Using Kernel Discriminant Analysis

Linear discrimiant analysis (LDA) has been used in face recognition. But it is difficult to handle the high nonlinear problems, such as changes of large viewpoint and illumination. In order to overcome these problems, kernel discriminant analysis for face recognition is presented. This approach adopts the kernel functions to replace the dot products of nonlinear mapping in the high dimensional feature space, and then the nonlinear problem can be solved in the input space conveniently without explicit mapping. Two face databases are given.

Unveiling the Predictive Capabilities of Machine Learning in Air Quality Data Analysis: A Comparative Evaluation of Different Regression Models

Air quality is a critical concern for public health and environmental regulation. The Air Quality Index (AQI), a widely adopted index by the US Environmental Protection Agency (EPA), serves as a crucial metric for reporting site-specific air pollution levels. Accurately predicting air quality, as measured by the AQI, is essential for effective air pollution management. In this study, we aim to identify the most reliable regression model among linear discriminant analysis (LDA), quadratic discriminant analysis (QDA), logistic regression, and K-nearest neighbors (KNN). We conducted four different regression analyses using a machine learning approach to determine the model with the best performance. By employing the confusion matrix and error percentages, we selected the best-performing model, which yielded prediction error rates of 22%, 23%, 20%, and 27%, respectively, for LDA, QDA, logistic regression, and KNN models. The logistic regression model outperformed the other three statistical models in predicting AQI. Understanding these models' performance can help address an existing gap in air quality research and contribute to the integration of regression techniques in AQI studies, ultimately benefiting stakeholders like environmental regulators, healthcare professionals, urban planners, and researchers.

Using discriminant analysis to detect intrusions in external communication for self-driving vehicles

Security systems are a necessity for the deployment of smart vehicles in our society. Security in vehicular ad hoe networks is crucial to the reliable exchange of information and control data. In this paper, we propose an intelligent Intrusion Detection System （IDS） to protect the external communication of self-driving and semi self-driving vehicles. This technology has the ability to detect Denial of Service （DOS） and black hole attacks on vehicular ad hoe networks （VANETs）. The advantage of the proposed IDS over existing security systems is that it detects attacks before they causes significant damage. The intrusion prediction technique is based on Linear Discriminant Analysis （LDA） and Quadratic Diseriminant Analysis （QDA） which are used to predict attacks based on observed vehicle behavior. We perform simulations using Network Simulator 2 to demonstrate that the IDS achieves a low rate of false alarms and high accuracy in detection.

A New Extended BIC and Sequential Lasso Regression Analysis and Their Application in Classification

In this paper, firstly, we propose a new method for choosing regularization parameter λ for lasso regression, which differs from traditional method such as multifold cross-validation, our new method gives the maximum value of parameter λ directly. Secondly, by considering another prior form over model space in the Bayes approach, we propose a new extended Bayes information criterion family, and under some mild condition, our new EBIC (NEBIC) is shown to be consistent. Then we apply our new method to choose parameter for sequential lasso regression which selects features by sequentially solving partially penalized least squares problems where the features selected in earlier steps are not penalized in the subsequent steps. Then sequential lasso uses NEBIC as the stopping rule. Finally, we apply our algorithm to identify the nonzero entries of precision matrix for high-dimensional linear discrimination analysis. Simulation results demonstrate that our algorithm has a lower misclassification rate and less computation time than its competing methods under considerations.

Modified algorithm of principal component analysis for face recognition

In principal component analysis （PCA） algorithms for face recognition, to reduce the influence of the eigenvectors which relate to the changes of the illumination on abstract features, a modified PCA （MPCA） algorithm is proposed. The method is based on the idea of reducing the influence of the eigenvectors associated with the large eigenvalues by normalizing the feature vector element by its corresponding standard deviation. The Yale face database and Yale face database B are used to verify the method. The simulation results show that, for front face and even under the condition of limited variation in the facial poses, the proposed method results in better performance than the conventional PCA and linear discriminant analysis （LDA） approaches, and the computational cost remains the same as that of the PCA, and much less than that of the LDA.

Machine Learning-based USD/PKR Exchange Rate Forecasting Using Sentiment Analysis of Twitter Data

This study proposes an approach based on machine learning to forecast currency exchange rates by applying sentiment analysis to messages on Twitter(called tweets).A dataset of the exchange rates between the United States Dollar(USD)and the Pakistani Rupee(PKR)was formed by collecting information from a forex website as well as a collection of tweets from the business community in Pakistan containing finance-related words.The dataset was collected in raw form,and was subjected to natural language processing by way of data preprocessing.Response variable labeling was then applied to the standardized dataset,where the response variables were divided into two classes:“1”indicated an increase in the exchange rate and“−1”indicated a decrease in it.To better represent the dataset,we used linear discriminant analysis and principal component analysis to visualize the data in three-dimensional vector space.Clusters that were obtained using a sampling approach were then used for data optimization.Five machine learning classifiers—the simple logistic classifier,the random forest,bagging,naïve Bayes,and the support vector machine—were applied to the optimized dataset.The results show that the simple logistic classifier yielded the highest accuracy of 82.14%for the USD and the PKR exchange rates forecasting.

Texture Analysis and Characteristic Identification About Plaque Tissues of IVUS

Intravascular ultrasound can provide clear real-time cross-sectional images,including lumen and plaque.In practice,to identify the plaques tissues in different pathological changes is very important.However,the grayscale differences of them are not so apparent.In this paper a new textural characteristic space vector was formed by the combination of Co-occurrence Matrix and fraction methods.The vector was projected to the new characteristic space after multiplied by a projective matrix which can best classify those plaques according to the Fisher linear discriminant.Then the classification was completed in the new vector space.Experimental results found that the veracity of this classification could reach up to 88%,which would be an accessorial tool for doctors to identify each plaque.

Statistical Analysis with Dingo Optimizer Enabled Routing for Wireless Sensor Networks

Security is a vital parameter to conserve energy in wireless sensor networks(WSN).Trust management in the WSN is a crucial process as trust is utilized when collaboration is important for accomplishing trustworthy data transmission.But the available routing techniques do not involve security in the design of routing techniques.This study develops a novel statistical analysis with dingo optimizer enabled reliable routing scheme(SADO-RRS)for WSN.The proposed SADO-RRS technique aims to detect the existence of attacks and optimal routes in WSN.In addition,the presented SADORRS technique derives a new statistics based linear discriminant analysis(LDA)for attack detection,Moreover,a trust based dingo optimizer(TBDO)algorithm is applied for optimal route selection in the WSN and accomplishes secure data transmission in WSN.Besides,the TBDO algorithm involves the derivation of the fitness function involving different input variables of WSN.For demonstrating the enhanced outcomes of the SADO-RRS technique,a wide range of simulations was carried out and the outcomes demonstrated the enhanced outcomes of the SADO-RRS technique.

An Optimization Criterion for Generalized Marginal Fisher Analysis on Undersampled Problems

Marginal Fisher analysis （MFA） not only aims to maintain the original relations of neighboring data points of the same class but also wants to keep away neighboring data points of the different classes.MFA can effectively overcome the limitation of linear discriminant analysis （LDA） due to data distribution assumption and available projection directions.However,MFA confronts the undersampled problems.Generalized marginal Fisher analysis （GMFA） based on a new optimization criterion is presented,which is applicable to the undersampled problems.The solutions to the proposed criterion for GMFA are derived,which can be characterized in a closed form.Among the solutions,two specific algorithms,namely,normal MFA （NMFA） and orthogonal MFA （OMFA）,are studied,and the methods to implement NMFA and OMFA are proposed.A comparative study on the undersampled problem of face recognition is conducted to evaluate NMFA and OMFA in terms of classification accuracy,which demonstrates the effectiveness of the proposed algorithms.