Graph Transformer for Communities Detection in Social Networks

Graphs are used in various disciplines such as telecommunication,biological networks,as well as social networks.In large-scale networks,it is challenging to detect the communities by learning the distinct properties of the graph.As deep learning hasmade contributions in a variety of domains,we try to use deep learning techniques to mine the knowledge from large-scale graph networks.In this paper,we aim to provide a strategy for detecting communities using deep autoencoders and obtain generic neural attention to graphs.The advantages of neural attention are widely seen in the field of NLP and computer vision,which has low computational complexity for large-scale graphs.The contributions of the paper are summarized as follows.Firstly,a transformer is utilized to downsample the first-order proximities of the graph into a latent space,which can result in the structural properties and eventually assist in detecting the communities.Secondly,the fine-tuning task is conducted by tuning variant hyperparameters cautiously,which is applied to multiple social networks(Facebook and Twitch).Furthermore,the objective function(crossentropy)is tuned by L0 regularization.Lastly,the reconstructed model forms communities that present the relationship between the groups.The proposed robust model provides good generalization and is applicable to obtaining not only the community structures in social networks but also the node classification.The proposed graph-transformer shows advanced performance on the social networks with the average NMIs of 0.67±0.04,0.198±0.02,0.228±0.02,and 0.68±0.03 on Wikipedia crocodiles,Github Developers,Twitch England,and Facebook Page-Page networks,respectively.

A Stochastic Flight Problem Simulation to Minimize Cost of Refuelling

Commercial airline companies are continuously seeking to implement strategies for minimizing costs of fuel for their flight routes as acquiring jet fuel represents a significant part of operating and managing expenses for airline activities.A nonlinear mixed binary mathematical programming model for the airline fuel task is presented to minimize the total cost of refueling in an entire flight route problem.The model is enhanced to include possible discounts in fuel prices,which are performed by adding dummy variables and some restrictive constraints,or by fitting a suitable distribution function that relates prices to purchased quantities.The obtained fuel plan explains exactly the amounts of fuel in gallons to be purchased from each airport considering tankering strategy while minimizing the pertinent cost of the whole flight route.The relation between the amount of extra burnt fuel taken through tinkering strategy and the total flight time is also considered.A case study is introduced for a certain flight rotation in domestic US air transport route.The mathematical model including stepped discounted fuel prices is formulated.The problem has a stochastic nature as the total flight time is a random variable,the stochastic nature of the problem is realistic and more appropriate than the deterministic case.The stochastic style of the problem is simulated by introducing a suitable probability distribution for the flight time duration and generating enough number of runs to mimic the probabilistic real situation.Many similar real application problems are modelled as nonlinear mixed binary ones that are difficult to handle by exact methods.Therefore,metaheuristic approaches are widely used in treating such different optimization tasks.In this paper,a gaining sharing knowledge-based procedure is used to handle the mathematical model.The algorithm basically based on the process of gaining and sharing knowledge throughout the human lifetime.The generated simulation runs of the example are solved using the proposed algorithm,and the resulting distribution outputs for the optimum purchased fuel amounts from each airport and for the total cost and are obtained.

Deep Stacked Ensemble Learning Model for COVID-19 Classification

COVID-19 is a growing problem worldwide with a high mortality rate.As a result,the World Health Organization(WHO)declared it a pandemic.In order to limit the spread of the disease,a fast and accurate diagnosis is required.A reverse transcript polymerase chain reaction(RT-PCR)test is often used to detect the disease.However,since this test is time-consuming,a chest computed tomography(CT)or plain chest X-ray(CXR)is sometimes indicated.The value of automated diagnosis is that it saves time and money by minimizing human effort.Three significant contributions are made by our research.Its initial purpose is to use the essential finetuning methodology to test the action and efficiency of a variety of vision models,ranging from Inception to Neural Architecture Search(NAS)networks.Second,by plotting class activationmaps(CAMs)for individual networks and assessing classification efficiency with AUC-ROC curves,the behavior of these models is visually analyzed.Finally,stacked ensembles techniques were used to provide greater generalization by combining finetuned models with six ensemble neural networks.Using stacked ensembles,the generalization of the models improved.Furthermore,the ensemble model created by combining all of the finetuned networks obtained a state-of-the-art COVID-19 accuracy detection score of 99.17%.The precision and recall rates were 99.99%and 89.79%,respectively,highlighting the robustness of stacked ensembles.The proposed ensemble approach performed well in the classification of the COVID-19 lesions on CXR according to the experimental results.

An Artificial Intelligence Approach for Solving Stochastic Transportation Problems

Recent years witness a great deal of interest in artificial intelligence(AI)tools in the area of optimization.AI has developed a large number of tools to solve themost difficult search-and-optimization problems in computer science and operations research.Indeed,metaheuristic-based algorithms are a sub-field of AI.This study presents the use of themetaheuristic algorithm,that is,water cycle algorithm(WCA),in the transportation problem.A stochastic transportation problem is considered in which the parameters supply and demand are considered as random variables that follow the Weibull distribution.Since the parameters are stochastic,the corresponding constraints are probabilistic.They are converted into deterministic constraints using the stochastic programming approach.In this study,we propose evolutionary algorithms to handle the difficulties of the complex high-dimensional optimization problems.WCA is influenced by the water cycle process of how streams and rivers flow toward the sea(optimal solution).WCA is applied to the stochastic transportation problem,and obtained results are compared with that of the new metaheuristic optimization algorithm,namely the neural network algorithm which is inspired by the biological nervous system.It is concluded that WCA presents better results when compared with the neural network algorithm.