The expanding Arabic user base presents a unique opportunity for researchers to tap into vast online Arabic resources. However, the lack of reliable Arabic word embedding models and limited availability of Arabic corpora pose significant challenges. This paper aims to address these gaps by conducting an experiment to train word embedding models with Arabic corpora and examine the influence of varying hyperparameter values on different NLP tasks. To gather data for training the models, we collected information from three distinct sources: Wikipedia, newspapers, and 31 Arabic books. Each corpus’s specific impact on the outcomes was analyzed. The experiment involved assessing the models across diverse NLP tasks, including sentiment analysis, similarity tests, and analogy tests. The findings revealed that both the corpus size and hyperparameter values had distinct effects on each test. In the Analogy test, employing a larger vocabulary size positively influenced the outcomes, with Fasttext models using skip-gram approaches performing well in solving Analogy Test questions. For sentiment analysis, we discovered that vocabulary size played a crucial role. In the similarity score test, Fasttext models achieved the highest scores, with lower window sizes and smaller vector sizes leading to better results. Overall, our models performed well, achieving a score of 99%, 90% accuracies for sentiment analysis and Analogy Test, respectively. Moreover, they achieved a similarity score of 8 out of 10. Our findings indicate that our models can serve as a valuable resource for Arabic NLP researchers, equipping them with a robust tool for handling Arabic text.

Nowadays people express their opinions on social media. Also provides product reviews on eCommerce websites and responds to various news as comments. It is necessary to know the polarity and aspect of various posts and comments for business, education and security. Aspect-based sentiment analysis (ABSA) predicts text category and polarity. In this paper, we proposed a deep learning framework Deep-ABSA for aspect-based sentiment analysis from Bangla texts. Our proposed framework is a multi-channel architecture. We implemented the word embedding, Bi-LSTM with the attention mechanism for one channel. And for another channel, we adopted the character-embedded convolutional neural network. Finally, we concatenated both channels for adjoining the features of each channel. We obtained an adequate performance from our proposed framework for aspect term analysis from Bangla sentences.

Systematic reviews represent a powerful instrument to summarize the existing evidence in medical literature. However, articles for a systematic review are hard to identify, and mostly require a structured search of the literature through a number of databases, using keyword-based search strategies, followed by the painstaking manual selection of pieces of evidence that are pertinent to the query. A.I. algorithms may offer solutions to reduce the workload on investigators. We applied BERTopic, a newer and much-recognized transformer-based topic-modeling algorithm, to two datasets of 6137 and 5309 articles of newly published systematic reviews in the area of peri-implantitis and bone regeneration in implant dentistry. In the two datasets, BERTopic identified 14 and 22 clusters, respectively, and it automatically created labels describing the nature of the topics for each individual cluster based on semantic interpretation of their titles. Most themes regarded the query theme, but in both conditions, BERTopic also uncovered articles related to off-themes, which composed around 30% of the dataset—with sensitivity up to 0.79 and specificities of at least 0.99. Our results suggest that adding a topic-modeling step to the screening process could potentially save working hours for researchers involved in systematic reviews of the literature.

Recommender systems as an effective information filtering system can be used to obtain information through the user's explicit or implicit behavior. On the one hand finding items that may be of interest to the user. On the other hand, the recommendation facilitates the interaction between the user and the item to increase the revenue. Recommender systems have been widely used in various fields, such as e-commerce, travel recommendation, online books and movies, social networks, etc, which can satisfy the intrinsic implicit needs of users through personalized services. In recent years, the development of deep learning has further improved the performance of recommendation systems. Although these methods improve the performance of the recommendation system, when the number of users and products increases, the recommendation system may face sparsity and cold start problems, and thus cannot achieve personalized recommendations. Knowledge graphs, which are structured data, have become the choice of many algorithms due to the high quality and wide scale of the data, and therefore many recommendation algorithms combined with knowledge graphs have emerged as a popular new direction in recommendation systems. These algorithms are able to preserve the rich connections between different entities. Moreover, when constructing the features of an entity, the entities that are far away from the central entity can also be utilized. Entities are no longer only directly connected to each other. To address the shortcomings of existing recommendation algorithms, this paper designs the recommendation algorithm GPRE using graph neural networks. GPRE focuses on expressing the user's features. The graph neural network provides GPRE with a strong generalization capability for modeling, which can provide long-range semantics between users and entities, as well as selective entity selection in the auxiliary graph neural network. Explicit semantic links are established between remote and central nodes to reduce the introduction of noise. In this paper, experiments are conducted on real-world datasets and the results are compared with baselines. The experimental results show that GPRE performs well on the experimental dataset.

In this paper, we provide a study on the effects of applying classical clustering algorithms, such as k-Means to free text recommender systems. A typical recommender system may face problems when the number of items from a database goes from a few items to hundreds of items. Currently, one of the most prominent techniques to scale the database is applying clustering, however clustering may have a negative impact on the accuracy of the system when applied without taking into consideration the underlying items. In this work, we build a conceptual text recommender system and use k-Means to partition its search space into different groups. We study how the variation of the number of clusters affects its performance in the light of two performance measurements: recommendation time and precision. We also analyze if this clustering is affected by the representation of text we use. All the techniques used in this study uses word-embeddings to represent the document. One of the main findings of this work is that using clustering we can improve the recommendation time in up to almost 30 times without affecting much off its initial accuracy. Another interesting finding is that the increment of the number of clusters is not directly translated into linear performance.

