Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.

Partite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree sequence problem of partite, 3-uniform hypergraphs, that is, to decide if such a hypergraph with prescribed degree sequences exists. We prove that this decision problem is NP-complete in general, and give a polynomial running time algorithm for third almost-regular degree sequences, that is, when each degree in one of the vertex classes is k or k - 1 for some fixed k, and there is no restriction for the other two vertex classes. We also consider the sampling problem, that is, to uniformly sample partite, 3-uniform hypergraphs with prescribed degree sequences. We propose a Parallel Tempering method, where the hypothetical energy of the hypergraphs measures the deviation from the prescribed degree sequence. The method has been implemented and tested on synthetic and real data. It can also be applied for χ2 testing of contingency tables. We have shown that this hypergraph-based χ2 test is more sensitive than the standard χ2 test. The extra sensitivity is especially advantageous on small data sets, where the proposed Parallel Tempering method shows promising performance.

Blood Test-Based Age Acceleration Is Inversely Associated with High-Volume Sports Activity.

PURPOSE: We develop blood test-based aging clocks and examine how these clocks reflect high-volume sports activity. METHODS: We use blood tests and body metrics data of 421 Hungarian athletes and 283 age-matched controls (mean age, 24.1 and 23.9 yr, respectively), the latter selected from a group of healthy Caucasians of the National Health and Nutrition Examination Survey (NHANES) to represent the general population ( n = 11,412). We train two age prediction models (i.e., aging clocks) using the NHANES dataset: the first model relies on blood test parameters only, whereas the second one additionally incorporates body measurements and sex. RESULTS: We find lower age acceleration among athletes compared with the age-matched controls with a median value of -1.7 and 1.4 yr, P < 0.0001. BMI is positively associated with age acceleration among the age-matched controls ( r = 0.17, P < 0.01) and the unrestricted NHANES population ( r = 0.11, P < 0.001). We find no association between BMI and age acceleration within the athlete dataset. Instead, age acceleration is positively associated with body fat percentage ( r = 0.21, P < 0.05) and negatively associated with skeletal muscle mass (Pearson r = -0.18, P < 0.05) among athletes. The most important blood test features in age predictions were serum ferritin, mean cell volume, blood urea nitrogen, and albumin levels. CONCLUSIONS: We develop and apply blood test-based aging clocks to adult athletes and healthy controls. The data suggest that high-volume sports activity is associated with slowed biological aging. Here, we propose an alternative, promising application of routine blood tests.

Network embedding aided vaccine skepticism detection.

We investigate automatic methods to assess COVID vaccination views in Twitter content. Vaccine skepticism has been a controversial topic of long history that has become more important than ever with the COVID-19 pandemic. Our main goal is to demonstrate the importance of network effects in detecting vaccination skeptic content. Towards this end, we collected and manually labeled vaccination-related Twitter content in the first half of 2021. Our experiments confirm that the network carries information that can be exploited to improve the accuracy of classifying attitudes towards vaccination over content classification as baseline. We evaluate a variety of network embedding algorithms, which we combine with text embedding to obtain classifiers for vaccination skeptic content. In our experiments, by using Walklets, we improve the AUC of the best classifier with no network information by. We publicly release our labels, Tweet IDs and source codes on GitHub.

Short and mid-term characteristics of COVID-19 disease course in athletes: A high-volume, single-center study.

INTRODUCTION: At the pandemic's beginning, significant concern has risen about the prevalence of myocardial involvement after SARS-CoV-2 infection. We assessed the cardiovascular burden of SARS-CoV-2 in a large cohort of athletes and identified factors that might affect the disease course. We included 633 athletes in our study on whom we performed extensive cardiology examinations after recovering from SARS-CoV-2 infection. More than half of the athletes (n = 322) returned for a follow-up examination median of 107 days after the commencement of their infection. RESULTS: Troponin T positivity was as low as 1.4% of the athletes, where the subsequently performed examinations did not show definitive, ongoing myocardial injury. Altogether, 31% of the athletes' rapid training rebuild was hindered by persistent or reoccurring symptoms. Female athletes reported a higher prevalence of return to play (RTP) symptoms than their male counterparts (34% vs. 19%, p = 0.005). The development of long COVID symptoms was independently predicted by increasing age and acute symptoms' severity in a multiple regression model (AUC 0.75, CI 0.685-0.801). Athletes presenting with either or both cough and ferritin levels higher than >150 µg/L had a 4.1x (CI 1.78-9.6, p = 0.001) higher odds ratio of developing persistent symptoms. CONCLUSION: While SARS-CoV-2 rarely affects the myocardium in athletes, about one in three of them experience symptoms beyond the acute phase. Identifying those athletes with a predisposition to developing long-standing symptoms may aid clinicians and trainers in finding the optimal return-to-play timing and training load rebuild pace.

Reliability of Family Dogs' Sleep Structure Scoring Based on Manual and Automated Sleep Stage Identification.

