scholarly journals TOLOMEO, a Novel Machine Learning Algorithm to Measure Information and Order in Correlated Networks and Predict Their State

Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1138
Author(s):  
Mattia Miotto ◽  
Lorenzo Monacelli
Keyword(s):  
Machine Learning ◽  
Maximum Entropy ◽  
Learning Algorithm ◽  
Broad Class ◽  
Mean Field ◽  
Cell Types ◽  
Square Lattice ◽  
Topological Information ◽  
Agent Based ◽  
Discrete Values

We present ToloMEo (TOpoLogical netwOrk Maximum Entropy Optimization), a program implemented in C and Python that exploits a maximum entropy algorithm to evaluate network topological information. ToloMEo can study any system defined on a connected network where nodes can assume N discrete values by approximating the system probability distribution with a Pottz Hamiltonian on a graph. The software computes entropy through a thermodynamic integration from the mean-field solution to the final distribution. The nature of the algorithm guarantees that the evaluated entropy is variational (i.e., it always provides an upper bound to the exact entropy). The program also performs machine learning, inferring the system’s behavior providing the probability of unknown states of the network. These features make our method very general and applicable to a broad class of problems. Here, we focus on three different cases of study: (i) an agent-based model of a minimal ecosystem defined on a square lattice, where we show how topological entropy captures a crossover between hunting behaviors; (ii) an example of image processing, where starting from discretized pictures of cell populations we extract information about the ordering and interactions between cell types and reconstruct the most likely positions of cells when data are missing; and (iii) an application to recurrent neural networks, in which we measure the information stored in different realizations of the Hopfield model, extending our method to describe dynamical out-of-equilibrium processes.

scholarly journals An Entropy-Based Machine Learning Algorithm for Combining Macroeconomic Forecasts

Entropy ◽  
2019 ◽  
Vol 21 (10) ◽  
pp. 1015 ◽  
Author(s):  
Carles Bretó ◽  
Priscila Espinosa ◽  
Penélope Hernández ◽  
Jose M. Pavía
Keyword(s):  
Machine Learning ◽  
Gross Domestic Product ◽  
Maximum Entropy ◽  
Simulation Study ◽  
Learning Algorithm ◽  
Predictive Ability ◽  
Learning Approach ◽  
Machine Learning Algorithm ◽  
Machine Learning Approach ◽  
Maximum Entropy Inference

This paper applies a Machine Learning approach with the aim of providing a single aggregated prediction from a set of individual predictions. Departing from the well-known maximum-entropy inference methodology, a new factor capturing the distance between the true and the estimated aggregated predictions presents a new problem. Algorithms such as ridge, lasso or elastic net help in finding a new methodology to tackle this issue. We carry out a simulation study to evaluate the performance of such a procedure and apply it in order to forecast and measure predictive ability using a dataset of predictions on Spanish gross domestic product.

scholarly journals On Similarities between Inference in Game Theory and Machine Learning

2008 ◽  
Vol 33 ◽  
pp. 259-283 ◽  
Author(s):  
I. Rezek ◽  
D. S. Leslie ◽  
S. Reece ◽  
S. J. Roberts ◽  
A. Rogers ◽  
...  
Keyword(s):  
Machine Learning ◽  
Game Theory ◽  
Graphical Models ◽  
Learning Algorithm ◽  
Mean Field ◽  
Mixture Distribution ◽  
Fictitious Play ◽  
Strongly Connected ◽  
Recent Developments ◽  
Variational Learning

In this paper, we elucidate the equivalence between inference in game theory and machine learning. Our aim in so doing is to establish an equivalent vocabulary between the two domains so as to facilitate developments at the intersection of both fields, and as proof of the usefulness of this approach, we use recent developments in each field to make useful improvements to the other. More specifically, we consider the analogies between smooth best responses in fictitious play and Bayesian inference methods. Initially, we use these insights to develop and demonstrate an improved algorithm for learning in games based on probabilistic moderation. That is, by integrating over the distribution of opponent strategies (a Bayesian approach within machine learning) rather than taking a simple empirical average (the approach used in standard fictitious play) we derive a novel moderated fictitious play algorithm and show that it is more likely than standard fictitious play to converge to a payoff-dominant but risk-dominated Nash equilibrium in a simple coordination game. Furthermore we consider the converse case, and show how insights from game theory can be used to derive two improved mean field variational learning algorithms. We first show that the standard update rule of mean field variational learning is analogous to a Cournot adjustment within game theory. By analogy with fictitious play, we then suggest an improved update rule, and show that this results in fictitious variational play, an improved mean field variational learning algorithm that exhibits better convergence in highly or strongly connected graphical models. Second, we use a recent advance in fictitious play, namely dynamic fictitious play, to derive a derivative action variational learning algorithm, that exhibits superior convergence properties on a canonical machine learning problem (clustering a mixture distribution).

