scispace - formally typeset
Proceedings ArticleDOI

Mining diverse opinions

Reads0
Chats0
TLDR
This paper seeks to quantify the effectiveness of a semantic redundancy based approach (over its syntactic counterparts) as a function of such inaccuracies and presents a detailed experimental evaluation using realistic information flows collected from an enterprise network with about 1500 users.
Abstract
Network operations that support tactical missions are often characterized by evolving information that needs to be delivered over bandwidth constrained communication networks and presented to a social/cognitive network with limited human attention span and high stress. Most past research efforts on data dissemination examined syntactic redundancy between data items (e.g., common bit strings, entropy coding and compression, etc.), but only limited work has examined the problem of reducing semantic redundancy with the goal of providing higher quality information to end users. In this paper we propose to measure semantic redundancy in large volume text streams using online topic models and opinion analysis (e.g., topic = Location X and opinion = possible_hazard+, safe_zone−). By suppressing semantically redundant content one can better utilize bottleneck resources such as bandwidth on a resource constrained network or attention time of a human user. However, unlike syntactic redundancy (e.g., lossless compression, lossy compression with small reconstruction errors), a semantic redundancy based approach is faced with the challenge of having to deal with larger inaccuracies (e.g., false positive and false negative probabilities in an opinion classifier). This paper seeks to quantify the effectiveness of a semantic redundancy based approach (over its syntactic counterparts) as a function of such inaccuracies and present a detailed experimental evaluation using realistic information flows collected from an enterprise network with about 1500 users1.

read more

Citations
More filters
Book ChapterDOI

Big Data in Online Social Networks: User Interaction Analysis to Model User Behavior in Social Networks

TL;DR: The goal is to evaluate the value of big data in various social applications and build a framework that models the cost/utility of data and proposes the big data value evaluation framework that weighs in the cost and value of data to determine capacity modeling in the context of data acquisition.
Proceedings ArticleDOI

I act, therefore I judge: network sentiment dynamics based on user activity change

TL;DR: A new generative and predictive model is developed that extends classical neighborhood-based influence propagation with the notion of user activation and outperforms significantly existing alternatives in identifying the individuals who are most likely to change sentiment based on past information.
Proceedings ArticleDOI

On Critical Event Observability Using Social Networks: A Disaster Monitoring Perspective

TL;DR: The paper presents models for actual damage and demonstrates that combining social response with actual damage can improve the damage modeling capability and investigate the gas shortage that ensued around New York City in the aftermath of Hurricane Sandy in November 2012.
Proceedings ArticleDOI

Hierarchical overlapping belief estimation by structured matrix factorization

TL;DR: In this article, a new class of unsupervised non-negative matrix factorization (NMF) algorithms, called Belief Structured Matrix Factorization (BSMF), is proposed to detect not only points of disagreement between communities, but also points of agreement.
Posted Content

Disentangling Overlapping Beliefs by Structured Matrix Factorization.

TL;DR: A new class of Non-negative Matrix Factorization algorithms that allow identification of both agreement and disagreement points when beliefs of different communities partially overlap, and shows that social beliefs overlap even in polarized scenarios.
References
More filters

Thumbs up? Sentiment Classiflcation using Machine Learning Techniques

TL;DR: In this paper, the problem of classifying documents not by topic, but by overall sentiment, e.g., determining whether a review is positive or negative, was considered and three machine learning methods (Naive Bayes, maximum entropy classiflcation, and support vector machines) were employed.
Proceedings ArticleDOI

Thumbs up? Sentiment Classification using Machine Learning Techniques

TL;DR: This work considers the problem of classifying documents not by topic, but by overall sentiment, e.g., determining whether a review is positive or negative, and concludes by examining factors that make the sentiment classification problem more challenging.
Proceedings ArticleDOI

BIRCH: an efficient data clustering method for very large databases

TL;DR: Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) as discussed by the authors is a data clustering method that is especially suitable for very large databases.
Proceedings ArticleDOI

Spray and wait: an efficient routing scheme for intermittently connected mobile networks

TL;DR: A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
Related Papers (5)