{"title":"Action rules for sentiment analysis using Twitter","authors":"A. Tzacheva, Jaishree Ranganathan, A. Bagavathi","doi":"10.1504/ijsnm.2020.10027371","DOIUrl":"https://doi.org/10.1504/ijsnm.2020.10027371","url":null,"abstract":"Actionable patterns are interesting and usable knowledge mined from large datasets. Action rules are rules that describe the possible transition of objects from one state to another with respect to a decision attribute. In this work, we extract actionable recommendations in the form of action rules, that can be applied to social networking data in a scalable manner to achieve the desired user goals. We propose extraction of actionable patterns based on sentiment analysis of social network data. In sentiment analysis there are two approaches to determine the polarity: Corpus-based, and Lexicon-based. We use corpus-based sentiment analysis approach, where sentiment values are generated based on sentence structure rather than words. Results show actionable patterns in tweet data and provide suggestions on how to change sentiment of the tweet to a more positive one. The experiment is performed with Twitter data in a distributed environment using Hadoop MapReduce for scalability with large data.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122597350","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 model for reputation rank in online social networks and its applications","authors":"I. Alsmadi, Muhammad Al-Abdullah","doi":"10.1504/ijsnm.2020.10027395","DOIUrl":"https://doi.org/10.1504/ijsnm.2020.10027395","url":null,"abstract":"The volume of information users upload through online social networks (OSNs) is continuously growing. Our focus in this research is in evaluating models to quantify the volume and strengths of interactions between users in OSNs. In our first model, we proposed a reputation rank in OSNs based on a tree graph in which users represent the tree nodes and edges represent their friends' connections or their generated activities. In each OSN such as Facebook, Twitter, LinkedIn, etc. each user will be given a single value that represents the user created activities and friends' interactions with those activities. The model focuses on volumes and statistics of interactions, rather than the content. We also extended the use of cliques' models in OSNs to be normalised or weighted based on the volumes of interactions among clique members. We showed that this can show deeper knowledge of clique relations when comparing it with the classical non-weighted clique models.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127356679","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":"Spatial patterns of the French rail strikes from social networks using weighted k-nearest neighbour","authors":"R. Ouaret, B. Birregah, Omar Jaafor","doi":"10.1504/ijsnm.2020.10027392","DOIUrl":"https://doi.org/10.1504/ijsnm.2020.10027392","url":null,"abstract":"The information analysis provided by millions of social network users is one of the most important sources of information yielding interesting insights of spatial patterns about socio-political events. During the recent French National Railway strikes (from April to June, 2018), Twitter was used as platform where people expressed their opinions, with millions of French National Railway Company (SNCF) tweets posted over the strike period. In this paper, we have discussed a methodology which allows the utilisation and interpretation of Twitter data to determine spatial patterns over French territory. The identification of a geographic strike landscape is achieved through spatial interpolation using weighted k-nearest neighbour. This study shows the benefits of geo-statistical learning for extracting sentiment polarities of social events across France.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130325742","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":"Research contributions published on betweenness centrality algorithm: modelling to analysis in the context of social networking","authors":"Sagar S. De, S. Dehuri, Sung-Bae Cho","doi":"10.1504/ijsnm.2020.10027370","DOIUrl":"https://doi.org/10.1504/ijsnm.2020.10027370","url":null,"abstract":"Social network analysis has become an inevitable tool for the prosperity of modern civilisation. The process of accumulating relational information from structured/unstructured sources, modelling networks, and extracting actionable information requires expertising in several knowledge domains. This paper presents an approach for the analysis of documents in the context of social networking. The approach is illustrated by using a case study related to research contributions published on betweenness centrality algorithm. Distinct networks in terms of article, article-author, and author are modelled and analysed to understand the insights. Consequently, it is possible to identify crucial articles, active authors, groups along with their expertise, research directions, the correlation among documents, and many more. Thus the paper conferred techniques for document collection, pre-processing, network modelling, and network analysis methods for the directed, undirected, weighted, unweighted, connected, disconnected, and bipartite networks.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116944987","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}
François Kawala, Éric Gaussier, A. Chouakria, E. Diemert
{"title":"A study of different keyword activity prediction problems in social media","authors":"François Kawala, Éric Gaussier, A. Chouakria, E. Diemert","doi":"10.1504/IJSNM.2016.10003523","DOIUrl":"https://doi.org/10.1504/IJSNM.2016.10003523","url":null,"abstract":"Forecasting keyword activities in social networking sites has been the subject of many studies, as such activities represent, in many cases, a direct estimate of the spread of real-world phenomena, e.g. box-office revenues or flu epidemic. Most of these studies rely on point-wise, regression-like prediction algorithms and focus on few, usually unambiguous, keywords. We study in this paper the impact of keyword activity on three different problems: a) classification of keywords according to the increase of their activity in the near future; b) prediction of the activity value of each keyword in the near future; c) ranking of a set of keywords according to their future activity values. It is the first time, to our knowledge, that such dimensions are evaluated in this framework. Our experiments are conducted on a large dataset built by monitoring Twitter over a year. The different methods tested are evaluated using standard scores as well as a newly defined, application driven quality measure.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133103619","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}
Partha Basuchowdhuri, V. Prabhu, Mithun Roy, S. Majumder, S. Saha
{"title":"Unified scheme for finding disjoint and overlapping communities in social networks using strength of ties","authors":"Partha Basuchowdhuri, V. Prabhu, Mithun Roy, S. Majumder, S. Saha","doi":"10.1504/IJSNM.2015.072304","DOIUrl":"https://doi.org/10.1504/IJSNM.2015.072304","url":null,"abstract":"In this paper, we have defined a metric that measures the strength of a link (SOL) in the network to calculate the degree to which it is considered to be part of a community. Higher the strength value of a link, more likely it is to be an integral part of a community whereas links with lesser strength value, such as bridges, are considered to be on the border of the communities. Based on the strength of the links, first we have devised a disjoint community detection technique and then we have extended it to form a unified scheme capable of detecting both disjoint and overlapping communities. This method does not need any predefined number of communities as input and shows the best set of clusters as output. Proposed methods produce results closer to ground truth compared to some popular community detection methods and has a high clique retention index.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"577 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134404357","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":"Lexicon-based sentiment analysis of Arabic tweets","authors":"M. Al-Ayyoub, S. Essa, I. Alsmadi","doi":"10.1504/IJSNM.2015.072280","DOIUrl":"https://doi.org/10.1504/IJSNM.2015.072280","url":null,"abstract":"Sentiment analysis (SA) and opinions mining (OM) are used to evaluate users' feedbacks and comments on issues related to news, products, services, etc. This topic has received increasing interests over the last decade due to the spread and expansion of social networks. SA for online reviews poses challenges to researchers and decision makers because such comments are written in unstructured formats with usually informal languages, expressions and possibly mixed languages. For Arabic, further challenges exist due to the language complexity and the limited number of research publications and datasets collected and analysed for such purpose. In SA, two approaches are generally used to determine the polarity of reviews: supervised (corpus-based) and unsupervised (lexicon-based). In this work, we follow the second approach and build a very large sentiment lexicon and a lexicon-based SA tool. The results show that the proposed tool performs very well.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122091648","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":"Mod-Müllner: an efficient algorithm for hierarchical community analysis in large networks","authors":"B. Conan-Guez, M. Nguyen","doi":"10.1504/IJSNM.2015.072301","DOIUrl":"https://doi.org/10.1504/IJSNM.2015.072301","url":null,"abstract":"In this work, we propose a new efficient agglomerative algorithm for hierarchical clustering analysis (HCA) of large networks. This algorithm, called Mod-Mullner, is an adaptation of an existing algorithm proposed by Mullner in 2011 and initially dedicated to HCA of pairwise dissimilarities. Mod-Mullner performs a greedy optimisation of the modularity, a widely used measure for network partitioning. We show that thanks to adapted data structures, Mod-Mullner achieves lower running times than other agglomerative algorithms, while producing comparable solutions. Finally, Mod-Mullner is compared to the Louvain method on simulated and real-world datasets. For both methods, the improved solutions obtained through single-level and multilevel refinements are studied.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121668063","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 novel hybrid approach for link prediction problem in social network","authors":"Seema Mishra, G. Nandi","doi":"10.1504/IJSNM.2015.072281","DOIUrl":"https://doi.org/10.1504/IJSNM.2015.072281","url":null,"abstract":"Link prediction in dynamic social network is an inherent challenging task to find out the intrinsic associations among the objects. This association can be discovered with the help of pattern of connection in already linked objects. This paper addresses the three novel hybrid feature extraction methodologies that leverage the significant insight of existing model available for link prediction. The proposed technique offers better agreement of causal link to be happened between pair of objects in future. The conventional link prediction models are applying features which are typically grounded on the node cardinality. These predictor models are common neighbour predictor, Adamic/Adar, Jaccard's coefficient, preferential attachment, friends measures. So, hybrid feature extraction techniques based on principle of feature ensemble is introduced to generate predictive model to be learned for link prediction. Jacccard's coefficient and preferential attachment (JCPA) model, Jaccard's coefficient and Adamic/Adar (JCAA) model and preferential attachment and Adamic/Adar (PAAA) model are generated with the context of ascertaining more accuracy in the performance of link prediction classifier. The probabilistic model based on Naive Bayes classifier is used as a base classier. Experimental results shows that we have achieved more accuracy in classifier performance which also been verified using receiver operating characteristic (ROC) curve.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125925109","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}
Ahmed Hafez, Eiman Tamah Al-Shammari, A. Hassanien, A. Fahmy
{"title":"Community detection in social networks using logic-based probabilistic programming","authors":"Ahmed Hafez, Eiman Tamah Al-Shammari, A. Hassanien, A. Fahmy","doi":"10.1504/IJSNM.2015.072303","DOIUrl":"https://doi.org/10.1504/IJSNM.2015.072303","url":null,"abstract":"Community detection in complex networks has attracted a lot of attention in recent years. Communities play special roles in the structure-function relationship; therefore, detecting communities can be a way to identify substructures that could correspond to important functions. Social networks can be formalised by a generative process in which interactions between actors are generated based on some assumptions, i.e., a model with some parameters. Based on that idea, a probabilistic inference technique can be used to infer the community structure of the network. We propose a generative model to describe how network interactions are generated and show the use of a logic-based probabilistic modelling technique such as PRISM, to solve the community detection problem. The proposed model works well with directed and undirected networks, and with weighted and un-weighted networks. We use the deterministic annealing expectation maximisation algorithm in the learning process, which prove to yield a very promising result when is applied to the community detection problem.","PeriodicalId":185032,"journal":{"name":"Int. J. Soc. Netw. Min.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122507667","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}