98 research outputs found

    Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination

    Full text link
    Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks. In the study of graph based data management, node disjoint subgraph homeomorphism relation between graphs is more suitable than (sub)graph isomorphism in many cases, especially in those cases that node skipping and node mismatching are allowed. However, no efficient node disjoint subgraph homeomorphism determination (ndSHD) algorithms have been available. In this paper, we propose two computationally efficient ndSHD algorithms based on state spaces searching with backtracking, which employ many heuristics to prune the search spaces. Experimental results on synthetic data sets show that the proposed algorithms are efficient, require relative little time in most of the testing cases, can scale to large or dense graphs, and can accommodate to more complex fuzzy matching cases.Comment: 15 pages, 11 figures, submitted to DASFAA 200

    MAPS-KB: A Million-scale Probabilistic Simile Knowledge Base

    Full text link
    The ability to understand and generate similes is an imperative step to realize human-level AI. However, there is still a considerable gap between machine intelligence and human cognition in similes, since deep models based on statistical distribution tend to favour high-frequency similes. Hence, a large-scale symbolic knowledge base of similes is required, as it contributes to the modeling of diverse yet unpopular similes while facilitating additional evaluation and reasoning. To bridge the gap, we propose a novel framework for large-scale simile knowledge base construction, as well as two probabilistic metrics which enable an improved understanding of simile phenomena in natural language. Overall, we construct MAPS-KB, a million-scale probabilistic simile knowledge base, covering 4.3 million triplets over 0.4 million terms from 70 GB corpora. We conduct sufficient experiments to justify the effectiveness and necessity of the methods of our framework. We also apply MAPS-KB on three downstream tasks to achieve state-of-the-art performance, further demonstrating the value of MAPS-KB.Comment: Accepted to AAAI 202

    Language Models as Knowledge Embeddings

    Full text link
    Knowledge embeddings (KE) represent a knowledge graph (KG) by embedding entities and relations into continuous vector spaces. Existing methods are mainly structure-based or description-based. Structure-based methods learn representations that preserve the inherent structure of KGs. They cannot well represent abundant long-tail entities in real-world KGs with limited structural information. Description-based methods leverage textual information and language models. Prior approaches in this direction barely outperform structure-based ones, and suffer from problems like expensive negative sampling and restrictive description demand. In this paper, we propose LMKE, which adopts Language Models to derive Knowledge Embeddings, aiming at both enriching representations of long-tail entities and solving problems of prior description-based methods. We formulate description-based KE learning with a contrastive learning framework to improve efficiency in training and evaluation. Experimental results show that LMKE achieves state-of-the-art performance on KE benchmarks of link prediction and triple classification, especially for long-tail entities.Comment: This revision corrects some texts after fixing a data leakage issu

    Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interests

    Full text link
    A contextual bandit problem is studied in a highly non-stationary environment, which is ubiquitous in various recommender systems due to the time-varying interests of users. Two models with disjoint and hybrid payoffs are considered to characterize the phenomenon that users' preferences towards different items vary differently over time. In the disjoint payoff model, the reward of playing an arm is determined by an arm-specific preference vector, which is piecewise-stationary with asynchronous and distinct changes across different arms. An efficient learning algorithm that is adaptive to abrupt reward changes is proposed and theoretical regret analysis is provided to show that a sublinear scaling of regret in the time length TT is achieved. The algorithm is further extended to a more general setting with hybrid payoffs where the reward of playing an arm is determined by both an arm-specific preference vector and a joint coefficient vector shared by all arms. Empirical experiments are conducted on real-world datasets to verify the advantages of the proposed learning algorithms against baseline ones in both settings.Comment: Accepted by AAAI 2

    DNA methylation and regulatory elements during chicken germline stem cell differentiation

    Get PDF
    Funding for Open Access provided by the UMD Libraries' Open Access Publishing Fund.The production of germ cells in vitro would open important new avenues for stem biology and human medicine, but the mechanisms of germ cell differentiation are not well understood. The chicken, as a great model for embryology and development, was used in this study to help us explore its regulatory mechanisms. In this study, we reported a comprehensive genome-wide DNA methylation landscape in chicken germ cells, and transcriptomic dynamics was also presented. By uncovering DNA methylation patterns on individual genes, some genes accurately modulated by DNA methylation were found to be associated with cancers and virus infection, e.g., AKT1 and CTNNB1. Chicken-unique markers were also discovered for identifying male germ cells. Importantly, integrated epigenetic mechanisms were explored during male germ cell differentiation, which provides deep insight into the epigenetic processes associated with male germ cell differentiation and possibly improves treatment options to male infertility in animals and humans

    Diet induced the change of mtDNA copy number and metabolism in Angus cattle

    Get PDF
    Grass-fed and grain-fed Angus cattle differ in the diet regimes. However, the intricate mechanisms of different beef quality and other phenotypes induced by diet differences are still unclear. Diet affects mitochondrial function and dynamic behavior in response to changes in energy demand and supply. In this study, we examined the mtDNA copy number, mitochondria-related genes expression, and metabolic biomarkers in grass-fed and grain-fed Angus cattle. We found that the grass-fed group had a higher mtDNA copy number than the grain-fed group. Among different tissues, the mtDNA copy number was the highest in the liver than muscle, rumen, and spleen. Based on the transcriptome of the four tissues, a lower expression of mtDNA-encoded genes in the grass-fed group compared to the grain-fed group was discovered. For the mitochondria-related nuclear genes, however, most of them were significantly down-regulated in the muscle of the grass-fed group and up-regulated in the other three tissues. In which, COX6A2, POLG2, PPIF, DCN, and NDUFA12, involving in ATP synthesis, mitochondrial replication, transcription, and maintenance, might contribute to the alterations of mtDNA copy number and gene expression. Meanwhile, 40 and 23 metabolic biomarkers were identified in the blood and muscle of the grain-fed group compared to a grass-fed group, respectively. Integrated analysis of the altered metabolites and gene expression revealed the high expression level of MDH1 in the grain-fed group might contribute to the mitochondrial NADH oxidation and spermidine metabolism for adapting the deletion mtDNA copy number. Overall, the study may provide further deep insight into the adaptive and regulatory modulations of the mitochondrial function in response to different feeding systems in Angus cattle.https://doi.org/10.1186/s40104-020-00482-

    Genetic assessment of inbred chicken lines indicates genomic signatures of resistance to Marek\u27s disease

    Get PDF
    Background: Marek’s disease (MD) is a highly contagious pathogenic and oncogenic disease primarily affecting chickens. However, the mechanisms of genetic resistance for MD are complex and not fully understood. MD-resistant line 63 and MD-susceptible line 72 are two highly inbred progenitor lines of White Leghorn. Recombinant Congenic Strains (RCS) were developed from these two lines, which show varied susceptibility to MD. Results: We investigated genetic structure and genomic signatures across the genome, including the line 63 and line 72, six RCSs, and two reciprocally crossed flocks between the lines 63 and 72 (F1 63 × 72 and F1 72 × 63) using Affymetrix® Axiom® HD 600 K genotyping array. We observed 18 chickens from RCS lines were specifically clustered into resistance sub-groups distributed around line 63. Additionally, homozygosity analysis was employed to explore potential genetic components related to MD resistance, while runs of homozygosity (ROH) are regions of the genome where the identical haplotypes are inherited from each parent. We found several genes including SIK, SOX1, LIG4, SIK1 and TNFSF13B were contained in ROH region identified in resistant group (line 63 and RCS), and these genes have been reported that are contribute to immunology and survival. Based on FST based population differential analysis, we also identified important genes related to cell death and anti-apoptosis, including AKT1, API5, CDH13, CFDP and USP15, which could be involved in divergent selection during inbreeding process. Conclusions: Our findings offer valuable insights for understanding the genetic mechanism of resistance to MD and the identified genes could be considered as candidate biomarkers in further evaluation
    • …
    corecore