Ensuring the integrity of scientific literature is essential for advancing knowledge and research. However, the credibility and trustworthiness of scholarly publications are compromised by manipulated citations. Traditional methods, such as manual inspection and basic statistical analyses, have limitations in detecting intricate patterns and subtle manipulations of citations. In recent years, network-based approaches have emerged as promising techniques for identifying and understanding citation manipulation. This study introduces a novel method to identify potential citation manipulation in academic papers using perturbations of a deep embedding model. The key idea is to reconstruct meaningful connections represented by citations within a network by exploring slightly longer alternative paths. These indirect pathways enable the recovery of original and reliable citations while estimating their trustworthiness. The investigation takes a comprehensive approach to link prediction, leveraging the consistent behavior of prominent connections when exposed to network perturbations. Through numerical experiments, the method demonstrates a high capability to identify reliable citations as the core of the analyzed data and to raise suspicions about unreliable references that may have been manipulated.

Network Embedding (NE) is an important method to learn the representations of network via a low-dimensional space. Conventional NE models focus on capturing the structure information and semantic information of vertices while neglecting such information for edges. In this work, we propose a novel NE model named BimoNet to capture both the structure and semantic information of edges. BimoNet is composed of two parts, i.e., the bi-mode embedding part and the deep neural network part. For bi-mode embedding part, the first mode named add-mode is used to express the entity-shared features of edges and the second mode named subtract-mode is employed to represent the entity-specific features of edges. These features actually reflect the semantic information. For deep neural network part, we firstly regard the edges in a network as nodes, and the vertices as links, which will not change the overall structure of the whole network. Then we take the nodes' adjacent matrix as the input of the deep neural network as it can obtain similar representations for nodes with similar structure. Afterwards, by jointly optimizing the objective function of these two parts, BimoNet could preserve both the semantic and structure information of edges. In experiments, we evaluate BimoNet on three real-world datasets and task of relation extraction, and BimoNet is demonstrated to outperform state-of-the-art baseline models consistently and significantly.

Link prediction is to complete the missing links in the network or to predict the generation of new links according to the current network structure information, which is very important for mining and analyzing the evolution of the network such for construction and analysis of logical architecture in 6G network. Link prediction algorithms based on node similarity need predefined similarity functions, which is highly hypothetical and only applies to specific network structures without generality. To solve this problem, this paper proposes a link prediction algorithm based on the subgraph of the target node pair. In order to automatically learn the graph structure characteristics, the algorithm firstly extracts the h-hop subgraph of the target node pair, and then predicts whether the target node pair will be linked according to the subgraph. Experiments on seven real data sets show that the link prediction algorithm based on target node pair subgraph is suitable for various network structures and superior to other link prediction algorithms.

The prediction of drug--target interactions is always a key task in the field of drug redirection. However, traditional methods of predicting drug--target interactions are either mediocre or rely heavily on data stacking. In this work, we merged heterogeneous graph information and obtained effective node information and substructure information based on mutual information in graph embeddings. We then learned high quality representations for downstream tasks, and proposed an end--to--end auto--encoder model to complete the task of link prediction. Experimental results show that our method outperforms several state--of--art models. The model can achieve the area under the receiver operating characteristics (AUROC) curve of 0.959 and area under the precise recall curve (AUPR) of 0.848. We found that the mutual information between the substructure and graph--level representations contributes most to the mutual information index in a relatively sparse network. And the mutual information between the node--level and graph--level representations contributes most in a relatively dense network.

Most machine learning and deep learning algorithms can only use low-dimensional data as input, but the data that must be processed in practical applications is diverse and irregular. There are two main problems with big dynamic data. (1) The size of the embedding table grows linearly with the vocabulary size, resulting in massive memory consumption. (2) For different newly added vocabularies. To solve these two problems, this paper proposes a novel embedding algorithm that can learn attribute associations with entities based on deep and hash algorithms. Taking movie data as an example, the encoding method and the specific flow of the algorithm are presented in detail, and the effect of dynamic reuse of data models is realized. Compared with the four existing embedding algorithms which can fuse entity attribute information, the deep hash embedding algorithm proposed in this paper has obvious optimization of time and space complexity.

Classical religious texts remain an essential part of human culture due to their undiminished influence on the advancement of civilization. Although their entirely divine origin is questioned repeatedly, explicit or implicit quoting and adherence to their basic guidelines are fundamental in modern society. In this respect, these documents’ inner structure and linguistic style appear to be pivotal. This paper considers the topic from the standpoint of small textual patterns classified using deep learning methods, traditionally applied to analyze short textual material like tweets. We divide the considered documents into small sequential chunks imitating tweets and categorizing them, classifying an entire text. The proposed method demonstrates that the religious text collections correspond to stable ”Twitter”-like structures that adequately reflect stylistic properties. So, concise word combinations seem to be an inborn textual attribute that adequately outlines the proposed multi-source authorship. This approach differs from traditional methods of analyzing classical religious documents, which are based on the consideration and interpretation of relatively long templates. The case study consists of three famous collections of Mosaic authorship in the Old Testament (Hebrew), Pauline authorship in the New Testament (Greek), and Al-Ghazali authorship (Arabic). The obtained results go well with most previously expressed evaluations and complement them with new implications, particularly in the authorship of two famous manuscripts attributed to Al-Ghazali.

The widespread deployment of social media has helped researchers access an enormous amount of data in various domains, including the pandemic caused by the COVID-19 spread. This study presents a heuristic approach to classify Commercial Instagram Posts (CIPs) and explores how the businesses around the Holy Shrine – a sacred complex in Mashhad, Iran, surrounded by numerous shopping centers – were impacted by the pandemic. Two datasets of Instagram posts (one gathered data from March 14th to April 10th, 2020, when Holy Shrine and nearby shops were closed, and one extracted data from the same period in 2019), two word embedding models – aimed at vectorizing associated caption of each post, and two neural networks – multi-layer perceptron and convolutional neural network – were employed to classify CIPs in 2019. Among the scenarios defined for the 2019 CIPs classification, the results revealed that the combination of MLP and CBoW achieved the best performance, which was then used for the 2020 CIPs classification. It is found out that the fraction of CIPs to total Instagram posts has increased from 5.58% in 2019 to 8.08% in 2020, meaning that business owners were using Instagram to increase their sales and continue their commercial activities to compensate for the closure of their stores during the pandemic. Moreover, the portion of non-commercial Instagram posts (NCIPs) in total posts has decreased from 94.42% in 2019 to 91.92% in 2020, implying the fact that since the Holy Shrine was closed, Mashhad citizens and tourists could not visit it and take photos to post on their Instagram accounts.

