REPUTATION COMPUTATION IN SOCIAL NETWORKS AND ITS APPLICATIONS

This thesis focuses on a quantification of reputation and presents models which compute reputation within networked environments. Reputation manifests past behaviors of users and helps others to predict behaviors of users and therefore reduce risks in future interactions. There are two approaches in computing reputation on networks- namely, the macro-level approach and the micro-level approach. A macro-level assumes that there exists a computing entity outside of a given network who can observe the entire network including degree distributions and relationships among nodes. In a micro-level approach, the entity is one of the nodes in a network and therefore can only observe the information local to itself, such as its own neighbors behaviors. In particular, we study reputation computation algorithms in online distributed environments such as social networks and develop reputation computation algorithms to address limitations of existing models. We analyze and discuss some properties of reputation values of a large number of agents including power-law distribution and their diffusion property. Computing reputation of another within a network requires knowledge of degrees of its neighbors. We develop an algorithm for estimating degrees of each neighbor. The algorithm considers observations associated with neighbors as a Bernoulli trial and repeatedly estimate degrees of neighbors as a new observation occurs. We experimentally show that the algorithm can compute the degrees of neighbors more accurately than a simple counting of observations. Finally, we design a bayesian reputation game where reputation is used as payoffs. The game theoretic view of reputation computation reflects another level of reality in which all agents are rational in sharing reputation information of others. An interesting behavior of agents within such a game theoretic environment is that cooperation- i.e., sharing true reputation information- emerges without an explicit punishment mechanism nor a direct reward mechanisms

Expressing Trust with Temporal Frequency of User Interaction in Online Communities

Reputation systems concern soft security dynamics in diverse areas. Trust dynamics in a reputation system should be stable and adaptable at the same time to serve the purpose. Many reputation mechanisms have been proposed and tested over time. However, the main drawback of reputation management is that users need to share private information to gain trust in a system such as phone numbers, reviews, and ratings. Recently, a novel model that tries to overcome this issue was presented: the Dynamic Interaction-based Reputation Model (DIBRM). This approach to trust considers only implicit information automatically deduced from the interactions of users within an online community. In this primary research study, the Reddit and MathOverflow online social communities have been selected for testing DIBRM. Results show how this novel approach to trust can mimic behaviors of the selected reputation systems, namely Reddit and MathOverflow, only with temporal information

Expressing Trust with Temporal Frequency of User Interaction in Online Communities

Reputation systems concern soft security dynamics in diverse areas. Trust dynamics in a reputation system should be stable and adaptable at the same time to serve the purpose. Many reputation mechanisms have been proposed and tested over time. However, the main drawback of reputation management is that users need to share private information to gain trust in a system such as phone numbers, reviews, and ratings. Recently, a novel model that tries to overcome this issue was presented: the Dynamic Interaction-based Reputation Model (DIBRM). This approach to trust considers only implicit information automatically deduced from the interactions of users within an online community. In this primary research study, the Red-dit and MathOverflow online social communities have been selected for testing DIBRM. Results show how this novel approach to trust can mimic behaviors of the selected reputation systems, namely Reddit and MathOverflow, only with temporal information

Emergency warning messages dissemination in vehicular social networks: A trust based scheme

To ensure users' safety on the road, a plethora of dissemination schemes for Emergency Warning Messages (EWMs) have been proposed in vehicular networks. However, the issue of false alarms triggered by malicious users still poses serious challenges, such as disruption of vehicular traffic especially on highways leading to precarious effects. This paper proposes a novel Trust based Dissemination Scheme (TDS) for EWMs in Vehicular Social Networks (VSNs) to solve the aforementioned issue. To ensure the authenticity of EWMs, we exploit the user-post credibility network for identifying true and false alarms. Moreover, we develop a reputation mechanism by calculating a trust-score for each node based on its social-utility, behavior, and contribution in the network. We utilize the hybrid architecture of VSNs by employing social-groups based dissemination in Vehicle-to-Infrastructure (V2I) mode, whereas nodes' friendship-network in Vehicle-to-Vehicle (V2V) mode. We analyze the proposed scheme for accuracy by extensive simulations under varying malicious nodes ratio in the network. Furthermore, we compare the efficiency of TDS with state-of-the-art dissemination schemes in VSNs for delivery ratio, transmission delay, number of transmissions, and hop-count. The experimental results validate the significant efficacy of TDS in accuracy and aforementioned network parameters. © 2019 Elsevier Inc

