Search

With the increasing demand for high-resolution images, handling high-dimensional image data has become a key aspect of intelligence algorithms. One effective approach is to preserve the high-dimensional manifold structure of the data and find the accurate mappings in a lower-dimensional space. However, various non-sparse, high-energy occlusions in real-world images can lead to erroneous calculations of sample relationships, invalidating the existing distance-based manifold dimensionality reduction techniques. Many types of noise are difficult to capture and filter in the original domain but can be effectively separated in the frequency domain. Inspired by this idea, a novel approach is proposed in this paper, which obtains the high-dimensional manifold structure according to the correlationships between data points in the frequency domain and accurately maps it to a lower-dimensional space, named Frequency domain-based Manifold Dimensionality Reduction (FMDR). In FMDR, samples are first transformed into frequency domains. Then, interference is filtered based on the distribution in the frequency domain, thereby emphasizing discriminative features. Subsequently, an innovative kernel function is proposed for measuring the similarities between samples according to the correlationships in the frequency domain. With the assistance of these correlationships, a graph structure can be constructed and utilized to find the mapping in a low-dimensional space. To further demonstrate the effectiveness of the proposed algorithm, FMDR is employed for the semi-supervised classification problems in this paper. Experiments using public image datasets indicate that, compared to baseline algorithms and state-of-the-art methods, our approach achieves superior recognition performance. Even with very few labeled data, the advantages of FMDR are still maintained. The effectiveness of FMDR in dimensionality reduction and feature extraction of images makes it widely applicable in fields such as image processing and image recognition. [ABSTRACT FROM AUTHOR]

With the rapid advancement of remote-sensing technology, the spectral information obtained from hyperspectral remote-sensing imagery has become increasingly rich, facilitating detailed spectral analysis of Earth's surface objects. However, the abundance of spectral information presents certain challenges for data processing, such as the "curse of dimensionality" leading to the "Hughes phenomenon", "strong correlation" due to high resolution, and "nonlinear characteristics" caused by varying surface reflectances. Consequently, dimensionality reduction of hyperspectral data emerges as a critical task. This paper begins by elucidating the principles and processes of hyperspectral image dimensionality reduction based on manifold theory and learning methods, in light of the nonlinear structures and features present in hyperspectral remote-sensing data, and formulates a dimensionality reduction process based on manifold learning. Subsequently, this study explores the capabilities of feature extraction and low-dimensional embedding for hyperspectral imagery using manifold learning approaches, including principal components analysis (PCA), multidimensional scaling (MDS), and linear discriminant analysis (LDA) for linear methods; and isometric mapping (Isomap), locally linear embedding (LLE), Laplacian eigenmaps (LE), Hessian locally linear embedding (HLLE), local tangent space alignment (LTSA), and maximum variance unfolding (MVU) for nonlinear methods, based on the Indian Pines hyperspectral dataset and Pavia University dataset. Furthermore, the paper investigates the optimal neighborhood computation time and overall algorithm runtime for feature extraction in hyperspectral imagery, varying by the choice of neighborhood k and intrinsic dimensionality d values across different manifold learning methods. Based on the outcomes of feature extraction, the study examines the classification experiments of various manifold learning methods, comparing and analyzing the variations in classification accuracy and Kappa coefficient with different selections of neighborhood k and intrinsic dimensionality d values. Building on this, the impact of selecting different bandwidths t for the Gaussian kernel in the LE method and different Lagrange multipliers λ for the MVU method on classification accuracy, given varying choices of neighborhood k and intrinsic dimensionality d, is explored. Through these experiments, the paper investigates the capability and effectiveness of different manifold learning methods in feature extraction and dimensionality reduction within hyperspectral imagery, as influenced by the selection of neighborhood k and intrinsic dimensionality d values, identifying the optimal neighborhood k and intrinsic dimensionality d value for each method. A comparison of classification accuracies reveals that the LTSA method yields superior classification results compared to other manifold learning approaches. The study demonstrates the advantages of manifold learning methods in processing hyperspectral image data, providing an experimental reference for subsequent research on hyperspectral image dimensionality reduction using manifold learning methods. [ABSTRACT FROM AUTHOR]

