Sentiment Index of the Russian Speaking Facebook

•

3 gostaram•848 visualizações

A sentiment index measures the average emotional level in a corpus. We introduce four such indexes and use them to gauge average “positiveness” of a population during some period based on posts in a social network. This article for the first time presents a text-, rather than word-based sentiment index. Furthermore, this study presents the first large-scale study of the sentiment index of the Russian-speaking Facebook. Our results are consistent with the prior experiments for English language.

Ciências Tecnologia Negócios

Introduction Social Sentiment Index Results
Sentiment Index of the
Russian Speaking Facebook
International Conference on Computational Linguistics
Dialogue 2014, Bekasovo, Russia
Alexander Panchenko
Digital Society Laboratory LLC, Moscow, Russia &
Universite catholique de Louvain, Louvain-la-Neuve, Belgium
June 8, 2014
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Motivation: Can we measure happiness?
Why such a wild idea as measuring happiness?
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Happiness: Google
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Happiness: semantic ﬁeld
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Happiness: self-reported vs estimated
self-reported
are you happy now?
estimated from socio-economical factors
gross national product
quality of life, etc.
estimated from linguistic data
positive statements vs negative statements
several researchers considered this problem during last 10 years
blogs: Mihalchea and Lui (2005), Mishne and Rijke (2006),
Balog and Rijke (2006)
social networks: Dodds et al. (2011), Kamvar and Harris
(2011), Facebook Gross National Happiness index (FGNH) of
Kramer (2010)
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Contributions
Two contributions of this paper to the exploration of
sentiment/happiness indexes are as follows:
We propose four indexes that gauge emotional level of
population. Unlike most previous works, we not only deal with
word-based indexes, but also device a text-based index.
To the best of our knowledge, this is the ﬁrst study of
sentiment index of the Russian-speaking social network.
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Facebook Corpus
Statistics of the Facebook corpus
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Facebook Corpus
Number of texts per day in the Facebook corpus
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Sentiment Detection Method
Most frequent positive and negative adjectives in the
Facebook corpus
1500 emotional adjectives (600 negative, 900 positive)
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Sentiment Detection Method
Dictionary Sentiment Text Classiﬁcation Approach
emotion delta ∆ ∈ [−1; 1] – direction and amplitude of text
sentiment
D+ – positive terms
D− – negative terms
w – word
t – text
n – length of text
α ∈ [0; 1] – a threshold
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Sentiment Detection Method
Comparison of Sentiment Classiﬁcation Approaches
ROMIP 2012 – Sentiment Analysis Collection
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Social Sentiment Indexes
Sentiment Indexes
The goal of a sentiment index is to measure positiveness of social
network users during some period.
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Social Sentiment Indexes
Sentiment Indexes
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Results of the social sentiment index calculation during the
entire period
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Evolution of the word sentiment index sw during the entire
period
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Word (sw ) and text (st) sentiment indexes
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Positive and Negative Events
(1) 31-12-*—New Year (+);
(2) 14-02-*—St.Valentine’s day (+);
(3) 23-02-*—Man’s day (+);
(4) 08-03-*—Woman’s day (+);
(5) 09-05-*—Victory Day, World War 2 commemorative day (–);
(6) 07-07-2012—Krasnodar Krai ﬂoods in Russia 6 (–);
(7) 22-07-2012—A new unpopular law regulating non-proﬁt
organizations in Russia 7 (–);
(8) 16-09-2012—A mass protest against government in Russia 8 (–);
(9) 25-10-2012—Hurricane Sandy in US (–).
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Word (ew ) and text (et) emotional indexes
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Word and text emotional indexes
Word (ew ) and text (et) emotional indexes, compared to the
number of words.
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Introduction Social Sentiment Index Results
Thank you! Questions?
Alexander Panchenko Sentiment Index of the Russian Speaking Facebook

Mais conteúdo relacionado

Mais de Alexander Panchenko

Graph's not dead: from unsupervised induction of linguistic structures from t...

Alexander Panchenko

We present DepCC, the largest-to-date linguistically analyzed corpus in English including 365 million documents, composed of 252 billion tokens and 7.5 billion of named entity occurrences in 14.3 billion sentences from a web-scale crawl of the Common Crawl project. The sentences are processed with a dependency parser and with a named entity tagger and contain provenance information, enabling various applications ranging from training syntax-based word embeddings to open information extraction and question answering. We built an index of all sentences and their linguistic meta-data enabling quick search across the corpus. We demonstrate the utility of this corpus on the verb similarity task by showing that a distributional model trained on our corpus yields better results than models trained on smaller corpora, like Wikipedia. This distributional model outperforms the state of art models of verb similarity trained on smaller corpora on the SimVerb3500 dataset. http://www.lrec-conf.org/proceedings/lrec2018/summaries/215.html

Building a Web-Scale Dependency-Parsed Corpus from Common Crawl

Alexander Panchenko

