Co-occurrence prediction in a large location-based social network

Location-based social network （LBSN） is at the forefront of emerging trends in social network services （SNS） since the users in LBSN are allowed to ＂check-in＂ the places （locations） when they visit them. The accurate geographi- cal and temporal information of these check-in actions are provided by the end-user GPS-enabled mobile devices, and recorded by the LBSN system. In this paper, we analyze and mine a big LBSN data, Gowalla, collected by us. First, we investigate the relationship between the spatio-temporal co- occurrences and social ties, and the results show that the co- occurrences are strongly correlative with the social ties. Sec- ond, we present a study of predicting two users whether or not they will meet （co-occur） at a place in a given future time, by exploring their check-in habits. In particular, we first intro- duce two new concepts, bag-of-location and bag-of-time-lag, to characterize user＇s check-in habits. Based on such bag rep- resentations, we define a similarity metric called habits sim- ilarity to measure the similarity between two users＇ check-in habits. Then we propose a machine !earning formula for pre- dicting co-occurrence based on the social ties and habits sim- ilarities. Finally, we conduct extensive experiments on our dataset, and the results demonstrate the effectiveness of the proposed method.

Impact of different interaction behavior on epidemic spreading in time-dependent social networks

We investigate the impact of pairwise and group interactions on the spread of epidemics through an activity-driven model based on time-dependent networks.The effects of pairwise/group interaction proportion and pairwise/group interaction intensity are explored by extensive simulation and theoretical analysis.It is demonstrated that altering the group interaction proportion can either hinder or enhance the spread of epidemics,depending on the relative social intensity of group and pairwise interactions.As the group interaction proportion decreases,the impact of reducing group social intensity diminishes.The ratio of group and pairwise social intensity can affect the effect of group interaction proportion on the scale of infection.A weak heterogeneous activity distribution can raise the epidemic threshold,and reduce the scale of infection.These results benefit the design of epidemic control strategy.

Deep Learning Social Network Access Control Model Based on User Preferences

A deep learning access controlmodel based on user preferences is proposed to address the issue of personal privacy leakage in social networks.Firstly,socialusers andsocialdata entities are extractedfromthe social networkandused to construct homogeneous and heterogeneous graphs.Secondly,a graph neural networkmodel is designed based on user daily social behavior and daily social data to simulate the dissemination and changes of user social preferences and user personal preferences in the social network.Then,high-order neighbor nodes,hidden neighbor nodes,displayed neighbor nodes,and social data nodes are used to update user nodes to expand the depth and breadth of user preferences.Finally,a multi-layer attention network is used to classify user nodes in the homogeneous graph into two classes:allow access and deny access.The fine-grained access control problem in social networks is transformed into a node classification problem in a graph neural network.The model is validated using a dataset and compared with other methods without losing generality.The model improved accuracy by 2.18%compared to the baseline method GraphSAGE,and improved F1 score by 1.45%compared to the baseline method,verifying the effectiveness of the model.

Predicting Users’ Latent Suicidal Risk in Social Media: An Ensemble Model Based on Social Network Relationships

Suicide has become a critical concern,necessitating the development of effective preventative strategies.Social media platforms offer a valuable resource for identifying signs of suicidal ideation.Despite progress in detecting suicidal ideation on social media,accurately identifying individuals who express suicidal thoughts less openly or infrequently poses a significant challenge.To tackle this,we have developed a dataset focused on Chinese suicide narratives from Weibo’s Tree Hole feature and introduced an ensemble model named Text Convolutional Neural Network based on Social Network relationships(TCNN-SN).This model enhances predictive performance by leveraging social network relationship features and applying correction factors within a weighted linear fusion framework.It is specifically designed to identify key individuals who can help uncover hidden suicidal users and clusters.Our model,assessed using the bespoke dataset and benchmarked against alternative classification approaches,demonstrates superior accuracy,F1-score and AUC metrics,achieving 88.57%,88.75%and 94.25%,respectively,outperforming traditional TextCNN models by 12.18%,10.84%and 10.85%.We assert that our methodology offers a significant advancement in the predictive identification of individuals at risk,thereby contributing to the prevention and reduction of suicide incidences.

