Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Optimizing the Learning Order of Chinese Characters Using a Novel Topological Sort Algorithm.

ABSTRACT: We present a novel algorithm for optimizing the order in which Chinese characters are learned, one that incorporates the benefits of learning them in order of usage frequency and in order of their hierarchal structural relationships. We show that our work outperforms previously published orders and algorithms. Our algorithm is applicable to any scheduling task where nodes have intrinsic differences in importance and must be visited in topological order.

SUBMITTER: Loach JC

PROVIDER: S-EPMC5051716 | biostudies-literature | 2016

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Optimizing the Learning Order of Chinese Characters Using a Novel Topological Sort Algorithm.

Loach James C JC Wang Jinzhao J

PloS one 20161005 10

We present a novel algorithm for optimizing the order in which Chinese characters are learned, one that incorporates the benefits of learning them in order of usage frequency and in order of their hierarchal structural relationships. We show that our work outperforms previously published orders and algorithms. Our algorithm is applicable to any scheduling task where nodes have intrinsic differences in importance and must be visited in topological order. ...[more]

PMID: 27706234

Similar Datasets

Efficient learning strategy of Chinese characters based on network approach.

Project description:We develop an efficient learning strategy of Chinese characters based on the network of the hierarchical structural relations between Chinese characters. A more efficient strategy is that of learning the same number of useful Chinese characters in less effort or time. We construct a node-weighted network of Chinese characters, where character usage frequencies are used as node weights. Using this hierarchical node-weighted network, we propose a new learning method, the distributed node weight (DNW) strategy, which is based on a new measure of nodes' importance that considers both the weight of the nodes and its location in the network hierarchical structure. Chinese character learning strategies, particularly their learning order, are analyzed as dynamical processes over the network. We compare the efficiency of three theoretical learning methods and two commonly used methods from mainstream Chinese textbooks, one for Chinese elementary school students and the other for students learning Chinese as a second language. We find that the DNW method significantly outperforms the others, implying that the efficiency of current learning methods of major textbooks can be greatly improved.

| S-EPMC3749196 | biostudies-literature

Predicting Breast Cancer in Chinese Women Using Machine Learning Techniques: Algorithm Development.

Project description:BACKGROUND:Risk-based breast cancer screening is a cost-effective intervention for controlling breast cancer in China, but the successful implementation of such intervention requires an accurate breast cancer prediction model for Chinese women. OBJECTIVE:This study aimed to evaluate and compare the performance of four machine learning algorithms on predicting breast cancer among Chinese women using 10 breast cancer risk factors. METHODS:A dataset consisting of 7127 breast cancer cases and 7127 matched healthy controls was used for model training and testing. We used repeated 5-fold cross-validation and calculated AUC, sensitivity, specificity, and accuracy as the measures of the model performance. RESULTS:The three novel machine-learning algorithms (XGBoost, Random Forest and Deep Neural Network) all achieved significantly higher area under the receiver operating characteristic curves (AUCs), sensitivity, and accuracy than logistic regression. Among the three novel machine learning algorithms, XGBoost (AUC 0.742) outperformed deep neural network (AUC 0.728) and random forest (AUC 0.728). Main residence, number of live births, menopause status, age, and age at first birth were considered as top-ranked variables in the three novel machine learning algorithms. CONCLUSIONS:The novel machine learning algorithms, especially XGBoost, can be used to develop breast cancer prediction models to help identify women at high risk for breast cancer in developing countries.

| S-EPMC7308891 | biostudies-literature

Optimizing 5’UTRs for mRNA-delivered gene editing using deep learning

Project description:mRNA therapeutics are revolutionizing the pharmaceutical industry, but methods to optimize the primary sequence for increased expression are still lacking. Here, we design 5’UTRs for efficient mRNA translation using deep learning. We perform polysome profiling of fully or partially randomized 5'UTR libraries in three cell types and find that UTR performance is highly correlated across cell types. We train models on all our datasets and use them to guide the design of high-performing 5’UTRs using gradient descent and generative neural networks. We experimentally test designed 5’UTRs with mRNA encoding megaTALTM gene editing enzymes for two different gene targets and in two different cell lines. We find that the designed 5’UTRs support strong gene editing activity. Editing efficiency is correlated between cell types and gene targets, although the best performing UTR was specific to one cargo and cell type. Our results highlight the potential of model-based sequence design for mRNA therapeutics.