Exploring a dimensionality reduction model that can adeptly eliminate outliers and select the appropriate number of clusters is of profound theoretical and practical importance. Additionally, the interpretability of these models presents a persistent challenge. This paper proposes two innovative dimensionality reduction models based on integer programming (DRMBIP). These models assess compactness through the correlation of each indicator with its class center, while separation is evaluated by the correlation between different class centers. In contrast to DRMBIP-p, the DRMBIP-v considers the threshold parameter as a variable aiming to optimally balances both compactness and separation. This study, getting data from the Global Health Observatory (GHO), investigates 141 indicators that influence life expectancy. The findings reveal that DRMBIP-p effectively reduces the dimensionality of data, ensuring compactness. It also maintains compatibility with other models. Additionally, DRMBIP-v finds the optimal result, showing exceptional separation. Visualization of the results reveals that all classes have a high compactness. The DRMBIP-p requires the input of the correlation threshold parameter, which plays a pivotal role in the effectiveness of the final dimensionality reduction results. In the DRMBIP-v, modifying the threshold parameter to variable potentially emphasizes either separation or compactness. This necessitates an artificial adjustment to the overflow component within the objective function. The DRMBIP presented in this paper is adept at uncovering the primary geometric structures within high-dimensional indicators. Validated by life expectancy data, this paper demonstrates potential to assist data miners with the reduction of data dimensions. To our knowledge, this is the first time that integer programming has been used to build a dimensionality reduction model with indicator filtering. It not only has applications in life expectancy, but also has obvious advantages in data mining work that requires precise class centers. [ABSTRACT FROM AUTHOR]

Featured Application: The solutions presented in the work, based on the use of a multi-sensor matrix and the analysis of multidimensional data, can be used in practice for assessing the mycological risk of buildings, detecting the presence of mold in rooms and evaluating the risk of the sick building syndrome. Paper is in the scope of moisture-related problems which are connected with mold threat in buildings, sick building syndrome (SBS) as well as application of electronic nose for evaluation of different building envelopes and building materials. The machine learning methods used to analyze multidimensional signals are important components of the e-nose system. These multidimensional signals are derived from a gas sensor array, which, together with instrumentation, constitute the hardware of this system. The accuracy of the classification and the correctness of the classification of mold threat in buildings largely depend on the appropriate selection of the data analysis methods used. This paper proposes a method of data analysis using Principal Component Analysis, metric multidimensional scaling and Kohonen self-organizing map, which are unsupervised machine learning methods, to visualize and reduce the dimensionality of the data. For the final classification of observations and the identification of datasets from gas sensor arrays analyzing air from buildings threatened by mold, as well as from other reference materials, supervised learning methods such as hierarchical cluster analysis, MLP neural network and the random forest method were used. [ABSTRACT FROM AUTHOR]

Delay in data transmission is one of the key performance indicators (KPIs) of a network. The planning and design value of delay in network management is of crucial importance for the optimal allocation of network resources and their performance focuses. To create optimal solutions, predictive models, which are currently most often based on machine learning (ML), are used. This paper aims to investigate the training, testing and selection of the best predictive delay model for a VoIP service in a Long Term Evolution (LTE) network using three ML techniques: Multilayer Perceptron (MLP), Support Vector Machines (SVM) and k-Nearest Neighbors (k-NN). The space of model input variables is optimized by dimensionality reduction techniques: RReliefF algorithm, Backward selection via the recursive feature elimination algorithm and the Pareto 80/20 rule. A three-segment road in the geo-space between the cities of Banja Luka (BL) and Doboj (Db) in the Republic of Srpska (RS), Bosnia and Herzegovina (BiH), covered by the cellular network (LTE) of the M:tel BL operator was chosen for the case study. The results show that the k-NN model has been selected as the best solution in all three optimization approaches. For the RReliefF optimization algorithm, the best model has six inputs and the minimum relative error (RE) RE = 0.109. For the Backward selection via the recursive feature elimination algorithm, the best model has four inputs and RE = 0.041. Finally, for the Pareto 80/20 rule, the best model has 11 inputs and RE = 0.049. The comparative analysis of the results concludes that, according to observed criteria for the selection of the final model, the best solution is an approach to optimizing the number of predictors based on the Backward selection via the recursive feature elimination algorithm. [ABSTRACT FROM AUTHOR]

The fault detection time identified by relying on the over-voltage criterion of zero-sequence voltage often lags behind the actual occurrence time of ground faults, which may cause fault protection methods based on transient quantity principles to miss fault characteristics and lose their protection capability. To accurately estimate the time of occurrence of a single-phase-to-ground fault, this paper proposes a two-step dimensionality reduction algorithm for estimating the time of occurrence of a single-phase-to-ground fault in a distribution network. This algorithm constructs a filter based on Empirical Mode Decomposition (EMD) to establish a high-dimensional feature dataset based on the zero-sequence current of all feeders. After Principal Component Analysis and Hilbert Mapping Algorithm, the high-dimensional data are reduced to two dimensions to construct a two-dimensional feature dataset. The density-based clustering method is used to adaptively divide the data into two categories, fault data and non-fault data, so as to estimate the time of occurrence of the fault. The paper designs 11 sets of experiments including 7 common high-resistance grounding mediums to verify the accuracy of the fault time recognition of this algorithm. The accuracy of this algorithm is within 7.3 ms and it exhibits better detection performance compared to the threshold detection method. [ABSTRACT FROM AUTHOR]

