Look inside. Predicting stock prices by analysing an enterprise intranet social network and using word co-occurrence networks

• URL: http://arxiv.org/abs/2105.11780v1
• Date: Tue, 25 May 2021 09:17:22 GMT
• Title: Look inside. Predicting stock prices by analysing an enterprise intranet social network and using word co-occurrence networks
• Authors: A. Fronzetti Colladon, G. Scettri
• Abstract summary: This study looks into employees' communication, offering novel metrics which can help to predict a company's stock price. We studied the intranet forum of a large Italian company, exploring the interactions and the use of language of about 8,000 employees. We found that a lower sentiment, a higher betweenness of the company brand, a denser centrality word co-occurrence network and more equally distributed centrality scores of employees are all significant predictors of higher stock prices.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This study looks into employees' communication, offering novel metrics which can help to predict a company's stock price. We studied the intranet forum of a large Italian company, exploring the interactions and the use of language of about 8,000 employees. We built a network linking words included in the general discourse. In this network, we focused on the position of the node representing the company brand. We found that a lower sentiment, a higher betweenness centrality of the company brand, a denser word co-occurrence network and more equally distributed centrality scores of employees (lower group betweenness centrality) are all significant predictors of higher stock prices. Our findings offers new metrics that can be helpful for scholars, company managers and professional investors and could be integrated into existing forecasting models to improve their accuracy. Lastly, we contribute to the research on word co-occurrence networks by extending their field of application.

Related papers

• Digital cloning of online social networks for language-sensitive agent-based modeling of misinformation spread [0.0]
  We develop a simulation framework for studying misinformation spread within online social networks. We create a 'digital clone' of a known misinformation sharing network by downloading social media histories for over ten thousand of its users.
  arXiv  Detail & Related papers  (2024-01-23T06:02:03Z)
• Cryptocurrency Portfolio Optimization by Neural Networks [81.20955733184398]
  This paper proposes an effective algorithm based on neural networks to take advantage of these investment products. A deep neural network, which outputs the allocation weight of each asset at a time interval, is trained to maximize the Sharpe ratio. A novel loss term is proposed to regulate the network's bias towards a specific asset, thus enforcing the network to learn an allocation strategy that is close to a minimum variance strategy.
  arXiv  Detail & Related papers  (2023-10-02T12:33:28Z)
• Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy [86.61829236732744]
  This work considers the problem of Distributed Mean Estimation (DME) over networks with intermittent connectivity. The goal is to learn a global statistic over the data samples localized across distributed nodes with the help of a central server. We study the tradeoff between collaborative relaying and privacy leakage due to the additional data sharing among nodes.
  arXiv  Detail & Related papers  (2023-02-28T19:17:03Z)
• Personalized multi-faceted trust modeling to determine trust links in social media and its potential for misinformation management [61.88858330222619]
  We present an approach for predicting trust links between peers in social media. We propose a data-driven multi-faceted trust modeling which incorporates many distinct features for a comprehensive analysis. Illustrated in a trust-aware item recommendation task, we evaluate the proposed framework in the context of a large Yelp dataset.
  arXiv  Detail & Related papers  (2021-11-11T19:40:51Z)
• From words to connections: Word use similarity as an honest signal conducive to employees' digital communication [0.0]
  We analyse the communication of close to 1600 employees, interacting on the intranet communication forum of a large company. We find that word use similarity is the main driver of interaction, much more than other language characteristics or similarity in network position. Our results suggest carefully choosing the language according to the target audience and have practical implications for both company managers and online community administrators.
  arXiv  Detail & Related papers  (2021-11-11T10:32:33Z)
• Measuring the impact of spammers on e-mail and Twitter networks [0.0]
  This paper investigates if senders of large amounts of irrelevant or unsolicited information - commonly called "spammers" - distort the network structure of social networks. Two large social networks are analyzed, the first extracted from the Twitter discourse about a big telecommunication company, and the second obtained from three years of email communication of 200 managers working for a large multinational company. Results show that spammers do not significantly alter the structure of the information-carrying network, for most of the social indicators.
  arXiv  Detail & Related papers  (2021-05-21T10:13:11Z)
• Full network nonlocality [68.8204255655161]
  We introduce the concept of full network nonlocality, which describes correlations that necessitate all links in a network to distribute nonlocal resources. We show that the most well-known network Bell test does not witness full network nonlocality. More generally, we point out that established methods for analysing local and theory-independent correlations in networks can be combined in order to deduce sufficient conditions for full network nonlocality.
  arXiv  Detail & Related papers  (2021-05-19T18:00:02Z)
• Robustness and stability of enterprise intranet social networks: The impact of moderators [0.0]
  We analyzed more than 52,000 messages posted by approximately 12,000 employees. We removed the forum moderators, the spammers, the overly connected nodes and the nodes lying at the network periphery. Our findings can help online community managers to understand the role of moderators within intranet forums.
  arXiv  Detail & Related papers  (2021-05-19T13:43:03Z)
• Competing Adaptive Networks [56.56653763124104]
  We develop an algorithm for decentralized competition among teams of adaptive agents. We present an application in the decentralized training of generative adversarial neural networks.
  arXiv  Detail & Related papers  (2021-03-29T14:42:15Z)
• NetReAct: Interactive Learning for Network Summarization [60.18513812680714]
  We present NetReAct, a novel interactive network summarization algorithm which supports the visualization of networks induced by text corpora to perform sensemaking. We show how NetReAct is successful in generating high-quality summaries and visualizations that reveal hidden patterns better than other non-trivial baselines.
  arXiv  Detail & Related papers  (2020-12-22T03:56:26Z)
• Assessing Centrality Without Knowing Connections [19.40833089993767]
  Motivated by modern communication networks spanning multiple providers, we show for the first time how multiple mutually-distrusting parties can successfully compute node EBC. A theoretical utility analysis upper bounds a primary source of private EBC error---private release of ego networks---with high probability.
  arXiv  Detail & Related papers  (2020-05-28T05:51:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.