scholarly journals Adaptive covariate acquisition for minimizing total cost of classification

2021 ◽  
Author(s):  
Daniel Andrade ◽  
Yuzuru Okajima

AbstractIn some applications, acquiring covariates comes at a cost which is not negligible. For example in the medical domain, in order to classify whether a patient has diabetes or not, measuring glucose tolerance can be expensive. Assuming that the cost of each covariate, and the cost of misclassification can be specified by the user, our goal is to minimize the (expected) total cost of classification, i.e. the cost of misclassification plus the cost of the acquired covariates. We formalize this optimization goal using the (conditional) Bayes risk and describe the optimal solution using a recursive procedure. Since the procedure is computationally infeasible, we consequently introduce two assumptions: (1) the optimal classifier can be represented by a generalized additive model, (2) the optimal sets of covariates are limited to a sequence of sets of increasing size. We show that under these two assumptions, a computationally efficient solution exists. Furthermore, on several medical datasets, we show that the proposed method achieves in most situations the lowest total costs when compared to various previous methods. Finally, we weaken the requirement on the user to specify all misclassification costs by allowing the user to specify the minimally acceptable recall (target recall). Our experiments confirm that the proposed method achieves the target recall while minimizing the false discovery rate and the covariate acquisition costs better than previous methods.


Blood ◽  
2019 ◽  
Vol 134 (Supplement_1) ◽  
pp. 3149-3149
Author(s):  
Pamela Santana ◽  
Ricardo Saad ◽  
Adrielle Kolanian ◽  
Cyntia Fioratti ◽  
Marcela Junqueira ◽  
...  

OBJECTIVES: Multiple myeloma (MM) is the second most common hematological malignancy with several available therapies and an extensive pipeline. A metanalysis comparing pivotal relapsed/refractory (RRMM) studies that assessed DRd, ERd, KRd and IRd showed that DRd had the best PFS results. The goal of this analysis was to compare the cost per progression-free survival (PFS) for each of the comparators from the perspective of the Brazilian private healthcare system. METHODS: We calculated the cost per PFS individually using the most recent available data from follow-up (FUP) studies of the therapies assessed. PFS values were based on POLLUX 3-year FUP (DRd), ENDEAVOR 4-year FUP (ERd), ASPIRE 3-year FUP (KRd) and TOURMALINE-MM1 (IRd). Only drug acquisition costs (with wastage) were considered in the analysis (according to drug label dosage) and were retrieved from the Brazilian official price list (Jul/19). Cost per PFS was calculated by dividing the total cost in the PFS period by time in PFS (in months). Cost in 18 months was assessed because it is the maximum time that carfilzomib is recommended to be used. RESULTS: DRd showed the best PFS result compared with ERd, KRd and IRd (42.0 vs. 19.4, 26.1, 20.6, respectively). Total costs in the period of PFS for each of the comparators were BRL 2.02 million (DRd), BRL 1.29 million (ERd), BRL 1.14 million (KRd) and BRL 0.98 million (IRd). Costs per PFS- were BRL 48,060, BRL 66,343, BRL 43,822, BRL 47,760 and costs in the 18 first months were BRL 1.01 million, BRL 1,13 million, BRL 0.95 million and BRL 0.84 million for DRd, ERd, KRd and IRd, respectively. CONCLUSIONS: DRd showed the best PFS result, however its cost per PFS is the 3rd lowest among the comparators. As costs are directly dependent on PFS, the longer the PFS the higher are the costs. Additionally, daratumumab has continuous usage meanwhile carfilzomib has label recommended usage for just 18 cycles due to toxicity and tolerability-related events. Disclosures Santana: Janssen pharmaceuticals: Employment. Saad:Janssen pharmaceuticals: Employment. Kolanian:Janssen pharmaceuticals: Employment. Fioratti:Janssen pharmaceuticals: Employment. Junqueira:Janssen pharmaceuticals: Employment. Decimoni:Janssen Pharmaceuticals: Employment.



2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.



Author(s):  
Narina Thakur ◽  
Deepti Mehrotra ◽  
Abhay Bansal ◽  
Manju Bala