As artificial intelligence has evolved, deep learning models have become important in extracting and interpreting complex patterns from raw multidimensional data. These models produce multidimensional embeddings that, while containing a lot of information, are often not directly understandable. Dimensionality reduction techniques play an important role in transforming multidimensional data into interpretable formats for decision support systems. To address this problem, the paper presents an analysis of dimensionality reduction and visualization techniques that embrace complex data representations and are useful inferences for decision systems. A novel framework is proposed, utilizing a Siamese neural network with a triplet loss function to analyze multidimensional data encoded into images, thus transforming these data into multidimensional embeddings. This approach uses dimensionality reduction techniques to transform these embeddings into a lower-dimensional space. This transformation not only improves interpretability but also maintains the integrity of the complex data structures. The efficacy of this approach is demonstrated using a keystroke dynamics dataset. The results support the integration of these visualization techniques into decision support systems. The visualization process not only simplifies the complexity of the data, but also reveals deep patterns and relationships hidden in the embeddings. Thus, a comprehensive framework for visualizing and interpreting complex keystroke dynamics is described, making a significant contribution to the field of user authentication. [ABSTRACT FROM AUTHOR]

Gesture recognition is crucial in computer vision-based applications, such as drone control, gaming, virtual and augmented reality (VR/AR), and security, especially in human–computer interaction (HCI)-based systems. There are two types of gesture recognition systems, i.e., static and dynamic. However, our focus in this paper is on dynamic gesture recognition. In dynamic hand gesture recognition systems, the sequences of frames, i.e., temporal data, pose significant processing challenges and reduce efficiency compared to static gestures. These data become multi-dimensional compared to static images because spatial and temporal data are being processed, which demands complex deep learning (DL) models with increased computational costs. This article presents a novel triple-layer algorithm that efficiently reduces the 3D feature map into 1D row vectors and enhances the overall performance. First, we process the individual images in a given sequence using the MediaPipe framework and extract the regions of interest (ROI). The processed cropped image is then passed to the Inception-v3 for the 2D feature extractor. Finally, a long short-term memory (LSTM) network is used as a temporal feature extractor and classifier. Our proposed method achieves an average accuracy of more than 89.7%. The experimental results also show that the proposed framework outperforms existing state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Aiming to improve the robustness and adaptiveness of the recently investigated capped norm linear discriminant analysis (CLDA), this paper proposes a regularized linear discriminant analysis based on the generalized capped l 2 , q -norm (GCLDA). Compared to CLDA, there are two improvements in GCLDA. Firstly, GCLDA uses the capped l 2 , q -norm rather than the capped l 2 , 1 -norm to measure the within-class and between-class distances for arbitrary q > 0 . By selecting an appropriate q, GCLDA is adaptive to different data, and also removes extreme outliers and suppresses the effect of noise more effectively. Secondly, by taking into account a regularization term, GCLDA not only improves its generalization ability but also avoids singularity. GCLDA is solved through a series of generalized eigenvalue problems. Experiments on an artificial dataset, some real world datasets and a high-dimensional dataset demonstrate the effectiveness of GCLDA. [ABSTRACT FROM AUTHOR]

The paper presents a computing procedure with the goal of suggesting applicable solutions to improve complex cases of major recurrent depression. The focus is on identifying the patients' illness patterns and on finding solutions for alleviating problematic symptoms. The illness patterns synthesize the outcomes of the relationship between the patients' life themes and symptoms. The testing of the effectiveness of illness improvement solutions was conducted by evaluating and comparing the Beck scores of patients after each psychotherapy session. In addition to latent semantic analysis used to identify semantic relationships between life themes and symptoms, the research also employed the correlation method to find life themes/symptoms that are experienced undistortedly and associations between life themes that amplify latent symptoms. The computing system was applied to eleven patients with severe forms of depression and their progress was monitored for six months. The results obtained following the application of the computing system demonstrated its ability to describe personalized illness patterns and to significantly improve, through its suggestions, the illness of all patients. These findings recommend the use of the computing system in severe cases of major recurrent depression. [ABSTRACT FROM AUTHOR]

Multi-wavelength ghost imaging usually involves extensive data processing and faces challenges such as poor reconstructed image quality. In this paper, we propose a multi-wavelength computational ghost imaging method based on feature dimensionality reduction. This method not only reconstructs high-quality color images with fewer measurements but also achieves low-complexity computation and storage. First, we utilize singular value decomposition to optimize the multi-scale measurement matrices of red, green, and blue components as illumination speckles. Subsequently, each component image of the target object is reconstructed using the second-order correlation function. Next, we apply principal component analysis to perform feature dimensionality reduction on these reconstructed images. Finally, we successfully recover a high-quality color reconstructed image. Simulation and experimental results show that our method not only improves the quality of the reconstructed images but also effectively reduces the computational and storage burden. When extended to multiple wavelengths, our method demonstrates greater advantages, making it more feasible to handle large-scale data. [ABSTRACT FROM AUTHOR]

