A STATISTICAL-FUZZY PERCEPTRON

1999 ◽  
Vol 13 (01) ◽  
pp. 33-41 ◽  
Author(s):  
M. ANDRECUT
Keyword(s):  
Classification Theory ◽  
Perceptron Algorithm ◽  
Optimal Classification ◽  
Training Sets

An optimal statistical perceptron algorithm is derived using the Bayes classification theory. The described algorithm is able to construct an optimal classification hyperplane for separable and nonseparable classes. The described algorithm can be easily improved by imposing a simple fuzzyfication scheme of the training sets.

scholarly journals A Unitary Weights Based One-Iteration Quantum Perceptron Algorithm for Non-Ideal Training Sets

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 36854-36865 ◽  
Author(s):  
Wenjie Liu ◽  
Peipei Gao ◽  
Yuxiang Wang ◽  
Wenbin Yu ◽  
Maojun Zhang
Keyword(s):  
Perceptron Algorithm ◽  
Training Sets

Constructing and Deconstructing Concepts

2016 ◽  
Vol 63 (5) ◽  
pp. 249-262 ◽  
Author(s):  
Charles A. Doan ◽  
Ronaldo Vigo
Keyword(s):  
Information Theory ◽  
Model Performance ◽  
Unsupervised Classification ◽  
Family Resemblance ◽  
Category Membership ◽  
Formal Models ◽  
Human Beings ◽  
One Dimensional ◽  
Relational Patterns ◽  
Optimal Classification

Abstract. Several empirical investigations have explored whether observers prefer to sort sets of multidimensional stimuli into groups by employing one-dimensional or family-resemblance strategies. Although one-dimensional sorting strategies have been the prevalent finding for these unsupervised classification paradigms, several researchers have provided evidence that the choice of strategy may depend on the particular demands of the task. To account for this disparity, we propose that observers extract relational patterns from stimulus sets that facilitate the development of optimal classification strategies for relegating category membership. We conducted a novel constrained categorization experiment to empirically test this hypothesis by instructing participants to either add or remove objects from presented categorical stimuli. We employed generalized representational information theory (GRIT; Vigo, 2011b , 2013a , 2014 ) and its associated formal models to predict and explain how human beings chose to modify these categorical stimuli. Additionally, we compared model performance to predictions made by a leading prototypicality measure in the literature.

Molecular Generation Targeting Desired Electronic Properties via Deep Generative Models

2019 ◽  
Author(s):  
Qi Yuan ◽  
Alejandro Santana-Bonilla ◽  
Martijn Zwijnenburg ◽  
Kim Jelfs
Keyword(s):  
Neural Network ◽  
Electronic Properties ◽  
Transfer Learning ◽  
Recurrent Neural Network ◽  
Chemical Space ◽  
Generative Models ◽  
Molecular Features ◽  
Donor Acceptor ◽  
Homo Lumo ◽  
Training Sets

<p>The chemical space for novel electronic donor-acceptor oligomers with targeted properties was explored using deep generative models and transfer learning. A General Recurrent Neural Network model was trained from the ChEMBL database to generate chemically valid SMILES strings. The parameters of the General Recurrent Neural Network were fine-tuned via transfer learning using the electronic donor-acceptor database from the Computational Material Repository to generate novel donor-acceptor oligomers. Six different transfer learning models were developed with different subsets of the donor-acceptor database as training sets. We concluded that electronic properties such as HOMO-LUMO gaps and dipole moments of the training sets can be learned using the SMILES representation with deep generative models, and that the chemical space of the training sets can be efficiently explored. This approach identified approximately 1700 new molecules that have promising electronic properties (HOMO-LUMO gap <2 eV and dipole moment <2 Debye), 6-times more than in the original database. Amongst the molecular transformations, the deep generative model has learned how to produce novel molecules by trading off between selected atomic substitutions (such as halogenation or methylation) and molecular features such as the spatial extension of the oligomer. The method can be extended as a plausible source of new chemical combinations to effectively explore the chemical space for targeted properties.</p>

scholarly journals Semi-automated classification of colonial Microcystis by FlowCAM imaging flow cytometry in mesocosm experiment reveals high heterogeneity during seasonal bloom

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yersultan Mirasbekov ◽  
Adina Zhumakhanova ◽  
Almira Zhantuyakova ◽  
Kuanysh Sarkytbayev ◽  
Dmitry V. Malashenkov ◽  
...  
Keyword(s):  
Machine Learning ◽  
Flow Cytometry ◽  
Spatial Resolution ◽  
Mesocosm Experiment ◽  
Imaging Flow Cytometry ◽  
Leibler Divergence ◽  
Temporal And Spatial ◽  
High Level ◽  
Training Sets

