Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures.

Graph energy is the energy of the matrix representation of the graph, where the energy of a matrix is the sum of singular values of the matrix. Depending on the definition of a matrix, one can contemplate graph energy, Randic energy, Laplacian energy, distance energy, and many others. Although theoretical properties of various graph energies have been investigated in the past in the areas of mathematics, chemistry, physics, or graph theory, these explorations have been limited to relatively small graphs representing chemical compounds or theoretical graph classes with strictly defined properties. In this paper we investigate the usefulness of the concept of graph energy in the context of large, complex networks. We show that when graph energies are applied to local egocentric networks, the values of these energies correlate strongly with vertex centrality measures. In particular, for some generative network models graph energies tend to correlate strongly with the betweenness and the eigencentrality of vertices. As the exact computation of these centrality measures is expensive and requires global processing of a network, our research opens the possibility of devising efficient algorithms for the estimation of these centrality measures based only on local information.

Evidence-based rules from family practice to inform family practice; the learning healthcare system case study on urinary tract infections.

BACKGROUND: Analysis of encounter data relevant to the diagnostic process sourced from routine electronic medical record (EMR) databases represents a classic example of the concept of a learning healthcare system (LHS). By collecting International Classification of Primary Care (ICPC) coded EMR data as part of the Transition Project from Dutch and Maltese databases (using the EMR TransHIS), data mining algorithms can empirically quantify the relationships of all presenting reasons for encounter (RfEs) and recorded diagnostic outcomes. We have specifically looked at new episodes of care (EoC) for two urinary system infections: simple urinary tract infection (UTI, ICPC code: U71) and pyelonephritis (ICPC code: U70). METHODS: Participating family doctors (FDs) recorded details of all their patient contacts in an EoC structure using the ICPC, including RfEs presented by the patient, and the FDs' diagnostic labels. The relationships between RfEs and episode titles were studied using probabilistic and data mining methods as part of the TRANSFoRm project. RESULTS: The Dutch data indicated that the presence of RfE's "Cystitis/Urinary Tract Infection", "Dysuria", "Fear of UTI", "Urinary frequency/urgency", "Haematuria", "Urine symptom/complaint, other" are all strong, reliable, predictors for the diagnosis "Cystitis/Urinary Tract Infection" . The Maltese data indicated that the presence of RfE's "Dysuria", "Urinary frequency/urgency", "Haematuria" are all strong, reliable, predictors for the diagnosis "Cystitis/Urinary Tract Infection". The Dutch data indicated that the presence of RfE's "Flank/axilla symptom/complaint", "Dysuria", "Fever", "Cystitis/Urinary Tract Infection", "Abdominal pain/cramps general" are all strong, reliable, predictors for the diagnosis "Pyelonephritis" . The Maltese data set did not present any clinically and statistically significant predictors for pyelonephritis. CONCLUSIONS: We describe clinically and statistically significant diagnostic associations observed between UTIs and pyelonephritis presenting as a new problem in family practice, and all associated RfEs, and demonstrate that the significant diagnostic cues obtained are consistent with the literature. We conclude that it is possible to generate clinically meaningful diagnostic evidence from electronic sources of patient data.

Priority Attachment: a Comprehensive Mechanism for Generating Networks.

We claim that networks are created according to the priority attachment mechanism. We introduce a simple model, which uses the priority attachment to generate both synthetic and close to empirical networks. Priority attachment is a mechanism, which generalizes previously proposed mechanisms, such as small world creation or preferential attachment, but we also observe its presence in a range of real-world networks. In this paper, we show that by using priority attachment we can generate networks of very diverse topologies, as well as re-create empirical ones. An additional advantage of the priority attachment mechanism is an easy interpretation of the latent processes of network formation. We substantiate our claims by performing numerical experiments on both synthetic and empirical networks. The two main contributions of the paper are: the development of the priority attachment mechanism, and the design of Priority Rank: a simple network generative model based on the priority attachment mechanism.

Social network structure is predictive of health and wellness.

Social networks influence health-related behavior, such as obesity and smoking. While researchers have studied social networks as a driver for diffusion of influences and behavior, it is less understood how the structure or topology of the network, in itself, impacts an individual's health behavior and wellness state. In this paper, we investigate whether the structure or topology of a social network offers additional insight and predictability on an individual's health and wellness. We develop a method called the Network-Driven health predictor (NetCARE) that leverages features representative of social network structure. Using a large longitudinal data set of students enrolled in the NetHealth study at the University of Notre Dame, we show that the NetCARE method improves the overall prediction performance over the baseline models-that use demographics and physical attributes-by 38%, 65%, 55%, and 54% for the wellness states-stress, happiness, positive attitude, and self-assessed health-considered in this paper.