MAITS

2011 ◽  
pp. 189-208 ◽  
Author(s):  
Dharmendra Sharma
Keyword(s):  
Machine Learning ◽  
Decision Making ◽  
Learning Algorithm ◽  
Computer Forensics ◽  
The Other ◽  
Security Requirements ◽  
Machine Learning Algorithm ◽  
Agent Based ◽  
Authentication And Authorization ◽  
Multi Agent

In this chapter, we propose a multi-agent-based information technology (IT) security approach (MAITS) as a holistic solution to the increasing needs of securing computer systems. Each specialist task for security requirements is modeled as a specialist agent. MAITS has five groups of working agents—administration assistant agents, authentication and authorization agents, system log *monitoring agents, intrusion detection agents, and pre-mortem-based computer forensics agents. An assessment center, which is comprised of yet another special group of agents, plays a key role in coordinating the interaction of the other agents. Each agent has an agent engine of an appropriate machine-learning algorithm. The engine enables the agent with learning, reasoning, and decision-making abilities. Each agent also has an agent interface, through which the agent interacts with other agents and also the environment.

scholarly journals P137 Preliminary validation of a multi-stage machine learning algorithm to assess histological inflammation in inflammatory bowel disease

2021 ◽  
Vol 15 (Supplement_1) ◽  
pp. S224-S225
Author(s):  
E Hagendorn ◽  
S Karsen ◽  
R Pai ◽  
V Jairath ◽  
H Knight ◽  
...  
Keyword(s):  
Machine Learning ◽  
Inflammatory Bowel Disease ◽  
Bowel Disease ◽  
Plasma Cells ◽  
Learning Algorithm ◽  
Ground Truth ◽  
Cell Types ◽  
Test Dataset ◽  
Preliminary Validation ◽  
Inflammatory Bowel

Abstract Background The histologic assessment of inflammatory bowel disease (IBD) relies on qualitative grading methods. Although widely accepted, these instruments are time consuming, require specialized training, and suffer from inter-rater disagreement. For these reasons there is a need for more consistent and less biased methods to assess IBD histology. Methods The algorithm was initially developed using hematoxylin and eosin (H&E) stained whole slide images of colon biopsies (238 ulcerative colitis [UC], 30 Crohn’s Disease [CD], and 28 endoscopically normal adjacent [ENA]). The first two stages implement convolutional neural networks (CNN) which segment 11 key anatomical features (Figure 1). The third stage extracts the features and models them for prediction. Results The first stage of the algorithm was validated on an independent test dataset by calculating the intersection-over-union (IoU) for the ground truth and prediction masks, resulting in a value of 0.97. A preliminary validation for stage 2 was performed by randomly selecting 30 unique biopsy sections from the test dataset and applying a 150um x 150um counting frame. An expert gastrointestinal pathologist confirmed correct cell identification by the algorithm for three of the primary inflammatory cell types: plasma cells, eosinophils, and neutrophils which resulted in a sensitivity/specificity of 0.76/0.99, 0.78/1.00, and 1.00/0.98 respectively. The final stage predicts RHI grades which could be directly compared to pathologist reads (Figure 2, 3, and 4). Conclusion This is the first study to demonstrate the value of machine learning to assess histologic activity in IBD. These methods lay the foundations for future work, and we believe stages 1 and 2 can be explored independently to statistically characterize the histologic changes of IBD, enabling the improvement of preexisting grading systems.

Machine Learning Algorithm to Predict Early Complications after Brain Tumor Surgery