2023-07-01 | GSE232927 | GEO

Higher-order topological insulators.

Project description:Three-dimensional topological (crystalline) insulators are materials with an insulating bulk but conducting surface states that are topologically protected by time-reversal (or spatial) symmetries. We extend the notion of three-dimensional topological insulators to systems that host no gapless surface states but exhibit topologically protected gapless hinge states. Their topological character is protected by spatiotemporal symmetries of which we present two cases: (i) Chiral higher-order topological insulators protected by the combination of time-reversal and a fourfold rotation symmetry. Their hinge states are chiral modes, and the bulk topology is Z2 -classified. (ii) Helical higher-order topological insulators protected by time-reversal and mirror symmetries. Their hinge states come in Kramers pairs, and the bulk topology is Z -classified. We provide the topological invariants for both cases. Furthermore, we show that SnTe as well as surface-modified Bi2TeI, BiSe, and BiTe are helical higher-order topological insulators and propose a realistic experimental setup to detect the hinge states.

| S-EPMC5983919 | biostudies-literature

Using comprehensive machine-learning models to classify complex morphological characters.

Project description:Recognizing and classifying multiple morphological features, such as patterns, sizes, and textures, can provide a comprehensive understanding of their variability and phenotypic evolution. Yet, quantitatively measuring complex morphological characters remains challenging.We provide a machine learning-based pipeline (SVMorph) to consider and classify complex morphological characters in multiple organisms that have either small or large datasets.Our pipeline integrates two descriptors, histogram of oriented gradient and local binary pattern, to meet various classification needs. We also optimized feature extraction by adding image data augmentation to improve model generalizability.We tested SVMorph on two real-world examples to demonstrate that it can be used with small training datasets and limited computational resources. Comparing with multiple CNN-based methods and traditional techniques, we show that SVMorph is reliable and fast in texture-based individual classification. Thus, SVMorph can be used to efficiently classify multiple morphological characters in distinct nonmodel organisms.

| S-EPMC8328437 | biostudies-literature

A novel constraint-based structure learning algorithm using marginal causal prior knowledge.

Project description:Causal discovery with prior knowledge is important for improving performance. We consider the incorporation of marginal causal relations, which correspond to the presence or absence of directed paths in a causal model. We propose the Marginal Prior Causal Knowledge PC (MPPC) algorithm to incorporate marginal causal relations into a constraint-based structure learning algorithm. We provide the theorems of conditional independence properties by combining observational data and marginal causal relations. We compare the MPPC algorithm with other structure learning methods in both simulation studies and real-world networks. The results indicate that, compare with other constraint-based structure learning methods, MPPC algorithm can incorporate marginal causal relations and is more effective and more efficient.

| S-EPMC11335901 | biostudies-literature

Novel mutations and the ophthalmologic characters in Chinese patients with Wolfram Syndrome.

Project description:BACKGROUND:Wolfram Syndrome (WFS) is a rare autosomal recessive neurodegenerative disease which has a wide spectrum of manifestations including diabetes insipidus, diabetes mellitus, optic atrophy and deafness. WFS1 and CISD2 are two main causing genes of WFS. The aim of this study was to illustrate the ophthalmologic manifestations and determine the genotype of Chinese WFS patients. RESULTS:Completed ophthalmic examinations and family investigations were performed on 4 clinically diagnosed WFS patients from 4 unrelated families. Genetic testing was done by the next generation sequencing of candidate genes. One patient carried a homozygous mutation (c.272_273del) in CISD2, two patients carried compound heterozygous mutations (c.1618?T?>?G?+?c.2020G?>?A and c.1048?T?>?A?+?c.2020G?>?A) in WFS1, and one patient carried a heterozygous mutation (c.937C?>?T) in WFS1. Three of them were novel mutations. CONCLUSIONS:Our study indicated WFS in Chinese is a neurodegenerative disease with both wide spectrum of clinical features and genetic heterogeneity. We found three novel mutations in WFS patients, and to our best knowledge, this is the first report of Chinese WFS patient with mutation in CISD2.

