Search results for "HM"
showing 10 items of 10594 documents
VARIABLE SELECTION FOR NOISY DATA APPLIED IN PROTEOMICS
2014
International audience; The paper proposes a variable selection method for pro-teomics. It aims at selecting, among a set of proteins, those (named biomarkers) which enable to discriminate between two groups of individuals (healthy and pathological). To this end, data is available for a cohort of individuals: the biological state and a measurement of concentrations for a list of proteins. The proposed approach is based on a Bayesian hierarchical model for the dependencies between biological and instrumental variables. The optimal selection function minimizes the Bayesian risk, that is to say the selected set of variables maximizes the posterior probability. The two main contributions are: (…
Input Selection Methods for Soft Sensor Design: A Survey
2020
Soft Sensors (SSs) are inferential models used in many industrial fields. They allow for real-time estimation of hard-to-measure variables as a function of available data obtained from online sensors. SSs are generally built using industries historical databases through data-driven approaches. A critical issue in SS design concerns the selection of input variables, among those available in a candidate dataset. In the case of industrial processes, candidate inputs can reach great numbers, making the design computationally demanding and leading to poorly performing models. An input selection procedure is then necessary. Most used input selection approaches for SS design are addressed in this …
P-FCM: a proximity-based fuzzy clustering for user-centered web applications
2003
Abstract In last years, the Internet and the web have been evolved in an astonishing way. Standard web search services play an important role as useful tools for the Internet community even though they suffer from a certain difficulty. The web continues its growth, making the reliability of Internet-based information and retrieval systems more complex. Nevertheless there has been a substantial analysis of the gap between the expected information and the returned information, the work of web search engine is still very hard. There are different problems concerning web searching activity, one among these falls in the query phase. Each engine provide an interface which the user is forced to le…
Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?
2020
Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares problem. Several different solvers can be applied to the resulting linear problem. In this paper, a thorough comparison of possible and recently proposed, especially randomized, algorithms is carried out for this problem with a representative set of regression datasets. In addition, we compare MLM with shallow and deep feedforward neural network models and study the effects of the number of observations and the number of features with a special dat…
Hard material small-batch industrial machining robot
2018
Abstract Hard materials can be cost effectively machined with standard industrial robots by enhancing current state-of-the-art technologies. It is demonstrated that even hard metals with specific robotics-optimised novel hard-metal tools can be machined by standard industrial robots with an improved position-control approach and enhanced compliance-control functions. It also shows that the novel strategies to compensate for elastic robot errors, based on models and advanced control, as well as the utilisation of new affordable sensors and human-machine interfaces, can considerably improve the robot performance and applicability of robots in machining tasks. In conjunction with the developme…
An Artificial Bee Colony Approach for Classification of Remote Sensing Imagery
2018
This paper presents a novel Artificial Bee Colony (ABC) approach for supervised classification of remote sensing images. One proposes to apply an ABC algorithm to optimize the coefficients of the set of polynomial discriminant functions. We have experimented the proposed ABC-based classifier algorithm for a Landsat 7 ETM+ image database, evaluating the influence of the ABC model parameters on the classifier performances. Such ABC model parameters are: numbers of employed/onlooker/scout bees, number of epochs, and polynomial degree. One has compared the best ABC classifier Overall Accuracy (OA) with the performances obtained using a set of benchmark classifiers (NN, NP, RBF, and SVM). The re…
A Novel Border Identification Algorithm Based on an “Anti-Bayesian” Paradigm
2013
Published version of a chapter in the book: Computer Analysis of Images and Patterns. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-40261-6_23 Border Identification (BI) algorithms, a subset of Prototype Reduction Schemes (PRS) aim to reduce the number of training vectors so that the reduced set (the border set) contains only those patterns which lie near the border of the classes, and have sufficient information to perform a meaningful classification. However, one can see that the true border patterns (“near” border) are not able to perform the task independently as they are not able to always distinguish the testing samples. Thus, researchers have worked on thi…
Stabilized branch-and-price algorithms for vector packing problems
2018
Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…
The minimum mean cycle-canceling algorithm for linear programs
2022
Abstract This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed for solving network flow problems for which it runs in strongly polynomial time, most of its properties are preserved. This is at the price of adapting the fundamental decomposition theorem of a network flow solution together with various definitions: that of a cycle and the way to calculate its cost, the residual problem, and the improvement factor at the end of a phase. We also use the primal and dual necessary and sufficient optimality conditions stated on the residual problem for establishing the pricing step giving its name to the algorith…
Measuring Social Responsibility: A Multicriteria Approach
2016
In this chapter we present a portfolio selection model for Socially Responsible Investment. The model, following the spirit of Socially Responsible Investment, consists of two different steps. Firstly, a social screening is applied in order to obtain the feasible set of assets accomplishing the socially responsible investment policy of the assets’ manager. In this step, an indicator is obtained for the measurement of the social responsibility degree of an asset. Assets are then ranked using this indicator from the most socially responsible to the less socially responsible. In a second step, once the feasible set is obtained, composed of those socially responsible assets verifying the screen…