Objective: Since the adequacy of Learning Objects (LO) is a dynamic concept and changes in its use, needs and evolution, it is important to consider the importance of LO in terms of time to assess its relevance as the main objective of the proposed research. Another goal is to increase the classification accuracy and precision. Methods: With existing IR and ranking algorithms, MAP optimization either does not lead to a comprehensively optimal solution or is expensive and time - consuming. Nevertheless, Support Vector Machine learning competently leads to a globally optimal solution. SVM is a powerful classifier method with its high classification accuracy and the Tilted time window based model is computationally efficient. Results: This paper proposes and implements the LO ranking and retrieval algorithm based on the Tilted Time window and the Support Vector Machine, which uses the merit of both methods. The proposed model is implemented for the NCBI dataset and MAT Lab. Conclusion: The experiments have been carried out on the NCBI dataset, and LO weights are assigned to be relevant and non - relevant for a given user query according to the Tilted Time series and the Cosine similarity score. Results showed that the model proposed has much better accuracy.



Water ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 514
Author(s):  
Leonardo Bayas-Jiménez ◽  
F. Javier Martínez-Solano ◽  
Pedro L. Iglesias-Rey ◽  
Daniel Mora-Melia ◽  
Vicente S. Fuertes-Miquel

A problem for drainage systems managers is the increase in extreme rain events that are increasing in various parts of the world. Their occurrence produces hydraulic overload in the drainage system and consequently floods. Adapting the existing infrastructure to be able to receive extreme rains without generating consequences for cities’ inhabitants has become a necessity. This research shows a new way to improve drainage systems with minimal investment costs, using for this purpose a novel methodology that considers the inclusion of hydraulic control elements in the network, the installation of storm tanks and the replacement of pipes. The presented methodology uses the Storm Water Management Model for the hydraulic analysis of the network and a modified Genetic Algorithm to optimize the network. In this algorithm, called the Pseudo-Genetic Algorithm, the coding of the chromosomes is integral and has been used in previous studies of hydraulic optimization. This work evaluates the cost of the required infrastructure and the damage caused by floods to find the optimal solution. The main conclusion of this study is that the inclusion of hydraulic controls can reduce the cost of network rehabilitation and decrease flood levels.



2021 ◽  
Vol 11 (11) ◽  
pp. 4742
Author(s):  
Tianpei Xu ◽  
Ying Ma ◽  
Kangchul Kim

In recent years, the telecom market has been very competitive. The cost of retaining existing telecom customers is lower than attracting new customers. It is necessary for a telecom company to understand customer churn through customer relationship management (CRM). Therefore, CRM analyzers are required to predict which customers will churn. This study proposes a customer-churn prediction system that uses an ensemble-learning technique consisting of stacking models and soft voting. Xgboost, Logistic regression, Decision tree, and Naïve Bayes machine-learning algorithms are selected to build a stacking model with two levels, and the three outputs of the second level are used for soft voting. Feature construction of the churn dataset includes equidistant grouping of customer behavior features to expand the space of features and discover latent information from the churn dataset. The original and new churn datasets are analyzed in the stacking ensemble model with four evaluation metrics. The experimental results show that the proposed customer churn predictions have accuracies of 96.12% and 98.09% for the original and new churn datasets, respectively. These results are better than state-of-the-art churn recognition systems.



2019 ◽  
Vol 11 (9) ◽  
pp. 2571
Author(s):  
Xujing Zhang ◽  
Lichuan Wang ◽  
Yan Chen

Low-carbon production has become one of the top management objectives for every industry. In garment manufacturing, the material distribution process always generates high carbon emissions. In order to reduce carbon emissions and the number of operators to meet enterprises’ requirements to control the cost of production and protect the environment, the paths of material distribution were analyzed to find the optimal solution. In this paper, the model of material distribution to obtain minimum carbon emissions and vehicles (operators) was established to optimize the multi-target management in three different production lines (multi-line, U-shape two-line, and U-shape three-line), while the workstations were organized in three ways: in the order of processes, in the type of machines, and in the components of garment. The NSGA-II algorithm (non-dominated sorting genetic algorithm-II) was applied to obtain the results of this model. The feasibility of the model and algorithm was verified by the practice of men’s shirts manufacture. It could be found that material distribution of multi-line layout produced the least carbon emissions when the machines were arranged in the group of type.



2016 ◽  
Vol 07 (01) ◽  
pp. 43-58 ◽  
Author(s):  
Yu Li Huang

