6,593 research outputs found

    CSNE: Conditional Signed Network Embedding

    Get PDF
    Signed networks are mathematical structures that encode positive and negative relations between entities such as friend/foe or trust/distrust. Recently, several papers studied the construction of useful low-dimensional representations (embeddings) of these networks for the prediction of missing relations or signs. Existing embedding methods for sign prediction generally enforce different notions of status or balance theories in their optimization function. These theories, however, are often inaccurate or incomplete, which negatively impacts method performance. In this context, we introduce conditional signed network embedding (CSNE). Our probabilistic approach models structural information about the signs in the network separately from fine-grained detail. Structural information is represented in the form of a prior, while the embedding itself is used for capturing fine-grained information. These components are then integrated in a rigorous manner. CSNE's accuracy depends on the existence of sufficiently powerful structural priors for modelling signed networks, currently unavailable in the literature. Thus, as a second main contribution, which we find to be highly valuable in its own right, we also introduce a novel approach to construct priors based on the Maximum Entropy (MaxEnt) principle. These priors can model the \emph{polarity} of nodes (degree to which their links are positive) as well as signed \emph{triangle counts} (a measure of the degree structural balance holds to in a network). Experiments on a variety of real-world networks confirm that CSNE outperforms the state-of-the-art on the task of sign prediction. Moreover, the MaxEnt priors on their own, while less accurate than full CSNE, achieve accuracies competitive with the state-of-the-art at very limited computational cost, thus providing an excellent runtime-accuracy trade-off in resource-constrained situations

    CSNE : Conditional Signed Network Embedding

    Get PDF
    Signed networks are mathematical structures that encode positive and negative relations between entities such as friend/foe or trust/distrust. Recently, several papers studied the construction of useful low-dimensional representations (embeddings) of these networks for the prediction of missing relations or signs. Existing embedding methods for sign prediction generally enforce different notions of status or balance theories in their optimization function. These theories, however, are often inaccurate or incomplete, which negatively impacts method performance. In this context, we introduce conditional signed network embedding (CSNE). Our probabilistic approach models structural information about the signs in the network separately from fine-grained detail. Structural information is represented in the form of a prior, while the embedding itself is used for capturing fine-grained information. These components are then integrated in a rigorous manner. CSNE's accuracy depends on the existence of sufficiently powerful structural priors for modelling signed networks, currently unavailable in the literature. Thus, as a second main contribution, which we find to be highly valuable in its own right, we also introduce a novel approach to construct priors based on the Maximum Entropy (MaxEnt) principle. These priors can model the polarity of nodes (degree to which their links are positive) as well as signed triangle counts (a measure of the degree structural balance holds to in a network). Experiments on a variety of real-world networks confirm that CSNE outperforms the state-of-the-art on the task of sign prediction. Moreover, the MaxEnt priors on their own, while less accurate than full CSNE, achieve accuracies competitive with the state-of-the-art at very limited computational cost, thus providing an excellent runtime-accuracy trade-off in resource-constrained situations

    Data analytics 2016: proceedings of the fifth international conference on data analytics

    Get PDF

    Applications of opinion mining to data journalism

    Get PDF
    Dissertação de mest., Processamento de Linguagem Natural e Indústrias da Língua, Faculdade de Ciências Humanas e Sociais, Univ. do Algarve, 2013Nowadays social media play a central role in every day life. A huge volume of user-generated data spins around online social networks, such as Twitter, having an extraordinary impact on the media industry and on the users’ everyday life. More and more users and people use social networks from their computers and smartphones to share their emotions and opinions about the facts happening in the world. Natural language processing and, in particular, sentiment analysis are key technologies to make sense out of the data about news that circulates in the online social networks. The application of opinion mining to news-oriented user-generated contents, such as news-linking tweets, can provide novel views on the news audience behaviour and help to interpret the evolution of sentiments. Applying this capability in the social news-sphere permits (i) to measure the impact of news onto readers and (ii) to gather elements that contain stories. From a broad perspective, the main aim of this research is to face this challenge, that is, to explore how opinion mining (or sentiment analysis) can be adopted into the field of digital media and data-driven journalism

    Text-based Spatial and Temporal Visualizations and their Applications in Visual Analytics

    Get PDF
    Textual labels are an essential part of most visualizations used in practice. However, these textual labels are mainly used to annotate other visualizations rather than being a central part of the visualization. Visualization researchers in areas like cartography and geovisualization have studied the combination of graphical features and textual labels to generate map based visualizations, but textual labels alone are not the primary focus in these representations. The idea of using symbols in visual representations and their interpretation as a quantity is gaining more traction. These types of representations are not only aesthetically appealing but also present new possibilities of encoding data. Such scenarios regularly arise while designing visual representations, where designers have to investigate feasibility of encoding information using symbols alone especially textual labels but the lack of readily available automated tools, and design guidelines makes it prohibitively expensive to experiment with such visualization designs. In order to address such challenges, this thesis presents the design and development of visual representations consisting entirely of text. These visual representations open up the possibility of encoding different types of spatial and temporal datasets. We report our results through two novel visualizations: typographic maps and text-based TextRiver visualization. Typographic maps merge text and spatial data into a visual representation where text alone forms the graphical features, mimicking the practices of human map makers. We also introduce methods to combine our automatic typographic maps technique with spatial datasets to generate thema-typographic maps where the properties of individual characters in the map are modified based on the underlying spatial data. Our TextRiver visualization is composed of collection of stream-like shapes consisting entirely of text where each stream represents thematic strength variations over time within a corpus. Such visualization enables additional ways to encode information contained in temporal datasets by modifying text attributes. We also conducted a usability evaluation to assess the potential value of our text-based TextRiver design

    Proceedings of the EACL Hackashop on News Media Content Analysis and Automated Report Generation

    Get PDF
    Peer reviewe
    • …
    corecore