Network analysis of the relationships between depressive symptoms and social participation activities among Chinese older adults and its implications for nursing

Objective:Network analysis was used to explore the complex inter-relationships between social participation activities and depressive symptoms among the Chinese older population,and the differences in network structures among different genders,age groups,and urban-rural residency would be compared.Methods:Based on the 2018 wave of the Chinese Longitudinal Healthy Longevity Survey(CLHLS),12,043 people aged 65 to 105 were included.The 10-item Center for Epidemiologic Studies Depression(CESD)Scale was used to assess depressive symptoms and 10 types of social participation activities were collected,including housework,tai-chi,square dancing,visiting and interacting with friends,garden work,reading newspapers or books,raising domestic animals,playing cards or mahjong,watching TV or listening to radio,and organized social activities.R 4.2.1 software was used to estimate the network model and calculate strength and bridge strength.Results:21.60%(2,601/12,043)of the participants had depressive symptoms.The total social participation score was negatively associated with depressive symptoms after adjusting for sociodemographic factors.The network of social participation and depressive symptoms showed that“D9(Inability to get going)”and“S9(Watching TV and/or listening to the radio)”had the highest strength within depressive symptoms and social participation communities,respectively,and“S1(Housework)”,“S9(Watching TV and/or listening to the radio)”,and“D5(Hopelessness)”were the most prominent bridging nodes between the two communities.Most edges linking the two communities were negative.“S5(Graden work)-D5(Hopelessness)”and“S6(Reading newspapers/books)-D4(Everything was an effort)”were the top 2 strongest negative edges.Older females had significantly denser network structures than older males.Compared to older people aged 65e80,the age group 81e105 showed higher network global strength.Conclusions:This study provides novel insights into the complex relationships between social participation and depressive symptoms.Except for doing housework,other social participation activities were found to be protective for depression levels.Different nursing strategies should be taken to prevent and alleviate depressive symptoms for different genders and older people of different ages.

Social Robot Detection Method with Improved Graph Neural Networks

Social robot accounts controlled by artificial intelligence or humans are active in social networks,bringing negative impacts to network security and social life.Existing social robot detection methods based on graph neural networks suffer from the problem of many social network nodes and complex relationships,which makes it difficult to accurately describe the difference between the topological relations of nodes,resulting in low detection accuracy of social robots.This paper proposes a social robot detection method with the use of an improved neural network.First,social relationship subgraphs are constructed by leveraging the user’s social network to disentangle intricate social relationships effectively.Then,a linear modulated graph attention residual network model is devised to extract the node and network topology features of the social relation subgraph,thereby generating comprehensive social relation subgraph features,and the feature-wise linear modulation module of the model can better learn the differences between the nodes.Next,user text content and behavioral gene sequences are extracted to construct social behavioral features combined with the social relationship subgraph features.Finally,social robots can be more accurately identified by combining user behavioral and relationship features.By carrying out experimental studies based on the publicly available datasets TwiBot-20 and Cresci-15,the suggested method’s detection accuracies can achieve 86.73%and 97.86%,respectively.Compared with the existing mainstream approaches,the accuracy of the proposed method is 2.2%and 1.35%higher on the two datasets.The results show that the method proposed in this paper can effectively detect social robots and maintain a healthy ecological environment of social networks.

Research on Fine-Grained Recognition Method for Sensitive Information in Social Networks Based on CLIP