Bursting is a crucial form of firing in neurons, laden with substantial information. Studying it can aid in understanding the neural coding to identify human behavioral characteristics conducted by these neurons. However, the high-dimensionality of many neuron models imposes a difficult challenge in studying the generative mechanisms of bursting. On account of the high complexity and nonlinearity characteristic of these models, it becomes nearly impossible to theoretically study and analyze them. Thus, this paper proposed to address these issues by focusing on the midbrain dopamine neurons, serving as the central neuron model for the investigation of the bursting mechanisms and bifurcation behaviors exhibited by the neuron. In this study, we considered the dimensionality reduction of a high-dimensional neuronal model and analyzed the dynamical properties of the reduced system. To begin, for the original thirteen-dimensional model, using the correlation between variables, we reduced its dimensionality and obtained a simplified three-dimensional system. Then, we discussed the changing characteristics of the number of spikes within a burst by simultaneously varying two parameters. Finally, we studied the co-dimension-2 bifurcation in the reduced system and presented the bifurcation behavior near the Bogdanov-Takens bifurcation. [ABSTRACT FROM AUTHOR]

Intrusion Detection Systems play a crucial role in a network. They can detect different network attacks and raise warnings on them. Machine Learning-based IDSs are trained on datasets that, due to the context, are inherently large, since they can contain network traffic from different time periods and often include a large number of features. In this paper, we present two contributions: the study of the importance of Feature Selection when using an IDS dataset, while striking a balance between performance and the number of features; and the study of the feasibility of using a low-capacity device, the Nvidia Jetson Nano, to implement an IDS. The results, comparing the GA with other well-known techniques in Feature Selection and Dimensionality Reduction, show that the GA has the best F1-score of 76%, among all feature/dimension sizes. Although the processing time to find the optimal set of features surpasses other methods, we observed that the reduction in the number of features decreases the GA processing time without a significant impact on the F1-score. The Jetson Nano allows the classification of network traffic with an overhead of 10 times in comparison to a traditional server, paving the way to a near real-time GA-based embedded IDS. [ABSTRACT FROM AUTHOR]

Images, texts, voices, and signals can be synthesized by latent spaces in a multidimensional vector, which can be explored without the hurdles of noise or other interfering factors. In this paper, we present a practical use case that demonstrates the power of latent space in exploring complex realities such as image space. We focus on DaVinciFace, an AI-based system that explores the StyleGAN2 space to create a high-quality portrait for anyone in the style of the Renaissance genius Leonardo da Vinci. The user enters one of their portraits and receives the corresponding Da Vinci-style portrait as an output. Since most of Da Vinci's artworks depict young and beautiful women (e.g., "La Belle Ferroniere", "Beatrice de' Benci"), we investigate the ability of DaVinciFace to account for other social categorizations, including gender, race, and age. The experimental results evaluate the effectiveness of our methodology on 1158 portraits acting on the vector representations of the latent space to produce high-quality portraits that retain the facial features of the subject's social categories, and conclude that sparser vectors have a greater effect on these features. To objectively evaluate and quantify our results, we solicited human feedback via a crowd-sourcing campaign. Analysis of the human feedback showed a high tolerance for the loss of important identity features in the resulting portraits when the Da Vinci style is more pronounced, with some exceptions, including Africanized individuals. [ABSTRACT FROM AUTHOR]

The domain of Machine learning has experienced Substantial advancement and development. Recently, showcasing a Broad spectrum of uses like Computational linguistics, image identification, and autonomous systems. With the increasing demand for intelligent systems, it has become crucial to comprehend the different categories of machine acquiring knowledge systems along with their applications in the present world. This paper presents actual use cases of machine learning, including cancer classification, and how machine learning algorithms have been implemented on medical data to categorize diverse forms of cancer and anticipate their outcomes. The paper also discusses supervised, unsupervised, and reinforcement learning, highlighting the benefits and disadvantages of each category of Computational intelligence system. The conclusions of this systematic study on machine learning methods and applications in cancer classification have numerous implications. The main lesson is that through accurate classification of cancer kinds, patient outcome prediction, and identification of possible therapeutic targets, machine learning holds enormous potential for improving cancer diagnosis and therapy. This review offers readers with a broad understanding as of the present advancements in machine learning applied to cancer classification today, empowering them to decide for themselves whether to use these methods in clinical settings. Lastly, the paper wraps up by engaging in a discussion on the future of machine learning, including the potential for new types of systems to be developed as the field advances. Overall, the information included in this survey article is useful for scholars, practitioners, and individuals interested in gaining knowledge about the fundamentals of machine learning and its various applications in different areas of activities. [ABSTRACT FROM AUTHOR]