Balancing Speed and Coverage by Sequential Seeding in Complex Networks.

Information spreading in complex networks is often modeled as diffusing information with certain probability from nodes that possess it to their neighbors that do not. Information cascades are triggered when the activation of a set of initial nodes - seeds - results in diffusion to large number of nodes. Here, several novel approaches for seed initiation that replace the commonly used activation of all seeds at once with a sequence of initiation stages are introduced. Sequential strategies at later stages avoid seeding highly ranked nodes that are already activated by diffusion active between stages. The gain arises when a saved seed is allocated to a node difficult to reach via diffusion. Sequential seeding and a single stage approach are compared using various seed ranking methods and diffusion parameters on real complex networks. The experimental results indicate that, regardless of the seed ranking method used, sequential seeding strategies deliver better coverage than single stage seeding in about 90% of cases. Longer seeding sequences tend to activate more nodes but they also extend the duration of diffusion. Various variants of sequential seeding resolve the trade-off between the coverage and speed of diffusion differently.

Requirements and validation of a prototype learning health system for clinical diagnosis.

INTRODUCTION: Diagnostic error is a major threat to patient safety in the context of family practice. The patient safety implications are severe for both patient and clinician. Traditional approaches to diagnostic decision support have lacked broad acceptance for a number of well-documented reasons: poor integration with electronic health records and clinician workflow, static evidence that lacks transparency and trust, and use of proprietary technical standards hindering wider interoperability. The learning health system (LHS) provides a suitable infrastructure for development of a new breed of learning decision support tools. These tools exploit the potential for appropriate use of the growing volumes of aggregated sources of electronic health records. METHODS: We describe the experiences of the TRANSFoRm project developing a diagnostic decision support infrastructure consistent with the wider goals of the LHS. We describe an architecture that is model driven, service oriented, constructed using open standards, and supports evidence derived from electronic sources of patient data. We describe the architecture and implementation of 2 critical aspects for a successful LHS: the model representation and translation of clinical evidence into effective practice and the generation of curated clinical evidence that can be used to populate those models, thus closing the LHS loop. RESULTS/CONCLUSIONS: Six core design requirements for implementing a diagnostic LHS are identified and successfully implemented as part of this research work. A number of significant technical and policy challenges are identified for the LHS community to consider, and these are discussed in the context of evaluating this work: medico-legal responsibility for generated diagnostic evidence, developing trust in the LHS (particularly important from the perspective of decision support), and constraints imposed by clinical terminologies on evidence generation.

Benford's Distribution in Complex Networks.

Many collections of numbers do not have a uniform distribution of the leading digit, but conform to a very particular pattern known as Benford's distribution. This distribution has been found in numerous areas such as accounting data, voting registers, census data, and even in natural phenomena. Recently it has been reported that Benford's law applies to online social networks. Here we introduce a set of rigorous tests for adherence to Benford's law and apply it to verification of this claim, extending the scope of the experiment to various complex networks and to artificial networks created by several popular generative models. Our findings are that neither for real nor for artificial networks there is sufficient evidence for common conformity of network structural properties with Benford's distribution. We find very weak evidence suggesting that three measures, degree centrality, betweenness centrality and local clustering coefficient, could adhere to Benford's law for scalefree networks but only for very narrow range of their parameters.

A methodology for mining clinical data: experiences from TRANSFoRm project.

Data mining of electronic health records (eHRs) allows us to identify patterns of patient data that characterize diseases and their progress and learn best practices for treatment and diagnosis. Clinical Prediction Rules (CPRs) are a form of clinical evidence that quantifies the contribution of different clinical data to a particular clinical outcome and help clinicians to decide the diagnosis, prognosis or therapeutic conduct for any given patient. The TRANSFoRm diagnostic support system (DSS) is based on the construction of an ontological repository of CPRs for diagnosis prediction in which clinical evidence is expressed using a unified vocabulary. This paper explains the proposed methodology for constructing this CPR repository, addressing algorithms and quality measures for filtering relevant rules. Some preliminary application results are also presented.