Multi-objective NSGA-II based community detection using dynamical evolution social network

Community detection is becoming a highly demanded topic in social networking-based applications. It involves finding the maximum intraconnected and minimum inter-connected sub-graphs in given social networks. Many approaches have been developed for community’s detection and less of them have focused on the dynamical aspect of the social network. The decision of the community has to consider the pattern of changes in the social network and to be smooth enough. This is to enable smooth operation for other community detection dependent application. Unlike dynamical community detection Algorithms, this article presents a non-dominated aware searching Algorithm designated as non-dominated sorting based community detection with dynamical awareness (NDS-CD-DA). The Algorithm uses a non-dominated sorting genetic algorithm NSGA-II with two objectives: modularity and normalized mutual information (NMI). Experimental results on synthetic networks and real-world social network datasets have been compared with classical genetic with a single objective and has been shown to provide superiority in terms of the domination as well as the convergence. NDS-CD-DA has accomplished a domination percentage of 100% over dynamic evolutionary community searching DECS for almost all iterations

Community Aware Recommendation System with Explicit and Implicit Link Prediction

Recommendation systems are essential tools that help users discover content they may be interested in, amidst the vast amount of information available online. However, current methods, such as using historical user-item interactions and collaborative filtering, have limitations in accurately predicting user preferences. Our research aims to address these challenges and improve the performance of recommendation systems. In this article, we propose a new approach to recommendation systems using a method called Probabilistic Matrix Factorization (PMF). We transform the standard PMF method into a communitybased PMF that takes into account implicit relationships between users and items. To achieve this, we use a machine learning technique called Reduced Kernel Extreme Learning Machine (RKELM). Our proposed framework is designed to integrate these implicit relationships and identify communities of users with similar preferences based on PMF. We conducted a comparative analysis of our newly developed model against existing methods, using two well-known datasets. Various performance metrics, such as prediction errors, were employed to evaluate the effectiveness of our proposed community-based PMF approach with RKELM. Our model demonstrates improved performance, achieving a 7% improvement for the Douban dataset and a 4% improvement for the Last.fm dataset. Despite the improvements demonstrated by our model, potential limitations and challenges may still exist, such as scalability to larger datasets or adaptability to different domains. Future work could explore these aspects and investigate further enhancements to our approach

Friendship prediction in social networks using developed extreme learning machine with Kernel reduction and probabilistic calculation

The social network remains a highly dynamic object. Friendship prediction presents a significant problem in the research in network application in general and in social networking applications in particular. It involves analyzing an existing network graph and predicting more links inside the graph that were not identified before. Various models and approaches were developed for this purpose. Similarity-based models were used extensively, mainly they suffered from non-capability of handling the changing nature of the graph. Other models have supervised models that require training on labelled data. However, they need the extraction of many features to achieve satisfying performance. This work provides a novel implicit link prediction probabilistic reduced kernel extreme learning machine named ILP-PRKELM. Unlike the traditional supervised model of link prediction, ILP-PRKELM is attributed to the capability of achieving absolute accuracy with less number of features. Experimental results showed the superiority of ILP-PRKELM with an accomplished accuracy of 84.6 and 78.6 for Last.fm and Douban respectively, which is equivalent to 2% improved accuracy over the benchmarks

The Role of Trust to Enhance the Recommendation System Based on Social Network

Recommendation systems or recommender system (RSs) is one of the hottest topics nowadays, which is widely utilized to predict an item to the end-user based on his/her preferences primary. Recommendation systems applied in many areas mainly in commercial applications. This work aims to collect evidence of utilizing social network information between users to enhance the quality of traditional recommendation system. It provides an overview of traditional and modern approaches used by RSs such as collaborative filter (CF) approach, content-based (CB) approach, and hybrid filter approach. CF is one of the most famous traditional approaches in RSs, which is facing many limitations due to the lack of information available during a performance such as Cold start, Sparsity and Shilling attack. Additionally, this content focused on the role of incorporating a trust relationship from the social network to enhance the weaknesses of CF and achieve better quality in the recommendation process. Trust-aware Recommendation Systems (TaRSs) is a modern approach proposed to overcome the limitations of CF recommendation system in a social network. The trust relationship between users can boost and enhance CF limitations. Many researchers are focusing on trust in the recommendation system but fewer works are highlighting the role of trust in the recommendation system. In the end, limitations, and open issues of the current picture of the recommendation system come across.