Vertrauensbasierte Empfehlungen in mehrschichtigen Netzwerken

The huge interest in social networking applications - Friendster.com, for example, has more than 40 million users - led to a considerable research interest in using this data for generating recommendations. Especially recommendation techniques that analyze trust networks were found to provide very accurate and highly personalized results. The main contribution of this thesis is to extend the approach to trust-based recommendations, which up to now have been made for unlinked items such as products or movies, to linked resources, in particular documents. Therefore, a second type of network, namely a document reference network, is considered apart from the trust network. This is, for example, the citation network of scientific publications or the hyperlink graph of webpages. Recommendations for documents are typically made by reference-based visibility measures which consider a document to be the more important, the more often it is referenced by important documents. Document and trust networks, as well as further networks such as organization networks are integrated in a multi-layer network. This architecture makes it possible to combine classical measures for the visibility of a document with trust-based recommendations, giving trust-enhanced visibility measures. Moreover, an approximation approach is introduced which considers the uncertainty induced by duplicate documents. These measures are evaluated in simulation studies. The trust-based recommender system for scientific publications SPRec implements a two-layer architecture and provides personalized recommendations via a Web interface.Soziale Netzwerke mit ihren Millionen von Nutzern haben zu einem großen Interesse an der Fragestellung geführt, wie die Informationen aus solchen sozialen Netzwerken in Empfehlungssystemen genutzt werden können. Aktuelle Forschungsarbeiten haben gezeigt, dass vor allem Techniken, die soziale Vertrauensnetzwerke zur Grundlage nehmen, sehr gute Ergebnisse liefern. Die vorliegende Dissertation erweitert Ansätze zu vertrauensbasierten Empfehlungen, die bisher nur isolierte Objekte wie beispielsweise Produkte oder Filme berücksichtigt haben, zu Ansätzen für vernetzte Ressourcen, insbesondere Dokumente. Daher wird neben dem Vertrauensnetzwerk eine zweite Art von Netzwerk betrachtet, ein Dokumentennetzwerk. Beispiele für Dokumentennetzwerke sind Zitationsnetzwerke wissenschaftlicher Publikationen oder der Hyperlink-Graph zwischen Webseiten. Dokumentenempfehlungen werden typischerweise mit referenzbasierten Sichtbarkeitsmaßen berechnet, die ein Dokument als wichtig erachten, wenn es von vielen wichtigen Dokumenten referenziert wird. Vertrauensnetzwerke und Dokumentennetzwerke werden in einer zweischichtigen Architektur integriert. Weitere Netzwerke, wie zum Beispiel Organisationsnetzwerke bauen sie zu einer mehrschichtigen Architektur aus. In dieser Architektur können klassische Maße für Dokumentensichtbarkeit mit vertrauensbasierten Empfehlungen kombiniert werden, nämlich in den sogenannten vertrauensbasierten Sichtbarkeitsmaßen. Darüberhinaus führt die Dissertation einen Ansatz ein, um die vertrauensbasierte Sichtbarkeit dann approximieren zu können, wenn das Dokumentennetzwerk Duplikate von Dokumenten enthält. Die entwickelten Sichtbarkeitsmaße werden in einer Simulationsstudie analysiert. Das webbasierte Empfehlungssystem für wissenschaftliche Veröffentlichungen SPRec implementiert die vertrauensbasierten Sichtbarkeitsmaße und generiert personalisierte Empfehlungen

Diffusion, Infection and Social (Information) Network Database

Research to analyze diffusive phenomena over large rich datasets has received considerable attention in recent years. Moreover, with the appearance and proliferation of online social network services, social (information) network analysis and mining techniques have become closely intertwined with the analysis of diffusive and infection phenomena. In this dissertation, we suggest various analysis and mining techniques to solve problems related to diffusive and infection phenomena over social (information) networks built from various datasets in diverse areas. This research makes five contributions. The first contribution is about influence analysis in social networks for which we suggest two new centrality measures, Diffusion Centrality and Covertness Centrality. Diffusion Centrality quantifies the influence of vertices in social networks with respect to a given diffusion model which explains how a diffusive property is spreading. Covertness Centrality quantifies how well a vertex can communicate (diffuse information) with (to) others and hide in networks as a common vertex w.r.t. a set of centrality measures. The second contribution is about network simplification problems to scale up analysis techniques for very large networks. For this topic, two techniques, CoarseNet and Coarsened Back and Forth (CBAF), are suggested in order to find a succinct representation of networks while preserving key characteristics for diffusion processes on that network. The third contribution is about social network databases. We propose a new network model, STUN (Spatio-Temporal Uncertain Networks), whose edges are characterized with uncertainty, space, and time, and develop a graph index structure to retrieve graph patterns over the network efficiently. The fourth contribution develops epidemic models and ensembles to predict the number of malware infections in countries using past detection history. In our fifth contribution, we also develop methods to predict financial crises of countries using financial connectedness among countries

