Disentangling categorical relationships through a graph of co-occurrences

Absence of stress‐promoted facilitation coupled with a competition decrease in the microbiome of ephemeral saline lakes

Salinity fluctuations constitute a well-known high stress factor strongly shaping global biological distributions and abundances. However, there is a knowledge gap regarding how increasing saline stress affects microbial biological interactions. We applied the combination of a probabilistic method for estimating significant co-occurrences/exclusions and a conceptual framework for filtering out associations potentially linked to environmental and/or spatial factors, in a series of connected ephemeral (hyper) saline lakes. We carried out a network analysis over the full aquatic microbiome-bacteria, eukarya, and archaea-under severe salinity fluctuations. Most of the observed co-occurrences/exclusions were potentially explained by environmental niche and/or dispersal limitation. Co-occurrences assigned to potential biological interactions remained stable, suggesting that the salt gradient was not promoting interspecific facilitation processes. Conversely, co-exclusions assigned to potential biological interactions decreased along the gradient both in number and network complexity, pointing to a decrease of interspecies competition as salinity increased. Overall, higher saline stress reduced microbial co-exclusions while co-occurrences remained stable suggesting decreasing competition coupled with lack of stress-gradient promoted facilitation in the microbiome of ephemeral saline lakes.

Biological Microbial Interactions from Cooccurrence Networks in a High Mountain Lacustrine District

A fundamental question in biology is why some species tend to occur together in the same locations, while others are never observed coexisting. This question becomes particularly relevant for microorganisms thriving in the highly diluted waters of high mountain lakes, where biotic interactions might be required to make the most of an extreme environment. We studied a high-throughput gene data set of alpine lakes (>220 Pyrenean lakes) with cooccurrence network analysis to infer potential biotic interactions, using the combination of a probabilistic method for determining significant cooccurrences and coexclusions between pairs of species and a conceptual framework for classifying the nature of the observed cooccurrences and coexclusions. This computational approach (i) determined and quantified the importance of environmental variables and spatial distribution and (ii) defined potential interacting microbial assemblages. We determined the properties and relationships between these assemblages by examining node properties at the taxonomic level, indicating associations with their potential habitat sources (i.e., aquatic versus terrestrial) and their functional strategies (i.e., parasitic versus mixotrophic). Environmental variables explained fewer pairs in bacteria than in microbial eukaryotes for the alpine data set, with pH alone explaining the highest proportion of bacterial pairs. Nutrient composition was also relevant for explaining association pairs, particularly in microeukaryotes. We identified a reduced subset of pairs with the highest probability of species interactions (“interacting guilds”) that significantly reached higher occupancies and lower mean relative abundances in agreement with the carrying capacity hypothesis. The interacting bacterial guilds could be more related to habitat and microdispersal processes (i.e., aquatic versus soil microbes), whereas for microeukaryotes trophic roles (osmotrophs, mixotrophs, and parasitics) could potentially play a major role. Overall, our approach may add helpful information to guide further efforts for a mechanistic understanding of microbial interactions in situ.

IMPORTANCE A fundamental question in biology is why some species tend to occur together in the same locations, while others are never observed to coexist. This question becomes particularly relevant for microorganisms thriving in the highly diluted waters of high mountain lakes, in which biotic interactions might be required to make the most of an extreme environment. Microbial metacommunities are too often only studied in terms of their environmental niches and geographic barriers since they show inherent difficulties to quantify biological interactions and their role as drivers of ecosystem functioning. Our study highlights that telling apart potential interactions from both environmental and geographic niches may help for the initial characterization of organisms with similar ecologies in a large scope of ecosystems, even when information about actual interactions is partial and limited. The multilayered statistical approach carried out here offers the possibility of going beyond taxonomy to understand microbiological behavior in situ.

A keyphrase-based approach for interpretable ICD-10 code classification of Spanish medical reports

BACKGROUND AND OBJECTIVES