With the emergence and development of social networks,people can stay in touch with friends,family,and colleagues more quickly and conveniently,regardless of their location.This ubiquitous digital internet environment has also led to large-scale disclosure of personal privacy.Due to the complexity and subtlety of sensitive information,traditional sensitive information identification technologies cannot thoroughly address the characteristics of each piece of data,thus weakening the deep connections between text and images.In this context,this paper adopts the CLIP model as a modality discriminator.By using comparative learning between sensitive image descriptions and images,the similarity between the images and the sensitive descriptions is obtained to determine whether the images contain sensitive information.This provides the basis for identifying sensitive information using different modalities.Specifically,if the original data does not contain sensitive information,only single-modality text-sensitive information identification is performed;if the original data contains sensitive information,multimodality sensitive information identification is conducted.This approach allows for differentiated processing of each piece of data,thereby achieving more accurate sensitive information identification.The aforementioned modality discriminator can address the limitations of existing sensitive information identification technologies,making the identification of sensitive information from the original data more appropriate and precise.

CRB:A new rumor blocking algorithm in online social networks based on competitive spreading model and influence maximization

The virtuality and openness of online social platforms make networks a hotbed for the rapid propagation of various rumors.In order to block the outbreak of rumor,one of the most effective containment measures is spreading positive information to counterbalance the diffusion of rumor.The spreading mechanism of rumors and effective suppression strategies are significant and challenging research issues.Firstly,in order to simulate the dissemination of multiple types of information,we propose a competitive linear threshold model with state transition(CLTST)to describe the spreading process of rumor and anti-rumor in the same network.Subsequently,we put forward a community-based rumor blocking(CRB)algorithm based on influence maximization theory in social networks.Its crucial step is to identify a set of influential seeds that propagate anti-rumor information to other nodes,which includes community detection,selection of candidate anti-rumor seeds and generation of anti-rumor seed set.Under the CLTST model,the CRB algorithm has been compared with six state-of-the-art algorithms on nine online social networks to verify the performance.Experimental results show that the proposed model can better reflect the process of rumor propagation,and review the propagation mechanism of rumor and anti-rumor in online social networks.Moreover,the proposed CRB algorithm has better performance in weakening the rumor dissemination ability,which can select anti-rumor seeds in networks more accurately and achieve better performance in influence spread,sensitivity analysis,seeds distribution and running time.

Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with Lévy flight

The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.

A Large-Scale Group Decision Making Model Based on Trust Relationship and Social Network Updating

With the development of big data and social computing,large-scale group decisionmaking(LGDM)is nowmerging with social networks.Using social network analysis(SNA),this study proposes an LGDM consensus model that considers the trust relationship among decisionmakers(DMs).In the process of consensusmeasurement:the social network is constructed according to the social relationship among DMs,and the Louvain method is introduced to classify social networks to form subgroups.In this study,the weights of each decision maker and each subgroup are computed by comprehensive network weights and trust weights.In the process of consensus improvement:A feedback mechanism with four identification and two direction rules is designed to guide the consensus of the improvement process.Based on the trust relationship among DMs,the preferences are modified,and the corresponding social network is updated to accelerate the consensus.Compared with the previous research,the proposedmodel not only allows the subgroups to be reconstructed and updated during the adjustment process,but also improves the accuracy of the adjustment by the feedbackmechanism.Finally,an example analysis is conducted to verify the effectiveness and flexibility of the proposed method.Moreover,compared with previous studies,the superiority of the proposed method in solving the LGDM problem is highlighted.

A Privacy Preservation Method for Attributed Social Network Based on Negative Representation of Information

Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many scholars.Inspired by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network privacy.Therefore,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called AttNetNRI.Specifically,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept private.Moreover,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social networks.To evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social networks.The experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding parts.The experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.

Location Prediction from Social Media Contents using Location Aware Attention LSTM Network

Location prediction in social media,a growing research field,employs machine learning to identify users' locations from their online activities.This technology,useful in targeted advertising and urban planning,relies on natural language processing to analyze social media content and understand the temporal dynamics and structures of social networks.A key application is predicting a Twitter user's location from their tweets,which can be challenging due to the short and unstructured nature of tweet text.To address this challenge,the research introduces a novel machine learning model called the location-aware attention LSTM(LAA-LSTM).This hybrid model combines a Long Short-Term Memory(LSTM) network with an attention mechanism.The LSTM is trained on a dataset of tweets,and the attention network focuses on extracting features related to latitude and longitude,which are crucial for pinpointing the location of a user's tweet.The result analysis shows approx.10% improvement in accuracy over other existing machine learning approaches.