Non-invasive polysomnography recording on dogs has been claimed to produce data comparable to those for humans regarding sleep macrostructure, EEG spectra and sleep spindles. While functional parallels have been described relating to both affective (e.g., emotion processing) and cognitive (e.g., memory consolidation) domains, methodologically relevant questions about the reliability of sleep stage scoring still need to be addressed. In Study 1, we analyzed the effects of different coders and different numbers of visible EEG channels on the visual scoring of the same polysomnography recordings. The lowest agreement was found between independent coders with different scoring experience using full (3 h-long) recordings of the whole dataset, and the highest agreement within-coder, using only a fraction of the original dataset (randomly selected 100 epochs (i.e., 100 × 20 s long segments)). The identification of drowsiness was found to be the least reliable, while that of non-REM (rapid eye movement, NREM) was the most reliable. Disagreements resulted in no or only moderate differences in macrostructural and spectral variables. Study 2 targeted the task of automated sleep EEG time series classification. Supervised machine learning (ML) models were used to help the manual annotation process by reliably predicting if the dog was sleeping or awake. Logistic regression models (LogREG), gradient boosted trees (GBT) and convolutional neural networks (CNN) were set up and trained for sleep state prediction from already collected and manually annotated EEG data. The evaluation of the individual models suggests that their combination results in the best performance: ~0.9 AUC test scores.

Session Recommendation via Recurrent Neural Networks over Fisher Embedding Vectors.

Recommendation services bear great importance in e-commerce, shopping, tourism, and social media, as they aid the user in navigating through the items that are most relevant to their needs. In order to build recommender systems, organizations log the item consumption in their user sessions by using different sensors. For instance, Web sites use Web data loggers, museums and shopping centers rely on user in-door positioning systems to register user movement, and Location-Based Social Networks use Global Positioning System for out-door user tracking. Most organizations do not have a detailed history of previous activities or purchases by the user. Hence, in most cases recommenders propose items that are similar to the most recent ones viewed in the current user session. The corresponding task is called session based, and when only the last item is considered, it is referred to as item-to-item recommendation. A natural way of building next-item recommendations relies on item-to-item similarities and item-to-item transitions in the form of "people who viewed this, also viewed" lists. Such methods, however, depend on local information for the given item pairs, which can result in unstable results for items with short transaction history, especially in connection with the cold-start items that recently appeared and had no time yet to accumulate a sufficient number of transactions. In this paper, we give new algorithms by defining a global probabilistic similarity model of all the items based on Random Fields. We give a generative model for the item interactions based on arbitrary distance measures over the items, including explicit, implicit ratings and external metadata to estimate and predict item-to-item transition probabilities. We exploit our new model in two different item similarity algorithms, as well as a feature representation in a recurrent neural network based recommender. Our experiments on various publicly available data sets show that our new model outperforms simple similarity baseline methods and combines well with recent item-to-item and deep learning recommenders under several different performance metrics.

Prediction and characterization of human ageing-related proteins by using machine learning.

Ageing has a huge impact on human health and economy, but its molecular basis - regulation and mechanism - is still poorly understood. By today, more than three hundred genes (almost all of them function as protein-coding genes) have been related to human ageing. Although individual ageing-related genes or some small subsets of these genes have been intensively studied, their analysis as a whole has been highly limited. To fill this gap, for each human protein we extracted 21000 protein features from various databases, and using these data as an input to state-of-the-art machine learning methods, we classified human proteins as ageing-related or non-ageing-related. We found a simple classification model based on only 36 protein features, such as the "number of ageing-related interaction partners", "response to oxidative stress", "damaged DNA binding", "rhythmic process" and "extracellular region". Predicted values of the model quantify the relevance of a given protein in the regulation or mechanisms of the human ageing process. Furthermore, we identified new candidate proteins having strong computational evidence of their important role in ageing. Some of them, like Cytochrome b-245 light chain (CY24A) and Endoribonuclease ZC3H12A (ZC12A) have no previous ageing-associated annotations.

Temporal walk based centrality metric for graph streams.

A plethora of centrality measures or rankings have been proposed to account for the importance of the nodes of a network. In the seminal study of Boldi and Vigna (2014), the comparative evaluation of centrality measures was termed a difficult, arduous task. In networks with fast dynamics, such as the Twitter mention or retweet graphs, predicting emerging centrality is even more challenging. Our main result is a new, temporal walk based dynamic centrality measure that models temporal information propagation by considering the order of edge creation. Dynamic centrality measures have already started to emerge in publications; however, their empirical evaluation is limited. One of our main contributions is creating a quantitative experiment to assess temporal centrality metrics. In this experiment, our new measure outperforms graph snapshot based static and other recently proposed dynamic centrality measures in assigning the highest time-aware centrality to the actually relevant nodes of the network. Additional experiments over different data sets show that our method perform well for detecting concept drift in the process that generates the graphs.