Abstract

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
The application of statistics has proliferated in recent years and has become increasingly relevant across numerous fields of study. With the advent of new technologies, its availability has opened into a wider range of users. Comparative Approaches to Using R and Python for Statistical Data Analysis is a comprehensive source of emerging research and perspectives on the latest computer software and available languages for the visualization of statistical data. By providing insights on relevant topics, such as inference, factor analysis, and linear regression, this publication is ideally designed for professionals, researchers, academics, graduate students, and practitioners interested in the optimization of statistical data analysis.

Abstract
Social Network Analysis (SNA) is an important research area. It originated in sociology but has spread to other areas of research, including anthropology, biology, information science, organizational studies, political science, and computer science. This has stimulated research on how to support SNA with the development of new algorithms. One of the critical areas involves calculation of different centrality measures. The challenge is how to do this fast, as many increasingly larger datasets are available. Our contribution is an incremental version of the Laplacian Centrality measure that can be applied not only to large graphs but also to dynamically changing networks. We have conducted several tests with different types of evolving networks. We show that our incremental version can process a given large network, faster than the corresponding batch version in both incremental and full dynamic network setups. © Springer International Publishing AG 2018.