Audiovisivi e Social Networks: il testo e i modi dell'esperienza 2007-2010

The doctoral research project "Audiovisuals and Social Networks: Text and Experiences 2007-2010" is mainly based on the analysis of the international audiovisuals landscape and of the promotional strategies of these products in Social Networks environment. The aim is to understand what kind of changes we can find about the concept of "text", users and marketing. The thesis is focused not just on Social Network marketing but also on new media development, such as Social TV and mobile.

Networking: the "making of" social networks. A closer look at the process and antecedents of some resourcing-oriented behaviors in organizations.

Social networks are one of the “hot” themes in people’s life and contemporary social research. Considering our “embeddedness” in a thick web of social relations is a study perspective that could unveil a number of explanations of how people may manage their personal and social resources. Looking at people’s behaviors of building and managing their social networks, seems to be an effective way to find some possible rationalization about how to help people getting the best from their resources . The main aim of this dissertation is to give a closer look at the role of networking behaviors. Antecedents, motivations, different steps and measures about networking behaviors and outcomes are analyzed and discussed. Results seem to confirm, in a different setting and time perspective, that networking behaviors include different types and goals that change over time. Effects of networking behaviors seem to find empirical confirmation through social network analysis methods. Both personality and situational self-efficacy seem to predict networking behaviors. Different types of motivational drivers seem to be related to diverse networking behaviors.

Hypergraph Mining for Social Networks

Nowadays, more and more data is collected in large amounts, such that the need of studying it both efficiently and profitably is arising; we want to acheive new and significant informations that weren't known before the analysis. At this time many graph mining algorithms have been developed, but an algebra that could systematically define how to generalize such operations is missing. In order to propel the development of a such automatic analysis of an algebra, We propose for the first time (to the best of my knowledge) some primitive operators that may be the prelude to the systematical definition of a hypergraph algebra in this regard.

Analisi del comportamento e dello stato d'animo di pazienti malati del Morbo di Crohn tramite social networks

Al giorno d'oggi una pratica molto comune è quella di eseguire ricerche su Google per cercare qualsiasi tipo di informazione e molte persone, con problemi di salute, cercano su Google sintomi, consigli medici e possibili rimedi. Questo fatto vale sia per pazienti sporadici che per pazienti cronici: il primo gruppo spesso fa ricerche per rassicurarsi e per cercare informazioni riguardanti i sintomi ed i tempi di guarigione, il secondo gruppo invece cerca nuovi trattamenti e soluzioni. Anche i social networks sono diventati posti di comunicazione medica, dove i pazienti condividono le loro esperienze, ascoltano quelle di altri e si scambiano consigli. Tutte queste ricerche, questo fare domande e scrivere post o altro ha contribuito alla crescita di grandissimi database distribuiti online di informazioni, conosciuti come BigData, che sono molto utili ma anche molto complessi e che necessitano quindi di algoritmi specifici per estrarre e comprendere le variabili di interesse. Per analizzare questo gruppo interessante di pazienti gli sforzi sono stati concentrati in particolare sui pazienti affetti dal morbo di Crohn, che è un tipo di malattia infiammatoria intestinale (IBD) che può colpire qualsiasi parte del tratto gastrointestinale, dalla bocca all'ano, provocando una grande varietà di sintomi. E' stato fatto riferimento a competenze mediche ed informatiche per identificare e studiare ciò che i pazienti con questa malattia provano e scrivono sui social, al fine di comprendere come la loro malattia evolve nel tempo e qual'è il loro umore a riguardo.

A cold blizzard was raging, but the light shone brightly' : social networks presented in stained glass within an industrial community

Historical stained glass in Calumet and Laurium revealed the complex structures of these industrial communities. Creating an Industrial Archaeology-focused approach, I examined stained glass as material culture. Sacred glass revealed ethnic and religious values of a congregation through the style, iconography, and quality of the glasswork. Residential glass showed how owners represented themselves within cultural settings by meeting social expectations. Commercial glass indicated community status of owners through discreet and artistic shows of wealth and taste. Corporate glass displayed prosperity and belonging through the superior quality and cost of the glasswork. Viewing stained glass as material culture opened new methods of looking at both stained glass and industrial communities. Findings from my research can teach the public about the importance of preserving and conserving stained glass, and that can lead to greater public appreciation for the material culture found within these industrial communities.

