Research on early risk predictive model and discriminative feature selection of cancer based on real-world routine physical examination data

Author(s):  
Guixia Kang ◽  
Zhuang Ni
Author(s):  
A. M. Bagirov ◽  
A. M. Rubinov ◽  
J. Yearwood

The feature selection problem involves the selection of a subset of features that will be sufficient for the determination of structures or clusters in a given dataset and in making predictions. This chapter presents an algorithm for feature selection, which is based on the methods of optimization. To verify the effectiveness of the proposed algorithm we applied it to a number of publicly available real-world databases. The results of numerical experiments are presented and discussed. These results demonstrate that the algorithm performs well on the datasets considered.


2017 ◽  
Vol 2017 ◽  
pp. 1-18 ◽  
Author(s):  
Andrea Bommert ◽  
Jörg Rahnenführer ◽  
Michel Lang

Finding a good predictive model for a high-dimensional data set can be challenging. For genetic data, it is not only important to find a model with high predictive accuracy, but it is also important that this model uses only few features and that the selection of these features is stable. This is because, in bioinformatics, the models are used not only for prediction but also for drawing biological conclusions which makes the interpretability and reliability of the model crucial. We suggest using three target criteria when fitting a predictive model to a high-dimensional data set: the classification accuracy, the stability of the feature selection, and the number of chosen features. As it is unclear which measure is best for evaluating the stability, we first compare a variety of stability measures. We conclude that the Pearson correlation has the best theoretical and empirical properties. Also, we find that for the stability assessment behaviour it is most important that a measure contains a correction for chance or large numbers of chosen features. Then, we analyse Pareto fronts and conclude that it is possible to find models with a stable selection of few features without losing much predictive accuracy.


1974 ◽  
Vol 8 (2) ◽  
pp. 199-212 ◽  
Author(s):  
Lloyd F. Van Pelt

Routine physical examination of laboratory-housed female rhesus monkeys can reveal lesions of the reproductive tract, and uterine cysts, ovarian cysts, cervical mucocoele, endometriosis, genital tuberculosis, and genital tract involution are briefly described. The examinations are also useful in the early determination of pregnancy, in the selection of females for breeding, and in settling mating priorities. Attention to cycle-to-cycle variation in fertility can lead to improved reproductive performance of the colony.


2012 ◽  
Vol 57 (3) ◽  
pp. 829-835 ◽  
Author(s):  
Z. Głowacz ◽  
J. Kozik

The paper describes a procedure for automatic selection of symptoms accompanying the break in the synchronous motor armature winding coils. This procedure, called the feature selection, leads to choosing from a full set of features describing the problem, such a subset that would allow the best distinguishing between healthy and damaged states. As the features the spectra components amplitudes of the motor current signals were used. The full spectra of current signals are considered as the multidimensional feature spaces and their subspaces are tested. Particular subspaces are chosen with the aid of genetic algorithm and their goodness is tested using Mahalanobis distance measure. The algorithm searches for such a subspaces for which this distance is the greatest. The algorithm is very efficient and, as it was confirmed by research, leads to good results. The proposed technique is successfully applied in many other fields of science and technology, including medical diagnostics.


2021 ◽  
pp. 100572
Author(s):  
Malek Alzaqebah ◽  
Khaoula Briki ◽  
Nashat Alrefai ◽  
Sami Brini ◽  
Sana Jawarneh ◽  
...  

2021 ◽  
Vol 13 (14) ◽  
pp. 2680
Author(s):  
Søren Skaarup Larsen ◽  
Anna B. O. Jensen ◽  
Daniel H. Olesen

GNSS signals arriving at receivers at the surface of the Earth are weak and easily susceptible to interference and jamming. In this paper, the impact of jamming on the reference station in carrier phase-based relative baseline solutions is examined. Several scenarios are investigated in order to assess the robustness of carrier phase-based positioning towards jamming. Among others, these scenarios include a varying baseline length, the use of single- versus dual-frequency observations, and the inclusion of the Galileo and GLONASS constellations to a GPS only solution. The investigations are based on observations recorded at physical reference stations in the Danish TAPAS network during actual jamming incidents, in order to realistically evaluate the impact of real-world jamming on carrier phase-based positioning accuracy. The analyses performed show that, while there are benefits of using observations from several frequencies and constellations in positioning solutions, special care must be taken in solution processing. The selection of which GNSS constellations and observations to include, as well as when they are included, is essential, as blindly adding more jamming-affected observations may lead to worse positioning accuracy.


2021 ◽  
pp. 1-21
Author(s):  
Muhammad Shabir ◽  
Rimsha Mushtaq ◽  
Munazza Naz

In this paper, we focus on two main objectives. Firstly, we define some binary and unary operations on N-soft sets and study their algebraic properties. In unary operations, three different types of complements are studied. We prove De Morgan’s laws concerning top complements and for bottom complements for N-soft sets where N is fixed and provide a counterexample to show that De Morgan’s laws do not hold if we take different N. Then, we study different collections of N-soft sets which become idempotent commutative monoids and consequently show, that, these monoids give rise to hemirings of N-soft sets. Some of these hemirings are turned out as lattices. Finally, we show that the collection of all N-soft sets with full parameter set E and collection of all N-soft sets with parameter subset A are Stone Algebras. The second objective is to integrate the well-known technique of TOPSIS and N-soft set-based mathematical models from the real world. We discuss a hybrid model of multi-criteria decision-making combining the TOPSIS and N-soft sets and present an algorithm with implementation on the selection of the best model of laptop.


2020 ◽  
Vol 8 (3) ◽  
pp. 107-108
Author(s):  
Vera Mahler

The selection of pharmacotherapy for patients with allergic rhinitis aims to control the disease and depends on many factors. Grading of Recommendations Assessment, Development and Evaluation (GRADE) guidelines have considerably improved the treatment of allergic rhinitis. However, there is an increasing trend toward use of real-world evidence to inform clinical practice, especially because randomized controlled trials are often limited with regard to the applicability of results. The Contre les Maladies Chroniques pour un Vieillissement Actif (MACVIA) algorithm has proposed an allergic rhinitis treatment by a consensus group. This simple algorithm can be used to step up or step down allergic rhinitis treatment. Next-generation guidelines for the pharmacologic treatment of allergic rhinitis were developed by using existing GRADE-based guidelines for the disease, real-world evidence provided by mobile technology, and additive studies (allergen chamber studies) to refine the MACVIA algorithm.


2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Weiwei Gu ◽  
Aditya Tandon ◽  
Yong-Yeol Ahn ◽  
Filippo Radicchi

AbstractNetwork embedding is a general-purpose machine learning technique that encodes network structure in vector spaces with tunable dimension. Choosing an appropriate embedding dimension – small enough to be efficient and large enough to be effective – is challenging but necessary to generate embeddings applicable to a multitude of tasks. Existing strategies for the selection of the embedding dimension rely on performance maximization in downstream tasks. Here, we propose a principled method such that all structural information of a network is parsimoniously encoded. The method is validated on various embedding algorithms and a large corpus of real-world networks. The embedding dimension selected by our method in real-world networks suggest that efficient encoding in low-dimensional spaces is usually possible.


Sign in / Sign up

Export Citation Format

Share Document