scholarly journals An empirical analysis of Brazilian courts law documents using learning techniques

2019 ◽  
Author(s):  
Bruno Silva ◽  
Marjory Da Costa-Abreu

This paper describes a survey on investigating judicial data to find patterns and relations between crime attributes and corresponding decisions made by courts, aiming to find import directions that interpretation of the law might be taking. We have developed an initial methodology and experimentation to look for behaviour patterns to build judicial sentences in the scope of Brazilian criminal courts and achieved results related to important trends in decision making. Neural networks-based techniques were applied for classification and pattern recognition, based on Multi-Layer Perceptron and Radial-basis Functions, associated with data organisation techniques and behavioral modalities extraction.

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Muhammad Taimoor ◽  
Xiao Lu ◽  
Hamid Maqsood ◽  
Chunyang Sheng

Purpose The objective of this research is to investigate various neural network (NN) observer techniques for sensors fault identification and diagnosis of nonlinear system in consideration of numerous faults, failures, uncertainties and disturbances. For the importunity of increasing the faults diagnosis and reconstruction preciseness, a new technique is used for modifying the weight parameters of NNs without enhancement of computational complexities. Design/methodology/approach Various techniques such as adaptive radial basis functions (ARBF), conventional radial basis functions, adaptive multi-layer perceptron, conventional multi-layer perceptron and extended state observer are presented. For increasing the fault detection preciseness, a new technique is used for updating the weight parameters of radial basis functions and multi-layer perceptron (MLP) without enhancement of computational complexities. Lyapunov stability theory and sliding-mode surface concepts are used for the weight-updating parameters. Based on the combination of these two concepts, the weight parameters of NNs are updated adaptively. The key purpose of utilization of adaptive weight is to enhance the detection of faults with high accuracy. Because of the online adaptation, the ARBF can detect various kinds of faults and failures such as simultaneous, incipient, intermittent and abrupt faults effectively. Results depict that the suggested algorithm (ARBF) demonstrates more confrontation to unknown disturbances, faults and system dynamics compared with other investigated techniques and techniques used in the literature. The proposed algorithms are investigated by the utilization of quadrotor unmanned aerial vehicle dynamics, which authenticate the efficiency of the suggested algorithm. Findings The proposed Lyapunov function theory and sliding-mode surface-based strategy are studied, which shows more efficiency to unknown faults, failures, uncertainties and disturbances compared with conventional approaches as well as techniques used in the literature. Practical implications For improvement of the system safety and for avoiding failure and damage, the rapid fault detection and isolation has a great significance; the proposed approaches in this research work guarantee the detection and reconstruction of unknown faults, which has a great significance for practical life. Originality/value In this research, two strategies such Lyapunov function theory and sliding-mode surface concept are used in combination for tuning the weight parameters of NNs adaptively. The main purpose of these strategies is the fault diagnosis and reconstruction with high accuracy in terms of shape as well as the magnitude of unknown faults. Results depict that the proposed strategy is more effective compared with techniques used in the literature.


2013 ◽  
Vol 2 (2) ◽  
pp. 66-79 ◽  
Author(s):  
Onsy A. Abdel Alim ◽  
Amin Shoukry ◽  
Neamat A. Elboughdadly ◽  
Gehan Abouelseoud

In this paper, a pattern recognition module that makes use of 3-D images of objects is presented. The proposed module takes advantage of both the generalization capability of neural networks and the possibility of manipulating 3-D images to generate views at different poses of the object that is to be recognized. This allows the construction of a robust 3-D object recognition module that can find use in various applications including military, biomedical and mine detection applications. The paper proposes an efficient training procedure and decision making strategy for the suggested neural network. Sample results of testing the module on 3-D images of several objects are also included along with an insightful discussion of the implications of the results.


1995 ◽  
Vol 7 (2) ◽  
pp. 219-269 ◽  
Author(s):  
Federico Girosi ◽  
Michael Jones ◽  
Tomaso Poggio