MODULARITY BASED FUZZY COMMUNITY DETECTION IN SOCIAL NETWORKS

Fuzzy community detection is to identify fuzzy communities in a network, which are groups of vertices in the network such that the membership of a vertex in one community is in [0,1] and that the sum of memberships of vertices in all communities equals to 1. Fuzzy communities are pervasive in social networks, but only a few works have been done for fuzzy community detection. Recently, a one-step forward extension of Newman’s Modularity, the most popular quality function for disjoint community detection, results into the Generalized Modularity (GM) that demonstrates good performance in finding well-known fuzzy communities. Thus, GMis chosen as the quality function in our research. We first propose a generalized fuzzy t-norm modularity to investigate the effect of different fuzzy intersection operators on fuzzy community detection, since the introduction of a fuzzy intersection operation is made feasible by GM. The experimental results show that the Yager operator with a proper parameter value performs better than the product operator in revealing community structure. Then, we focus on how to find optimal fuzzy communities in a network by directly maximizing GM, which we call it Fuzzy Modularity Maximization (FMM) problem. The effort on FMM problem results into the major contribution of this thesis, an efficient and effective GM-based fuzzy community detection method that could automatically discover a fuzzy partition of a network when it is appropriate, which is much better than fuzzy partitions found by existing fuzzy community detection methods, and a crisp partition of a network when appropriate, which is competitive with partitions resulted from the best disjoint community detections up to now. We address FMM problem by iteratively solving a sub-problem called One-Step Modularity Maximization (OSMM). We present two approaches for solving this iterative procedure: a tree-based global optimizer called Find Best Leaf Node (FBLN) and a heuristic-based local optimizer. The OSMM problem is based on a simplified quadratic knapsack problem that can be solved in linear time; thus, a solution of OSMM can be found in linear time. Since the OSMM algorithm is called within FBLN recursively and the structure of the search tree is non-deterministic, we can see that the FMM/FBLN algorithm runs in a time complexity of at least O (n2). So, we also propose several highly efficient and very effective heuristic algorithms namely FMM/H algorithms. We compared our proposed FMM/H algorithms with two state-of-the-art community detection methods, modified MULTICUT Spectral Fuzzy c-Means (MSFCM) and Genetic Algorithm with a Local Search strategy (GALS), on 10 real-world data sets. The experimental results suggest that the H2 variant of FMM/H is the best performing version. The H2 algorithm is very competitive with GALS in producing maximum modularity partitions and performs much better than MSFCM. On all the 10 data sets, H2 is also 2-3 orders of magnitude faster than GALS. Furthermore, by adopting a simply modified version of the H2 algorithm as a mutation operator, we designed a genetic algorithm for fuzzy community detection, namely GAFCD, where elite selection and early termination are applied. The crossover operator is designed to make GAFCD converge fast and to enhance GAFCD’s ability of jumping out of local minimums. Experimental results on all the data sets show that GAFCD uncovers better community structure than GALS.

Social Networks Analysis

This morning Dr. Risser will introduce you to the basic ideas of social network analysis. You will learn some history behind the study of social networks. Dr. Risser will introduce you to mathematical measures of social networks including centrality measures and measures of spread and cohesion. You will also learn how to use a computer program to analyze social network data

Social Networking: How to Build Social Networks

This poster illustrates variables and connections in social networking.

Online social networks: why we disclose

On online social networks such as Facebook, massive self-disclosure by users has attracted the attention of industry players and policymakers worldwide. Despite the impressive scope of this phenomenon, very little is understood about what motivates users to disclose personal information. Integrating focus group results into a theoretical privacy calculus framework, we develop and empirically test a Structural Equation Model of self-disclosure with 259 subjects. We find that users are primarily motivated to disclose information because of the convenience of maintaining and developing relationships and platform enjoyment. Countervailing these benefits, privacy risks represent a critical barrier to information disclosure. However, users’ perception of risk can be mitigated by their trust in the network provider and availability of control options. Based on these findings, we offer recommendations for network providers.