Introduced in 2009, Bitcoin has demonstrated a huge potential as the world’s first digital currency and has been widely used as a financial investment. Our research aims to uncover the relationship between Bitcoin prices and people’s sentiments about Bitcoin on social media. Among various social media platforms, micro-blogging is one of the most popular. Millions of people use micro-blogging platforms to exchange ideas, broadcast views, and to provide opinions on different topics related to politics, culture, science, and technology. This makes them a potentially rich source of data for sentiment analysis. Therefore we chose one of the busiest micro-blogging platforms, Twitter, to perform sentiment analysis on Bitcoin. We used ELMo embedding model to convert Bitcoin-related tweets into a vector form and SVM classifier to divide the tweets into three sentiment categories - positive, negative, and neutral. We then used the sentiment data to find its relation with Bitcoin price fluctuation using the linear mixed model.

The acceleration of the universe is described as a consequence of the extrinsic curvature of the space-time embedded in a bulk space, defined by the Einstein-Hilbert. Using the linear approximation of Nash-Green theorem, we obtain the related perturbed equations in which just the gravitational-tensor field equations contribute to propagation of cosmological perturbations. In accordance with Big Bang Nucleosynthesis and solar constraints, we calculate numerically the effective Newtonian function Geff to constrain the related parameters of the model. We numerically solve the growth density equation for two possible family of solutions leading to an interesting overdensity and, in some cases, a mild damping of the growth profiles, with a top amplification of the growth perturbations around 14% in comparison with LCDM model and quintessence. The effective gravitational Phi and Newtonian curvature Psi are also analysed showing mild perturbations in early times induced only by the extrinsic curvature differently from the LambdaCDM standards.

With the development of deep learning, several Graph Neural Networks (GNN)-based approaches have been utilized for text classification. However, GNNs encounter challenges in capturing contextual text information within a document sequence. To address this, a novel text classification model RB-GAT is proposed by combining RoBERTa-BiGRU embedding and a multi-head Graph ATtention Network (GAT). First, the pre-trained RoBERTa model is exploited to learn word and text embeddings in different contexts. Second, the Bidirectional Gated Recurrent Unit (BiGRU) is employed to capture long-term dependencies and bidirectional sentence information from the text context. Next, the multi-head graph attention network is applied to analyze this information, which serves as a node feature for the document. Finally, the classification results are generated through a Softmax layer. Experimental results on three benchmark datasets demonstrate that our method can achieve an accuracy of 71.48%, 98.45%, and 80.32% on Ohsumed, R8, and MR, which is superior to the existing nine text classification approaches.

Spatio-Temporal Dynamic Mode Decomposition (STDMD) is an extension of Dynamic Mode Decomposition (DMD) designed to handle spatio-temporal datasets. It extends the framework so that it can analyze data that has both spatial and temporal variations, allowing for the extraction of spatial structures and their temporal evolution. The STDMD method extracts temporal and spatial development information simultaneously, including wavenumber, frequencies and growth rates, which is essential in complex dynamic systems. We provide a comprehensive mathematical framework for sequential and parallel STDMD approaches. We also introduce delay coordinates generalization to the presented algorithms to extend the scope of their application. The extension, labeled delay embedding STDMD allows the use of delayed data, which can be both time-delayed and space-delayed. An explicit expression of the presented algorithms in matrix form is also provided, which facilitates theoretical analysis and provides a solid foundation for further research and development. The novel approach is demonstrated using some illustrative model dynamics.

In today's world, news events are emerging incessantly. Classifying the same event reported by different countries is of significant importance for public opinion control and intelligence gathering. Due to the diverse types of news, relying solely on translators would be costly and inefficient, while depending solely on translation systems would incur considerable performance overheads in invoking translation interfaces and storing translated texts. To address this issue, we mainly focus on the clustering problem of cross-lingual news. To be specific, we use a combination of sentence vector representations of news headlines in a mixed semantic space and the topic probability distributions of news content to represent a news article. In the training of cross-lingual models, we employ knowledge distillation techniques to fit two semantic spaces into a mixed semantic space. We abandon traditional static clustering methods like K-Means and AGNES in favor of the incremental clustering algorithm Single-Pass, which we further modify to better suit cross-lingual news clustering scenarios. Our main contributions are as follows: (1) We adopt the English standard BERT as the teacher model and XLM-Roberta as the student model, training a cross-lingual model through knowledge distillation that can represent sentence-level bilingual texts in both Chinese and English. (2) We use the LDA topic model to represent news as a combination of cross-lingual vectors for headlines and topic probability distributions for content, introducing concepts such as topic similarity to address the cross-lingual issue in news content representation. (3) We adapt the Single-Pass clustering algorithm for the news context to make it more applicable. Our optimizations of Single-Pass include adjusting the distance algorithm between samples and clusters, adding cluster merging operations, and incorporating a news time parameter.

Single cell RNA-seq (scRNA-seq) profiles conceal temporal and spatial tissue developmental information. De novo reconstruction of single cell temporal trajectory has been fairly addressed, but reverse engineering single cell 3D spatial tissue localization is hitherto landmark based, and de novo spatial reconstruction is a compelling computational open problem. Here we show that a new algorithm - named D-CE - for coalescent embedding of single cell transcriptomic networks can address this open problem. We rely merely on the spatial information encoded in the expression patterns of developmental signal transcription factor (DST) genes, and we find that D-CE of cell-cell association DST-transcriptomic networks reliably reconstructs the Geo-seq or single cell samples’ 3D spatial tissue distribution. Comparison to the novoSpaRC and CSOmap (recent and only available de novo 3D spatial reconstruction methods) on 16 datasets and 681 reconstructions, reveals a significantly distinctive superior performance of D-CE.

