Symmetric Nonnegative Matrix Factorization-Based Community Detection Models and Their Convergence Analysis

Semi-supervised non-negative matrix factorization with structure preserving for image clustering

Semi-supervised learning methods have wide applications thanks to the reasonable utilization for a part of label information of data. In recent years, non-negative matrix factorization (NMF) has received considerable attention because of its interpretability and practicality. Based on the advantages of semi-supervised learning and NMF, many semi-supervised NMF methods have been presented. However, these existing semi-supervised NMF methods construct a label matrix only containing elements 1 and 0 to represent the labeled data and further construct a label regularization, which neglects an intrinsic structure of NMF. To address the deficiency, in this paper, we propose a novel semi-supervised NMF method with structure preserving. Specifically, we first construct a new label matrix with weights and further construct a label constraint regularizer to both utilize the label information and maintain the intrinsic structure of NMF. Then, based on the label constraint regularizer, the basis images of labeled data are extracted for monitoring and modifying the basis images learning of all data by establishing a basis regularizer. Finally, incorporating the label constraint regularizer and the basis regularizer into NMF, we propose a new semi-supervised NMF method. To solve the optimization problem, a multiplicative updating algorithm is developed. The proposed method is applied to image clustering to test its performance. Experimental results on eight data sets demonstrate the effectiveness of the proposed method in contrast with state-of-the-art unsupervised and semi-supervised algorithms.

Quantitative stakeholder-driven assessment of radiation protection issues via a PIANOFORTE online survey

To enhance stakeholder engagement and foster the inclusion of interests of citizens in radiation protection research, a comprehensive online survey was developed within the framework of the European Partnership PIANOFORTE. This survey was performed in 2022 and presented an opportunity for a wide range of stakeholders to voice their opinions on research priorities in radiation protection for the foreseeable future. Simultaneously, it delved into pertinent issues surrounding general radiation protection. The PIANOFORTE e-survey was conducted in the English language, accommodating a diverse range of participants. Overall, 440 respondents provided their insights and feedback, representing a broad geographical reach encompassing 29 European countries, as well as Canada, China, Colombia, India, and the United States. To assess the outcomes, the Positive Matrix Factorization numerical model was applied, in addition to qualitative and quantitative assessment of individual responses, enabling the discernment of four distinct stakeholder groups with varying attitudes. While the questionnaire may not fully represent all stakeholders due to the limited respondent pool, it is noteworthy that approximately 70% of the participants were newcomers to comparable surveys, demonstrating a proactive attitude, a strong willingness to collaborate and the necessity to continuously engage with stakeholder groups. Among the individual respondents, distinct opinions emerged particularly regarding health effects of radiation exposure, medical use of radiation, radiation protection of workers and the public, as well as emergency and recovery preparedness and response. In cluster analysis, none of the identified groups had clear preferences concerning the prioritization of future radiation protection research topics.

Community Detection via Autoencoder-Like Nonnegative Tensor Decomposition

Community detection aims at partitioning a network into several densely connected subgraphs. Recently, nonnegative matrix factorization (NMF) has been widely adopted in many successful community detection applications. However, most existing NMF-based community detection algorithms neglect the multihop network topology and the extreme sparsity of adjacency matrices. To resolve them, we propose a novel conception of adjacency tensor, which extends adjacency matrix to multihop cases. Then, we develop a novel tensor Tucker decomposition-based community detection method-autoencoder-like nonnegative tensor decomposition (ANTD), leveraging the constructed adjacency tensor. Distinct from simply applying tensor decomposition on the constructed adjacency tensor, which only works as a decoder, ANTD also introduces an encoder component to constitute an autoencoder-like architecture, which can further enhance the quality of the detected communities. We also develop an efficient alternative updating algorithm with convergence guarantee to optimize ANTD, and theoretically analyze the algorithm complexity. Moreover, we also study a graph regularized variant of ANTD. Extensive experiments on real-world benchmark networks by comparing 27 state-of-the-art methods, validate the effectiveness, efficiency, and robustness of our proposed methods.

Predicting Protein-Protein Interactions Using Sequence and Network Information via Variational Graph Autoencoder

Protein-protein interactions (PPIs) play a critical role in the proteomics study, and a variety of computational algorithms have been developed to predict PPIs. Though effective, their performance is constrained by high false-positive and false-negative rates observed in PPI data. To overcome this problem, a novel PPI prediction algorithm, namely PASNVGA, is proposed in this work by combining the sequence and network information of proteins via variational graph autoencoder. To do so, PASNVGA first applies different strategies to extract the features of proteins from their sequence and network information, and obtains a more compact form of these features using principal component analysis. In addition, PASNVGA designs a scoring function to measure the higher-order connectivity between proteins and so as to obtain a higher-order adjacency matrix. With all these features and adjacency matrices, PASNVGA trains a variational graph autoencoder model to further learn the integrated embeddings of proteins. The prediction task is then completed by using a simple feedforward neural network. Extensive experiments have been conducted on five PPI datasets collected from different species. Compared with several state-of-the-art algorithms, PASNVGA has been demonstrated as a promising PPI prediction algorithm.