High-dimensional data is characterized by its sparsity and noise, which can increase the likelihood of overfitting and compromise the model's generalizability performance. In this paper, a novel robust subspace learning method based on stable adaptive spectral clustering is put forward for dimensionality reduction. Firstly, a robust estimator is used to distinguish the role of normal and abnormal samples in constructing the model, thereby small values are assigned to the outliers, then the influence of outliers on the construction of the learning models will be reduced. Secondly, the p-order of L 2 -norm distance is applied as the distance metric, replacing the square of L 2 -norm distance metric. The L 2 , p -norm often commendably tolerates the biases caused by the outliers in sample data, especially when the outliers are away from the normal data distributions. Thirdly, the adaptive stable spectral clustering based on the L 2 , p -norm is proposed to construct similarity matrix of the novel robust subspace to carry out reflexive embedding learning to learn the local and globe features of the raw data. In the subspace, the data is reconstructed to reduce the influence of noise and outliers, and the similarity matrix is structured by the new features, that is more conducive to subspace learning. Three main roles of the objective function of our model are: (1) preserving the consistency between the original data and the estimation; (2) achieving a "clean" subspace and further removing the outliers; (3) avoiding the trivial solution for each node in the graph. Finally, the random forest algorithm is used to classify and predict the learned subspace with different feature selections. Experimental results show that the proposed method is superior to other subspace learning methods in classification performance. The results of noise experiment and statistical analysis demonstrate the effectiveness of the proposed method once again. [ABSTRACT FROM AUTHOR]

In this paper, we are proposing extensions to the multinomial principal component analysis (MPCA) framework, which is a Dirichlet (Dir)-based model widely used in text document analysis. The MPCA is a discrete analogue to the standard PCA (it operates on continuous data using Gaussian distributions). With the extensive use of count data in modeling nowadays, the current limitations of the Dir prior (independent assumption within its components and very restricted covariance structure) tend to prevent efficient processing. As a result, we are proposing some alternatives with flexible priors such as generalized Dirichlet (GD) and Beta-Liouville (BL), leading to GDMPCA and BLMPCA models, respectively. Besides using these priors as they generalize the Dir, importantly, we also implement a deterministic method that uses variational Bayesian inference for the fast convergence of the proposed algorithms. Additionally, we use collapsed Gibbs sampling to estimate the model parameters, providing a computationally efficient method for inference. These two variational models offer higher flexibility while assigning each observation to a distinct cluster. We create several multitopic models and evaluate their strengths and weaknesses using real-world applications such as text classification and sentiment analysis. [ABSTRACT FROM AUTHOR]

In graph theory, the weighted Laplacian matrix is the most utilized technique to interpret the local and global properties of a complex graph structure within computer vision applications. However, with increasing graph nodes, the Laplacian matrix's dimensionality also increases accordingly. Therefore, there is always the "curse of dimensionality"; In response to this challenge, this paper introduces a new approach to reducing the dimensionality of the weighted Laplacian matrix by utilizing the Gershgorin circle theorem by transforming the weighted Laplacian matrix into a strictly diagonal domain and then estimating rough eigenvalue inclusion of a matrix. The estimated inclusions are represented as reduced features, termed GC features; The proposed Gershgorin circle feature extraction (GCFE) method was evaluated using three publicly accessible computer vision datasets, varying image patch sizes, and three different graph types. The GCFE method was compared with eight distinct studies. The GCFE demonstrated a notable positive Z-score compared to other feature extraction methods such as I-PCA, kernel PCA, and spectral embedding. Specifically, it achieved an average Z-score of 6.953 with the 2D grid graph type and 4.473 with the pairwise graph type, particularly on the E_Balanced dataset. Furthermore, it was observed that while the accuracy of most major feature extraction methods declined with smaller image patch sizes, the GCFE maintained consistent accuracy across all tested image patch sizes. When the GCFE method was applied to the E_MNSIT dataset using the K-NN graph type, the GCFE method confirmed its consistent accuracy performance, evidenced by a low standard deviation (SD) of 0.305. This performance was notably lower compared to other methods like Isomap, which had an SD of 1.665, and LLE, which had an SD of 1.325; The GCFE outperformed most feature extraction methods in terms of classification accuracy and computational efficiency. The GCFE method also requires fewer training parameters for deep-learning models than the traditional weighted Laplacian method, establishing its potential for more effective and efficient feature extraction in computer vision tasks. [ABSTRACT FROM AUTHOR]

As electrochemical research undergoes rapid technological progression, the acquisition of substantial amounts of electrochemical impedance spectra (EIS) becomes increasingly feasible. Yet, this advancement introduces intricate challenges in data processing, automation, and interpretation. This paper delves into the sufficiency of unsupervised machine learning (ML) and in particular dimensionality reduction methods in decoding EIS complexities, examining its strengths, limitations, and potential pathways for optimization. As we navigated the intricacies of non‐linear dimensionality reduction, spotlighting t‐distributed stochastic neighbor embedding (t‐SNE) and uniform manifold approximation and projection (UMAP) algorithms, a pattern emerged: these techniques excel at categorizing divergent impedance spectra but show limitations when faced with analogous circuit configurations, especially those substituting a capacitor with a constant phase element. This observation not only underscores a limitation but also accentuates that unsupervised ML approaches, alone, may not fully unravel the nuances of EIS spectra. In the concluding section of our manuscript, we discuss the implications of this finding from a practical standpoint, particularly for electrochemists seeking to apply these methods in their work. [ABSTRACT FROM AUTHOR]