Dynamic safety analysis of decommissioning and abandonment of offshore oil and gas installations

The global oil and gas industry have seen an increase in the number of installations moving towards decommissioning. Offshore decommissioning is a complex, challenging and costly activity, making safety one of the major concerns. The decommissioning operation is, therefore, riskier than capital projects, partly due to the uniqueness of every offshore installation, and mainly because these installations were not designed for removal during their development phases. The extent of associated risks is deep and wide due to limited data and incomplete knowledge of the equipment conditions. For this reason, it is important to capture every uncertainty that can be introduced at the operational level, or existing hazards due to the hostile environment, technical difficulties, and the timing of the decommissioning operations. Conventional accident modelling techniques cannot capture the complex interactions among contributing elements. To assess the safety risks, a dynamic safety analysis of the accident is, thus, necessary. In this thesis, a dynamic integrated safety analysis model is proposed and developed to capture both planned and evolving risks during the various stages of decommissioning. First, the failure data are obtained from source-to-source and are processed utilizing Hierarchical Bayesian Analysis. Then, the system failure and potential accident scenarios are built on bowtie model which is mapped into a Bayesian network with advanced relaxation techniques. The Dynamic Integrated Safety Analysis (DISA) allows for the combination of reliability tools to identify safetycritical causals and their evolution into single undesirable failure through the utilisation of source to-source variability, time-dependent prediction, diagnostic, and economic risk assessment to support effective recommendations and decisions-making. The DISA framework is applied to the Elgin platform well abandonment and Brent Alpha jacket structure decommissioning and the results are validated through sensitivity analysis. Through a dynamic-diagnostic and multi-factor regression analysis, the loss values of accident contributory factors are also presented. The study shows that integrating Hierarchical Bayesian Analysis (HBA) and dynamic Bayesian networks (DBN) application to modelling time-variant risks are essential to achieve a well-informed decommissioning decision through the identification of safety critical barriers that could be mitigated against to drive down the cost of remediation.The global oil and gas industry have seen an increase in the number of installations moving towards decommissioning. Offshore decommissioning is a complex, challenging and costly activity, making safety one of the major concerns. The decommissioning operation is, therefore, riskier than capital projects, partly due to the uniqueness of every offshore installation, and mainly because these installations were not designed for removal during their development phases. The extent of associated risks is deep and wide due to limited data and incomplete knowledge of the equipment conditions. For this reason, it is important to capture every uncertainty that can be introduced at the operational level, or existing hazards due to the hostile environment, technical difficulties, and the timing of the decommissioning operations. Conventional accident modelling techniques cannot capture the complex interactions among contributing elements. To assess the safety risks, a dynamic safety analysis of the accident is, thus, necessary. In this thesis, a dynamic integrated safety analysis model is proposed and developed to capture both planned and evolving risks during the various stages of decommissioning. First, the failure data are obtained from source-to-source and are processed utilizing Hierarchical Bayesian Analysis. Then, the system failure and potential accident scenarios are built on bowtie model which is mapped into a Bayesian network with advanced relaxation techniques. The Dynamic Integrated Safety Analysis (DISA) allows for the combination of reliability tools to identify safetycritical causals and their evolution into single undesirable failure through the utilisation of source to-source variability, time-dependent prediction, diagnostic, and economic risk assessment to support effective recommendations and decisions-making. The DISA framework is applied to the Elgin platform well abandonment and Brent Alpha jacket structure decommissioning and the results are validated through sensitivity analysis. Through a dynamic-diagnostic and multi-factor regression analysis, the loss values of accident contributory factors are also presented. The study shows that integrating Hierarchical Bayesian Analysis (HBA) and dynamic Bayesian networks (DBN) application to modelling time-variant risks are essential to achieve a well-informed decommissioning decision through the identification of safety critical barriers that could be mitigated against to drive down the cost of remediation

