Profiling Attitudes for Personalized Information Provision

PAROS is a generic system under design whose goal is to offer personalization, recommendation, and other adaptation services to information providing systems. In its heart lies a rich user model able to capture several diverse aspects of user behavior, interests, preferences, and other attitudes. The user model is instantiated with profiles of users, which are obtained by analyzing and appropriately interpreting potentially arbitrary pieces of user-relevant information coming from diverse sources. These profiles are maintained by the system, updated incrementally as additional data on users becomes available, and used by a variety of information systems to adapt the functionality to the users’ characteristics

Greedy MAXCUT Algorithms and their Information Content

MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem. Applications of MAXCUT are abundant in machine learning, computer vision and statistical physics. Greedy algorithms to approximately solve MAXCUT rely on greedy vertex labelling or on an edge contraction strategy. These algorithms have been studied by measuring their approximation ratios in the worst case setting but very little is known to characterize their robustness to noise contaminations of the input data in the average case. Adapting the framework of Approximation Set Coding, we present a method to exactly measure the cardinality of the algorithmic approximation sets of five greedy MAXCUT algorithms. Their information contents are explored for graph instances generated by two different noise models: the edge reversal model and Gaussian edge weights model. The results provide insights into the robustness of different greedy heuristics and techniques for MAXCUT, which can be used for algorithm design of general USM problems.Comment: This is a longer version of the paper published in 2015 IEEE Information Theory Workshop (ITW

Topic Independent Identification of Agreement and Disagreement in Social Media Dialogue

Research on the structure of dialogue has been hampered for years because large dialogue corpora have not been available. This has impacted the dialogue research community's ability to develop better theories, as well as good off the shelf tools for dialogue processing. Happily, an increasing amount of information and opinion exchange occur in natural dialogue in online forums, where people share their opinions about a vast range of topics. In particular we are interested in rejection in dialogue, also called disagreement and denial, where the size of available dialogue corpora, for the first time, offers an opportunity to empirically test theoretical accounts of the expression and inference of rejection in dialogue. In this paper, we test whether topic-independent features motivated by theoretical predictions can be used to recognize rejection in online forums in a topic independent way. Our results show that our theoretically motivated features achieve 66% accuracy, an improvement over a unigram baseline of an absolute 6%.Comment: @inproceedings{Misra2013TopicII, title={Topic Independent Identification of Agreement and Disagreement in Social Media Dialogue}, author={Amita Misra and Marilyn A. Walker}, booktitle={SIGDIAL Conference}, year={2013}

Exploiting Social Network Structure for Person-to-Person Sentiment Analysis

Person-to-person evaluations are prevalent in all kinds of discourse and important for establishing reputations, building social bonds, and shaping public opinion. Such evaluations can be analyzed separately using signed social networks and textual sentiment analysis, but this misses the rich interactions between language and social context. To capture such interactions, we develop a model that predicts individual A's opinion of individual B by synthesizing information from the signed social network in which A and B are embedded with sentiment analysis of the evaluative texts relating A to B. We prove that this problem is NP-hard but can be relaxed to an efficiently solvable hinge-loss Markov random field, and we show that this implementation outperforms text-only and network-only versions in two very different datasets involving community-level decision-making: the Wikipedia Requests for Adminship corpus and the Convote U.S. Congressional speech corpus

Communication Between Process and Structure: Modelling and Simulating Message Reference Networks with COM/TE

Focusing on observable message signs and referencing structures, communication processes can be described and analysed as message reference networks which are characterized by dynamic pattern evolution. Computational simulation provides a way of obtaining insights into the factors driving such processes. Our paper describes a theoretical framework for communication-oriented modelling — the COM approach — that is centred around the notion of social visibility as a reputation mechanism. The approach contrasts with agent-based social networks on the one hand, and with bibliometric document networks on the other. In introducing our simulation environment COM/TE, typical properties of message reference networks are discussed in terms of a case study which deals with the impact of different media and styles of communication on emergent patterns of social visibility.Communication, Communication-Oriented Modelling, Message Sign, Dynamic Networks, Bottom-up Approach, Temporality, Social Visibility, Reputation, Socionics

Exploring the Characteristics of Opinion Expressions for Political Opinion Classification

Recently there has been increasing interest in constructing general-purpose political opinion classifiers for applications in e-Rulemaking. This problem is generally modeled as a sentiment classification task in a new domain. However, the classification accuracy is not as good as that in other domains such as customer reviews. In this paper, we report the results of a series of experiments designed to explore the characteristics of political opinion expression which might affect the sentiment classification performance. We found that the average sentiment level of Congressional debate is higher than that of neutral news articles, but lower than that of movie reviews. Also unlike the adjectivecentered sentiment expression in movie reviews, the choice of topics, as reflected in nouns, serves as an important mode of political opinion expression. Manual annotation results demonstrate that a significant number of political opinions are expressed in neutral tones. These characteristics suggest that recognizing the sentiment is not enough for political opinion classification. Instead, what seems to be needed is a more finegrained model of individuals\u27 ideological positions and the different ways in which those positions manifest themselves in political discourse

Method for analyzing web space data

A method for analyzing data from the web that determine the importance that a chosen subject has in society, e.g., subject matter relating a concert, a scientific discovery, a football match, a person, a corporation, a brand, or a car, and analyze such data that can represent the entire society better than the known techniques. The method according to the invention can avoid malicious alterations and is able to measure and detect the temporal relations among all the web resources that talk about a particular topic or subject matter