Abstract
Panel data is a regression analysis type that uses time data and spatial data. Thus, the behavior of groups, for example, enterprises or communities, is analyzed through a time scale. Panel data allows exploring variables that cannot be observed or measured or variables that evolve over time but not across groups or communities. In this chapter, two different techniques used in panel data analysis is explored: fixed effects (FE) and random effects (RE). First, theoretical concepts of panel data are presented. Additionally, a case study example of the use of this type of regression is provided. Panel data analysis is performed with R language, and a step-by-step approach is presented.

Abstract
Discovering communities in a network is a fundamental and important problem to complex networks. Find the most influential actors among its peers is a major task. If on one side, studies on community detection ignore the influence of actors and communities, on the other hand, ignoring the hierarchy and community structure of the network neglect the actor or community influence. We bridge this gap by combining a dynamic community detection method with a dynamic centrality measure. The proposed enhanced dynamic hierarchical community detection method computes centrality for nodes and aggregated communities and selects each community representative leader using the ranked centrality of every node belonging to the community. This method is then able to unveil, track, and measure the importance of main actors, network intra and inter-community structural hierarchies based on a centrality measure. The empirical analysis performed, using two temporal networks shown that the method is able to find and tracking community leaders in evolving networks. © 2020, Springer Nature Switzerland AG.

Abstract
Text Mining and NLP techniques are a hot topic nowadays. Researchers thrive to develop new and faster algorithms to cope with larger amounts of data. Particularly, text data analysis has been increasing in interest due to the growth of social networks media. Given this, the development of new algorithms and/or the upgrade of existing ones is now a crucial task to deal with text mining problems under this new scenario. In this paper, we present an update to TextRank, a well-known implementation used to do automatic keyword extraction from text, adapted to deal with streams of text. In addition, we present results for this implementation and compare them with the batch version. Major improvements are lowest computation times for the processing of the same text data, in a streaming environment, both in sliding window and incremental setups. The speedups obtained in the experimental results are significant. Therefore the approach was considered valid and useful to the research community. Copyright

Abstract

Abstract
Forecasting enterprise bankruptcy is a critical area for Business Intelligence. It is a major concern for investors and credit institutions on risk analysis. It may also enable the sustainability assessment of critical suppliers and clients, as well as competitors and the business environment. Data Mining may deliver a faster and more precise insight about this issue. Widespread software tools offer a broad spectrum of Artificial Intelligence algorithms and the most difficult task may be the decision of selecting that algorithm. Trying to find an answer for this decision in the relatively large amount of available literature in this area with so many options, advantages, and pitfalls may be as informative as distracting. In this chapter, the authors present an empirical study with a comprehensive Knowledge Discovery and Data Mining (KDD) workflow. The proposed classifier selection automation selects an algorithm that has better prediction performance than the most widely documented in the literature.