Collatz conjecture (3x+1 problem) is a natural phenomenon in set theory that may be reconstructed using known combinatorics and order theory. Construction begins by selecting a specific order isomorphism with a bijectional order-embedding. Mapping by 3x+1 induces a unique property to only members of the mapped embedding. Under selective congruence from recursive division by two, that complex controls sequence behavior. This demonstration uses an order isomorphism consisting of two linear orders: the (1) odd positive integers and the always odd (2) Rule 50 Jacobsthal numbers, as the embedding. The argument proceeds by cardinality. When the order isomorphism is mapped under 3x+1, all Rule 50 Jacobsthal numbers are mapped to all the powers of four. This one-to-one correspondence guarantees that every odd integer is assigned to a Rule 50 Jacobsthal number, and subsequently, to a power of four. To align this construction with the conjecture, expand the set to all positive integers by showing that: (1) the powers of four embed the powers of two, in a natural way, and (2) the unique factorization of any positive even integer, not congruent to a power of two, is simply an odd integer, once the factorized power of two is divided out. In other words, if the initial choice for a positive integer is not congruent to a power of two, then recursion continues until a Rule 50 Jacobsthal number (guaranteed by cardinality) is attained. Since this value mapped by 3x+1 is always a power of four, repeated division by two will always send the sequence to one. Because this same process occurs for any choice of positive integer, Collatz conjecture is true.

Scator set, introduced by Fernández-Guasti and Zaldívar, is endowed with a very peculiar non-distributive product. In this paper we consider the scator space of dimension $1+2$ and the so called fundamental embedding which maps the subset of scators with non-zero scalar component into 4-dimensional space endowed with a natural distributive product. The original definition of the scator product is induced in a straightforward way. Moreove, we propose an extension of the scator product on the whole scator space, including scators with vanishing scalar component.

The purpose of feature selection is to find important features from the original high-dimensional space. As atypical feature selection algorithm, Locally linear embedding(LLE)-based feature selection algorithm, which applies the idea of LLE to the graph-preserving feature selection framework, has been received wide attention. However, LLE-based feature selection framework is sensitive to noise and K-nearest neighbors. To address these problems, an improved LLE-based feature selection algorithm, robust LLE (RLLE) vote, is proposed. In this algorithm, $l_1$ and $l_2$ regularization are introduced into the high-dimensional reconstruction model of LLE. Furthermore, RLLE vote also proposes a criterion to measure the difference between the reconstruction features and the original features, and then the importance features can be selected by this criteria. Extensive experiments are carried out on a benchmark fault data set and the bearing data set collected from our own laboratory, and the experimental results demonstrate that RLLE vote achieves the most significant performance compared existing state-of-art methods.

In this paper we propose a novel self-supervised approach of keywords and keyphrases retrieval and extraction by an end-to-end deep learning approach, which is trained by contextually self-labelled corpus. Our proposed approach is novel to use contextual and semantic features to extract the keywords and has outperformed the state of the art. Through the experiment the proposed approach has been proved to be better in both semantic meaning and quality than the existing popular algorithms of keyword extraction. In addition, we propose to use contextual features from bidirectional transformers to automatically label short-sentence corpus with keywords and keyphrases to build the ground truth. This process avoids the human time to label the keywords and do not need any prior knowledge. To the best of our knowledge, our published dataset in this paper is a fine domain-independent corpus of short sentences with labelled keywords and keyphrases in the NLP community.

Unsupervised metric learning has been generally studied as a byproduct of dimensionality reduction or manifold learning techniques. Manifold learning techniques like Diusion maps, Laplacian eigenmaps has a special property that embedded space is Euclidean. Although laplacian eigenmaps can provide us with some (dis)similarity information it does not provide with a metric which can further be used on out-of-sample data. On other hand supervised metric learning technique like ITML which can learn a metric needs labeled data for learning. In this work propose methods for incremental unsupervised metric learning. In rst approach Laplacian eigenmaps is used along with Information Theoretic Metric Learning(ITML) to form an unsupervised metric learning method. We rst project data into a low dimensional manifold using Laplacian eigenmaps, in embedded space we use euclidean distance to get an idea of similarity between points. If euclidean distance between points in embedded space is below a threshold t₁ value we consider them as similar points and if it is greater than a certain threshold t₂ we consider them as dissimilar points. Using this we collect a batch of similar and dissimilar points which are then used as a constraints for ITML algorithm and learn a metric. To prove this concept we have tested our approach on various UCI machine learning datasets. In second approach we propose Incremental Diusion Maps by updating SVD in a batch-wise manner.

Chipman contends, in stark contrast to the conventional view, that utility is not a real number but a vector and is inherently lexicographic in nature. According to these views, it will be proved that, for every preordered topological space (X,≾,t), the assumption t to be finer than the order topology t≾ on (X,t), i.e. t⊇t≾, and the assumption the quotient topology t∣∼≾ that is defined on the preordered set (X∣∼,≾∣∼) of indifference classes of ≾ to be Hausdorff imply that a cardinal number κ and a (complete) preorder ≲ on {0,1}κ that is coarser than the lexicographical ordering ≤lex on {0,1}κ, i.e. ≤lex⊂≲, can be chosen in such a way that there exists a continuous order-embedding ϑ:(X,≾,t)⟶({0,1}κ,≲,t≤lex). This theorem will be compared with a theorem that, in particular, describes necessary and sufficient conditions for ≾ to have a continuous multi-utility representation.