SummaryPatient access to care and long wait times has been identified as major problems in outpatient delivery systems. These aspects impact medical staff productivity, service quality, clinic efficiency, and health-care cost.This study proposed to redesign existing patient types into scheduling groups so that the total cost of clinic flow and scheduling flexibility was minimized. The optimal scheduling group aimed to improve clinic efficiency and accessibility.The proposed approach used the simulation optimization technique and was demonstrated in a Primary Care physician clinic. Patient type included, emergency/urgent care (ER/UC), follow-up (FU), new patient (NP), office visit (OV), physical exam (PE), and well child care (WCC). One scheduling group was designed for this physician. The approach steps were to collect physician treatment time data for each patient type, form the possible scheduling groups, simulate daily clinic flow and patient appointment requests, calculate costs of clinic flow as well as appointment flexibility, and find the scheduling group that minimized the total cost.The cost of clinic flow was minimized at the scheduling group of four, an 8.3% reduction from the group of one. The four groups were: 1. WCC, 2. OV, 3. FU and ER/UC, and 4. PE and NP. The cost of flexibility was always minimized at the group of one. The total cost was minimized at the group of two. WCC was considered separate and the others were grouped together. The total cost reduction was 1.3% from the group of one.This study provided an alternative method of redesigning patient scheduling groups to address the impact on both clinic flow and appointment accessibility. Balance between them ensured the feasibility to the recognized issues of patient service and access to care. The robustness of the proposed method on the changes of clinic conditions was also discussed.



Author(s):  
Josu Doncel ◽  
Nicolas Gast ◽  
Bruno Gaujal

We analyze a mean field game model of SIR dynamics (Susceptible, Infected, and Recovered) where players choose when to vaccinate. We show that this game admits a unique mean field equilibrium (MFE) that consists in vaccinating at a maximal rate until a given time and then not vaccinating. The vaccination strategy that minimizes the total cost has the same structure as the MFE. We prove that the vaccination period of the MFE is always smaller than the one minimizing the total cost. This implies that, to encourage optimal vaccination behavior, vaccination should always be subsidized. Finally, we provide numerical experiments to study the convergence of the equilibrium when the system is composed by a finite number of agents ( $N$ ) to the MFE. These experiments show that the convergence rate of the cost is $1/N$ and the convergence of the switching curve is monotone.



2021 ◽  
Vol 7 (1) ◽  
pp. 167-173
Author(s):  
Kelvin Riupassa ◽  
Narizma Nova ◽  
Endah Lestari ◽  
Sri Juniarti Azis ◽  
Wahyu Sulistiadi

Background: An ambulance is a vehicle designed to be able to handle emergency patients, provide first aid and carry out intensive care while on the way to a referral hospital. Ambulance operations require a large amount of funds obtained from APBD funds through tariffs that were passed through the DKI Jakarta Governor Regulation five years ago. For this reason, a new tariff is required to adjust to current conditions. Objectives: The purpose of this study is to calculate the unit cost of ambulance services in DKI Jakarta to be a consideration in the tariff setting policy in DKI Jakarta province. Research Metodes: This study uses a quantitative descriptive approach to obtain information about the unit cost of the Jakarta ambulance production unit. The method used is the calculation of real cost using the basis of the causes of costs. This research was conducted at the DKI Jakarta Emergency Ambulance using secondary data on investment costs, operational costs and maintenance costs in 2018. Results: The total cost of emergency ambulance in 2018 is known that the proportion of three cost components, namely operational costs, is 76%, followed by investment costs of 20% and maintenance costs of 3%. The calculation of the total cost of medical evacuation using the double distribution method is Rp. 98,915,016,805.00 divided by the number of medical evacuations in 2018 of 37,564 activities, the unit cost of medical evacuation for the AGD of DKI Jakarta Health Office is Rp. 2,633,215.00 without subsidies. APBD costs, while if the subsidy component is included in the calculation, the unit cost for one trip to the AGD of the Health Office is Rp. 604,071.00. This is still far above the current tariff of Rp. 450.00, so the cost recovery rate (CRR) is still below. 100%. Conclusion: From the three cost components consisting of investment, operational and maintenance costs,the largest proportion was operational costs at 76%. The Cost Recovery Rate has not reached 100% so that the existing rates have not covered the costs incurred.   Keywords: ambulance; price fixing; unit cost



2022 ◽  
Vol 0 (0) ◽  
Author(s):  
Fouzia Amir ◽  
Ali Farajzadeh ◽  
Jehad Alzabut

Abstract Multiobjective optimization is the optimization with several conflicting objective functions. However, it is generally tough to find an optimal solution that satisfies all objectives from a mathematical frame of reference. The main objective of this article is to present an improved proximal method involving quasi-distance for constrained multiobjective optimization problems under the locally Lipschitz condition of the cost function. An instigation to study the proximal method with quasi distances is due to its widespread applications of the quasi distances in computer theory. To study the convergence result, Fritz John’s necessary optimality condition for weak Pareto solution is used. The suitable conditions to guarantee that the cluster points of the generated sequences are Pareto–Clarke critical points are provided.



Sign in / Sign up

Export Citation Format

Share Document