Summary This paper presents a comprehensive three‐step approach (CNN‐JSO‐LSTM) for predictive modeling using a pandemic such as COVID‐19 as a test case. Initially, a Convolutional Neural Network (CNN) is employed to extract crucial features pertinent to the pandemic. Subsequently, the Jellyfish Search Optimizer (JSO) algorithm is applied for feature selection, identifying the most relevant factors. These chosen features are then inputted into a Long Short‐Term Memory (LSTM) network, responsible for classifying samples into “healthy” and “diseased” categories. Our method enhances LSTM performance using the Jellyfish Search optimizer, resulting in exceptional prediction accuracy. Our experiments achieved remarkable metrics, with an accuracy of 95.32%, high sensitivity (94.87%), and precision (94.28%), surpassing alternative methods. In conclusion, our study presents a promising and highly accurate approach for pandemic prediction, harnessing deep learning and swarm intelligence techniques. These findings suggest a potential for more effective pandemic management and intervention strategies.

Abstract Here we introduce a new evolutionary algorithm called the Lotus Effect Algorithm, which combines efficient operators from the dragonfly algorithm, such as the movement of dragonflies in flower pollination for exploration, with the self-cleaning feature of water on flower leaves known as the lotus effect, for extraction and local search operations. The authors compared this method to other improved versions of the dragonfly algorithm using standard benchmark functions, and it outperformed all other methods according to Fredman's test on 29 benchmark functions. The article also highlights the practical application of LEA in reducing energy consumption in IoT nodes through clustering, resulting in increased packet delivery ratio and network lifetime. Additionally, the performance of the proposed method was tested on real-world problems with multiple constraints, such as the welded beam design optimization problem and the speed-reducer problem applied in a gearbox, and the results showed that LEA performs better than other methods in terms of accuracy.

Abstract Today, millions of active users spend a percentage of their time on location‐based social networks like Yelp and Gowalla and share their rich information. They can easily learn about their friends' behaviors and where they are visiting and be influenced by their style. As a result, the existence of personalized recommendations and the investigation of meaningful features of users and Point of Interests (POIs), given the challenges of rich contents and data sparsity, is a substantial task to accurately recommend the POIs and interests of users in location‐based social networks (LBSNs). This work proposes a novel pipeline of POI recommendations named DeePOF based on deep learning and the convolutional neural network. This approach only takes into consideration the influence of the most similar pattern of friendship instead of the friendship of all users. The mean‐shift clustering technique is used to detect similarity. The most similar friends' spatial and temporal features are fed into our deep CNN technique. The output of several proposed layers can predict latitude and longitude and the ID of subsequent appropriate places, and then using the friendship interval of a similar pattern, the lowest distance venues are chosen. This combination method is estimated on two popular datasets of LBSNs. Experimental results demonstrate that analyzing similar friendships could make recommendations more accurate and the suggested model for recommending a sequence of top‐k POIs outperforms state‐of‐the‐art approaches.

Abstract Matrix factorization (MF) is one of the most important regression analysis methods used in recommendation systems. Max margin matrix factorization (MMMF) is a variant of MF which transforms the regression analysis problem into a single multi‐class classification problem, and then learns a multi‐class max margin classifier to achieve to a better error rate. One drawback of multi‐class MMMF is its bias towards class with small sample size. Therefore, hierarchical MMMF (HMF) which uses some two‐class MMMF problems in a hierarchical manner for multi‐class classification was proposed. Each two‐class MMMF of HMF is learned on the basis of thresholded training data which is too imbalanced for some two‐class MMMFs. Meanwhile, all training data is used in each two‐class MMMF. In the test phase of HMF, an imbalanced tree is used to estimate rating. Each node of this tree is a learned two‐class MMMF. In this paper, we propose a balanced HMF, which constructs a balanced tree with minimum depth. Each node of this tree is a learned two‐class MMMF on the basis of a part of data which is selected such that to be more balanced than that of the traditional HMF. Moreover, each part of data in our proposed balanced HMF does not have overlap with all previous parts of data. Therefore, the overall training data used in each step of balanced HMF is smaller than that of in the traditional HMF. Experimental results on real datasets show that training time, test time and error rate of our proposed balanced HMF is better than those of the traditional HMF.