A novel PID-like particle swarm optimizer: on terminal convergence analysis

In this paper, a novel proportion-integral-derivative-like particle swarm optimization (PIDLPSO) algorithm is presented with improved terminal convergence of the particle dynamics. A derivative control term is introduced into the traditional particle swarm optimization (PSO) algorithm so as to alleviate the overshoot problem during the stage of the terminal convergence. The velocity of the particle is updated according to the past momentum, the present positions (including the personal best position and the global best position), and the future trend of the positions, thereby accelerating the terminal convergence and adjusting the search direction to jump out of the area around the local optima. By using a combination of the Routh stability criterion and the final value theorem of the Z-transformation, the convergence conditions are obtained for the developed PIDLPSO algorithm. Finally, the experiment results reveal the superiority of the designed PIDLPSO algorithm over several other state-of-the-art PSO variants in terms of the population diversity, searching ability and convergence rate.

An improved generative adversarial network with modified loss function for crack detection in electromagnetic nondestructive testing

In this paper, an improved generative adversarial network (GAN) is proposed for the crack detection problem in electromagnetic nondestructive testing (NDT). To enhance the contrast ratio of the generated image, two additional regulation terms are introduced in the loss function of the underlying GAN. By applying an appropriate threshold to the segmentation of the generated image, the real crack areas and the fake crack areas (which are affected by the noises) are accurately distinguished. Experiments are carried out to show the superiority of the improved GAN over the original one on crack detection tasks, where a real-world NDT dataset is exploited that consists of magnetic optical images obtained using the electromagnetic NDT technique.

A Correlation Analysis of Geomagnetic Field Characteristics in Geomagnetic Perceiving Navigation

It is well-known that geomagnetic fields have multiple components or parameters, and that these geomagnetic parameters are related to each other. In this paper, a parameter selection method is proposed, and this paper mainly discusses the correlation of geomagnetic field parameters for geomagnetic navigation technology. For the correlation analysis between geomagnetic parameters, the similarity calculation of the correlation coefficient is firstly introduced for geomagnetic navigation technology, and the grouped results are obtained by data analysis. At the same time, the search algorithm (Hex-path algorithm) is used to verify the correlation analysis results. The results show the same convergent state for the approximate correlation coefficient. In other words, the simulation results are in agreement with the similarity calculation results.

Empower parameterized generative adversarial networks using a novel particle swarm optimizer: algorithms and applications

In this paper, a novel parameterized generative adversarial network (GAN) is proposed where the parameters are introduced to enhance the performance of image segmentation. The developed algorithm is applied to the image-based crack detection problem on the thermal data obtained through the non-destructive testing process. A new regularization term, which contains three tunable hyperparameters, embedded into the objective function of the GAN in order to improve the contrast ratio of certain areas of the image so as to benefit the crack detection process. To automate the selection of the optimal hyperparameters of the GAN, a new particle swarm optimization (PSO) algorithm is put forward where a neighborhood-based velocity updating strategy is developed for the purpose of thoroughly exploring the problem space. The proposed PSO-based GAN algorithm is shown to 1) work well in detecting cracks on the thermal data generated by the eddy current pulsed thermography technique; and 2) outperforms other conventional GAN algorithms.

A New GAN-Based Approach to Data Augmentation and Image Segmentation for Crack Detection in Thermal Imaging Tests

As a popular nondestructive testing (NDT) technique, thermal imaging test demonstrates competitive performance in crack detection, especially for detecting subsurface cracks. In thermal imaging test, the temperature of the crack area is higher than that of the non-crack area during the NDT process. By extracting the features of the thermal image sequences, the temperature curve of each spatial point is employed for crack detection. Nevertheless, the quality of thermal images is influenced by the noises due to the complex thermal environment in NDT. In this paper, a modified generative adversarial network (GAN) is employed to improve the image segmentation performance. To improve the feature extraction ability and alleviate the influence of noises, a penalty term is put forward in the loss function of the conventional GAN. A data preprocessing method is developed where the principle component analysis algorithm is adopted for feature extraction. The data argumentation technique is utilized to guarantee the quantity of the training samples. To validate its effectiveness in thermal imaging NDT, the modified GAN is applied to detect the cracks on the eddy current pulsed thermography NDT dataset.