Search results for "Machine learning."
showing 10 items of 1455 documents
Deep-Learning-Enabled Fast Optical Identification and Characterization of 2D Materials.
2020
© 2020 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim Advanced microscopy and/or spectroscopy tools play indispensable roles in nanoscience and nanotechnology research, as they provide rich information about material processes and properties. However, the interpretation of imaging data heavily relies on the “intuition” of experienced researchers. As a result, many of the deep graphical features obtained through these tools are often unused because of difficulties in processing the data and finding the correlations. Such challenges can be well addressed by deep learning. In this work, the optical characterization of 2D materials is used as a case study, and a neural-network-based algorithm is de…
Search of a topological pattern to evaluate toxicity of heterogeneous compounds.
2001
Abstract Molecular connectivity has been applied to the search of mathematical models able to predict the carcinogenic and teratogenic activity of a wide group of structurally heterogeneous compounds. Through the linear discriminant analysis and the diagrams of distribution of pharmacological activity, the classification criteria that minimizes the percentage of error are established. The easiness and speed of the calculation of the descriptors used in this work make the models developed useful in data bases containing a huge number of compounds.
Statistical criteria for early-stopping of support vector machines
2007
This paper proposes the use of statistical criteria for early-stopping support vector machines, both for regression and classification problems. The method basically stops the minimization of the primal functional when moments of the error signal (up to fourth order) become stationary, rather than according to a tolerance threshold of primal convergence itself. This simple strategy induces lower computational efforts and no significant differences are observed in terms of performance and sparsity.
Implementing some Evolutionary Computing Methods for Determining the Optimal Parameters in the Turning Process
2015
In this paper, we comparatively present two heuristics search methods – Simulated Annealing and Weighted Sum Genetic Algorithm, in order to find optimal cutting parameters in turning operation. We consider five different constraints aiming to achieve minimum total cost of machining. We developed a customizable software application in Microsoft Visual Studio with C# source code, flexible and extensible that implements the optimization methods. The experiments are based on real data gathered from S.C. “Compa” S.A Sibiu, a company that manufactures automotive components and targets improving of product quality and reducing cost and production time. The obtained results show that, although the …
Using box indices in supporting comparison in multiobjective optimization
2009
Because of the conflicting nature of criteria or objectives, solving a multiobjective optimization problem typically requires interaction with a decision maker who can specify preference information related to the objectives in the problem in question. Due to the difficulties of dealing with multiple objectives, the way information is presented plays a very important role. Questions posed to the decision maker must be simple enough and information shown must be easy to understand. For this purpose, visualization and graphical representations can be useful and constitute one of the main tools used in the literature. In this paper, we propose to use box indices to represent information relate…
Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks
2016
The contribution of this study is twofold: First, we show that we can predict the performance of Iterated Local Search (ILS) in different landscapes with the help of Local Optima Networks (LONs) with escape edges. As a predictor, we use the PageRank Centrality of the global optimum. Escape edges can be extracted with lower effort than the edges used in a previous study. Second, we show that the PageRank vector of a LON can be used to predict the solution quality (average fitness) achievable by ILS in different landscapes.
Unbiased Branches: An Open Problem
2007
The majority of currently available dynamic branch predictors base their prediction accuracy on the previous k branch outcomes. Such predictors sustain high prediction accuracy but they do not consider the impact of unbiased branches, which are difficult-to-predict. In this paper, we evaluate the impact of unbiased branches in terms of prediction accuracy on a range of branch difference predictors using prediction by partial matching, multiple Markov prediction and neural-based prediction. Since our focus is on the impact that unbiased branches have on processor performance, timing issues and hardware costs are out of scope of this investigation. Our simulation results, with the SPEC2000 in…
Online Metric Learning Methods Using Soft Margins and Least Squares Formulations
2012
Online metric learning using margin maximization has been introduced as a way to learn appropriate dissimilarity measures in an efficient way when information as pairs of examples is given to the learning system in a progressive way. These schemes have several practical advantages with regard to global ones in which a training set needs to be processed. On the other hand, they may suffer from a poor performance depending on the quality of the examples and the particular tuning or other implementation details. This paper formulates several online metric learning alternatives using a passive-aggressive schema. A new formulation of the online problem using least squares is also introduced. The…
Improvement of Statistical Decisions under Parametric Uncertainty
2011
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncertainty. Decision‐making under uncertainty is a central problem in statistical inference, and has been formally studied in virtually all approaches to inference. The aim of the present paper is to show how the invariant embedding technique, the idea of which belongs to the authors, may be employed in the particular case of finding the improved statistical decisions under parametric uncertainty. This technique represents a simple and computationally attractive statistical method based on the constructive use of the i…
Fitness diversity based adaptation in Multimeme Algorithms:A comparative study
2007
This paper compares three different fitness diversity adaptations in multimeme algorithms (MmAs). These diversity indexes have been integrated within a MmA present in literature, namely fast adaptive memetic algorithm. Numerical results show that it is not possible to establish a superiority of one of these adaptive schemes over the others and choice of a proper adaptation must be made by considering features of the problem under study. More specifically, one of these adaptations outperforms the others in the presence of plateaus or limited range of variability in fitness values, another adaptation is more proper for landscapes having distant and strong basins of attraction, the third one, …