Abstract
In recent years growing volumes of data have made the task of applying various machine learning algorithms a challenge in a great number of cases. This challenge is posed in two main ways: training time and processing load. Normally, problems in these two categories may be attributed to irrelevant, redundant, or noisy features. So as to avoid this type of feature most pre-processing pipelines include a step dedicated so selecting the most relevant features or combining existing ones into a single better representation. These techniques are denominated dimensionality reduction techniques. In this work, we aim to present a short look at the current state of the art in this area. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract
Many real-world datasets have an underlying dynamic graph structure, where entities and their interactions evolve over time. Machine learning models should consider these dynamics in order to harness their full potential in downstream tasks. Previous approaches for graph representation learning have focused on either sampling khop neighborhoods, akin to breadth-first search, or random walks, akin to depth-first search. However, these methods are computationally expensive and unsuitable for real-time, low-latency inference on dynamic graphs. To overcome these limitations, we propose graph-sprints a general purpose feature extraction framework for continuous-time-dynamic-graphs (CTDGs) that has low latency and is competitive with state-of-the-art, higher latency models. To achieve this, a streaming, low latency approximation to the random-walk based features is proposed. In our framework, time-aware node embeddings summarizing multi-hop information are computed using only single-hop operations on the incoming edges. We evaluate our proposed approach on three open-source datasets and two in-house datasets, and compare with three state-of-the-art algorithms (TGN-attn, TGN-ID, Jodie). We demonstrate that our graph-sprints features, combined with a machine learning classifier, achieve competitive performance (outperforming all baselines for the node classification tasks in five datasets). Simultaneously, graphsprints significantly reduce inference latencies, achieving close to an order of magnitude speed-up in our experimental setting.

Abstract
Several research works have applied Reinforcement Learning (RL) algorithms to solve the Rate Adaptation (RA) problem in Wi-Fi networks. The dynamic nature of the radio link requires the algorithms to be responsive to changes in link quality. Delays in the execution of the algorithm due to implementional details may be detrimental to its performance, which in turn may decrease network performance. These delays can be avoided to a certain extent. However, this aspect has been overlooked in the state of the art when using simulated environments, since the computational delays are not considered. In this paper, we present an analysis of computational delays and their impact on the performance of RL-based RA algorithms, and propose a methodology to incorporate the experimental computational delays of the algorithms from running in a specific target hardware, in a simulation environment. Our simulation results considering the real computational delays showed that these delays do, in fact, degrade the algorithm’s execution and training capabilities which, in the end, has a negative impact on network performance.

Abstract

Abstract
This study aims to conduct a bibliometric analysis inherent to assessing competitive intelligence and business intelligence concepts using the Scopus database and the Bibliometrix R software. The study's articles were found using precise criteria in the Scopus database. The 42 publications were then examined with Bibliometrix software, which included extensive parameterization for each component under evaluation. The results of this study consisted of establishing the number of existing publications on the topic under analysis between 2017 and 2021 - in this sense, it was possible to identify that the publications are experiencing an annual decrease rate of 22.69%; the trends in terms of publications and collaborations between countries; the most relevant journals in the area; and the interconnections between authors, keywords, and publications. This study has as an added value the possibility to evaluate the relevance attributed by academics to ascertain the most important contributions in terms of authors, articles, and journals. One major limitation in this study could be addressed in future research. The study focused on a limited study field in the context of business, management, and accounting, so it would be very pertinent to understand how this topic has evolved, particularly in the area of computer science.

Abstract