http://www.lrec-conf.org/proceedings/lrec2018/pdf/234.pdf In this paper, we show how distributionally-induced semantic classes can be helpful for extracting hypernyms. We present methods for inducing sense-aware semantic classes using distributional semantics and using these induced semantic classes for filtering noisy hypernymy relations. Denoising of hypernyms is performed by labeling each semantic class with its hypernyms. On the one hand, this allows us to filter out wrong extractions using the global structure of distributionally similar senses. On the other hand, we infer missing hypernyms via label propagation to cluster terms. We conduct a large-scale crowdsourcing study showing that processing of automatically extracted hypernyms using our approach improves the quality of the hypernymy extraction in terms of both precision and recall. Furthermore, we show the utility of our method in the domain taxonomy induction task, achieving the state-of-the-art results on a SemEval'16 task on taxonomy induction. The paper was presented at the LREC'2018 conference in Miyazaki, Japan.

Improving Hypernymy Extraction with Distributional Semantic Classes

Alexander Panchenko

In this talk, we will discuss induction of sparse and dense word sense representations using graph-based approaches and distributional models. Induced senses are represented by a vector, but also a set of hypernyms, images, and usage examples, derived in an unsupervised and knowledge-free manner, which ensure interpretability of the discovered senses by humans. We showcase the usage of the induced representations for the tasks of word sense disambiguation and enrichment of lexical resources, such as WordNet.

Inducing Interpretable Word Senses for WSD and Enrichment of Lexical Resources

Alexander Panchenko

IIT-UHH at SemEval-2017 Task 3: Exploring Multiple Features for Community Que...

Alexander Panchenko

Fighting with Sparsity of the Synonymy Dictionaries for Automatic Synset Indu...

Alexander Panchenko

The 6th Conference on Analysis of Images, Social Networks, and Texts (AIST 2...

Alexander Panchenko

We introduce a new method for unsupervised knowledge-based word sense disambiguation (WSD) based on a resource that links two types of sense-aware lexical networks: one is induced from a corpus using distributional semantics, the other is manually constructed. The combination of two networks reduces the sparsity of sense representations used for WSD. We evaluate these enriched representations within two lexical sample sense disambiguation benchmarks. Our results indicate that (1) features extracted from the corpus-based resource help to significantly outperform a model based solely on the lexical resource; (2) our method achieves results comparable or better to four state-of-the-art unsupervised knowledge-based WSD systems including three hybrid systems that also rely on text corpora. In contrast to these hybrid methods, our approach does not require access to web search engines, texts mapped to a sense inventory, or machine translation systems. See the full paper at: http://www.aclweb.org/anthology/W/W17/W17-1909.pdf Panchenko A., Faralli S., Ponzetto S. P., and Biemann C. (2017): Using Linked Disambiguated Distributional Networks for Word Sense Disambiguation. In Proceedings of the Workshop on Sense, Concept and Entity Representations and their Applications (SENSE) co-located with the 15th Conference of the European Chapter of the Association for Computational Linguistics (EACL'2017). Valencia, Spain. Association for Computational Linguistics

Using Linked Disambiguated Distributional Networks for Word Sense Disambiguation

Alexander Panchenko

The current trend in NLP is the use of highly opaque models, e.g. neural networks and word embeddings. While these models yield state-of-the-art results on a range of tasks, their drawback is poor interpretability. On the example of word sense induction and disambiguation (WSID), we show that it is possible to develop an interpretable model that matches the state-of-the-art models in accuracy. Namely, we present an unsupervised, knowledge-free WSID approach, which is interpretable at three levels: word sense inventory, sense feature representations, and disambiguation procedure. Experiments show that our model performs on par with state-of-the-art word sense embeddings and other unsupervised systems while offering the possibility to justify its decisions in human-readable form.

Unsupervised Does Not Mean Uninterpretable: The Case for Word Sense Induction...

Alexander Panchenko

Making Sense of Word Embeddings

Alexander Panchenko

We introduce an approach to word sense induction and disambiguation. The method is unsupervised and knowledge-free: sense representations are learned from distributional evidence and subsequently used to disambiguate word instances in context. These sense representations are obtained by clustering dependency-based secondorder similarity networks. We then add features for disambiguation from heterogeneous sources such as window-based and sentence-wide co-occurrences, and explore various schemes to combine these context clues. Our method reaches a performance comparable to the state-of-the-art unsupervised word sense disambiguation systems including top participants of the SemEval 2013 word sense induction task and two more recent state-of-the-art neural word sense induction systems Full paper: https://www.lt.informatik.tu-darmstadt.de/fileadmin/user_upload/Group_LangTech/publications/konvens2016panchenko.pdf

Noun Sense Induction and Disambiguation using Graph-Based Distributional Sema...

Alexander Panchenko

Getting started in Apache Spark and Flink (with Scala) - Part II

Alexander Panchenko

IIT-TUDA at SemEval-2016 Task 5: Beyond Sentiment Lexicon: Combining Domain ...

Alexander Panchenko

Неологизмы в социальной сети Фейсбук

Alexander Panchenko

Dmitry Gubanov. An Approach to the Study of Formal and Informal Relations of ...

Alexander Panchenko

Document

Alexander Panchenko

Semantic Similarity Measures for Semantic Relation Extraction

Alexander Panchenko

Mais de Alexander Panchenko (17)