Language change and evolution in Online Social Networks

Language is in constant flux, whether through the creation of new terms or the changing meanings of existing words. The process by which language change happens is through complex reinforcing interactions between individuals and the social structures in which they exist. There has been much research into language change and evolution, though this has involved manual processes that are both time consuming and costly. However, with the growth in popularity of osn, for the first time, researchers have access to fine-grained records of language and user interactions that not only contain data on the creation of these language innovations but also reveal the inter-user and inter-community dynamics that influence their adoptions and rejections. Having access to these osn datasets means that language change and evolution can now be assessed and modelled through the application of computational and machine-learning-based methods. Therefore, this thesis looks at how one can detect and predict language change in osn, as well as the factors that language change depends on. The answer to this over-arching question lies in three core components: first, detecting the innovations; second, modelling the individual user adoption process; and third, looking at the collective adoption across a network of individuals. In the first question, we operationalise traditional language acceptance heuristics (used to detect the emergence of new words) into three classes of computation time-series measures computing the variation in frequency, form and/or meaning. The grounded methods are applied to two osn, with results demonstrating the ability to detect language change across both networks. By additionally applying the methods to communities within each network, e.g. geographical regions, on Twitter and Subreddits in Reddit, the results indicate that language variation and change can be dependent on the community memberships. The second question in this thesis focuses on the process of users adopting language innovations in relation to other users with whom they are in contact. By modelling influence between users as a function of past innovation cascades, we compute a global activation threshold at which users adopt new terms dependent on exposure to them from their neighbours. Additionally, by testing the user interaction networks through random shuffles, we show that the time at which a user adopts a term is dependent on the local structure; however, a large part of the influence comes from sources external to the observed osn. The final question looks at how the speakers of a language are embedded in social networks, and how the networks' resulting structures and dynamics influence language usage and adoption patterns. We show that language innovations diffuse across a network in a predictable manner, which can be modelled using structural, grammatical and temporal measures, using a logistic regression model to predict the vitality of the diffusion. With regard to network structure, we show how innovations that manifest across structural holes and weak ties diffuse deeper across the given network. Beyond network influence, our results demonstrate that the grammatical context through which innovations emerge also play an essential role in diffusion dynamics - this indicates that the adoption of new words is enabled by a complex interplay of both network and linguistic factors. The three questions are used to answer the over-arching question, showing that one can, indeed, model language change and forecast user and community adoption of language innovations. Additionally, we also show the ability to apply grounded models and methods and apply them within a scalable computational framework. However, it is a challenging process that is heavily influenced by the underlying processes that are not recorded within the data from the osns

SOCIAL MEDIA ANALYTICS − A UNIFYING DEFINITION, COMPREHENSIVE FRAMEWORK, AND ASSESSMENT OF ALGORITHMS FOR IDENTIFYING INFLUENCERS IN SOCIAL MEDIA

Given its relative infancy, there is a dearth of research on a comprehensive view of business social media analytics (SMA). This dissertation first examines current literature related to SMA and develops an integrated, unifying definition of business SMA, providing a nuanced starting point for future business SMA research. This dissertation identifies several benefits of business SMA, and elaborates on some of them, while presenting recent empirical evidence in support of foregoing observations. The dissertation also describes several challenges facing business SMA today, along with supporting evidence from the literature, some of which also offer mitigating solutions in particular contexts. The second part of this dissertation studies one SMA implication focusing on identifying social influencer. Growing social media usage, accompanied by explosive growth in SMA, has resulted in increasing interest in finding automated ways of discovering influencers in online social interactions. Beginning 2008, many variants of multiple basic approaches have been proposed. Yet, there is no comprehensive study investigating the relative efficacy of these methods in specific settings. This dissertation investigates and reports on the relative performance of multiple methods on Twitter datasets containing between them tens of thousands to hundreds of thousands of tweets. Accordingly, the second part of the dissertation helps further an understanding of business SMA and its many aspects, grounded in recent empirical work, and is a basis for further research and development. This dissertation provides a relatively comprehensive understanding of SMA and the implementation SMA in influencer identification