Distributional word vector representation orword embedding has become an essential ingredient in many natural language processing (NLP) tasks such as machine translation, document classification, information retrieval andquestion answering. Investigation of embedding model helps to reduce the feature space and improves textual semantic as well as syntactic relations.This paper presents three embedding techniques (such as Word2Vec, GloVe, and FastText) with different hyperparameters implemented on a Bengali corpusconsists of180 million words. The performance of the embedding techniques is evaluated with extrinsic and intrinsic ways. Extrinsic performance evaluated by text classification, which achieved a maximum of 96.48% accuracy. Intrinsic performance evaluatedby word similarity (e.g., semantic, syntactic and relatedness) and analogy tasks. The maximum Pearson (ˆr) correlation accuracy of 60.66% (Ssˆr) achieved for semantic similarities and 71.64% (Syˆr) for syntactic similarities whereas the relatedness obtained 79.80% (Rsˆr). The semantic word analogy tasks achieved 44.00% of accuracy while syntactic word analogy tasks obtained 36.00%

With large-scale distributed generators (DGs) in an active distribution network (ADN), conventional load flow convergence failure is incurred by heavy power transmission. The Holomorphic Embedding Load Flow Method (HELM) has proven to be more robust than the Newton–Raphson method under heavy power transmission. At present, HELM is mainly designed for balanced transmission networks. In this study, we developed a three-phase HELM model to accommodate DGs, delta connection loads, and ZIP loads for ADN. The effectiveness and better performance of the proposed method under heavy load situations were validated using modified unbalanced IEEE 13, 34, 37, and 123 test feeders.

The proliferation of fake news on social media platforms poses significant challenges to information authenticity and public trust. In this study, the impact of various word embedding techniques on the performance of both machine learning and deep learning models for fake news detection is systematically evaluated. The comprehensive TruthSeeker dataset, which spans over a decade of labeled news articles and social media posts, is utilized. Three popular word embedding techniques are analyzed: TF-IDF, Word2Vec, and FastText. These embeddings were tested with multiple machine learning classifiers, including logistic regression, naive Bayes, K-nearest neighbors, support vector machines, multilayer perceptrons, decision trees, and random forests, as well as deep learning models, specifically convolutional neural networks (CNNs). Among machine learning models, the Support Vector Machine (SVM) with TF-IDF achieved the highest accuracy of 99.03%, precision of 98.92%, recall of 99.15%, and F1 score of 99.03%. The Multilayer Perceptron (MLP) also demonstrated strong performance with Word2Vec, reaching an accuracy of 95.24%, precision of 94.95%, recall of 95.50%, and F1 score of 95.07%. For deep learning models, CNNs combined with TF-IDF embeddings showed outstanding results, achieving an accuracy of 98.99%, precision of 98.56%, recall of 99.48%, and F1 score of 99.02%. These results highlight the critical role of word embeddings in enhancing model accuracy and reliability in misinformation detection.

In bioinformatics research, traditional machine learning methods have demonstrated efficacy in addressing Euclidean data. However, real-world data often encompasses non-Euclidean forms, such as graph data, which contain intricate structural patterns or high-order relationships that elude conventional machine-learning approaches. Representation learning seeks to derive valuable data representations from enhancing predictive or analytic tasks, capturing vital patterns and structures. This method has proven particularly beneficial in bioinformatics and biomedicine, as it effectively handles high-dimensional, sparse data, detects complex biological patterns, and optimizes predictive performance. In recent years, graph representation learning has become a popular research direction. It embeds graphs into a low-dimensional space while preserving the structural and attribute information of the graph, enabling better feature extraction for downstream tasks. This study extensively reviews representation learning advancements, particularly in the research of representation methods since the emergence of COVID-19. We begin with an analysis and classification of neural network-based language model representation learning techniques as well as graph representation learning methods. Subsequently, we explore their methodological innovations in the context of COVID-19, with a focus on the domains of drugs, public health, and healthcare. Furthermore, we discuss the challenges and opportunities associated with graph representation learning. This comprehensive review presents invaluable insights for researchers as it documents the development of COVID-19 and offers experiential lessons to preempt future infectious diseases. Moreover, this study guides future bioinformatics and biomedicine research methodologies.

Depressive disorder is a disease that causes a decrease in daily function, and the prevalence of depressive disorder in Korea is the highest among OECD countries. However, due to lack of manpower and negative social awareness, timely treatment is not being performed properly. As a solution to this, AI counseling chatbots are emerging, and it is essential to use labeled datasets to create chatbots. Currently, many countries around the world, including Korea, use the Diagnostic and Statistical Manual of Mental Disorders Fifth Edition, DSM-5, but there are no nine labeled datasets according to the DSM-5 depression disorder diagnosis criteria. This study collects sympathetic datasets, analyzes morphemes using Kind Korean Morpheme Analyzer and augments and builds a word dictionary using Word2Vec. As a result, we have labeled the dataset with nine criteria for diagnosing DSM-5 depressive disorder, which will enhance the performance of the counseling chatbot.

Embedding representation models characterize each word as a vector of numbers with a fixed length. These models have been used in tasks involving text classification, such as recommen- dation and question-answer systems. Semantic relationships are words with a relationship between them providing a complete idea to a text. Therefore, it is hypothesized that an embedding model involving semantic relationships will provide better performance for tasks that use them. This paper presents three embedding models based on semantic relations extracted fromWikipedia to classify texts. The synonym, hyponym, and hyperonym semantic relationships were the ones considered in this work since previous experiments have shown that they are the ones that provide the most semantic knowledge. Lexical-syntactic patterns present in the literature were implemented and subsequently applied to the Wikipedia corpus to obtain the semantic relationships present in it. Several semantic relationships are used in different models: synonymy, hyponym-hyperonym, and a combination of the first two. A convolutional neural network was trained for text classification to evaluate the performance of each model. The results obtained were evaluated with the metrics of precision, accuracy, recall, and F1-measure. The best values obtained with the second model were accuracy of 0.79 for the 20-Newsgroup corpus. F1-measure and recall of 0.87 respectively for the Reuters corpus.