Abstract In real-world recommender systems, user preferences are dynamic and typically change over time. Capturing the temporal dynamics of user preferences is essential to design an efficient personalized recommender system and has recently attracted significant attention. In this paper, we consider user preferences change individually over time. Moreover, based on the intuition that social influence can affect the users’ preferences in a recommender system, we propose a Temporal and Social Collective Matrix Factorization model called TSCMF for recommendation. We jointly factorize the users’ rating information and social trust information in a collective matrix factorization framework by introducing a joint objective function. We model user dynamics into this framework by learning a transition matrix of user preferences between two successive time periods for each individual user. We present an efficient optimization algorithm based on stochastic gradient descent for solving the objective function. The experiments on a real-world dataset illustrate that the proposed model outperforms the competitive methods. Moreover, the complexity analysis demonstrates that the proposed model can be scaled up to large datasets.

Abstract Two previously proposed heuristic algorithms for solving penalized regression‐based clustering model (PRClust) are (a) an algorithm that combines the difference‐of‐convex programming with a coordinate‐wise descent (DC‐CD) algorithm and (b) an algorithm that combines DC with the alternating direction method of multipliers (DC‐ADMM). In this paper, a faster method is proposed for solving PRClust. DC‐CD uses p × n × (n − 1)/2 slack variables to solve PRClust, where n is the number of data and p is the number of their features. In each iteration of DC‐CD, these slack variable and cluster centres are updated using a second‐order cone programming (SOCP). DC‐ADMM uses p × n × (n − 1) slack variables. In each iteration of DC‐ADMM, these slack variables and cluster centres are updated using ADMM. In this paper, PRClust is reformulated into an equivalent model to be solved using alternating optimization. Our proposed algorithm needs only n × (n − 1)/2 slack variables, which is much less than that of DC‐CD and DC‐ADMM and updates them analytically using a simple equation in each iteration of the algorithm. Our proposed algorithm updates only cluster centres using an SOCP. Therefore, our proposed SOCP is much smaller than that of DC‐CD, which is used to update both cluster centres and slack variables. Experimental results on real datasets confirm that our proposed method is faster and much faster than DC‐ADMM and DC‐CD, respectively.

Social annotation systems (SAS) allow users to annotate different online resources with keywords (tags). These systems help users in finding, organizing, and retrieving online resources to significantly provide collaborative semantic data to be potentially applied by recommender systems. Previous studies on SAS had been worked on tag recommendation. Recently, SAS‐based resource recommendation has received more attention by scholars. In the most of such systems, with respect to annotated tags, searched resources are recommended to user, and their recent behavior and click‐through is not taken into account. In the current study, to be able to design and implement a more precise recommender system, because of previous users' tagging data and users' current click‐through, it was attempted to work on the both resource (such as web pages, research papers, etc.) and tag recommendation problem. Moreover, by applying heat diffusion algorithm during the recommendation process, more diverse options would present to the user. After extracting data, such as users, tags, resources, and relations between them, the recommender system so called “Swallow” creates a graph‐based pattern from system log files. Eventually, following the active user path and observing heat conduction on the created pattern, user further goals are anticipated and recommended to him. Test results on SAS data set demonstrate that the proposed algorithm has improved the accuracy of former recommendation algorithms.

We present a study of the Web based user navigation patterns mining and propose a novel approach for clustering of user navigation patterns. The approach is based on the graph partitioning for modeling user navigation patterns. For the clustering of user navigation patterns we create an undirected graph based on connectivity between each pair of Web pages and we propose novel formula for assigning weights to edges in such a graph. The experimental results represent that the approach can improve the quality of clustering for user navigation pattern in Web usage mining systems. These results can be use for predicting userpsilas next request in the huge Web sites.

The Internet is one of the fastest growing areas of intelligence gathering. During their navigation web users leave many records of their activity. This huge amount of data can be a useful source of knowledge. Advanced mining processes are needed for this knowledge to be extracted, understood and used. Web Usage Mining (WUM) systems are specifically designed to carry out this task by analyzing the data representing usage data about a particular Web Site. WUM can model user behavior and, therefore, to forecast their future movements. Online prediction is one web usage mining application. However, the accuracy of the prediction and classification in the current architecture of predicting users' future requests systems can not still satisfy users especially in Huge Web sites. To provide online prediction efficiently, we advance an architecture for online predicting in Web Usage Mining system and propose a novel approach based on LCS algorithm for classifying user navigation patterns for predicting users' future requests. The Excremental results show that the approach can improve accuracy of classification in the architecture.