The 10th version of International Classification of Diseases (ICD-10) codification system has been widely adopted by the health systems of many countries, including Spain. However, manual code assignment of Electronic Health Records (EHR) is a complex and time-consuming task that requires a great amount of specialised human resources. Therefore, several machine learning approaches are being proposed to assist in the assignment task. In this work we present an alternative system for automatically recommending ICD-10 codes to be assigned to EHRs.

METHODS

Our proposal is based on characterising ICD-10 codes by a set of keyphrases that represent them. These keyphrases do not only include those that have literally appeared in some EHR with the considered ICD-10 codes assigned, but also others that have been obtained by a statistical process able to capture expressions that have led the annotators to assign the code.

RESULTS

The result is an information model that allows to efficiently recommend codes to a new EHR based on their textual content. We explore an approach that proves to be competitive with other state-of-the-art approaches and can be combined with them to optimise results.

CONCLUSIONS

In addition to its effectiveness, the recommendations of this method are easily interpretable since the phrases in an EHR leading to recommend an ICD-10 code are known. Moreover, the keyphrases associated with each ICD-10 code can be a valuable additional source of information for other approaches, such as machine learning techniques.

Hierarchical clustering of bipartite data sets based on the statistical significance of coincidences

When some 'entities' are related by the 'features' they share they are amenable to a bipartite network representation. Plant-pollinator ecological communities, co-authorship of scientific papers, customers and purchases, or answers in a poll, are but a few examples. Analyzing clustering of such entities in the network is a useful tool with applications in many fields, like internet technology, recommender systems, or detection of diseases. The algorithms most widely applied to find clusters in bipartite networks are variants of modularity optimization. Here, we provide a hierarchical clustering algorithm based on a dissimilarity between entities that quantifies the probability that the features shared by two entities are due to mere chance. The algorithm performance is O(n^{2}) when applied to a set of n entities, and its outcome is a dendrogram exhibiting the connections of those entities. Through the introduction of a 'susceptibility' measure we can provide an 'optimal' choice for the clustering as well as quantify its quality. The dendrogram reveals further useful structural information though-like the existence of subclusters within clusters or of nodes that do not fit in any cluster. We illustrate the algorithm by applying it first to a set of synthetic networks, and then to a selection of examples. We also illustrate how to transform our algorithm into a valid alternative for one-mode networks as well, and show that it performs at least as well as the standard, modularity-based algorithms-with a higher numerical performance. We provide an implementation of the algorithm in python freely accessible from GitHub.

Validation of Twitter opinion trends with national polling aggregates: Hillary Clinton vs Donald Trump

Measuring and forecasting opinion trends from real-time social media is a long-standing goal of big-data analytics. Despite the large amount of work addressing this question, there has been no clear validation of online social media opinion trend with traditional surveys. Here we develop a method to infer the opinion of Twitter users by using a combination of statistical physics of complex networks and machine learning based on hashtags co-occurrence to build an in-domain training set of the order of a million tweets. We validate our method in the context of 2016 US Presidential Election by comparing the Twitter opinion trend with the New York Times National Polling Average, representing an aggregate of hundreds of independent traditional polls. The Twitter opinion trend follows the aggregated NYT polls with remarkable accuracy. We investigate the dynamics of the social network formed by the interactions among millions of Twitter supporters and infer the support of each user to the presidential candidates. Our analytics unleash the power of Twitter to uncover social trends from elections, brands to political movements, and at a fraction of the cost of traditional surveys.

Text Authorship Identified Using the Dynamics of Word Co-Occurrence Networks

Automatic identification of authorship in disputed documents has benefited from complex network theory as this approach does not require human expertise or detailed semantic knowledge. Networks modeling entire books can be used to discriminate texts from different sources and understand network growth mechanisms, but only a few studies have probed the suitability of networks in modeling small chunks of text to grasp stylistic features. In this study, we introduce a methodology based on the dynamics of word co-occurrence networks representing written texts to classify a corpus of 80 texts by 8 authors. The texts were divided into sections with equal number of linguistic tokens, from which time series were created for 12 topological metrics. Since 73% of all series were stationary (ARIMA(p, 0, q)) and the remaining were integrable of first order (ARIMA(p, 1, q)), probability distributions could be obtained for the global network metrics. The metrics exhibit bell-shaped non-Gaussian distributions, and therefore distribution moments were used as learning attributes. With an optimized supervised learning procedure based on a nonlinear transformation performed by Isomap, 71 out of 80 texts were correctly classified using the K-nearest neighbors algorithm, i.e. a remarkable 88.75% author matching success rate was achieved. Hence, purely dynamic fluctuations in network metrics can characterize authorship, thus paving the way for a robust description of large texts in terms of small evolving networks.