In heterogeneous networks, the random walks based on meta-path requires prior knowledge and lacks flexibility. And the random walks based on non-meta-path only considers the number of node types, but does not consider the influence of schema and topology between node types in real networks. To solve the above problems, this paper proposes a novel model HNE-RWTIC (Heterogeneous Network Embedding Based on Random Walks of Type & Inner Constraint). Firstly, to realize the flexible walks, we design a Type strategy, which is the node type selection strategy based on the co-occurrence probability of node types. Secondly, to achieve the uniformity of node sampling, we design an Inner strategy, which is the node selection strategy based on the adjacency relationship between nodes. The Type & Inner strategy can realize the random walks based on meta-path, the flexibility of the walks, and can sample the node types and nodes uniformly in proportion. Thirdly, based on the above strategy, a transition probability model is constructed; then, we obtain the nodes embedding based on the random walks and Skip-Gram. Finally, in classification and clustering tasks, we conducted a thorough empirical evaluation of our method on three real heterogeneous networks. Experimental results shown that F1-Score and NMI of HNE-RWTIC outperform state-of-the-art approaches.

Nowadays, we use social networks such as Twitter, Facebook, WeChat and Weibo as means to communicate with each other and get to know others. Gradually social networks has become indispensable in our everyday life, and we cannot absolutely imagine what the daily life would be like without social networks. Through social networks, we can access friends' opinions and behaviors easily and are influenced by them in turn. Thus, an effective algorithm to find the top-K influential nodes (the problem of influence maximization) in the social network is critical for various downstream tasks such as viral marketing, anticipating natural hazards, reducing gang violence, public opinion supervision etc. Solving the problem of influence maximization in real-world propagation scenarios often involves estimating influence strength (influence probability between two nodes), which cannot directly observed. To estimate influence strength, conventional approaches propose various humanly-devised rules to extract features of user interactions, the effectiveness of which heavily depends on domain expert knowledge. Besides, they are often applicable for special scenarios or specific diffusion models. Consequently, they are difficult to be generalized into different scenarios, diffusion models and even domains. Inspired by the powerful ability of neural networks in the field of representation learning, we design a deep hierarchical network embedding model HGE to map nodes (with attributes) into latent space automatically. In general, HGE takes an attributed social network as the input for learning latent network representation of each node, incorporating hierarchical community structure, node attributes and general network structure into a unified deep generative framework. Then, with the leaned latent representation of each node, we propose a HGE-GA algorithm to predict influence strength and compute the top-K influential nodes through a greedy-based maximization algorithm. Extensive experiments on real-world attributed networks demonstrate the outstanding superiority of the proposed HGE model and HGE-GA algorithm compared with the state-of-the-art methods, verifying the effectiveness of the proposed model and algorithm.

In the extensive monitoring of maritime traffic, maritime management frequently encounters incomplete automatic identification system (AIS) data, particularly in critical static fields like vessel types. This shortfall presents substantial challenges in safety management, necessitating robust methods for data completion. Distinct from road traffic, where road width imposes constraints, maritime vessels of identical classifications often choose significantly divergent routes, deviating by several nautical miles. Sole dependence on trajectory clustering is insufficient. Addressing this issue, we segments the maritime area into spatiotemporal grids, transforming vessel paths into sequences of grid encodings. Utilizing natural language processing techniques, we integrate the Word2vec word embedding approach with our novel biLSTM self-attention chunk-max pooling net (biSAMNet) model, enhancing the classification of vessel trajectories. This method is crucial for determining static details like vessel types. Employing the Taiwan Strait as a case study and benchmarking against CNN, RNN, and methods based on the attention mechanism, our findings underscore our model’s superiority. The biSAMNet achieves an impressive vessel classification F1 score of 0.94, using only 5-dimensional word embeddings, highlighting the effectiveness of Word2vec pre-trained embedding layers. This research introduces a novel paradigm for processing vessel trajectory data, greatly enhancing the accuracy of filling in incomplete vessel type details.

The root system plays an irreplaceable role in plant growth. Its improvement can increase crop productivity. However, such system is still mysterious for us. The underlying mechanism has not been fully uncovered. The investigation on proteins related to the root system is an important means to complete this task. In the previous time, lack of root-related proteins makes it impossible to adopt machine learning methods for designing efficient models for the discovery of novel root-related proteins. Recently, a public database on root-related proteins was set up and machine learning methods can be applied in this field. In this study, we proposed a machine learning based model, named Graph-Root, for identification of root-related proteins. The features derived from protein sequences and one network were extracted, where the former features were processed by graph convolutional neural network and multi-head attention, and the later features abstracted the linkage between proteins. These features were fed into the fully connected layer to make prediction. The 5-fold cross-validation and independent tests suggested its good performance. It also outperformed the only one previous model, SVM-Root. Furthermore, the importance of each feature type and component in the proposed model was investigated.

The gate resistance is a parasitic element in transistors for RF and millimeter-wave circuits that can negatively impact power gain and noise figure. To develop accurate device models, a reliable measurement methodology is crucial. This article reviews the standard measurement methodology used in the literature and proposes also an additional method, which is evaluated using suitable test structures in a 16nm FinFET process. The advantages and disadvantages of the two approaches are discussed along with their respective application scenarios