We had previously shown that regularization principles lead to approximation schemes that are equivalent to networks with one layer of hidden units, called regularization networks. In particular, standard smoothness functionals lead to a subclass of regularization networks, the well known radial basis functions approximation schemes. This paper shows that regularization networks encompass a much broader range of approximation schemes, including many of the popular general additive models and some of the neural networks. In particular, we introduce new classes of smoothness functionals that lead to different classes of basis functions. Additive splines as well as some tensor product splines can be obtained from appropriate classes of smoothness functionals. Furthermore, the same generalization that extends radial basis functions (RBF) to hyper basis functions (HBF) also leads from additive models to ridge approximation models, containing as special cases Breiman's hinge functions, some forms of projection pursuit regression, and several types of neural networks. We propose to use the term generalized regularization networks for this broad class of approximation schemes that follow from an extension of regularization. In the probabilistic interpretation of regularization, the different classes of basis functions correspond to different classes of prior probabilities on the approximating function spaces, and therefore to different types of smoothness assumptions. In summary, different multilayer networks with one hidden layer, which we collectively call generalized regularization networks, correspond to different classes of priors and associated smoothness functionals in a classical regularization principle. Three broad classes are (1) radial basis functions that can be generalized to hyper basis functions, (2) some tensor product splines, and (3) additive splines that can be generalized to schemes of the type of ridge approximation, hinge functions, and several perceptron-like neural networks with one hidden layer.


2008 ◽  
Vol 41 (2) ◽  
pp. 7463-7467
Author(s):  
Ali S. Saad Azhar ◽  
Muhammad Shafiq ◽  
Jamil M. Bakhashwain ◽  
Fouad M. AL-Sunni

2002 ◽  
Vol 14 (8) ◽  
pp. 1979-2002 ◽  
Author(s):  
Katsuyuki Hagiwara

In considering a statistical model selection of neural networks and radial basis functions under an overrealizable case, the problem of unidentifiability emerges. Because the model selection criterion is an unbiased estimator of the generalization error based on the training error, this article analyzes the expected training error and the expected generalization error of neural networks and radial basis functions in overrealizable cases and clarifies the difference from regular models, for which identifiability holds. As a special case of an overrealizable scenario, we assumed a gaussian noise sequence as training data. In the least-squares estimation under this assumption, we first formulated the problem, in which the calculation of the expected errors of unidentifiable networks is reduced to the calculation of the expectation of the supremum of thex2 process. Under this formulation, we gave an upper bound of the expected training error and a lower bound of the expected generalization error, where the generalization is measured at a set of training inputs. Furthermore, we gave stochastic bounds on the training error and the generalization error. The obtained upper bound of the expected training error is smaller than in regular models, and the lower bound of the expected generalization error is larger than in regular models. The result tells us that the degree of overfitting in neural networks and radial basis functions is higher than in regular models. Correspondingly, it also tells us that the generalization capability is worse than in the case of regular models. The article may be enough to show a difference between neural networks and regular models in the context of the least-squares estimation in a simple situation. This is a first step in constructing a model selection criterion in an overrealizable case. Further important problems in this direction are also included in this article.


2021 ◽  
Vol 7 ◽  
pp. 71-81
Author(s):  
Yoana Ivanova

This paper is considered to be a continuation of a previous publication devoted to tendencies in the applications of advanced technology solutions to strengthen the cybersecurity of critical infrastructure (Yearbook Telecommunications, vol. 6, 2019). The specificity of the research is related to tracing the evolution of artificial neural networks (ANN) from their establishment to their modelling and simulation. The theoretical framework involves a well-supported rationale by some practical examples of advanced methods of design and simulation of ANN using SIMBRAIN. These methods are applicable in Cognitive science and Robotics because of their contribution to scientific researches related to study of perceptions and behaviors, abilities of decision making, pattern recognition and morphological analysis and etc.


Sign in / Sign up

Export Citation Format

Share Document