Nardine Basta, A. El-Nahas, H. P. Großmann, Slim Abdennadher
{"title":"A Framework for Social Tie Strength Inference in Vehicular Social Networks","authors":"Nardine Basta, A. El-Nahas, H. P. Großmann, Slim Abdennadher","doi":"10.1109/WD.2019.8734218","DOIUrl":null,"url":null,"abstract":"The tie strength is a network concept that has attracted arguably the most research attention as being an important ingredient for modeling the interaction of users in a network and understanding their behavior. With the emergence of online social networks like Facebook and Twitter, the social tie strength interpretation evolved to reflect the frequency of contact on computer-mediated communication networks. The rapid proliferation of Mobile Adhoc Networks and in particular vehicular networks creates ample opportunity for novel applications relying on the human mobility characteristics such as vehicles destination prediction and recommendation systems. Hence, arises the need for a novel definition of the social tie strength reflecting the meetings frequency of the network nodes. This paper sets the ground work for quantifying the social tie strength in vehicular social networks. It presents a new definition for the social tie strength and formalizes a semantic aware model namely the Social, Spatial and Context-based Encounter Frequency (SSCEF) to quantify the strength as per the suggested definition. The model is tested using a data-set collected at the city of Ulm, Germany for the purpose of this study. It comprises social network information and its associated one month mobility traces. The performance of the proposed model is further validated by feeding the inferred ties to a social-based vehicular destination predictor [4]. The SSCEF inferred ties achieves a prediction accuracy of 67% in comparison to 70% for the original traces-based calculated ties.","PeriodicalId":432101,"journal":{"name":"2019 Wireless Days (WD)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Wireless Days (WD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WD.2019.8734218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The tie strength is a network concept that has attracted arguably the most research attention as being an important ingredient for modeling the interaction of users in a network and understanding their behavior. With the emergence of online social networks like Facebook and Twitter, the social tie strength interpretation evolved to reflect the frequency of contact on computer-mediated communication networks. The rapid proliferation of Mobile Adhoc Networks and in particular vehicular networks creates ample opportunity for novel applications relying on the human mobility characteristics such as vehicles destination prediction and recommendation systems. Hence, arises the need for a novel definition of the social tie strength reflecting the meetings frequency of the network nodes. This paper sets the ground work for quantifying the social tie strength in vehicular social networks. It presents a new definition for the social tie strength and formalizes a semantic aware model namely the Social, Spatial and Context-based Encounter Frequency (SSCEF) to quantify the strength as per the suggested definition. The model is tested using a data-set collected at the city of Ulm, Germany for the purpose of this study. It comprises social network information and its associated one month mobility traces. The performance of the proposed model is further validated by feeding the inferred ties to a social-based vehicular destination predictor [4]. The SSCEF inferred ties achieves a prediction accuracy of 67% in comparison to 70% for the original traces-based calculated ties.