Can multilinguality improve Biomedical Word Sense Disambiguation?

Ambiguity in the biomedical domain represents a major issue when performing Natural Language Processing tasks over the huge amount of available information in the field. For this reason, Word Sense Disambiguation is critical for achieving accurate systems able to tackle complex tasks such as information extraction, summarization or document classification. In this work we explore whether multilinguality can help to solve the problem of ambiguity, and the conditions required for a system to improve the results obtained by monolingual approaches. Also, we analyze the best ways to generate those useful multilingual resources, and study different languages and sources of knowledge. The proposed system, based on co-occurrence graphs containing biomedical concepts and textual information, is evaluated on a test dataset frequently used in biomedicine. We can conclude that multilingual resources are able to provide a clear improvement of more than 7% compared to monolingual approaches, for graphs built from a small number of documents. Also, empirical results show that automatically translated resources are a useful source of information for this particular task.

Topic segmentation via community detection in complex networks

Many real systems have been modeled in terms of network concepts, and written texts are a particular example of information networks. In recent years, the use of network methods to analyze language has allowed the discovery of several interesting effects, including the proposition of novel models to explain the emergence of fundamental universal patterns. While syntactical networks, one of the most prevalent networked models of written texts, display both scale-free and small-world properties, such a representation fails in capturing other textual features, such as the organization in topics or subjects. We propose a novel network representation whose main purpose is to capture the semantical relationships of words in a simple way. To do so, we link all words co-occurring in the same semantic context, which is defined in a threefold way. We show that the proposed representations favor the emergence of communities of semantically related words, and this feature may be used to identify relevant topics. The proposed methodology to detect topics was applied to segment selected Wikipedia articles. We found that, in general, our methods outperform traditional bag-of-words representations, which suggests that a high-level textual representation may be useful to study the semantical features of texts.

A Complex Network Approach to Stylometry

Statistical methods have been widely employed to study the fundamental properties of language. In recent years, methods from complex and dynamical systems proved useful to create several language models. Despite the large amount of studies devoted to represent texts with physical models, only a limited number of studies have shown how the properties of the underlying physical systems can be employed to improve the performance of natural language processing tasks. In this paper, I address this problem by devising complex networks methods that are able to improve the performance of current statistical methods. Using a fuzzy classification strategy, I show that the topological properties extracted from texts complement the traditional textual description. In several cases, the performance obtained with hybrid approaches outperformed the results obtained when only traditional or networked methods were used. Because the proposed model is generic, the framework devised here could be straightforwardly used to study similar textual applications where the topology plays a pivotal role in the description of the interacting agents.

Local-based semantic navigation on a networked representation of information

The size and complexity of actual networked systems hinders the access to a global knowledge of their structure. This fact pushes the problem of navigation to suboptimal solutions, one of them being the extraction of a coherent map of the topology on which navigation takes place. In this paper, we present a Markov chain based algorithm to tag networked terms according only to their topological features. The resulting tagging is used to compute similarity between terms, providing a map of the networked information. This map supports local-based navigation techniques driven by similarity. We compare the efficiency of the resulting paths according to their length compared to that of the shortest path. Additionally we claim that the path steps towards the destination are semantically coherent. To illustrate the algorithm performance we provide some results from the Simple English Wikipedia, which amounts to several thousand of pages. The simplest greedy strategy yields over an 80% of average success rate. Furthermore, the resulting content-coherent paths most often have a cost between one- and threefold compared to shortest-path lengths.