Electronic nose is an electronic olfactory system that simulates the biological olfactory mechanism, which mainly includes gas sensor, data pre-processing, and pattern recognition. In recent years, the proposals of electronic nose have been widely developed, which proves that electronic nose is a considerably important tool. However, the most recent studies concentrate on the applications of electronic nose, which gradually neglects the inherent technique improvement of electronic nose. Although there are some proposals on the technique improvement, they usually pay attention to the modification of gas sensor module and barely consider the improvement of the last two modules. Therefore, this paper optimizes the electronic nose system from the perspective of data pre-processing and pattern recognition. Recurrent neural network (RNN) is used to do pattern recognition and guarantee accuracy rate and stability. Regarding the high-dimensional data pre-processing, the method of locally linear embedding (LLE) is used to do dimensionality reduction. The experiments are made based on the real sensor drift dataset, and the results show that the proposed optimization mechanism not only has higher accuracy rate and stability, but also has lower response time than the three baselines. In addition, regarding the usage of RNN model, the experimental results also show its efficiency in terms of recall ratio, precision ratio, and F1 value. [ABSTRACT FROM AUTHOR]

Clustering is a basic primer of exploratory tasks. In order to obtain valuable results, the parameters in the clustering algorithm, the number of clusters must be set appropriately. Existing methods for determining the number of clusters perform well on low-dimensional small datasets, but how to effectively determine the optimal number of clusters on large high-dimensional datasets is still a challenging problem. In this paper, the authors design a method for effectively estimating the optimal number of clusters on large-scale high-dimensional datasets that can overcome the shortcomings of existing estimation methods and accurately and quickly estimate the optimal number of clusters on large-scale high-dimensional datasets. Extensive experiments show that it (1) outperforms existing estimation methods in accuracy and efficiency, (2) generalizes across different datasets, and (3) is suitable for high-dimensional large datasets. [ABSTRACT FROM AUTHOR]

This paper proposes a pattern recognition method for the fault diagnosis of machinery based on an enhanced trace ratio linear discriminant analysis (ETR-LDA) algorithm. It is an extension of TR-LDA that pursues to maximize the between-class distance and minimize the within-class distance. Since TR-LDA focuses on the total between-class distance and ignores the attention to local features, it may lead to deficiencies in the classification of specific patterns/classes, which is defined as short board in this paper. To cope with this limitation, the proposed ETR-LDA makes a reconsideration of the relationship between the total between-class distance and the global separability. More specifically, a new objective function is derived in ETR-LDA by taking the smallest between-class distance into account. The optimal solution of this objective function is proved to improve the smallest between-class distance with no change to the convergence and the global optimality of the algorithm, and the separability of different classes is increased eventually. Both synthetic data and hard disk drive wearing experimental data are employed to verify the efficiency of the proposed method. The results show that ETR-LDA is able to distinguish those fault categories and outperform TR-LDA and other dimensionality reduction methods. [ABSTRACT FROM AUTHOR]

Software Cost Estimation (SCE) is one of the research priorities and challenges in the construction of cyber-physical-social systems (CPSSs). In CPSS, it is urge to process environmental and social information accurately and use it to guide social practice. Thus, in response to the problems of low prediction accuracy, poor robustness, and poor interpretability in SCE, this paper proposes a SCE model based on Autoencoder and Random Forest. First, preprocess the project data, remove outliers, and build regression trees to fill in missing attributes in the data. Second, construct a Autoencoder to reduce the dimensionality of factors that affect software cost. Subsequently, the performance of the model was trained and validated using the XGBoost framework on three datasets: COCOMO81, Albrecht, and Desharnais, and compared with common cost prediction models. The experimental results show that the MMRE, MdMRE, and PRED (0.25) values of the proposed model on the COCOMO81 dataset reached 0.21, 0.16, and 0.71, respectively. Compared with other models, the proposed model achieved significant improvements in accuracy and robustness. [ABSTRACT FROM AUTHOR]

The high dimensionality of real-life datasets is one of the biggest challenges in the machine learning field. Due to the increased need for computational resources, the higher the dimension of the input data is, the more difficult the learning task will be—a phenomenon commonly referred to as the curse of dimensionality. Laying the paper's foundation based on this premise, we propose a two-stage dimensionality reduction (TSDR) method for data classification. The first stage extracts high-quality features to a new subset by maximizing the pairwise separation probability, with the aim of avoiding overlap between individuals from different classes that are close to one another, also known as the class masking problem. The second stage takes the previous resulting subset and transforms it into a reduced final space in a way that maximizes the distance between the cluster centers of different classes while also minimizing the dispersion of instances within the same class. Hence, the second stage aims to improve the accuracy of the succeeding classifier by lowering its sensitivity to an imbalanced distribution of instances between different classes. Experiments on benchmark and social media datasets show how promising the proposed method is over some well-established algorithms, especially regarding social media engagement classification. [ABSTRACT FROM AUTHOR]