AbstractA machine learning approach was employed to detect and quantify Microcystis colonial morphospecies using FlowCAM-based imaging flow cytometry. The system was trained and tested using samples from a long-term mesocosm experiment (LMWE, Central Jutland, Denmark). The statistical validation of the classification approaches was performed using Hellinger distances, Bray–Curtis dissimilarity, and Kullback–Leibler divergence. The semi-automatic classification based on well-balanced training sets from Microcystis seasonal bloom provided a high level of intergeneric accuracy (96–100%) but relatively low intrageneric accuracy (67–78%). Our results provide a proof-of-concept of how machine learning approaches can be applied to analyze the colonial microalgae. This approach allowed to evaluate Microcystis seasonal bloom in individual mesocosms with high level of temporal and spatial resolution. The observation that some Microcystis morphotypes completely disappeared and re-appeared along the mesocosm experiment timeline supports the hypothesis of the main transition pathways of colonial Microcystis morphoforms. We demonstrated that significant changes in the training sets with colonial images required for accurate classification of Microcystis spp. from time points differed by only two weeks due to Microcystis high phenotypic heterogeneity during the bloom. We conclude that automatic methods not only allow a performance level of human taxonomist, and thus be a valuable time-saving tool in the routine-like identification of colonial phytoplankton taxa, but also can be applied to increase temporal and spatial resolution of the study.

Spatial-temporal variables for swimming coaches: A comparison study between video and TritonWear sensor

2021 ◽  
pp. 174795412110137
Author(s):  
Robin Pla ◽  
Thibaut Ledanois ◽  
Escobar David Simbana ◽  
Anaël Aubry ◽  
Benjamin Tranchard ◽  
...  
Keyword(s):  
Swimming Performance ◽  
Video Recording ◽  
Open Water ◽  
Percentage Error ◽  
Stroke Index ◽  
Wearable Sensor ◽  
Stroke Length ◽  
Video Recordings ◽  
Temporal Variables ◽  
Training Sets

The main aim of this study was to evaluate the validity and the reliability of a swimming sensor to assess swimming performance and spatial-temporal variables. Six international male open-water swimmers completed a protocol which consisted of two training sets: a 6×100m individual medley and a continuous 800 m set in freestyle. Swimmers were equipped with a wearable sensor, the TritonWear to collect automatically spatial-temporal variables: speed, lap time, stroke count (SC), stroke length (SL), stroke rate (SR), and stroke index (SI). Video recordings were added as a “gold-standard” and used to assess the validity and the reliability of the TritonWear sensor. The results show that the sensor provides accurate results in comparison with video recording measurements. A very high accuracy was observed for lap time with a mean absolute percentage error (MAPE) under 5% for each stroke (2.2, 3.2, 3.4, 4.1% for butterfly, backstroke, breaststroke and freestyle respectively) but high error ranges indicate a dependence on swimming technique. Stroke count accuracy was higher for symmetric strokes than for alternate strokes (MAPE: 0, 2.4, 7.1 & 4.9% for butterfly, breaststroke, backstroke & freestyle respectively). The other variables (SL, SR & SI) derived from the SC and the lap time also show good accuracy in all strokes. The wearable sensor provides an accurate real time feedback of spatial-temporal variables in six international open-water swimmers during classical training sets (at low to moderate intensities), which could be a useful tool for coaches, allowing them to monitor training load with no effort.

scholarly journals Gradient boosting for linear mixed models

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Colin Griesbach ◽  
Benjamin Säfken ◽  
Elisabeth Waldmann
Keyword(s):  
Random Effects ◽  
Mixed Models ◽  
Selection Procedure ◽  
Classification Theory ◽  
Gradient Boosting ◽  
Random Structure ◽  
Boosting Algorithm ◽  
The One ◽  
Biased Estimates ◽  
Selection Of

Abstract Gradient boosting from the field of statistical learning is widely known as a powerful framework for estimation and selection of predictor effects in various regression models by adapting concepts from classification theory. Current boosting approaches also offer methods accounting for random effects and thus enable prediction of mixed models for longitudinal and clustered data. However, these approaches include several flaws resulting in unbalanced effect selection with falsely induced shrinkage and a low convergence rate on the one hand and biased estimates of the random effects on the other hand. We therefore propose a new boosting algorithm which explicitly accounts for the random structure by excluding it from the selection procedure, properly correcting the random effects estimates and in addition providing likelihood-based estimation of the random effects variance structure. The new algorithm offers an organic and unbiased fitting approach, which is shown via simulations and data examples.

Optimal Solution for Hyper-Sphere Integral Classification Process of Big Data

2014 ◽  
Vol 687-691 ◽  
pp. 1462-1465
Author(s):  
Zhi Liang Zhang
Keyword(s):  
Big Data ◽  
Calculation Method ◽  
Optimal Solution ◽  
Constraint Condition ◽  
Target Problem ◽  
Maximum Value ◽  
Dual Programming ◽  
Optimal Classification ◽  
Classification Function ◽  
Optimal Calculation

This paper mainly discusses the optimal solution for hyper-sphere integral classification process of big data. The paper proposes an optimal calculation method for the target problem. Through statistics and analysis of big data, we get the constraint condition, and calculate a maximum value of data characteristic. Then, by the dual programming of Quadratic Programming, we obtain the optimal classification function for hyper-sphere integral classification process of big data. The experiment results show that the proposed algorithm can significantly improve the accuracy of the classification hyper-sphere integral for big data.

Examples in the classification theory of Riemannian manifolds and the equation?u=Pu

1971 ◽  
Vol 121 (3) ◽  
pp. 233-238
Author(s):  
Moses Glasner ◽  
Richard Katz ◽  
Mitsuru Nakai
Keyword(s):  
Riemannian Manifolds ◽  
Classification Theory
Sign in / Sign up

Export Citation Format

Share Document