562 research outputs found
JUNIPR: a Framework for Unsupervised Machine Learning in Particle Physics
In applications of machine learning to particle physics, a persistent
challenge is how to go beyond discrimination to learn about the underlying
physics. To this end, a powerful tool would be a framework for unsupervised
learning, where the machine learns the intricate high-dimensional contours of
the data upon which it is trained, without reference to pre-established labels.
In order to approach such a complex task, an unsupervised network must be
structured intelligently, based on a qualitative understanding of the data. In
this paper, we scaffold the neural network's architecture around a
leading-order model of the physics underlying the data. In addition to making
unsupervised learning tractable, this design actually alleviates existing
tensions between performance and interpretability. We call the framework
JUNIPR: "Jets from UNsupervised Interpretable PRobabilistic models". In this
approach, the set of particle momenta composing a jet are clustered into a
binary tree that the neural network examines sequentially. Training is
unsupervised and unrestricted: the network could decide that the data bears
little correspondence to the chosen tree structure. However, when there is a
correspondence, the network's output along the tree has a direct physical
interpretation. JUNIPR models can perform discrimination tasks, through the
statistically optimal likelihood-ratio test, and they permit visualizations of
discrimination power at each branching in a jet's tree. Additionally, JUNIPR
models provide a probability distribution from which events can be drawn,
providing a data-driven Monte Carlo generator. As a third application, JUNIPR
models can reweight events from one (e.g. simulated) data set to agree with
distributions from another (e.g. experimental) data set.Comment: 37 pages, 24 figure
Efficient Clustering on Riemannian Manifolds: A Kernelised Random Projection Approach
Reformulating computer vision problems over Riemannian manifolds has
demonstrated superior performance in various computer vision applications. This
is because visual data often forms a special structure lying on a lower
dimensional space embedded in a higher dimensional space. However, since these
manifolds belong to non-Euclidean topological spaces, exploiting their
structures is computationally expensive, especially when one considers the
clustering analysis of massive amounts of data. To this end, we propose an
efficient framework to address the clustering problem on Riemannian manifolds.
This framework implements random projections for manifold points via kernel
space, which can preserve the geometric structure of the original space, but is
computationally efficient. Here, we introduce three methods that follow our
framework. We then validate our framework on several computer vision
applications by comparing against popular clustering methods on Riemannian
manifolds. Experimental results demonstrate that our framework maintains the
performance of the clustering whilst massively reducing computational
complexity by over two orders of magnitude in some cases
A machine learning study to identify spinodal clumping in high energy nuclear collisions
The coordinate and momentum space configurations of the net baryon number in heavy ion collisions that undergo spinodal decomposition, due to a first-order phase transition, are investigated using state-of-the-art machine-learning methods. Coordinate space clumping, which appears in the spinodal decomposition, leaves strong characteristic imprints on the spatial net density distribution in nearly every event which can be detected by modern machine learning techniques. On the other hand, the corresponding features in the momentum distributions cannot clearly be detected, by the same machine learning methods, in individual events. Only a small subset of events can be systematically differ- entiated if only the momentum space information is available. This is due to the strong similarity of the two event classes, with and without spinodal decomposition. In such sce- narios, conventional event-averaged observables like the baryon number cumulants signal a spinodal non-equilibrium phase transition. Indeed the third-order cumulant, the skewness, does exhibit a peak at the beam energy (Elab = 3–4 A GeV), where the transient hot and dense system created in the heavy ion collision reaches the first-order phase transition
Learning Multimodal Structures in Computer Vision
A phenomenon or event can be received from various kinds of detectors or under different conditions. Each such acquisition framework is a modality of the phenomenon. Due to the relation between the modalities of multimodal phenomena, a single modality cannot fully describe the event of interest. Since several modalities report on the same event introduces new challenges comparing to the case of exploiting each modality separately.
We are interested in designing new algorithmic tools to apply sensor fusion techniques in the particular signal representation of sparse coding which is a favorite methodology in signal processing, machine learning and statistics to represent data. This coding scheme is based on a machine learning technique and has been demonstrated to be capable of representing many modalities like natural images. We will consider situations where we are not only interested in support of the model to be sparse, but also to reflect a-priorily known knowledge about the application in hand.
Our goal is to extract a discriminative representation of the multimodal data that leads to easily finding its essential characteristics in the subsequent analysis step, e.g., regression and classification. To be more precise, sparse coding is about representing signals as linear combinations of a small number of bases from a dictionary. The idea is to learn a dictionary that encodes intrinsic properties of the multimodal data in a decomposition coefficient vector that is favorable towards the maximal discriminatory power.
We carefully design a multimodal representation framework to learn discriminative feature representations by fully exploiting, the modality-shared which is the information shared by various modalities, and modality-specific which is the information content of each modality individually. Plus, it automatically learns the weights for various feature components in a data-driven scheme. In other words, the physical interpretation of our learning framework is to fully exploit the correlated characteristics of the available modalities, while at the same time leverage the modality-specific character of each modality and change their corresponding weights for different parts of the feature in recognition
Enhanced Ai-Based Machine Learning Model for an Accurate Segmentation and Classification Methods
Phone Laser Scanner becomes the versatile sensor module that is premised on Lamp Identification and Spanning methodology and is used in a spectrum of uses. There are several prior editorials in the literary works that concentrate on the implementations or attributes of these processes; even so, evaluations of all those inventive computational techniques reported in the literature have not even been performed in the required thickness. At ToAT that finish, we examine and summarize the latest advances in Artificial Intelligence based machine learning data processing approaches such as extracting features, fragmentation, machine vision, and categorization. In this survey, we have reviewed total 48 papers based on an enhanced AI based machine learning model for accurate classification and segmentation methods. Here, we have reviewed the sections on segmentation and classification of images based on machine learning models
APPLICATION OF DEEP CONVOLUTIONAL NETWORK FOR THE CLASSIFICATION OF AUTO IMMUNE DISEASE
Abstract—Indirect Immuno Fluorescence (IIF) detection analysis technique is in limelight because of its great importance in the field of medical health. It is mainly used for the analysis of auto-immune diseases. These diseases are caused when body’s natural defense system can’t distinguish between normal body cells and foreign cells. More than 80 auto-immune diseases exist in humans which affect different parts of body. IIF works both manually as well as by using Computer-Aided Diagnosis (CAD). The aim of research is to propose an advanced methodology for the analysis of auto-immune diseases by using well-known model of transfer learning for the analysis of autoimmune diseases. Data augmentation and data normalization is also used to resolve the problem of over fitting in data. Firstly, freely available MIVIA data set of HEP- type 2 cells has been selected, which contains total of 1457 images and six different classes of staining patterns named as centromere, homogeneous, nucleolar, coarse speckled, fine speckled and cytoplasmatic. Then well-known model of transfer learning VGG-16 are train on MIVIA data set of HEP-type 2 cells. Data augmentation and data normalization used on pre-trained data to avoid over fitting because datasets of medical images are not very large. After the application of data augmentation and data normalization on pre-trained model, the performance of model is used to calculate by using a confusion matrix of VGG-16. VGG-16 achieves 84.375% accuracy. It is more suitable for the analysis of auto-immune diseases. Same as accuracy, we also use the other three parameters, Precision, F1 measures, and recall to check the performance of model. All four parameters use confusion matrix to find performance of model. The tools and languages also have great importance because it gives a simple and easy way of implementation to solve problems in image processing. For this purpose, python and colab is used to read and write the data because python provides fast execution of data and colab work as a simulator of python. The result shows that transfer learning is the most sufficient and enhanced technique for the analysis of auto-immune diseases since it provides high accuracy in less time and reduces the errors in image classification
Temporal - spatial recognizer for multi-label data
Pattern recognition is an important artificial intelligence task with practical applications in many fields such as medical and species distribution. Such application involves overlapping data points which are demonstrated in the multi- label dataset. Hence, there is a need for a recognition algorithm that can separate the overlapping data points in order to recognize the correct pattern. Existing recognition methods suffer from sensitivity to noise and overlapping points as they could not recognize a pattern when there is a shift in the position of the data points. Furthermore, the methods do not implicate temporal information in the process of recognition, which leads to low quality of data clustering. In this study, an improved pattern recognition method based on Hierarchical Temporal Memory (HTM) is proposed to solve the overlapping in data points of multi- label dataset. The imHTM (Improved HTM) method includes improvement in two of its components; feature extraction and data clustering. The first improvement is realized as TS-Layer Neocognitron algorithm which solves the shift in position problem in feature extraction phase. On the other hand, the data clustering step, has two improvements, TFCM and cFCM (TFCM with limit- Chebyshev distance metric) that allows the overlapped data points which occur in patterns to be separated correctly into the relevant clusters by temporal clustering. Experiments on five datasets were conducted to compare the proposed method (imHTM) against statistical, template and structural pattern recognition methods. The results showed that the percentage of success in recognition accuracy is 99% as compared with the template matching method (Featured-Based Approach, Area-Based Approach), statistical method (Principal Component Analysis, Linear Discriminant Analysis, Support Vector Machines and Neural Network) and structural method (original HTM). The findings indicate that the improved HTM can give an optimum pattern recognition accuracy, especially the ones in multi- label dataset
- …