Fault detection is crucial in maintaining reliability, safety, and consistent product quality in chemical engineering processes. Accurate fault detection allows for identifying anomalies, signaling deviations from the system's nominal behavior, ensuring the system operates within desired performance parameters, and minimizing potential losses. This paper presents a novel semi-supervised data-based monitoring technique for fault detection in multivariate processes. To this end, the proposed approach merges the capabilities of Principal Component Analysis (PCA) for dimensionality reduction and feature extraction with the Kolmogorov–Smirnov (KS)-based scheme for fault detection. The KS indicator is computed between the two distributions in a moving window of fixed length, allowing it to capture sensitive details that enhance the detection of faults. Moreover, no labeling is required when using this fault detection approach, making it flexible in practice. The performance of the proposed PCA–KS strategy is assessed for different sensor faults on benchmark processes, specifically the Plug Flow Reactor (PFR) process and the benchmark Tennessee Eastman (TE) process. Different sensor faults, including bias, intermittent, and aging faults, are considered in this study to evaluate the proposed fault detection scheme. The results demonstrate that the proposed approach surpasses traditional PCA-based methods. Specifically, when applied to PFR data, it achieves a high average detection rate of 98.31% and a low false alarm rate of 0.25%. Similarly, when applied to the TE process, it provides a good average detection rate of 97.27% and a false alarm rate of 6.32%. These results underscore the efficacy of the proposed PCA–KS approach in enhancing the fault detection of high-dimensional processes. [ABSTRACT FROM AUTHOR]

Remote Sensing plays a fundamental role in acquiring crucial information about the Earth's surface from a distance, especially through fully polarimetric data, which offers a rich source of information for diverse applications. However, extracting meaningful insights from this intricate data necessitates sophisticated techniques. In addressing this challenge, one predominant trend that has emerged is known as target decomposition techniques. These techniques can be broadly classified into coherent and non-coherent methods. Each of these methods provides high-quality information using different procedures. In this context, this paper introduces innovative feature fusion techniques, amalgamating coherent and non-coherent information. While coherent techniques excel in detailed exploration and specific feature extraction, non-coherent methods offer a broader perspective. Our feature fusion techniques aim to harness the strengths of both approaches, providing a comprehensive and high-quality fusion of information. In the first approach, features derived from Pauli coherent decomposition, Freeman–Durden non-coherent technique, and the Symmetry criterion from Cameron's stepwise algorithm are combined to construct a sophisticated feature vector. This fusion is achieved using the well-established Fisher Linear Discriminant Analysis algorithm. In the second approach, the Symmetry criterion serves as the basis for fusing coherent and non-coherent coefficients, resulting in the creation of a new feature vector. Both approaches aim to exploit information simultaneously extracted from coherent and non-coherent methods in feature extraction from Remote Sensing data through fusion at the feature level. To evaluate the effectiveness of the feature generated by the proposed fusion techniques, we employ a land cover classification procedure. This involves utilizing a basic classifier, achieving overall accuracies of approximately 82% and 86% for each of the two proposed techniques. Furthermore, the accuracy in individual classes surpasses 92%. The evaluation aims to gauge the effectiveness of the fusion methods in enhancing feature extraction from fully polarimetric data and opens avenues for further exploration in the integration of coherent and non-coherent features for remote sensing applications. [ABSTRACT FROM AUTHOR]

Deterministic wind power prediction can be used for long time-scale optimization of power dispatching systems, but the probability and fluctuation range of prediction results cannot be calculated. A Bayesian LSTM neural network (BNN-LSTM) is constructed based on Bayesian networks by placing a priori distributions on top of the LSTM network layer weight parameters. First, the temporal convolutional neural network (TCNN) is used to process the historical time-series data for wind power prediction, which is used to extract the correlation features of the time-series data and learn the trend changes of the time-series data. Then, the mutual information entropy method is used to analyze the meteorological dataset of wind power, which is used to eliminate the variables with small correlation and reduce the dimension of the meteorological dataset, so as to simplify the overall structure of the prediction model. At the same time, the Embedding structure is used to learn the temporal classification features of wind power. Finally, the time series data processed by TCNN, the meteorological data after dimensionality reduction, and the time classification feature data are fed into the BNN-LSTM prediction model together. Compared with a Bayesian neural network, continuous interval method, and Temporal Fusion Transformer (TFT), which is one of the most advanced time series prediction networks, the improved BNN-LSTM can respond more accurately to wind power fluctuations with better prediction results. The comprehensive index of probability prediction of pinball loss is smaller than those of the other three methods by 53.2%, 24.4%, and 11.3%, and the Winkler index is 3.5 %, 34.6 %, and 8.2 % smaller, respectively. [ABSTRACT FROM AUTHOR]