Drug repositioning (also called drug repurposing) is a strategy for identifying new therapeutic targets for existing drugs. This approach is of great importance in pharmacology as it is a faster and cheaper way to develop new medical treatments. In this paper, we present, to our knowledge, the first application of multiplex-heterogeneous network embedding to drug repositioning. Network embedding learns the vector representations of nodes, opening the whole machine learning toolbox for a wide variety of applications including link prediction, node labelling or clustering. So far, the application of network embedding for drug repositioning focused on heterogeneous networks. Our approach for drug repositioning is based on multiplex-heterogeneous network embedding. Such method allows the richness and complexity of multiplex and heterogeneous networks to be projected in the same vector space. In other words, multiplex-heterogeneous networks aggregate different multi-omics data in the same network representation. We validate the approach on a task of link prediction and on a case study for SARS-CoV2 drug repositioning. Experimental results show that our approach is highly robust and effective for finding new drug-target associations.

This paper addresses the problem of non-cooperative spectrum sensing in very low signal noise ratio (SNR) conditions. In our approach, detecting an unoccupied bandwidth consists to detect the presence or absence of a communication signal on this bandwidth. Major well known communication signals may contain hidden periodicities, we use the Recurrence Quantification Analysis (RQA) to reveal the hidden periodicities. RQA is very sensitive to a reliable estimation of the phase space dimension m or the time delay τ. In view of the limitations of algorithms proposed in the literature, we have proposed a new algorithm to estimate simultaneously the optimal values of m and τ. The new proposed optimal values allow the states reconstruction of the observed signal and then the estimation of the distance matrix. This distance matrix has particular properties which we have exploited to propose the Recurrence Analysis based Detector (RAD). RAD can detect a communication signal in a very low SNR condition. Using Receiver Operating Characteristic curves, our experimental results corroborate the robustness of our proposed algorithm comparing to classical widely used algorithms.

The aim of this study was to build a tool to analyze, using artificial intelligence, the sentiment perception of users who answered two questions from the CSQ – 8 questionnaires with raw Spanish free-text. Their responses are related to mindfulness, which is a novel technique used to control stress and anxiety caused by different factors in daily life. As such, we proposed an online course where this method was applied in order to improve the quality of life of health care professionals in COVID 19 pandemic times. We also carried out an evaluation of the satis-faction level of the participants involved, with a view to establishing strategies to improve fu-ture experiences. To automatically perform this task, we used Natural Language Processing (NLP) models such as swivel embedding, neural networks and transfer learning, so as to classify the inputs into the following 3 categories: negative, neutral and positive. Due to the lim-ited amount of data available - 86 registers for the first and 68 for the second - transfer learning techniques were required. The length of the text had no limit from the user’s standpoint, and our approach attained a maximum accuracy of 93.02 % and 90.53 % respectively based on ground truth labeled by 3 experts. Finally, we proposed a complementary analysis, using com-puter graphic text representation based on word frequency, to help researchers identify relevant information about the opinions with an objective approach to sentiment. The main conclusion drawn from this work is that the application of NLP techniques in small amounts of data using transfer learning is able to obtain enough accuracy in sentiment analysis and text classification stages

Complexity science studies physical phenomena that cannot be explained by the mere analysis of the single units of a system but requires to account for their interactions. A feature of complexity in connected systems is the emergence of mesoscale patterns in a geometric space, such as groupings in bird flocks. These patterns are formed by groups of points that tend to separate from each other, creating mesoscale structures. When multidimensional data or complex networks are embedded in a geometric space, some mesoscale patterns can appear respectively as clusters or communities, and their geometric separability is a feature according to which the performance of an algorithm for network embedding can be evaluated. Here, we introduce a framework for the definition and measure of the geometric separability (linear and nonlinear) of mesoscale patterns by solving the travelling salesman problem (TSP), and we offer experimental evidence on embedding and visualization of multidimensional data or complex networks, which are generated artificially or are derived from real complex systems. For the first time in literature the TSP’s solution is used to define a criterion of nonlinear separability of points in a geometric space, hence redefining the separability problem in terms of the travelling salesman problem is an innovation which impacts both computer science and complexity theory.

Alzheimer’s Disease (AD) affects the quality of life of millions of people worldwide and represents one of the biggest challenges for the whole society. The SH-SY5Y neuroblastoma cell line is often used as an in vitro model of neuronal function and is widely applied to study the molecular events leading to AD. In the last few years, basic research on SH-SY5Y cells has provided interesting insights for the discovery of new drugs and biomarkers for improved AD treatment and diagnosis. At the same time, untargeted NMR metabolomics is widely applied on biological fluids for (i) metabolic profile analysis, (ii) screening for differential metabolites, (iii) analysis of metabolic pathways, and (iv) the discovery of new biomarkers. Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) have proved to be powerful methods for processing NMR data, being useful in signal quantization, even if more sophisticated --- typically non--linear --- techniques are needed to obtain compact yet information--rich embeddings for complex spectra. In this paper, a compression technique based on convolutional autoencoders is proposed, which can perform a high dimensionality reduction of the spectral signal (up to more than 300 times), maintaining informative features (guaranteed by a reconstruction error always smaller than 5%). Moreover, before compression, an ad hoc preprocessing method was devised to remedy the scarcity of available data. The compressed spectral data were then used to train some SVM classifiers to distinguish diseased from healthy cells, achieving an accuracy close to 78%, a significantly better performance with respect to using PCA--compressed data.

This research investigated high-temperature corrosion (500 °C) of Cr-Mo steel processed using water jet peening or multifunction cavitation (MFC), and the suitability of such steel for high-temperature boilers and reaction vessels. High-temperature corrosion was induced using an embedment test and a coating test using sulfide-type K2SO4-Na2SO4 powder. To measure the relaxation of the residual stress due to the decrease in work hardening caused by an increase in specimen temperature and the difference in thermal shrinkage between the surface and interior of the specimen, a thermal cycling test was conducted. For the MFC-processed specimen, the oxide film that formed on the surface suppressed mass loss, prevented crack formation, and reduced the compressive residual stress caused by high-temperature corrosion. MFC-processed Cr-Mo steel is thus suitable for a high-temperature corrosion environment.

