{"title":"The structure of co-publications multilayer network","authors":"Ghislain Romaric Meleu, Paulin Yonta Melatagia","doi":"10.1186/s40649-021-00089-w","DOIUrl":"https://doi.org/10.1186/s40649-021-00089-w","url":null,"abstract":"Using the headers of scientific papers, we have built multilayer networks of entities involved in research namely: authors, laboratories, and institutions. We have analyzed some properties of such networks built from data extracted from the HAL archives and found that the network at each layer is a small-world network with power law distribution. In order to simulate such co-publication network, we propose a multilayer network generation model based on the formation of cliques at each layer and the affiliation of each new node to the higher layers. The clique is built from new and existing nodes selected using preferential attachment. We also show that, the degree distribution of generated layers follows a power law. From the simulations of our model, we show that the generated multilayer networks reproduce the studied properties of co-publication networks.","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"48 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138524852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Influence network design via multi-level optimization considering boundedly rational user behaviours in social media networks","authors":"Guanxiang Yun, Q. Zheng, V. Boginski, E. Pasiliao","doi":"10.1186/s40649-020-00082-9","DOIUrl":"https://doi.org/10.1186/s40649-020-00082-9","url":null,"abstract":"","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-020-00082-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65734447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Discovering the maximum k-clique on social networks using bat optimization algorithm","authors":"Akram Khodadadi, Shahram Saeidi","doi":"10.1186/s40649-021-00087-y","DOIUrl":"https://doi.org/10.1186/s40649-021-00087-y","url":null,"abstract":"The k-clique problem is identifying the largest complete subgraph of size k on a network, and it has many applications in Social Network Analysis (SNA), coding theory, geometry, etc. Due to the NP-Complete nature of the problem, the meta-heuristic approaches have raised the interest of the researchers and some algorithms are developed. In this paper, a new algorithm based on the Bat optimization approach is developed for finding the maximum k-clique on a social network to increase the convergence speed and evaluation criteria such as Precision, Recall, and F1-score. The proposed algorithm is simulated in Matlab® software over Dolphin social network and DIMACS dataset for k = 3, 4, 5. The computational results show that the convergence speed on the former dataset is increased in comparison with the Genetic Algorithm (GA) and Ant Colony Optimization (ACO) approaches. Besides, the evaluation criteria are also modified on the latter dataset and the F1-score is obtained as 100% for k = 5.","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"31 7","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138524858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Understanding social media beyond text: a reliable practice on Twitter","authors":"Qixuan Hou, Meng Han, Feiyang Qu, J. He","doi":"10.1186/s40649-021-00088-x","DOIUrl":"https://doi.org/10.1186/s40649-021-00088-x","url":null,"abstract":"","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40649-021-00088-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43856388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Non-submodular model for group profit maximization problem in social networks","authors":"Jianming Zhu, Smita Ghosh, Weili Wu, Chuangen Gao","doi":"10.1186/s40649-020-00085-6","DOIUrl":"https://doi.org/10.1186/s40649-020-00085-6","url":null,"abstract":"In social networks, there exist many kinds of groups in which people may have the same interests, hobbies, or political orientation. Sometimes, group decisions are made by simply majority, which means that most of the users in this group reach an agreement, such as US Presidential Elections. A group is called activated if $$beta$$ percent of users are influenced in the group. Enterprise will gain income from all influenced groups. Simultaneously, to propagate influence, enterprise needs pay advertisement diffusion cost. Group profit maximization (GPM) problem aims to pick k seeds to maximize the expected profit that considers the benefit of influenced groups with the diffusion cost. GPM is proved to be NP-hard and the objective function is proved to be neither submodular nor supermodular. An upper bound and a lower bound which are difference of two submodular functions are designed. We propose a submodular–modular algorithm (SMA) to solve the difference of two submodular functions and SMA is shown to converge to a local optimal. We present an randomized algorithm based on weighted group coverage maximization for GPM and apply sandwich framework to get theoretical results. Our experiments verify the efficiency of our methods.","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"23 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138524883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A review: preprocessing techniques and data augmentation for sentiment analysis","authors":"Huu-Thanh Duong, Tram-Anh Nguyen-Thi","doi":"10.1186/s40649-020-00080-x","DOIUrl":"https://doi.org/10.1186/s40649-020-00080-x","url":null,"abstract":"In literature, the machine learning-based studies of sentiment analysis are usually supervised learning which must have pre-labeled datasets to be large enough in certain domains. Obviously, this task is tedious, expensive and time-consuming to build, and hard to handle unseen data. This paper has approached semi-supervised learning for Vietnamese sentiment analysis which has limited datasets. We have summarized many preprocessing techniques which were performed to clean and normalize data, negation handling, intensification handling to improve the performances. Moreover, data augmentation techniques, which generate new data from the original data to enrich training data without user intervention, have also been presented. In experiments, we have performed various aspects and obtained competitive results which may motivate the next propositions.","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"42 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138513563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hendrik Nunner, Vincent Buskens, Mirjam Kretzschmar
{"title":"A model for the co-evolution of dynamic social networks and infectious disease dynamics.","authors":"Hendrik Nunner, Vincent Buskens, Mirjam Kretzschmar","doi":"10.1186/s40649-021-00098-9","DOIUrl":"10.1186/s40649-021-00098-9","url":null,"abstract":"<p><p>Recent research shows an increasing interest in the interplay of social networks and infectious diseases. Many studies either neglect explicit changes in health behavior or consider networks to be static, despite empirical evidence that people seek to distance themselves from diseases in social networks. We propose an adaptable steppingstone model that integrates theories of social network formation from sociology, risk perception from health psychology, and infectious diseases from epidemiology. We argue that networking behavior in the context of infectious diseases can be described as a trade-off between the benefits, efforts, and potential harm a connection creates. Agent-based simulations of a specific model case show that: (i) high (perceived) health risks create strong social distancing, thus resulting in low epidemic sizes; (ii) small changes in health behavior can be decisive for whether the outbreak of a disease turns into an epidemic or not; (iii) high benefits for social connections create more ties per agent, providing large numbers of potential transmission routes and opportunities for the disease to travel faster, and (iv) higher costs of maintaining ties with infected others reduce final size of epidemics only when benefits of indirect ties are relatively low. These findings suggest a complex interplay between social network, health behavior, and infectious disease dynamics. Furthermore, they contribute to solving the issue that neglect of explicit health behavior in models of disease spread may create mismatches between observed transmissibility and epidemic sizes of model predictions.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"8 1","pages":"19"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8495675/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39512711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modeling the transmission dynamics of racism propagation with community resilience.","authors":"Dejen Ketema Mamo","doi":"10.1186/s40649-021-00102-2","DOIUrl":"10.1186/s40649-021-00102-2","url":null,"abstract":"<p><p>Racism spreading can have a vital influence on people's lives, declining adherence, pretending political views, and recruiters' socio-economical crisis. Besides, Web 2.0 technologies have democratized the creation and propagation of racist information, which facilitated the rapid spreading of racist messages. In this research work, the impact of community resilience on the spread dynamics of racism was assessed. To investigate the effect of resilience-building, new <i>SERDC</i> mathematical model was formulated and analyzed. The racism spread is under control where <math> <mrow><msub><mi>R</mi> <mn>0</mn></msub> <mo><</mo> <mn>1</mn></mrow> </math> , whereas persist in the community whenever <math> <mrow><msub><mi>R</mi> <mn>0</mn></msub> <mo>></mo> <mn>1</mn></mrow> </math> . Sensitivity analysis of the parameters value of the model are conducted. The rising of transmission and racial extremeness rate provides the prevalence of racism spread. Effective community resilience decline the damages, mitigate, and eradicate racism propagation. Theoretical analysis of the model are backed up by numerical results. Despite the evidence of numerical simulations, reducing the transmission and racial extremeness rate by improving social bonds and solidarity through community resilience could control the spread of racism.</p>","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"8 1","pages":"22"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8571679/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39623758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Node-weighted centrality: a new way of centrality hybridization","authors":"Anuj Singh, Rishi Ranjan Singh, S. R. S. Iyengar","doi":"10.1186/s40649-020-00081-w","DOIUrl":"https://doi.org/10.1186/s40649-020-00081-w","url":null,"abstract":"Centrality measures have been proved to be a salient computational science tool for analyzing networks in the last two to three decades aiding many problems in the domain of computer science, economics, physics, and sociology. With increasing complexity and vividness in the network analysis problems, there is a need to modify the existing traditional centrality measures. Weighted centrality measures usually consider weights on the edges and assume the weights on the nodes to be uniform. One of the main reasons for this assumption is the hardness and challenges in mapping the nodes to their corresponding weights. In this paper, we propose a way to overcome this kind of limitation by hybridization of the traditional centrality measures. The hybridization is done by taking one of the centrality measures as a mapping function to generate weights on the nodes and then using the node weights in other centrality measures for better complex ranking.","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"64 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138542883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}