iTourSPOT:a context-aware framework for next POI recommendation in location-based social networks

The rising prosperity of Location-based Social Networks(LBSNs)witnessed an explosion in the availability of geo-tagged social media data,which enables tremendous location-aware online services,especially next point of interest(POI)recommendation.However,previous next POI recommendation studies usually adopt fix-length time windows for user check-in sequence modeling,leading to a limited capacity in capturing fine-grained user temporal preferences that easily change over time.Besides,existing methods often directly leverage multi-modal contexts as auxiliary to alleviate the data sparsity issue,which fails to fully exploit the sequential patterns of contextual information for inferring user interest drift.To address the above challenges,we propose a novel framework named iTourSPOT which extends traditional collaborative filtering methods with a context-aware POI embedding architecture.For enhancing temporal interests modeling capacity,we associate the context feature extraction with varying-length sessions and incorporate check-in frequencies of POIs as prior knowledge to instruct the session representation learning of our model.Moreover,a collaborative sequence transduction model is designed for joint context sequence modeling and session-based POI recommendation.Experimental results on a real-world geo-tagged photo dataset clearly demonstrate the effectiveness of the proposed framework when compared with state-of-the-art baseline methods,especially in both sparse and cold-start scenarios.

Discrete Choice Analysis of Temporal Factors on Social Network Growth

Social networks like Facebook, X (Twitter), and LinkedIn provide an interaction and communication environment for users to generate and share content, allowing for the observation of social behaviours in the digital world. These networks can be viewed as a collection of nodes and edges, where users and their interactions are represented as nodes and the connections between them as edges. Understanding the factors that contribute to the formation of these edges is important for studying network structure and processes. This knowledge can be applied to various areas such as identifying communities, recommending friends, and targeting online advertisements. Several factors, including node popularity and friends-of-friends relationships, influence edge formation and network growth. This research focuses on the temporal activity of nodes and its impact on edge formation. Specifically, the study examines how the minimum age of friends-of-friends edges and the average age of all edges connected to potential target nodes influence the formation of network edges. Discrete choice analysis is used to analyse the combined effect of these temporal factors and other well-known attributes like node degree (i.e., the number of connections a node has) and network distance between nodes. The findings reveal that temporal properties have a similar impact as network proximity in predicting the creation of links. By incorporating temporal features into the models, the accuracy of link prediction can be further improved.

Habits on Social Networks at Workplace: A Survey of Motivations and Behaviour

This article explores the use of social networks by workers in Abidjan, Côte d’Ivoire, with particular emphasis on a descriptive or quantitative analysis aimed at understanding motivations and methods of use. More than five hundred and fifty questionnaires were distributed, highlighting workers’ preferred digital channels and platforms. The results indicate that the majority use social media through their mobile phones, with WhatsApp being the most popular app, followed by Facebook and LinkedIn. The study reveals that workers use social media for entertainment purposes and to develop professional and social relationships, with 55% unable to live without social media at work for recreational activities. In addition, 35% spend on average 1 to 2 hours on social networks, mainly between 12 p.m. and 2 p.m. It also appears that 46% believe that social networks moderately improve their productivity. These findings can guide marketing strategies, training, technology development and government policies related to the use of social media in the workplace.

Venture Capital Syndication under Social Network Theory:Literature Review and Prospect

As an important channel for start-ups to obtain R&D funds and external knowledge and information resources,and as one of the key methods for investment institutions to leverage scale and synergy effects to enhance investment returns,venture capital syndication holds significant research value in the field of venture capital.This paper reviews the literature,summarizing the motivations behind the formation of joint investment networks,the conceptual characteristics of the three core theories of social network theory,and the empirical research on venture capital syndication within the framework of social network theory.It also highlights the existing research results,identifies gaps,and anticipates future research directions.