2018 ◽  
Author(s):  
C.H.B. van Niftrik ◽  
F. van der Wouden ◽  
V. Staartjes ◽  
J. Fierstra ◽  
M. Stienen ◽  
...  
Keyword(s):  
Machine Learning ◽  
Brain Tumor ◽  
Learning Algorithm ◽  
Machine Learning Algorithm ◽  
Tumor Surgery ◽  
Early Complications ◽  
Brain Tumor Surgery

Design of English text-to-speech conversion algorithm based on machine learning

2020 ◽  
pp. 1-12
Author(s):  
Li Dongmei
Keyword(s):  
Machine Learning ◽  
Speech Synthesis ◽  
Feature Recognition ◽  
Learning Algorithm ◽  
Morphological Structure ◽  
English Text ◽  
Text To Speech ◽  
Part Of Speech ◽  
Modern Computer ◽  
Conversion Algorithm

English text-to-speech conversion is the key content of modern computer technology research. Its difficulty is that there are large errors in the conversion process of text-to-speech feature recognition, and it is difficult to apply the English text-to-speech conversion algorithm to the system. In order to improve the efficiency of the English text-to-speech conversion, based on the machine learning algorithm, after the original voice waveform is labeled with the pitch, this article modifies the rhythm through PSOLA, and uses the C4.5 algorithm to train a decision tree for judging pronunciation of polyphones. In order to evaluate the performance of pronunciation discrimination method based on part-of-speech rules and HMM-based prosody hierarchy prediction in speech synthesis systems, this study constructed a system model. In addition, the waveform stitching method and PSOLA are used to synthesize the sound. For words whose main stress cannot be discriminated by morphological structure, label learning can be done by machine learning methods. Finally, this study evaluates and analyzes the performance of the algorithm through control experiments. The results show that the algorithm proposed in this paper has good performance and has a certain practical effect.

Intelligent system of English composition scoring model based on improved machine learning algorithm

2020 ◽  
pp. 1-11
Author(s):  
Jie Liu ◽  
Lin Lin ◽  
Xiufang Liang
Keyword(s):  
Machine Learning ◽  
Evaluation System ◽  
Intelligent System ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Assessment System ◽  
English Composition ◽  
Region Extraction ◽  
Constraint Model

The online English teaching system has certain requirements for the intelligent scoring system, and the most difficult stage of intelligent scoring in the English test is to score the English composition through the intelligent model. In order to improve the intelligence of English composition scoring, based on machine learning algorithms, this study combines intelligent image recognition technology to improve machine learning algorithms, and proposes an improved MSER-based character candidate region extraction algorithm and a convolutional neural network-based pseudo-character region filtering algorithm. In addition, in order to verify whether the algorithm model proposed in this paper meets the requirements of the group text, that is, to verify the feasibility of the algorithm, the performance of the model proposed in this study is analyzed through design experiments. Moreover, the basic conditions for composition scoring are input into the model as a constraint model. The research results show that the algorithm proposed in this paper has a certain practical effect, and it can be applied to the English assessment system and the online assessment system of the homework evaluation system algorithm system.

Feature extraction and prediction of Dengue Outbreaks

2020 ◽  
pp. 216-222
Author(s):  
Kunal Parikh ◽  
Tanvi Makadia ◽  
Harshil Patel
Keyword(s):  
Public Health ◽  
Machine Learning ◽  
Developing Countries ◽  
Feature Extraction ◽  
Predictive Analytics ◽  
Learning Algorithm ◽  
Machine Learning Algorithm ◽  
Health Concerns ◽  
The World ◽  
Dengue Outbreaks

Dengue is unquestionably one of the biggest health concerns in India and for many other developing countries. Unfortunately, many people have lost their lives because of it. Every year, approximately 390 million dengue infections occur around the world among which 500,000 people are seriously infected and 25,000 people have died annually. Many factors could cause dengue such as temperature, humidity, precipitation, inadequate public health, and many others. In this paper, we are proposing a method to perform predictive analytics on dengue’s dataset using KNN: a machine-learning algorithm. This analysis would help in the prediction of future cases and we could save the lives of many.

Sign in / Sign up

Export Citation Format

Share Document