LPDA: A new classification method based on linear programming.
Ontology highlight
ABSTRACT:
SUBMITTER: Nueda MJ
PROVIDER: S-EPMC9262202 | biostudies-literature | 2022
REPOSITORIES: biostudies-literature
Publications
LPDA: A new classification method based on linear programming.
Nueda María J MJ Gandía Carmen C Molina Mariola D MD
PloS one 20220707 7
The search of separation hyperplanes is an efficient way to find rules with classification purposes. This paper presents an alternative mathematical programming formulation to existing methods to find a discriminant hyperplane. The hyperplane H is found by minimizing the sum of all the distances to the area assigned to the group each individual belongs to. It results in a convex optimization problem for which we find an equivalent linear programming problem. We demonstrate that H exists when the ...[more]
Similar Datasets
Project description:BackgroundA priori analysis of the activity of drugs on the target protein by computational approaches can be useful in narrowing down drug candidates for further experimental tests. Currently, there are a large number of computational methods that predict the activity of drugs on proteins. In this study, we approach the activity prediction problem as a classification problem and, we aim to improve the classification accuracy by introducing an algorithm that combines partial least squares regression with mixed-integer programming based hyper-boxes classification method, where drug molecules are classified as low active or high active regarding their binding activity (IC50 values) on target proteins. We also aim to determine the most significant molecular descriptors for the drug molecules.ResultsWe first apply our approach by analyzing the activities of widely known inhibitor datasets including Acetylcholinesterase (ACHE), Benzodiazepine Receptor (BZR), Dihydrofolate Reductase (DHFR), Cyclooxygenase-2 (COX-2) with known IC50 values. The results at this stage proved that our approach consistently gives better classification accuracies compared to 63 other reported classification methods such as SVM, Naïve Bayes, where we were able to predict the experimentally determined IC50 values with a worst case accuracy of 96%. To further test applicability of this approach we first created dataset for Cytochrome P450 C17 inhibitors and then predicted their activities with 100% accuracy.ConclusionOur results indicate that this approach can be utilized to predict the inhibitory effects of inhibitors based on their molecular descriptors. This approach will not only enhance drug discovery process, but also save time and resources committed.
| S-EPMC2572625 | biostudies-literature
Project description:Cancer is a serious public health concern worldwide and is the leading cause of death. Blood cancer is one of the most dangerous types of cancer. Leukemia is a type of cancer that affects the blood cell and bone marrow. Acute leukemia is a chronic condition that is fatal if left untreated. A timely, reliable, and accurate diagnosis of leukemia at an early stage is critical to treating and preserving patients' lives. There are four types of leukemia, namely acute lymphocytic leukemia, acute myelogenous leukemia, chronic lymphocytic in extracting, and chronic myelogenous leukemia. Recognizing these cancerous development cells is often done via manual analysis of microscopic images. This requires an extraordinarily skilled pathologist. Leukemia symptoms might include lethargy, a lack of energy, a pale complexion, recurrent infections, and easy bleeding or bruising. One of the challenges in this area is identifying subtypes of leukemia for specialized treatment. This Study is carried out to increase the precision of diagnosis to assist in the development of personalized plans for treatment, and improve general leukemia-related healthcare practises. In this research, we used leukemia gene expression data from Curated Microarray Database (CuMiDa). Microarrays are ideal for studying cancer, however, categorizing the expression pattern of microarray information can be challenging. This proposed study uses feature selection methods and machine learning techniques to predict and classify subtypes of leukemia in gene expression data CuMiDa (GSE9476). This research work utilized linear programming (LP) as a machine-learning technique for classification. Linear programming model classifies and predicts the subtypes of leukemia Bone_Marrow_CD34, Bone Marrow, AML, PB, and PBSC CD34. Before using the LP model, we selected 25 features from the given dataset of 22283 features. These 25 significant features were the most distinguishing for classification. The classification accuracy of this work is 98.44%.
| S-EPMC10561850 | biostudies-literature
Project description:SummaryTopology determination is one of the most important intermediate steps toward building the atomic structure of proteins from their medium-resolution cryo-electron microscopy (cryo-EM) map. The main goal in the topology determination is to identify correct matches (i.e. assignment and direction) between secondary structure elements (SSEs) (α-helices and β-sheets) detected in a protein sequence and cryo-EM density map. Despite many recent advances in molecular biology technologies, the problem remains a challenging issue. To overcome the problem, this article proposes a linear programming-based topology determination (LPTD) method to solve the secondary structure topology problem in three-dimensional geometrical space. Through modeling of the protein's sequence with the aid of extracting highly reliable features and a distance-based scoring function, the secondary structure matching problem is transformed into a complete weighted bipartite graph matching problem. Subsequently, an algorithm based on linear programming is developed as a decision-making strategy to extract the true topology (native topology) between all possible topologies. The proposed automatic framework is verified using 12 experimental and 15 simulated α-β proteins. Results demonstrate that LPTD is highly efficient and extremely fast in such a way that for 77% of cases in the dataset, the native topology has been detected in the first rank topology in <2 s. Besides, this method is able to successfully handle large complex proteins with as many as 65 SSEs. Such a large number of SSEs have never been solved with current tools/methods.Availability and implementationThe LPTD package (source code and data) is publicly available at https://github.com/B-Behkamal/LPTD. Moreover, two test samples as well as the instruction of utilizing the graphical user interface have been provided in the shared readme file.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC9306757 | biostudies-literature
Project description:Metaproteomics based on high-throughput tandem mass spectrometry (MS/MS) plays a crucial role in characterizing microbiome functions. The acquired MS/MS data is searched against a protein sequence database to identify peptides, which are then used to infer a list of proteins present in a metaproteome sample. While the problem of protein inference has been well-studied for proteomics of single organisms, it remains a major challenge for metaproteomics of complex microbial communities because of the large number of degenerate peptides shared among homologous proteins in different organisms. This challenge calls for improved discrimination of true protein identifications from false protein identifications given a set of unique and degenerate peptides identified in metaproteomics. MetaLP was developed here for protein inference in metaproteomics using an integrative linear programming method. Taxonomic abundance information extracted from metagenomics shotgun sequencing or 16s rRNA gene amplicon sequencing, was incorporated as prior information in MetaLP. Benchmarking with mock, human gut, soil, and marine microbial communities demonstrated significantly higher numbers of protein identifications by MetaLP than ProteinLP, PeptideProphet, DeepPep, PIPQ, and Sipros Ensemble. In conclusion, MetaLP could substantially improve protein inference for complex metaproteomes by incorporating taxonomic abundance information in a linear programming model.
| S-EPMC9629623 | biostudies-literature
Project description:Train pathing is a typical problem which is to assign the train trips on the sets of rail segments, such as rail tracks and links. This paper focuses on the train pathing problem, determining the paths of the train trips in emergencies. We analyze the influencing factors of train pathing, such as transferring cost, running cost, and social adverse effect cost. With the overall consideration of the segment and station capability constraints, we build the fuzzy linear programming model to solve the train pathing problem. We design the fuzzy membership function to describe the fuzzy coefficients. Furthermore, the contraction-expansion factors are introduced to contract or expand the value ranges of the fuzzy coefficients, coping with the uncertainty of the value range of the fuzzy coefficients. We propose a method based on triangular fuzzy coefficient and transfer the train pathing (fuzzy linear programming model) to a determinate linear model to solve the fuzzy linear programming problem. An emergency is supposed based on the real data of the Beijing-Shanghai Railway. The model in this paper was solved and the computation results prove the availability of the model and efficiency of the algorithm.
| S-EPMC4121284 | biostudies-other
Project description:Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity. Because of integer decision variables, as the problem size increases, the number of possible solutions increases super-linearly thereby leading to a drastic increase in the computational effort. To efficiently solve MILP problems, a "price-based" decomposition and coordination approach is developed to exploit 1. the super-linear reduction of complexity upon the decomposition and 2. the geometric convergence potential inherent to Polyak's stepsizing formula for the fastest coordination possible to obtain near-optimal solutions in a computationally efficient manner. Unlike all previous methods to set stepsizes heuristically by adjusting hyperparameters, the key novel way to obtain stepsizes is purely decision-based: a novel "auxiliary" constraint satisfaction problem is solved, from which the appropriate stepsizes are inferred. Testing results for large-scale Generalized Assignment Problems demonstrate that for the majority of instances, certifiably optimal solutions are obtained. For stochastic job-shop scheduling as well as for pharmaceutical scheduling, computational results demonstrate the two orders of magnitude speedup as compared to Branch-and-Cut. The new method has a major impact on the efficient resolution of complex Mixed-Integer Programming problems arising within a variety of scientific fields.
| S-EPMC9794831 | biostudies-literature
Project description:Collapse risk assessment is an important basis for the prevention and control of geological disasters in mountainous areas. The existing research on collapse hazard is less, and there is still no further advancement in the evaluation of collapse hazard for the traditional indicator assignment method for the diversification of the assignment results of the indicators and the comprehensive evaluation method that cannot consider the ambiguity and randomness of the indicator data at the same time. In this paper, we utilize the respective advantages of the linear programming theory and the cloud model from the prevention and control point of view, and evaluate the collapse samples. Firstly, the weight interval of evaluation index is determined by improved analytic hierarchy process, entropy weight method and coefficient of variation method. Secondly, the linear programming algorithm is used to select the specific weight of each collapse sample when the risk is the largest in the interval. Finally, a comprehensive evaluation model of cloud model is constructed to determine the risk level of collapse. In this paper, 20 collapse samples counted by predecessors in G4217 Wenchuan-Lixian section are taken as research cases. The evaluation results of 20 collapse samples are compared with other evaluation methods and field survey conditions to prove the reliability and rationality of the method. The evaluation results show that 13 of the 20 collapse samples are extremely dangerous, 2 are highly dangerous, 4 are moderately dangerous, and 1 is lowly dangerous. Among them, the extremely dangerous collapse samples account for 65% of the total number of collapses. Compared with other methods, this method is more in line with the actual situation.
| S-EPMC11649075 | biostudies-literature
Project description:The automatic sorting of construction waste (CW) is an essential procedure in the field of CW recycling due to its remarkable efficiency and safety. The classification of CW is the primary task that guides automatic and precise sorting. In our work, a new method of CW classification based on two-level fusion is proposed to promote classification performance. First, statistical histograms are used to obtain global hue information and local oriented gradients, which are called the hue histogram (HH) and histogram of oriented gradients (HOG), respectively. To fuse these visual features, a bag-of-visual-words (BoVW) method is applied to code HOG descriptors in a CW image as a vector, and this process is named B-HOG. Then, based on feature-level fusion, we define a new feature to combine HH and B-HOG, which represent the global and local visual characteristics of an object in a CW image. Furthermore, two base classifiers are used to learn the information from the color feature space and the new feature space. Based on decision-level fusion, we propose a joint decision-making model to combine the decisions from the two base classifiers for the final classification result. Finally, to verify the performance of the proposed method, we collect five types of CW images as the experimental data set and use these images to conduct experiments on three different base classifiers. Moreover, we compare this method with other extant methods. The results demonstrate that our method is effective and feasible.
| S-EPMC9794073 | biostudies-literature
Project description:A large and wide variety of ridge parameter estimators proposed for linear regression models exist in the literature. Actually proposing new ridge parameter estimator lately proving its efficiency on few cases seems endless. However, so far there is no ridge parameter estimator that can serve best for any sample size or any degree of collinearity among regressors. In this study we propose a new robust ridge parameter estimator that serves best for any case assuring that is free of sample size, number of regressors and degree of collinearity. This is in fact realized by choosing three best from enormous number of ridge parameter estimators performing well in different cases in developing the new ridge parameter estimator in a way of search method providing the smallest mean square error values of regression parameters. After that a simulation study is conducted to show that the proposed parameter is robust. In conclusion, it is found that this ridge parameter estimator is promising in any case. Moreover, a recent data set is used as an example for illustration to show that the proposed ridge parameter estimator is performing better.
| S-EPMC9042055 | biostudies-literature
Project description:Consider an underdetermined system of linear equations y = Ax with known y and d x n matrix A. We seek the nonnegative x with the fewest nonzeros satisfying y = Ax. In general, this problem is NP-hard. However, for many matrices A there is a threshold phenomenon: if the sparsest solution is sufficiently sparse, it can be found by linear programming. We explain this by the theory of convex polytopes. Let a(j) denote the jth column of A, 1 < or = j < or = n, let a0 = 0 and P denote the convex hull of the a(j). We say the polytope P is outwardly k-neighborly if every subset of k vertices not including 0 spans a face of P. We show that outward k-neighborliness is equivalent to the statement that, whenever y = Ax has a nonnegative solution with at most k nonzeros, it is the nonnegative solution to y = Ax having minimal sum. We also consider weak neighborliness, where the overwhelming majority of k-sets of a(j)s not containing 0 span a face of P. This implies that most nonnegative vectors x with k nonzeros are uniquely recoverable from y = Ax by linear programming. Numerous corollaries follow by invoking neighborliness results. For example, for most large n by 2n underdetermined systems having a solution with fewer nonzeros than roughly half the number of equations, the sparsest solution can be found by linear programming.
| S-EPMC1172251 | biostudies-literature