Dynamic items delivery network: prediction and clustering.
Ontology highlight
ABSTRACT:
SUBMITTER: Yudhanegara MR
PROVIDER: S-EPMC8129949 | biostudies-literature | 2021 May
REPOSITORIES: biostudies-literature
Publications
Dynamic items delivery network: prediction and clustering.
Yudhanegara Mokhammad R MR Indratno Sapto W SW Sari Rr Kurnia N RKN
Heliyon 20210508 5
Items delivery companies generally use a model to minimize delivery costs. From a mathematical perspective, the model is an objective function that involves constraints. Meanwhile, from a practical point of view, these constraints include aspects that affect item delivery, for example, delivery zones, number of delivery vehicles, vehicle capacity, trip routes, etc. However, the models built so far have not paid attention to changes in road density. This aspect can result in a nonoptimal delivery ...[more]
Similar Datasets
Project description:Interpretability is the dominant feature of a fuzzy model in security-oriented fields. Traditionally fuzzy models based on expert knowledge have obtained well interpretation innately but imprecisely. Numerical data based fuzzy models perform well in precision but not necessarily in interpretation. To utilize the expert knowledge and numerical data in a fuzzy model synchronously, this paper proposed a hybrid fuzzy c-means (FCM) clustering algorithm and Fuzzy Network (FN) method-based model for prediction. The Mamdani rule-based structure of the proposed model is identified based on FCM algorithm from data and by expert-system method from expert knowledge, both of which are combined by FN method. Particle swarm optimization (PSO) algorithm is utilized to optimize the fuzzy set parameters. We tested the proposed model on 6 real datasets comparing the results with the ones obtained by using FCM algorithm. The results showed that our model performed best in interpretability, transparency, and accuracy.
| S-EPMC9523042 | biostudies-literature
Project description:MotivationIn genome-wide association studies (GWAS), up to millions of single nucleotide polymorphisms (SNPs) are genotyped for thousands of individuals. However, conventional single locus-based approaches are usually unable to detect gene-gene interactions underlying complex diseases. Due to the huge search space for complicated high order interactions, many existing multi-locus approaches are slow and may suffer from low detection power for GWAS.ResultsIn this article, we develop a simple, fast and effective algorithm to detect genome-wide multi-locus epistatic interactions based on the clustering of relatively frequent items. Extensive experiments on simulated data show that our algorithm is fast and more powerful in general than some recently proposed methods. On a real genome-wide case-control dataset for age-related macular degeneration (AMD), the algorithm has identified genotype combinations that are significantly enriched in the cases.Availabilityhttp://www.cs.ucr.edu/~minzhux/EDCF.zipContactminzhux@cs.ucr.edu; jingli@cwru.eduSupplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC3244765 | biostudies-literature
Project description:College students experience ever-increasing levels of stress, leading to a wide range of health problems. In this context, monitoring and predicting students' stress levels is crucial and, fortunately, made possible by the growing support for data collection via mobile devices. However, predicting stress levels from mobile phone data remains a challenging task, and off-the-shelf deep learning models are inapplicable or inefficient due to data irregularity, inter-subject variability, and the "cold start problem". To overcome these challenges, we developed a platform named Branched CALM-Net that aims to predict students' stress levels through dynamic clustering in a personalized manner. This is the first platform that leverages the branching technique in a multitask setting to achieve personalization and continuous adaptation. Our method achieves state-of-the-art performance in predicting student stress from mobile sensor data collected as part of the Dartmouth StudentLife study, with a ROC AUC 37% higher and a PR AUC surpassing that of the nearest baseline models. In the cold-start online learning setting, Branched CALM-Net outperforms other models, attaining an average F1 score of 87% with just 1 week of training data for a new student, which shows it is reliable and effective at predicting stress levels from mobile data.
| S-EPMC10951234 | biostudies-literature
Project description:Both perceiving and processing external sound stimuli as well as actively maintaining and updating relevant information (i.e., working memory) are critical for communication and problem solving in everyday acoustic environments. The translation of sensory information into perceptual decisions for goal-directed tasks hinges on dynamic changes in neural activity. However, the underlying brain network dynamics involved in this process are not well specified. In this study, we collected functional MRI data of participants engaging in auditory discrimination and auditory working memory tasks. Independent component analysis (ICA) was performed to extract the brain networks involved and the sliding-window functional connectivity (FC) among networks was calculated. Next, a temporal clustering technique was used to identify the brain states underlying auditory processing. Our results identified seven networks configured into four brain states. The number of brain state transitions was negatively correlated with auditory discrimination performance, and the fractional dwell time of State 2-which included connectivity among the triple high-order cognitive networks and the auditory network (AN)-was positively correlated with working memory performance. A comparison of the two tasks showed significant differences in the connectivity of the frontoparietal, default mode, and sensorimotor networks (SMNs), which is consistent with previous studies of the modulation of task load on brain network interaction. In summary, the dynamic network analysis employed in this study allowed us to isolate moment-to-moment fluctuations in inter-network synchrony, find network configuration in each state, and identify the specific state that enables fast, effective performance during auditory processing. This information is important for understanding the key neural mechanisms underlying goal-directed auditory tasks.
| S-EPMC6872968 | biostudies-literature
Project description:It is well accepted that genes are simultaneously involved in multiple biological processes and that genes are coordinated over the duration of such events. Unfortunately, clustering methodologies that group genes for the purpose of novel gene discovery fail to acknowledge the dynamic nature of biological processes and provide static clusters, even when the expression of genes is assessed across time or developmental stages. By taking advantage of techniques and theories from time frequency analysis, periodic gene expression profiles are dynamically clustered based on the assumption that different spectral frequencies characterize different biological processes. A two-step cluster validation approach is proposed to statistically estimate both the optimal number of clusters and to distinguish significant clusters from noise. The resulting clusters reveal coordinated coexpressed genes. This novel dynamic clustering approach has broad applicability to a vast range of sequential data scenarios where the order of the series is of interest.
| S-EPMC4393063 | biostudies-literature
Project description:The difficulty of converting scientific research findings into novel pharmacological treatments for rare and life-threatening diseases is enormous. Biomarkers related to multiple biological processes involved in cell growth, proliferation, and disease occurrence have been identified in recent years with the development of immunology, molecular biology, and genomics technologies. Biomarkers are capable of reflecting normal physiological processes, pathological processes, and the response to therapeutic intervention; as such, they play vital roles in disease diagnosis, prevention, drug response, and other aspects of biomedicine. The discovery of valuable biomarkers has become a focal point of current research. Numerous studies have identified molecular biomarkers based on the differential expression/concentration of molecules (e.g., genes/proteins) for disease state diagnosis, characterization, and treatment. Although technological breakthroughs in molecular analysis platforms have enabled the identification of a large number of candidate biomarkers for rare diseases, only a small number of these candidates have been properly validated for use in patient treatment. The traditional molecular biomarkers may lose vital information by ignoring molecular associations/interactions, and thus the concept of network biomarkers based on differential associations/correlations of molecule pairs has been established. This approach promises to be more stable and reliable in diagnosing disease states. Furthermore, the newly-emerged dynamic network biomarkers (DNBs) based on differential fluctuations/correlations of molecular groups are able to recognize pre-disease states or critical states instead of disease states, thereby achieving rare disease prediction or predictive/preventative medicine and providing deep insight into the dynamic characteristics of disease initiation and progression.
| S-EPMC11197705 | biostudies-literature
Project description:BackgroundThis study focuses on the task of supervised prediction of aging-related genes from -omics data. Unlike gene expression methods for this task that capture aging-specific information but ignore interactions between genes (i.e., their protein products), or protein-protein interaction (PPI) network methods for this task that account for PPIs but the PPIs are context-unspecific, we recently integrated the two data types into an aging-specific PPI subnetwork, which yielded more accurate aging-related gene predictions. However, a dynamic aging-specific subnetwork did not improve prediction performance compared to a static aging-specific subnetwork, despite the aging process being dynamic. This could be because the dynamic subnetwork was inferred using a naive Induced subgraph approach. Instead, we recently inferred a dynamic aging-specific subnetwork using a methodologically more advanced notion of network propagation (NP), which improved upon Induced dynamic aging-specific subnetwork in a different task, that of unsupervised analyses of the aging process.ResultsHere, we evaluate whether our existing NP-based dynamic subnetwork will improve upon the dynamic as well as static subnetwork constructed by the Induced approach in the considered task of supervised prediction of aging-related genes. The existing NP-based subnetwork is unweighted, i.e., it gives equal importance to each of the aging-specific PPIs. Because accounting for aging-specific edge weights might be important, we additionally propose a weighted NP-based dynamic aging-specific subnetwork. We demonstrate that a predictive machine learning model trained and tested on the weighted subnetwork yields higher accuracy when predicting aging-related genes than predictive models run on the existing unweighted dynamic or static subnetworks, regardless of whether the existing subnetworks were inferred using NP or the Induced approach.ConclusionsOur proposed weighted dynamic aging-specific subnetwork and its corresponding predictive model could guide with higher confidence than the existing data and models the discovery of novel aging-related gene candidates for future wet lab validation.
| S-EPMC8543111 | biostudies-literature
Project description:We consider the problem of clustering graph nodes over large-scale dynamic graphs, such as citation networks, images and web networks, when graph updates such as node/edge insertions/deletions are observed distributively. We propose communication-efficient algorithms for two well-established communication models namely the message passing and the blackboard models. Given a graph with n nodes that is observed at s remote sites over time [1, t], the two proposed algorithms have communication costs Õ(ns) and Õ(n + s) (Õ hides a polylogarithmic factor), almost matching their lower bounds, Ω(ns) and Ω (n + s), respectively, in the message passing and the blackboard models. More importantly, we prove that at each time point in [1, t] our algorithms generate clustering quality nearly as good as that of centralizing all updates up to that time and then applying a standard centralized clustering algorithm. We conducted extensive experiments on both synthetic and real-life datasets which confirmed the communication efficiency of our approach over baseline algorithms while achieving comparable clustering results.
| S-EPMC9275443 | biostudies-literature
Project description:Community detection is challenging when the network structure is estimated with uncertainty. Dynamic networks present additional challenges but also add information across time periods. We propose a global community detection method, persistent communities by eigenvector smoothing (PisCES), that combines information across a series of networks, longitudinally, to strengthen the inference for each period. Our method is derived from evolutionary spectral clustering and degree correction methods. Data-driven solutions to the problem of tuning parameter selection are provided. In simulations we find that PisCES performs better than competing methods designed for a low signal-to-noise ratio. Recently obtained gene expression data from rhesus monkey brains provide samples from finely partitioned brain regions over a broad time span including pre- and postnatal periods. Of interest is how gene communities develop over space and time; however, once the data are divided into homogeneous spatial and temporal periods, sample sizes are very small, making inference quite challenging. Applying PisCES to medial prefrontal cortex in monkey rhesus brains from near conception to adulthood reveals dense communities that persist, merge, and diverge over time and others that are loosely organized and short lived, illustrating how dynamic community detection can yield interesting insights into processes such as brain development.
| S-EPMC5798376 | biostudies-literature
Project description:In natural ecosystems, hundreds of species typically share the same environment and are connected by a dense network of interactions such as predation or competition for resources. Much is known about how fixed ecological niches can determine species abundances in such systems, but far less attention has been paid to patterns of abundances in randomly varying environments. Here, we study this question in a simple model of competition between many species in a patchy ecosystem with randomly fluctuating environmental conditions. Paradoxically, we find that introducing noise can actually induce ordered patterns of abundance-fluctuations, leading to a distinct periodic variation in the correlations between species as a function of the phenotypic distance between them; here, difference in growth rate. This is further accompanied by the formation of discrete, dynamic clusters of abundant species along this otherwise continuous phenotypic axis. These ordered patterns depend on the collective behavior of many species; they disappear when only individual or pairs of species are considered in isolation. We show that they arise from a balance between the tendency of shared environmental noise to synchronize species abundances and the tendency for competition among species to make them fluctuate out of step. Our results demonstrate that in highly interconnected ecosystems, noise can act as an ordering force, dynamically generating ecological patterns even in environments lacking explicit niches.
| S-EPMC3060162 | biostudies-literature