Time and Location Aware Points of Interest Recommendation inLocation-Based Social Networks

The wide spread of location-based social networks brings about a huge volume of user check-in data, whichfacilitates the recommendation of points of interest （POIs）. Recent advances on distributed representation shed light onlearning low dimensional dense vectors to alleviate the data sparsity problem. Current studies on representation learningfor POI recommendation embed both users and POIs in a common latent space, and users＇ preference is inferred basedon the distance/similarity between a user and a POI. Such an approach is not in accordance with the semantics of usersand POIs as they are inherently different objects. In this paper, we present a novel translation-based, time and locationaware （TransTL） representation, which models the spatial and temporal information as a relationship connecting users andPOIs. Our model generalizes the recent advances in knowledge graph embedding. The basic idea is that the embedding ofa 〈time, location〉 pair corresponds to a translation from embeddings of users to POIs. Since the POI embedding shouldbe close to the user embedding plus the relationship vector, the recommendation can be performed by selecting the top-kPOIs similar to the translated POI, which are all of the same type of objects. We conduct extensive experiments on tworeal-world data.sets. The results demonstrate that our TransTL model achieves the state-of-the-art performance. It is alsomuch more robust to data sparsity than the baselines.

Recommending Friends Instantly in Location-based Mobile Social Networks

Differently from the general online social network(OSN),locationbased mobile social network(LMSN),which seamlessly integrates mobile computing and social computing technologies,has unique characteristics of temporal,spatial and social correlation.Recommending friends instantly based on current location of users in the real world has become increasingly popular in LMSN.However,the existing friend recommendation methods based on topological structures of a social network or non-topological information such as similar user profiles cannot well address the instant making friends in the real world.In this article,we analyze users' check-in behavior in a real LMSN site named Gowalla.According to this analysis,we present an approach of recommending friends instantly for LMSN users by considering the real-time physical location proximity,offline behavior similarity and friendship network information in the virtual community simultaneously.This approach effectively bridges the gap between the offline behavior of users in the real world and online friendship network information in the virtual community.Finally,we use the real user check-in dataset of Gowalla to verify the effectiveness of our approach.

Design and implementation of user information sharing system using location-based services for social network services

Internet takes a role as a place for communication between people beyond a space simply for the acquisition of information.Recently,social network service(SNS)reflecting human’s basic desire for talking and communicating with others is focused on around the world.And location-based service(LBS)is a service that provides various life conveniences like improving productivity through location information,such as GPS and WiFi.This paper suggests an application combining LBS and SNS based on Android OS.By using smart phone which is personal mobile information equipment,it combines location information with user information and SNS so that the service can be developed.It also maximizes sharing and use of information via twit based on locations of friends.This proposed system is aims for users to show online identity more actively and more conveniently.

Improved Key Node Recognition Method of Social Network Based on PageRank Algorithm

The types and functions of social networking sites are becoming more abundant with the prevalence of self-media culture,and the number of daily active users of social networking sites represented by Weibo and Zhihu continues to expand.There are key node users in social networks.Compared with ordinary users,their influence is greater,their radiation range is wider,and their information transmission capabilities are better.The key node users playimportant roles in public opinion monitoring and hot event prediction when evaluating the criticality of nodes in social networking sites.In order to solve the problems of incomplete evaluation factors,poor recognition rate and low accuracy of key nodes of social networking sites,this paper establishes a social networking site key node recognition algorithm(SNSKNIS)based on PageRank(PR)algorithm,and evaluates the importance of social networking site nodes in combination with the influence of nodes and the structure of nodes in social networks.This article takes the Sina Weibo platform as an example,uses the key node identification algorithm system of social networking sites to discover the key nodes in the social network,analyzes its importance in the social network,and displays it visually.