BackgroundThere is a tendency toward nonoperative management of appendicitis resulting in an increasing need for preoperative diagnosis and classification. For medical purposes, simple conceptual decision-making models that can learn are widely used. Decision trees are reliable and effective techniques which provide high classification accuracy. We tested if we could detect appendicitis and differentiate uncomplicated from complicated cases using machine learning algorithms. MethodsWe analyzed all cases admitted between 2010 and 2016 that fell into the following categories: healthy controls (Group 1); sham controls (Group 2); sham disease (Group 3), and acute abdomen (Group 4). The latter group was further divided into four groups: false laparotomy; uncomplicated appendicitis; complicated appendicitis without abscess, and complicated appendicitis with abscess. Patients with comorbidities and whose complete blood count and/or pathology results were lacking were excluded. Data were collected for demographics, preoperative blood analysis, and postoperative diagnosis. Various machine learning algorithms were applied to detect appendicitis patients. ResultsThere were 7244 patients with a mean age of 6.84±5.31 years, of whom 82.3% (5960/7244) were male. Most algorithms tested, especially linear methods, provided similar performance measures. We preferred the decision tree model due to its easier interpretability. With this algorithm, we detected appendicitis patients with 93.97 % area under the curve (AUC), 94.69% accuracy, 93.55% sensitivity, and 96.55% specificity, and uncomplicated appendicitis with 79.47% AUC, 70.83% accuracy, 66.81% sensitivity, and 81.88% specificity. ConclusionsMachine learning is a novel approach to prevent unnecessary operations and decrease the burden of appendicitis both for patients and health systems.
Abstract. We provide a novel proof of the existence of regulator indecomposables in the cycle group CH 2 (X, 1), where X is a sufficiently general product of two elliptic curves. In particular, the nature of our proof provides an illustration of Beilinson rigidity.
Is feeling grateful a different kind of experience than feelings of other positive emotions like pride, awe, or love? Here, we use semantic space theory to test which positive emotional experiences are distinct from each other based on in-depth personal narratives of experiences involving 22 positive emotions (n = 165; 3,592 emotional events). A bottom-up computational analysis was applied to the transcribed text; unsupervised clustering was employed to maximise internal granular consistency (i.e., the clusters being as different as possible from each other while internally as homogenous as possible). The analysis yielded distinct positive emotion experiences, characterised by admiration, amusement, being moved, feeling respected, excitement, hope, interest, lust, positive surprise, pride, sensory pleasure, and tenderness. Applying bottom-up language analysis techniques to rich accounts of emotional experiences reveals that there are at least 12 unique dimensions of positive emotion experience in daily life.
BackgroundThere is a tendency toward nonoperative management of appendicitis resulting in an increasing need for preoperative diagnosis and classification. For medical purposes, simple conceptual decision-making models that can learn are widely used. Decision trees are reliable and effective techniques which provide high classification accuracy. We tested if we could detect appendicitis and differentiate uncomplicated from complicated cases using machine learning algorithms. MethodsWe analyzed all cases admitted between 2010 and 2016 that fell into the following categories: healthy controls (Group 1); sham controls (Group 2); sham disease (Group 3), and acute abdomen (Group 4). The latter group was further divided into four groups: false laparotomy; uncomplicated appendicitis; complicated appendicitis without abscess, and complicated appendicitis with abscess. Patients with comorbidities and whose complete blood count and/or pathology results were lacking were excluded. Data were collected for demographics, preoperative blood analysis, and postoperative diagnosis. Various machine learning algorithms were applied to detect appendicitis patients. ResultsThere were 7244 patients with a mean age of 6.84±5.31 years, of whom 82.3% (5960/7244) were male. Most algorithms tested, especially linear methods, provided similar performance measures. We preferred the decision tree model due to its easier interpretability. With this algorithm, we detected appendicitis patients with 93.97 % area under the curve (AUC), 94.69% accuracy, 93.55% sensitivity, and 96.55% specificity, and uncomplicated appendicitis with 79.47% AUC, 70.83% accuracy, 66.81% sensitivity, and 81.88% specificity. ConclusionsMachine learning is a novel approach to prevent unnecessary operations and decrease the burden of appendicitis both for patients and health systems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.