Saggi critici

Saggi critici / Arnaldo De Risi. - Roma : P. Cremonese, 1932 Dedica manoscritta dell'autore: A S. E. Emilio Bodrero / deferente omaggio / Arnaldo De Risi https://galileodiscovery.unipd.it/discovery/fulldisplay?context=L&vid=39UPD_INST:VU1&search_scope=MyInst_and_CI&tab=Everything&docid=alma99000153258020604

A Convergent Hybrid Decomposition Algorithm Model for SVM Training

Training of support vector machines (SVMs) requires to solve a linearly constrained convex quadratic problem. In real applications, the number of training data may be very huge and the Hessian matrix cannot be stored. In order to take into account this issue, a common strategy consists in using decomposition algorithms which at each iteration operate only on a small subset of variables, usually referred to as the working set. Training time can be significantly reduced by using a caching technique that allocates some memory space to store the columns of the Hessian matrix corresponding to the variables recently updated. The convergence properties of a decomposition method can be guaranteed by means of a suitable selection of the working set and this can limit the possibility of exploiting the information stored in the cache. We propose a general hybrid algorithm model which combines the capability of producing a globally convergent sequence of points with a flexible use of the information in the cache. As an example of a specific realization of the general hybrid model, we describe an algorithm based on a particular strategy for exploiting the information deriving from a caching technique. We report the results of computational experiments performed by simple implementations of this algorithm. The numerical results point out the potentiality of the approach

A convergent decomposition algorithm for support vector machines

In this work we consider nonlinear minimization problems with a single linear equality constraint and box constraints. In particular we are interested in solving problems where the number of variables is so huge that traditional optimization methods cannot be directly applied. Many interesting real world problems lead to the solution of large scale constrained problems with this structure. For example, the special subclass of problems with convex quadratic objective function plays a fundamental role in the training of Support Vector Machine, which is a technique for machine learning problems. For this particular subclass of convex quadratic problem, some convergent decomposition methods, based on the solution of a sequence of smaller subproblems, have been proposed. In this paper we define a new globally convergent decomposition algorithm that differs from the previous methods in the rule for the choice of the subproblem variables and in the presence of a proximal point modification in the objective function of the subproblems. In particular, the new rule for sequentially selecting the subproblems appears to be suited to tackle large scale problems, while the introduction of the proximal point term allows us to ensure the global convergence of the algorithm for the general case of nonconvex objective function. Furthermore, we report some preliminary numerical results on support vector classification problems with up to 100 thousands variables

Decomposition Algorithm Model for Singly Linearly-Constrained Problems Subject to Lower and Upper Bounds

Many real applications can be formulated as nonlinear minimization problems with a single linear equality constraint and box constraints. We are interested in solving problems where the number of variables is so huge that basic operations, such as the evaluation of the objective function or the updating of its gradient, are very time consuming. Thus, for the considered class of problems (including dense quadratic programs), traditional optimization methods cannot be applied directly. In this paper, we define a decomposition algorithm model which employs, at each iteration, a descent search direction selected among a suitable set of sparse feasible directions. The algorithm is characterized by an acceptance rule of the updated point which on the one hand permits to choose the variables to be modified with a certain degree of freedom and on the other hand does not require the exact solution of any subproblem. The global convergence of the algorithm model is proved by assuming that the objective function is continuously differentiable and that the points of the level set have at least one component strictly between the lower and upper bounds. Numerical results on large-scale quadratic problems arising in the training of support vector machines show the effectiveness of an implemented decomposition scheme derived from the general algorithm mode

A patient adaptable ECG beat classifier based on neural networks

Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7 , Rome / CNR - Consiglio Nazionale delle RichercheSIGLEITItal

Intracranial pressure wave morphological classification: automated analysis and clinical validation

BACKGROUND: Recently, different software has been developed to automatically analyze multiple intracranial pressure (ICP) parameters, but the suggested methods are frequently complex and have no clinical correlation. The objective of this study was to assess the clinical value of a new morphological classification of the cerebrospinal fluid pulse pressure waveform (CSFPPW), comparing it to the elastance index (EI) and CSF-outflow resistance (Rout), and to test the efficacy of an automatic ICP analysis. METHODS: An artificial neural network (ANN) was trained to classify 60 CSFPPWs in four different classes, according to their morphology, and its efficacy was compared to an expert examiner's classification. The morphology of CSFPPW, recorded in 60 patients at baseline, was compared to EI and Rout calculated at the end of an intraventricular infusion test to validate the utility of the proposed classification in patients' clinical evaluation. RESULTS: The overall concordance in CSFPPW classification between the expert examiner and the ANN was 88.3 %. An elevation of EI was statistically related to morphological class' progression. All patients showing pathological baseline CSFPPW (class IV) revealed an alteration of CSF hydrodynamics at the end of their infusion test. CONCLUSIONS: The proposed morphological classification estimates the global ICP wave and its ability to reflect or predict an alteration in CSF hydrodynamics. An ANN can be trained to efficiently recognize four different CSF wave morphologies. This classification seems helpful and accurate for diagnostic use

The monitoring resynchronization dEvices and CARdiac patiEnts (MORE-CARE) randomized controlled trial: Phase 1 results on dynamics of early intervention with remote monitoring

Background: Remote monitoring (RM) in patients with advanced heart failure and cardiac resynchronization therapy defibrillators (CRT-D) may reduce delays in clinical decisions by transmitting automatic alerts. However, this strategy has never been tested specifically in this patient population, with alerts for lung fluid overload, and in a European setting. Objective: The main objective of Phase 1 (presented here) is to evaluate if RM strategy is able to reduce time from device-detected events to clinical decisions. Methods: In this multicenter randomized controlled trial, patients with moderate to severe heart failure implanted with CRT-D devices were randomized to a Remote group (with remote follow-up and wireless automatic alerts) or to a Control group (with standard follow-up without alerts). The primary endpoint of Phase 1 was the delay between an alert event and clinical decisions related to the event in the first 154 enrolled patients followed for 1 year. Results: The median delay from device-detected events to clinical decisions was considerably shorter in the Remote group compared to the Control group: 2 (25th-75th percentile, 1-4) days vs 29 (25th-75th percentile, 3-51) days respectively, P=.004. In-hospital visits were reduced in the Remote group (2.0 visits/patient/year vs 3.2 visits/patient/year in the Control group, 37.5% relative reduction, P<.001). Automatic alerts were successfully transmitted in 93% of events occurring outside the hospital in the Remote group. The annual rate of all-cause hospitalizations per patient did not differ between the two groups (P=.65). Conclusions: RM in CRT-D patients with advanced heart failure allows physicians to promptly react to clinically relevant automatic alerts and significantly reduces the burden of in-hospital visits

The MOnitoring Resynchronization dEvices and CARdiac patiEnts (MORE-CARE) randomized controlled trial: phase 1 results on dynamics of early intervention with remote monitoring

Remote monitoring (RM) in patients with advanced heart failure and cardiac resynchronization therapy defibrillators (CRT-D) may reduce delays in clinical decisions by transmitting automatic alerts. However, this strategy has never been tested specifically in this patient population, with alerts for lung fluid overload, and in a European setting