Search results for "Decision Trees"
showing 10 items of 74 documents
An Open-Label Trial of 12-Week Simeprevir plus Peginterferon/Ribavirin (PR) in Treatment-Naïve Patients with Hepatitis C Virus (HCV) Genotype 1 (GT1)
2016
Background: Shortening duration of peginterferon-based HCV treatment reduces associated burden for patients. Primary objectives of this study were to assess the efficacy against the minimally acceptable response rate 12 weeks post-treatment (SVR12) and safety of simeprevir plus PR in treatment-naïve HCV GT1 patients treated for 12 weeks. Additional objectives included the investigation of potential associations of rapid viral response and baseline factors with SVR12. Methods: In this Phase III, open-label study in treatment-naïve HCV GT1 patients with F0-F2 fibrosis, patients with HCV-RNA 12-week regimen. Conclusions: Overall SVR12 rate (66%) was below the target of 80%, indicating that sho…
Risk Analysis of a Fuel Storage Terminal Using HAZOP and FTA
2017
[EN] The size and complexity of industrial chemical plants, together with the nature of the products handled, means that an analysis and control of the risks involved is required. This paper presents a methodology for risk analysis in chemical and allied industries that is based on a combination of HAZard and OPerability analysis (HAZOP) and a quantitative analysis of the most relevant risks through the development of fault trees, fault tree analysis (FTA). Results from FTA allow prioritizing the preventive and corrective measures to minimize the probability of failure. An analysis of a case study is performed; it consists in the terminal for unloading chemical and petroleum products, and t…
A general strategy to determine the congruence between a hierarchical and a non-hierarchical classification
2007
This article is available from: http://www.biomedcentral.com/1471-2105/8/442
[Deciding in conditions of uncertainty: the Delphi method and its use in the formulation of guidelines].
2001
The purpose of this paper is to analyze one of the most powerful tools in the decision-making under conditions of uncertainty, the Delphi method, and to verify the related interest of scientific world, particularly, for formulation of guidelines. The method combines the expert opinion preventing biases due to institutional role, status or dominant personality. In the text we explain the methodology and the steps through which it is possible to realize the consensus; we schematized in a didactic manner all the phases for an operational approach of the reader. The search by the most diffused biomedical database (Medline) individualized 623 citations, 7 of which are guidelines (3 of remarkable…
Evaluation of Risk Parameters in Bone Regeneration Using a Customized Titanium Mesh
2019
PURPOSE The aim of the study was an evaluation of risk factors for an innovative bone regeneration technique using a customized titanium mesh that was tested in a clinical setting. MATERIALS AND METHODS This retrospective study included 65 patients with 70 grafting procedures of osseous defects of the jaws with a customized titanium mesh together with Advanced- and Injectable-Platelet-Rich Fibrin (A- and I-PRF), resorbable membranes, and bone grafting materials. Exposures of the meshes and grafting outcome were analyzed according to a novel classification as (a) punctual and (b) tooth width or complete exposure of the mesh (c). No exposure was stated as (d). RESULTS In 37% of cases, exposur…
Pruning Incremental Linear Model Trees with Approximate Lookahead
2014
Incremental linear model trees with approximate lookahead are fast, but produce overly large trees. This is due to non-optimal splitting decisions boosted by a possibly unlimited number of examples obtained from a data source. To keep the processing speed high and the tree complexity low, appropriate incremental pruning techniques are needed. In this paper, we introduce a pruning technique for the class of incremental linear model trees with approximate lookahead on stationary data sources. Experimental results show that the advantage of approximate lookahead in terms of processing speed can be further improved by producing much smaller and consequently more explanatory, less memory consumi…
Weighted distance-based trees for ranking data
2017
Within the framework of preference rankings, the interest can lie in finding which predictors and which interactions are able to explain the observed preference structures, because preference decisions will usually depend on the characteristics of both the judges and the objects being judged. This work proposes the use of a univariate decision tree for ranking data based on the weighted distances for complete and incomplete rankings, and considers the area under the ROC curve both for pruning and model assessment. Two real and well-known datasets, the SUSHI preference data and the University ranking data, are used to display the performance of the methodology.
A methodology and algorithms for an optimal identification of Tourist Local Systems
2007
In last years, despite the emphasis on the importance of tourism as a leading industry in the development of a country’s economy, there is a lack of criteria and methodologies for the identification, the promotion and the governance of Tourism Local Systems (TLS). Moreover, nowadays an important debate is more and more emerging on the sustainable tourism development which involve three interconnected aspects: environmental, socio-cultural and economic. To this end, in this paper, a rigorous mathematical model is proposed for the optimal identification and dimensioning of TLS. The model here presented consists of a two stage methodology: at first, all the factors that characterize a geograph…
Learning the structure of HMM's through grammatical inference techniques
2002
A technique is described in which all the components of a hidden Markov model are learnt from training speech data. The structure or topology of the model (i.e. the number of states and the actual transitions) is obtained by means of an error-correcting grammatical inference algorithm (ECGI). This structure is then reduced by using an appropriate state pruning criterion. The statistical parameters that are associated with the obtained topology are estimated from the same training data by means of the standard Baum-Welch algorithm. Experimental results showing the applicability of this technique to speech recognition are presented. >
Fuzzified Tree Search in Real Domain Games
2011
Fuzzified game tree search algorithm is based on the idea that the exact game tree evaluation is not required to find the best move. Therefore, pruning techniques may be applied earlier resulting in faster search and greater performance. Applied to an abstract domain, it outperforms the existing ones such as Alpha-Beta, PVS, Negascout, NegaC*, SSS*/ Dual* and MTD(f). In this paper we present experimental results in real domain games, where the proposed algorithm demonstrated 10 percent performance increase over the existing algorithms.