The rise of datathons, also known as data or data science hackathons, has provided a platform to collaborate, learn, and innovate quickly. Despite their significant potential benefits, organizations often struggle to effectively work with data due to a lack of clear guidelines and best practices for potential issues that might arise. Drawing on our own experiences and insights from organizing +80 datathon challenges with +60 partnership organizations since 2016, we provide a guide that serves as a resource for organizers to navigate the data-related complexities of datathons. We apply our proposed framework to 10 case studies.

Abstract We propose a decentralised “local2global” approach to graph representation learning, that one can a-priori use to scale any embedding technique. Our local2global approach proceeds by first dividing the input graph into overlapping subgraphs (or “patches”) and training local representations for each patch independently. In a second step, we combine the local representations into a globally consistent representation by estimating the set of rigid motions that best align the local representations using information from the patch overlaps, via group synchronization. A key distinguishing feature of local2global relative to existing work is that patches are trained independently without the need for the often costly parameter synchronization during distributed training. This allows local2global to scale to large-scale industrial applications, where the input graph may not even fit into memory and may be stored in a distributed manner. We apply local2global on data sets of different sizes and show that our approach achieves a good trade-off between scale and accuracy on edge reconstruction and semi-supervised classification. We also consider the downstream task of anomaly detection and show how one can use local2global to highlight anomalies in cybersecurity networks.

Phosphoproteomics allows one to measure the activity of kinases that drive the fluxes of signal transduction pathways involved in biological processes such as immune function, senescence and cell growth. However, deriving knowledge of signalling network circuitry from these data is challenging due to a scarcity of phosphorylation sites that define kinase-kinase relationships. To address this issue, we previously identified around 6,000 phosphorylation sites as markers of kinase-kinase relationships (that may be conceptualised as network edges), from which empirical cell-model-specific weighted kinase networks may be reconstructed. Here, we assess whether the application of community detection algorithms to such networks can identify new components linked to canonical signalling pathways. Phosphoproteomics data from acute myeloid leukaemia (AML) cells treated separately with PI3K, AKT, MEK and ERK inhibitors were used to reconstruct individual kinase networks. We used modularity maximisation to detect communities in each network, and selected the community containing the main target of the inhibitor used to treat cells. These analyses returned communities that contained known canonical signalling components. Interestingly, in addition to canonical PI3K/AKT/mTOR members, the community assignments returned TTK (also known as MPS1) as a likely component of PI3K/AKT/mTOR signalling. We drew similar insights from an external phosphoproteomics dataset from breast cancer cells treated with rapamycin and oestrogen. We confirmed this observation with wet-lab laboratory experiments showing that TTK phosphorylation was decreased in AML cells treated with AKT and MTOR inhibitors. This study illustrates the application of community detection algorithms to the analysis of empirical kinase networks to uncover new members linked to canonical signalling pathways.