Reliable prediction of infectious disease is an essential need for public health organizations to minimize or prevent the disease's spread. With the increase of data growth in the healthcare sector, accurate analysis of such data helps for early disease detection and better patient care. With the availability of huge data, it is a great deal for predicting and handling an epidemic occurrence. To control the epidemic disease, a new Artificial Intelligence called Manhattan Hessian Linear Feature Embedding Based Tucker Congruence Deep Convolutional Network (MHLFE-TCDCN) is introduced with higher accuracy and minimum time consumption. The MIoT device is used to collect the data from the patient body. The proposed MHLFE-TCDCN includes two major processes namely feature selection and classification with multiple layers such as input, two hidden layers, and one output layer. First, the feature selection process is performed using the Manhattan Hessian Locally Linear Embedding technique in the first hidden layer to minimize the dimensionality and time complexity. After selecting the feature, the classification is performed using the Tucker coefficient of congruence regression. The Tucker coefficient of congruence measures the similarity between the training and testing disease data. A positive similarity level is used to accurately identify the disease at the output layer based on the similarity measure. Experimental assessment is carried out with various parameters such as accuracy, precision, recall, F-measure, and computational time concerning several numbers of patient data. The quantitative results and discussion that the proposed MHLFE-TCDCN technique achieves higher accuracy with minimal computation time as compared to the conventional methods.

In 1999, Molodtsov initiated the theory of soft sets as a new mathematical tool for dealing with uncertainties in many fields of applied sciences. In 2011, Shabir and Naz introduced and studied the notion of soft topological spaces, also defining and investigating many new soft properties as generalization of the classical ones. In this paper, we introduce the notions of soft separation between soft points and soft closed sets in order to obtain a generalization of the well-known Embedding Lemma to the class of soft topological spaces.

The review of previous works shows this study is the first attempt to analyse the lockdown effect using Natural Language Processing Techniques, particularly sentiment analysis methods applied at large scale. On the other hand, it is also the first of its kind to analyse the impact of COVID 19 on the university community jointly on staff and students and with a multi-country perspective. The main overall findings of this work show that the most often related words were family, anxiety, house and life. On another front, it has also been shown that staff have a slightly less negative perception of the consequences of COVID in their daily life. We have used artificial intelligence models like swivel embedding and the Multilayer Perceptron, as classification algorithms. The performance reached in terms of accuracy metric are 88.8% and 88.5%, for student and staff respectively. The main conclusion of our study is that higher education institutions and policymakers around the world may benefit from these findings while formulating policy recommendations and strategies to support students during this and any future pandemics.

The rapid expansion of transcriptomics from increased affordability of next-generation sequencing (NGS) technologies generates rocketing amounts of gene expression data across biology and medicine, and notably in cancer research. Concomitantly, many bioinformatics tools were developed to streamline gene expression analysis and quantification. We tested the concordance of NGS RNA sequencing (RNA-seq) analysis outcomes between the two predominant programs for reads alignment, HISAT2 and STAR, and the two most popular programs for quantifying gene expression in NGS experiments, edgeR and DESeq2, using RNA-seq data from a series of breast cancer progression specimens, which include histologically confirmed normal, early neoplasia, ductal carcinoma in situ and infiltrating ductal carcinoma samples microdissected from formalin fixed, paraffin embedded (FFPE) breast tissue blocks. We identified significant differences in aligners’ performance: HISAT2 was prone to misalign reads to retrogene genomic loci, STAR generated more precise alignments, especially for early neoplasia samples. edgeR and DESeq2 produced similar lists of differentially expressed genes in stage comparisons, with edgeR producing more conservative, though shorter, lists of genes. Albeit, Gene Ontology (GO) enrichment analysis revealed no skewness in significant GO categories identified among differentially expressed genes by edgeR vs DESeq2. As transcriptome analysis of archived FFPE samples becomes a vanguard of precision medicine, identification and fine-tuning of bioinformatics tools becomes critical for clinical research. Our results indicate that STAR and edgeR are well-suited tools for differential gene expression analysis from FFPE samples.

Historical maps constitute unique sources of retrospective geographic information. Recently, several map archives containing map series covering large spatial and temporal extents have been systematically scanned and made available to the public. The geographic information contained in such data archives allows extending geospatial analysis retrospectively beyond the era of digital cartography. However, given the large data volumes of such archives and the low graphical quality of older map sheets, the processes to extract geographic information need to be automated to the highest degree possible. In order to understand the salient characteristics, data quality variation, and potential challenges in large-scale information extraction tasks, preparatory analytical steps are required to efficiently assess spatio-temporal coverage, approximate map content, and spatial accuracy of such georeferenced map archives across different cartographic scales. Such preparatory steps are often neglected or ignored in the map processing literature but represent highly critical phases that lay the foundation for any subsequent computational analysis and recognition. In this contribution we demonstrate how such preparatory analyses can be conducted using classical analytical and cartographic techniques as well as visual-analytical data mining tools originating from machine learning and data science, exemplified for the United States Geological Survey topographic map and Sanborn fire insurance map archives.

The notion of Critical Point Theory has extensive application in the filed of Partial Differential Equations, one of which is studying the existence and commenting on the uniqueness and multiplicity (in case when the solution is not unique) of weak solutions to Elliptic PDEs under certain boundary conditions.\par This article provides a brief survey about specific concepts like : differentiation on Banach Spaces, maxima and minima and its applications to PDEs. Furthermore, we've discussed the notion of defining a weak topology on Banach Spaces, before introducing the Variational Principle and its applications.\par The epilogue of the article primarily deals with results which studies the existence of weak solutions to Dirichlet Boundary Value Problems under specific conditions. The most notable aspect of this article is the proof of \textit{Rabinowitz's Saddle Point Theorem} using the method of \textit{Brouwer Degree}. Readers who are highly motivated in pursuing research in any of the topics relevent to the contents of this paper will surely find the \texttt{References} section to be extremely resourceful.