| S-EPMC6686481 | biostudies-literature

Optimizing Personalized Therapy for Rheumatoid Arthritis Using a Novel Drug Combination of Bioactive Chemical Constituents Derived from a Classic Chinese Herbal Formula

Project description:Personalized therapy of rheumatoid arthritis (RA) based on traditional Chinese medicine cold and hot syndromes is selection of the best treatment for an individual patient. Wutou Decoction (WTD) is one of the classic Chinese herbal formulae which achieve favorable therapeutic response in treating RA-cold syndrome. Microarray analysis based on the adjuvant induced arthritis model combined with characteristics of RA and cold/hot syndromes was performed to screen RA-cold and RA-hot-syndrome-related genes, as well as WTD effect genes.

2018-06-13 | GSE115662 | GEO

Optimizing nucleotide sequence ensembles for combinatorial protein libraries using a genetic algorithm.

Project description:Protein libraries are essential to the field of protein engineering. Increasingly, probabilistic protein design is being used to synthesize combinatorial protein libraries, which allow the protein engineer to explore a vast space of amino acid sequences, while at the same time placing restrictions on the amino acid distributions. To this end, if site-specific amino acid probabilities are input as the target, then the codon nucleotide distributions that match this target distribution can be used to generate a partially randomized gene library. However, it turns out to be a highly nontrivial computational task to find the codon nucleotide distributions that exactly matches a given target distribution of amino acids. We first showed that for any given target distribution an exact solution may not exist at all. Formulated as a constrained optimization problem, we then developed a genetic algorithm-based approach to find codon nucleotide distributions that match as closely as possible to the target amino acid distribution. As compared with the previous gradient descent method on various objective functions, the new method consistently gave more optimized distributions as measured by the relative entropy between the calculated and the target distributions. To simulate the actual lab solutions, new objective functions were designed to allow for two separate sets of codons in seeking a better match to the target amino acid distribution.

| S-EPMC2811015 | biostudies-literature

Adjusting ADJUST: Optimizing the ADJUST algorithm for pediatric data using geodesic nets.

Project description:A major challenge for electroencephalograph (EEG) studies on pediatric populations is that large amounts of data are lost due to artifacts (e.g., movement and blinks). Independent component analysis (ICA) can separate artifactual and neural activity, allowing researchers to remove such artifactual activity and retain a greater percentage of EEG data for analyses. However, manual identification of artifactual components is time-consuming and requires subjective judgment. Automated algorithms, like ADJUST and ICLabel, have been validated on adults, but to our knowledge, no such algorithms have been optimized for pediatric data. Therefore, in an attempt to automate artifact selection for pediatric data collected with geodesic nets, we modified ADJUST's algorithm. Our "adjusted-ADJUST" algorithm was compared to the "original-ADJUST" algorithm and ICLabel in adults, children, and infants on three different performance measures: respective classification agreement with expert coders, the number of trials retained following artifact removal, and the reliability of the EEG signal after preprocessing with each algorithm. Overall, the adjusted-ADJUST algorithm performed better than the original-ADJUST algorithm and no ICA correction with adult and pediatric data. Moreover, in some measures, it performed better than ICLabel for pediatric data. These results indicate that optimizing existing algorithms improves artifact classification and retains more trials, potentially facilitating EEG studies with pediatric populations. Adjusted-ADJUST is freely available under the terms of the GNU General Public License at: https://github.com/ChildDevLab/MADE-EEG-preprocessing-pipeline/tree/master/adjusted_adjust_scripts.

| S-EPMC7402217 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data