Cartography is a technique for creating maps, which are graphical representations of spatial information. Traditional cartography involves the creation of geographical data, such as locations of countries, geographical features of mountains, rivers, and oceans, and celestial objects. However, cartography has recently been utilized to display various data, such as antigenic signatures, graphically. Hence, it is natural to consider a new cartography that can flexibly deal with various data types. This study proposes a model of Siamese topological neural networks consisting of a pair of hierarchical neural networks, each with a low-dimensional internal layer for creating context-flexible maps. The proposed Siamese topological neural network transfers high-dimensional data with various contexts into their low-dimensional spatial representations on a map that humans can use to gain insights from the data. Here, it is enough to define a metric of difference between an arbitrary pair of data instances for training the proposed neural network. As the metric can be arbitrarily defined, the proposed neural network realizes context-flexible cartography useful for visual data analysis. This paper applies the proposed network for visualizing various demographic data. [ABSTRACT FROM AUTHOR]

Single-cell multi-omics technology has catalyzed a transformative shift in contemporary cell biology, illuminating the nuanced relationship between genotype and phenotype. This paradigm shift hinges on the understanding that while genomic structures remain uniform across cells within an organism, the expression patterns dictate physiological traits. Leveraging high throughput sequencing, single-cell RNA sequencing (scRNA-seq) has emerged as a powerful tool, enabling comprehensive transcriptomic analysis at unprecedented resolution. This paper navigates through a landscape of dimensionality reduction techniques essential for distilling meaningful insights from the scRNA-seq datasets. Notably, while foundational, Principal Component Analysis may fall short of capturing the intricacies of diverse cell types. In response, nonlinear techniques have garnered traction, offering a more nuanced portrayal of cellular relationships. Among these, Pairwise Controlled Manifold Approximation Projection (PaCMAP) stands out for its capacity to preserve local and global structures. We present an augmented iteration, Compactness Preservation Pairwise Controlled Manifold Approximation Projection (CP-PaCMAP), a novel advancement for scRNA-seq data visualization. Employing benchmark datasets from critical human organs, we demonstrate the superior efficacy of CP-PaCMAP in preserving compactness, offering a pivotal breakthrough for enhanced classification and clustering in scRNA-seq analysis. A comprehensive suite of metrics, including Trustworthiness, Continuity, Mathew Correlation Coefficient, and Mantel test, collectively validate the fidelity and utility of proposed and existing techniques. These metrics provide a multi-dimensional evaluation, elucidating the performance of CP-PaCMAP compared to other dimensionality reduction techniques. [ABSTRACT FROM AUTHOR]

Multidimensional scaling (MDS) is an often-used method to reduce the dimensionality of multidimensional data nonlinearly and to present the data visually. MDS minimizes some stress function which variables are coordinates of points in the projected lower-dimensional space. Recently, the so-called Geometric MDS has been developed, where the stress function and multidimensional scaling, in general, are considered from the geometric point of view. Using ideas of Geometric MDS, it is possible to construct the iterative procedure of minimization of the stress where coordinates of a separate point of the projected space are moved to the new position defined analytically. In this paper, we discover and prove the main advantage of Geometric MDS theoretically: changing the position of all the points of the projected space simultaneously (independently of each other) in the directions and with steps, defined analytically by Geometric MDS strategy for a separate point, decreases the MDS stress. Moreover, the analytical updating of coordinates of projected points in each iteration has a simple geometric interpretation. New properties of Geometric MDS have been discovered. The obtained results allow us for the future development of a class of new both sequential and parallel algorithms. Ideas for global optimization of the stress are highlighted. [ABSTRACT FROM AUTHOR]

Hierarchical multi-label classification problems typically deal with datasets with many attributes and labels, which can negatively impact the classifier performance. The application of dimensionality reduction methods can significantly improve the performance of classifiers. Dimensionality reduction can be performed by feature extraction or feature selection, according to the problem domain and datasets characteristics. This work carried out a systematic literature mapping to identify the approaches and techniques of dimensionality reduction that have been used in hierarchical multi-label classification tasks. Searches were performed on 7 important databases for the Computer Science field. From a list of 184 retrieved papers, 12 were selected for analysis, from which it was possible to determine a general overview of studies conducted from 2010 to 2022. It was identified that feature selection was the most frequent reduction method, with filter approach standing out. In addition, it was detected that most of the works used tree hierarchical structure. As its main outcome, this paper presents the state of the art of dimensionality reduction problem for hierarchical multi-label classification, indicating trends and research issues in the field. [ABSTRACT FROM AUTHOR]