WO2016054031A1 - Predictive test for aggressiveness or indolence of prostate cancer from mass spectrometry of blood-based sample - Google Patents

Predictive test for aggressiveness or indolence of prostate cancer from mass spectrometry of blood-based sample Download PDF

Info

Publication number
WO2016054031A1
WO2016054031A1 PCT/US2015/052927 US2015052927W WO2016054031A1 WO 2016054031 A1 WO2016054031 A1 WO 2016054031A1 US 2015052927 W US2015052927 W US 2015052927W WO 2016054031 A1 WO2016054031 A1 WO 2016054031A1
Authority
WO
WIPO (PCT)
Prior art keywords
prostate cancer
sample
classifier
patients
blood
Prior art date
Application number
PCT/US2015/052927
Other languages
French (fr)
Inventor
Joanna Roder
Heinrich Röder
Carlos Oliveira
Original Assignee
Biodesix, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Biodesix, Inc. filed Critical Biodesix, Inc.
Priority to EP15846544.3A priority Critical patent/EP3201812B1/en
Publication of WO2016054031A1 publication Critical patent/WO2016054031A1/en

Links

Classifications

    • GPHYSICS
    • G16INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16BBIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
    • G16B20/00ICT specially adapted for functional genomics or proteomics, e.g. genotype-phenotype associations
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01NINVESTIGATING OR ANALYSING MATERIALS BY DETERMINING THEIR CHEMICAL OR PHYSICAL PROPERTIES
    • G01N33/00Investigating or analysing materials by specific methods not covered by groups G01N1/00 - G01N31/00
    • G01N33/48Biological material, e.g. blood, urine; Haemocytometers
    • G01N33/50Chemical analysis of biological material, e.g. blood, urine; Testing involving biospecific ligand binding methods; Immunological testing
    • G01N33/53Immunoassay; Biospecific binding assay; Materials therefor
    • G01N33/574Immunoassay; Biospecific binding assay; Materials therefor for cancer
    • G01N33/57407Specifically defined cancers
    • G01N33/57434Specifically defined cancers of prostate
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01NINVESTIGATING OR ANALYSING MATERIALS BY DETERMINING THEIR CHEMICAL OR PHYSICAL PROPERTIES
    • G01N33/00Investigating or analysing materials by specific methods not covered by groups G01N1/00 - G01N31/00
    • G01N33/48Biological material, e.g. blood, urine; Haemocytometers
    • G01N33/50Chemical analysis of biological material, e.g. blood, urine; Testing involving biospecific ligand binding methods; Immunological testing
    • G01N33/68Chemical analysis of biological material, e.g. blood, urine; Testing involving biospecific ligand binding methods; Immunological testing involving proteins, peptides or amino acids
    • G01N33/6803General methods of protein analysis not limited to specific proteins or families of proteins
    • G01N33/6848Methods of protein analysis involving mass spectrometry
    • G01N33/6851Methods of protein analysis involving laser desorption ionisation mass spectrometry
    • GPHYSICS
    • G16INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16BBIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
    • G16B40/00ICT specially adapted for biostatistics; ICT specially adapted for bioinformatics-related machine learning or data mining, e.g. knowledge discovery or pattern finding
    • GPHYSICS
    • G16INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16BBIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
    • G16B40/00ICT specially adapted for biostatistics; ICT specially adapted for bioinformatics-related machine learning or data mining, e.g. knowledge discovery or pattern finding
    • G16B40/10Signal processing, e.g. from mass spectrometry [MS] or from PCR
    • GPHYSICS
    • G16INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16BBIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
    • G16B40/00ICT specially adapted for biostatistics; ICT specially adapted for bioinformatics-related machine learning or data mining, e.g. knowledge discovery or pattern finding
    • G16B40/20Supervised data analysis
    • HELECTRICITY
    • H01ELECTRIC ELEMENTS
    • H01JELECTRIC DISCHARGE TUBES OR DISCHARGE LAMPS
    • H01J49/00Particle spectrometers or separator tubes
    • H01J49/26Mass spectrometers or separator tubes
    • H01J49/34Dynamic spectrometers
    • H01J49/40Time-of-flight spectrometers
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01NINVESTIGATING OR ANALYSING MATERIALS BY DETERMINING THEIR CHEMICAL OR PHYSICAL PROPERTIES
    • G01N2800/00Detection or diagnosis of diseases
    • G01N2800/56Staging of a disease; Further complications associated with the disease
    • HELECTRICITY
    • H01ELECTRIC ELEMENTS
    • H01JELECTRIC DISCHARGE TUBES OR DISCHARGE LAMPS
    • H01J49/00Particle spectrometers or separator tubes
    • H01J49/0027Methods for using particle spectrometers
    • H01J49/0036Step by step routines describing the handling of the data generated during a measurement

Definitions

  • Prostate cancer is a cancer that forms in tissues of the prostate, a gland in the male reproductive system. Prostate cancer usually occurs in older men. More than one million prostate biopsies are performed each year in the United States, leading to over 200,000 prostate cancer diagnoses. Managing the care of these patients is challenging, as the tumors can range from quite indolent to highly aggressive.
  • PSA prostate specific antigen
  • a set of biopsies are taken from different regions of the prostate, using hollow needles. When seen through a microscope, the biopsies may exhibit five different patterns (numbered from 1 to 5), according to the distribution/shape/lack of cells and glands.
  • a pathologist decides what the dominant pattern is (Primary Gleason Score) and the next-most frequent pattern (Secondary Gleason Score). The Primary and Secondary scores are then summed up and a Total Gleason Score (TGS) is obtained, ranging from 2 to 10. As the TGS increases the prognosis worsens.
  • TGS Total Gleason Score
  • Patients with Gleason score of 8 or higher are classified as high risk and are typically scheduled for immediate treatment, such as radical prostatectomy, radiation therapy and/or systemic androgen therapy.
  • Patients with Gleason score of 7 are placed in an intermediate risk category, while patients with Gleason score of 6 or lower are classified as low or very low risk.
  • Patients diagnosed with very low, low, and intermediate risk prostate cancer are assigned to watchful waiting, an active surveillance protocol. For these patients, levels of serum PSA are monitored and repeat biopsies maybe ordered every 1-4 years. However, despite low baseline PSA and favorable biopsy results, some patients defined as low risk do experience rapid progression. These patients, especially in the younger age group, would benefit from early intervention.
  • a method for predicting the aggressiveness or indolence of prostate cancer in a patient previously diagnosed with prostate cancer includes the steps of: obtaining a blood-based sample from the prostate cancer patient; conducting mass spectrometry of the blood-based sample with a mass spectrometer and thereby obtaining mass spectral data including intensity values at a multitude of m/z features in a spectrum produced by the mass spectrometer, and performing pre-processing operations on the mass spectral data, such as for example background subtraction, normalization and alignment.
  • the method continues with a step of classifying the sample with a programmed computer implementing a classifier.
  • the classifier is defined from one or more master classifiers generated as combination of filtered mini-classifiers with regularization.
  • the classifier operates on the intensity values of the spectra obtained from the sample after the preprocessing operations have been performed and a set of stored values of m/z features from a constitutive set of mass spectra.
  • constitutive set of mass spectra we use the term "constitutive set of mass spectra" to mean a set of feature values of mass spectral data which are used in the construction and application of a classifier.
  • the final classifier produces a class label for the blood based sample of High, Early, or the equivalent, signifying the patient is at high risk of early progression of the prostate cancer indicating aggressiveness of the prostate cancer, or Low, Late or the equivalent, signifying that the patient is at low risk of early progression of the prostate cancer indicating indolence of the cancer.
  • the mini-classifiers execute a K-nearest neighbor classification (k-NN) algorithm on features selected from a list of features set forth in Example 1 Appendix A, Example 2 Appendix A, or Example 3 Appendix A.
  • the mini-classifiers could alternatively execute another supervised classification algorithm, such as decision tree, support vector machine or other.
  • the master classifiers are generated by conducting logistic regression with extreme drop-out on mini-classifiers which meet predefined filtering criteria.
  • a system for prostate cancer aggressiveness or indolence prediction includes a computer system including a memory storing a final classifier defined as a majority vote of a plurality of master classifiers, a set of mass spectrometry feature values, subsets of which serve as reference sets for the mini-classifiers, a classification algorithm (e.g., k-NN), and a set of logistic regression weighting coefficients defining one or more master classifiers generated from mini-classifiers with regularization.
  • the computer system includes program code for executing the master classifier on a set of mass spectrometry feature values obtained from mass spectrometry of a blood-based sample of a human with prostate cancer.
  • a laboratory test system for conducting a test on a blood- based sample from a prostate cancer patient to predict aggressiveness or indolence of the prostate cancer.
  • the system includes, in combination, a mass spectrometer conducting mass spectrometry of the blood-based sample thereby obtaining mass spectral data including intensity values at a multitude of m/z features in a spectrum produced by the mass spectrometer, and a programmed computer including code for performing preprocessing operations on the mass spectral data and classifying the sample with a final classifier defined by one or more master classifiers generated as a combination of filtered mini-classifiers with regularization.
  • the final classifier operates on the intensity values of the spectra from a sample after the pre-processing operations have been performed and a set of stored values of m/z features from a constitutive set of mass spectra.
  • the programmed computer produces a class label for the blood-based sample of High, Early or the equivalent, signifying the patient is at high risk of early progression of the prostate cancer indicating aggressiveness of the prostate cancer, or Low, Late or the equivalent, signifying that the patient is at low risk of early progression of the prostate cancer indicating indolence of the cancer.
  • a programmed computer operating as a classifier for predicting prostate cancer aggressiveness or indolence includes a processing unit and a memory storing a final classifier in the form of a set of feature values for a set of mass spectrometry features forming a constitutive set of mass spectra obtained from blood-based samples of prostate cancer patients, and a final classifier defined as a majority vote or average probability cutoff, of a multitude of master classifiers constructed from a combination of mini-classifiers with dropout regularization.
  • the mass spectrum of the blood-based sample is obtained from at least 100,000 laser shots in MALDI-TOF mass spectrometry, e.g., using the techniques described in the patent application of H. Roder et al., U.S. Serial No. 13/836,436 filed March 15, 2013, the content of which is incorporated by reference herein.
  • Figure 1 is a flow chart showing a classifier generation process referred to herein as combination of mini-classifiers with drop-out (CMC/D) which was used in generation of the classifiers of Examples 1 , 2 and 3.
  • Figures 2A-2C are plots of the distribution of the performance metrics among the master classifiers (MCs) for Approach 1 of Example 1.
  • Figures 3A-3C are plots of the distribution of the performance metrics among the MCs for Approach 2 of Example 1.
  • Figures 4A-4L are plots of the distribution of the performance metrics among the obtained MCs for approach 2 of Example 1 when flipping labels. Each row of plots corresponds to a sequential iteration of loop 1 142 in the classification development process of Figure 1.
  • Figures 5A-5C are t-Distributed Stochastic Neighbor Embedding (t-SNE) 2D maps of the development sample set labeled according to the initial assignment of group labels for the development sample set in Approach 1 of Example ( Figure 5A); an initial assignment for Approach 2 of Example ( Figure 5B); and final classification labels after 3 iterations of label flips (Approach 3 of Example l)( Figure 5C).
  • t-SNE Stochastic Neighbor Embedding
  • Figure 6 is a plot of the distribution of the times on study for patients in Example 2 leaving the study early without a progression event.
  • Figure 7 is a plot of Kaplan-Meier curves for time to progression (TTP) using the modified majority vote (MMV) classification labels obtained by a final classifier in Approach 1 of Example 2.
  • Figure 9 is a plot of the Kaplan-Meier curves for TTP using the MMV classification labels obtained in Approach 2 of Example 2.
  • Figure 10 is a plot of the distribution of Cox Hazard Ratios of the individual 301 master classifiers (MCs) created in Approach 2 of Example 2.
  • Figures 1 1 A-l 1 C are plots of the distribution of the performance metrics among the MCs in Approach 2 of Example 2.
  • Figure 12 are Kaplan-Meier curves for TTP obtained using the MMV classification labels after each iteration of label flips (using Approach 2 of Example 2 as the starting point) in the classifier development process of Figure 1. The log-rank p-value and the log-rank Hazard Ratio (together with its 95% Confidence Interval) are also shown for each iteration.
  • Figure 13 are t-Distributed Stochastic Neighbor Embedding (t-SNE) two dimensional maps of the classifier development data set, labeled according to (left) the initial assignment for the group labels in the training set and (right) the final classification labels, for each of three approaches to classifier development used in Example 2.
  • Figure 14 is a plot of Kaplan-Meier curves for TTP using classification labels obtained in approach 2 of Example 2 and including the patients of the "validation set" cohort. For the patients that were used in the test/training splits the MMV label is taken. For the "validation set” patients, the normal majority vote of all the 301 MCs is used. The log-rank p- value is 0.025 and the log-rank Hazard Ratio 2.95 with a 95% CI of [1.13,5.83]. A table showing the percent progression free for each classified risk group at 3, 4 and 5 years on study is also shown.
  • Figure 15 are Box and Whisker plots of the distribution of the PSA baseline levels (taken at the beginning of the study) of the two classification groups in Approach 2 of Example 2.
  • the MMV label is taken.
  • the "validation set” patients the normal majority vote of all the 301 MCs is used. The plot takes into account only the 1 19 patients (from the development and "validation" sample sets), for whom baseline PSA levels were available.
  • Figure 16 is a plot of the distribution of the Total Gleason Score (TGS) values of the two classification groups (using Approach 2 of Example 2). For the patients that were used in the test/training splits the MMV label is taken. For the "validation set” patients, the normal majority vote of all the 301 MCs is used. Only the 133 patients (from the development and validation sets) for whom TGSs were available are considered in this plot.
  • TGS Total Gleason Score
  • Figure 17 is a box and whisker plot showing normalization scalars for spectra for Relapse and No Relapse patient groups in Example 3.
  • Figure 18 is a plot of a multitude of mass spectra showing example feature definitions; i.e., m/z ranges over which integrated intensity values are calculated to give feature values for use in classification.
  • Figure 19 is a box and whisker plot showing normalization scalars found by partial ion current normalization analysis comparison between clinical groups Relapse and No Relapse.
  • Figures 20A and 20B are Kaplan-Meier plots for time to relapse (TTR) by Early and Late classification groups, showing the performance of the classifiers generated in Example 3.
  • TTR time to relapse
  • Figure 20A shows the classifier performance for Approach (1) of Example 3, which uses only mass spectral data for classification
  • Figure 20B shows classifier performance for Approach (2) of Example 3, which uses non-mass spectral information, including patient's age, PSA and % fPSA, in addition to the mass spectral data.
  • Figure 21 is an illustration of a testing process and system for conducting a test on a blood-based sample of a prostate cancer patient to predict indolence or aggressiveness of the cancer.
  • a programmed computer is described below which implements a classifier for predicting from mass spectrometry data obtained from a blood-based sample from a prostate cancer patient whether the cancer is aggressive or indolent.
  • the method for development of this classifier will be explained in three separate Examples using three different sets of prostate cancer blood-based samples.
  • the classifier development process referred to herein as "CMC/D" (combination of mini-classifiers with dropout) incorporates the techniques which are disclosed in US application serial no. 14/486,442 filed September 15, 2014, the content of which is incorporated by reference herein.
  • the pertinent details of the classifier development process are described in this document in conjunction with Figure 1.
  • a testing system which may be implemented in a laboratory test center including a mass spectrometer and the programmed computer, is also described later on in conjunction with Figure 21.
  • Example 1 Classifier Development from Oregon Data Set
  • Example 1 we will describe the generation of a classifier to predict prostate cancer aggressiveness or indolence from a set of prostate cancer patient data in the form of blood-based samples obtained from prostate cancer patients and associated clinical data.
  • This Example will describe the process we used for generating mass spectrometry data, preprocessing steps which were performed on the mass spectra, and the specific steps we used in development of a classifier from the set of data.
  • This set of data is referred to as the "development set” 1 100 of Figure 1.
  • the patients included in this data set all had prostate biopsies and an evaluation of their Gleason Scores made (distributed according to Table 1 ). 18 of them were classified as low risk, 28 as intermediate risk and 29 as high risk, according to existing guidelines.
  • Serum samples were available from 79 patients diagnosed with prostate cancer. Mass Spectral Data Acquisition
  • Spectra of nominal 2,000 shots were collected on a MALDI-TOF mass spectrometer using acquisition settings we used in the commercially available VeriStrat test of the assignee Biodesix, Inc., see U.S. Patent 7,736,905, the details of which are not particularly important. Spectra could not be acquired from two samples.
  • the data set consists originally of 237 spectra corresponding to 79 patients (3 replicates per patient). The spectra of 4 patients were not used for the study:
  • Table 1 Distribution of the patients included in this analysis according to their primary and secondary Gleason Score combinations
  • the background was estimated and then subtracted. Peaks passing a SNR threshold of 6 were identified.
  • the raw spectra (no background subtraction) were aligned using a subset of 15 peaks (Table 2) to correct for slight differences in mass divided by charge (m/z) scale between replicate spectra.
  • the aligned spectra were averaged resulting in a single average spectrum for each patient. With the exception of alignment, no other preprocessing was performed on the spectra prior to averaging.
  • Table 4 Features used in the final PIC normalization. For further details on the feature ranges see Example 1 Appendix A.
  • Step 1 102 Definition of Initial Groups
  • Step 1 108 Select training and test sets
  • the development set 1 100 is split in step 1 108 into test and training sets, shown in Figure 1 as 1 1 10 and 1 1 12.
  • the training set group 1 1 12 was then subject to the CMC/D classifier development process shown in steps 1 120, 1 126 and 1 130 and the master classifier generated at step 1 130 was evaluated by classifying those samples which were assigned to the test set group 1 1 10 and comparing the resulting labels with the initial ones.
  • Step 1 120 Creation of Mini-Classifiers
  • Many k-nearest neighbor (kNN) mini-classifiers (mCs) that use the training set as their reference set are constructed using single features or pairs of features from the 84 mass spectral features identified (1 124), and listed in Example 1 Appendix A.
  • kNN k-nearest neighbor
  • mCs mini-classifiers
  • samples are spotted in triplicate on a MALDI-TOF sample plate and a 2,000 shot spectrum is acquired from each spot. The three replicate spectra are aligned and averaged to yield one average spectrum per sample.
  • Each mini-classifier is created using the known k-NN algorithm and either a single feature or a pair of features from feature space 1 122.
  • Step 1 126 Filtering of mini-classifiers
  • Step 1 130 and 1 132 Generation of Master Classifier (MC) by combination of mini- classifiers using logistic regression with dropout (CMC/D)
  • a master classifier is generated in step 1 130.
  • the mCs are combined in one master classifier (MC) using a logistic regression trained using the training set labels as indicated at 1 132.
  • the regression is regularized using extreme drop out. A total of 5 randomly selected mCs are included in each logistic regression iteration and the weights for the mCs averaged over 6,000 dropout iterations.
  • Neural networks regularized by drop-out Neural networks regularized by drop-out (Nitishshrivastava, "Improving Neural Networh with Dropout", Master's Thesis, graduate Department of Computer Science, University of Toronto; available at online from the Computer Science department of the University of Toronto).
  • step 1 132 the result of each mini-classifier is one of two values, either "Low” or "High”.
  • logistic regression to combine the results of the mini-classifiers in the spirit of a logistic regression by defining the probability of obtaining a "Low” via standard logistic regression (see e.g.
  • I(mc(feature values)) 1 , if the mini-classifier mc applied to the feature values of a sample returns "Low”, and 0 if the mini-classifier returns "High”.
  • the weights w mc are unknown and need to be determined from a regression fit of the above formula for all samples in the training set using 1 for the left hand side of the formula for the Low-labeled samples in the training set, and 0 for the High-labeled samples, respectively.
  • Step 1 134 Evaluate Master Classifier performance
  • the MC created at step 1 130 is then evaluated by performing classification on the test set 1 1 10 and evaluating the results.
  • Methods of evaluating classifier performance are described in US Serial no. 14/486,442 filed September 15, 2014 and include, among others, the distribution of Hazard Ratios, overall accuracy, sensitivity and specificity.
  • Step 1 136 Loop over many Training/Test set splits
  • step 1 136 the process loops back to step 1 108 and a new separation of the development set 1 100 into training and test sets is performed and the steps 1 120, 1 126, 1 130 and 1 132 are performed on a new random realization of the training set and test set split.
  • the use of multiple training/test splits avoids selection of a single, particularly advantageous or difficult, training set for classifier creation and avoids bias in performance assessment from testing on a test set that could be especially easy or difficult to classify.
  • Step 1 137 analyze data from the training/test set splits
  • the MC performance over all the training and test set splits is performed. This can be done by obtaining performance characteristics of the MCs and their classification results, for example as indicated in block 1 138.
  • Step 1 140 Redefine training labels
  • One other advantage of these multiple training/test splits is that it allows for the refinement of the initial assignment for the "High'V'Low” groups, particularly for those samples which are persistently misclassified.
  • the resulting classifications for the sample can be obtained by the majority vote of the MCs (or by a Modified Majority Vote, MMV, explained below). If the sample persistently misclassifies relative to the initial guess as to the risk group, the sample can be moved from the "High” into the "Low” group, or vice versa, as indicated in loop 1 142.
  • Iteration 1 The labels of the patients for which the classification MMV Label (from approach 2) was mismatching the initial classification group assignment (for 9 patients from the "High” group and 1 8 patients from the "Low” group) were flipped and a new CMC/D iteration was run. After label flipping, 37 patients were defined as belonging to the "Low” group and 38 to the "High” group. The 301 test/training splits took randomly 15 patients from each group and assigned them to the training set, while leaving the remaining patients in the test set.
  • Iteration 2 The labels of the patients for which the classification MMV Label was mismatching the classification from Iteration 1 (3 patients from the "High” group and 4 patients from the “Low” group) were flipped and a new CMC/D iteration was run. After label flipping, 36 patients were defined as belonging to the "Low” group and 39 to the "High” group. The 301 test/training splits took randomly 15 patients from each group and assigned them to the training set, while leaving the remaining patients in the test set. Iteration 3: The labels of the patients for which the classification MMV Label was mismatching the classification from Iteration 2 (1 patient from the "High” group and 2 patients from the "Low” group) were flipped and a new CMC/D iteration was run. After label flipping, 35 patients were defined as belonging to the "Low” group and 40 to the "High” group. The 301 test/training splits took randomly 15 patients from each group and assigned them to the training set, while leaving the remaining patients in the test set.
  • Step 1 144 Define final test/classifier
  • a final classifier is defined from one or more of the master classifiers (MCs) generated in the previous iterations of the process.
  • MCs master classifiers
  • the final classifier is created from 301 MCs (301 different realizations of the training/test set split) by taking a majority vote over the MCs.
  • each training/test split realization produces one master classifier (MC) generated from the combination of mini-classifiers (mCs) through logistic regression with dropout regularization.
  • the output of this logistic regression is, in the first instance, not a binary label but a continuous probability taking values between 0 and 1.
  • Applying a cutoff e.g. 0.5, but any choice is possible
  • a cutoff e.g. 0.5, but any choice is possible
  • each MC produces a classification label for a given sample.
  • this step is not essential, and one can choose not to apply a cutoff here, but instead to retain the information in the continuous probability variable.
  • MMV modified majority vote
  • the MMV produces another, averaged, continuous variable that can take values between 0 and 1 , an average probability of being in a particular class.
  • This can be converted into a binary classification label via implementation of a cutoff after averaging over MCs.
  • Direct averaging of the probabilities provides some advantages. If we obtain an average probability for each sample, it is possible to assess simultaneously the performance of the whole family of classifiers that can be produced by imposing different cutoffs on the average probability. This can be done by using the standard receiver operating characteristic (ROC) curve approach, a well-known method.
  • ROC receiver operating characteristic
  • classification labels are generated for all samples and these labels can be compared with the known or initially defined class labels to calculate the sensitivity and specificity of the classifier defined by this cutoff. This can be carried out for many values of the cutoff and the results plotted in terms of sensitivity versus 1 -specificity (the ROC curve).
  • Overall performance of the family of classifiers can be characterized by the area under the curve (AUC).
  • AUC area under the curve
  • the ROC curve can be inspected and a particular cutoff selected that best suits the target performance desired for the classifier, in terms of sensitivity and specificity.
  • Table 6 Distribution of the classification labels, obtained after 3 iterations of label flips, according to the different Primary + Secondary Gleason Scores combinations
  • Table 7 Contingency table showing the frequency distribution according to the initial assignment and the final classification labels achieved after 3 iterations of label flipping.
  • t-Distributed Stochastic Neighbor Embedding is a tool that allows the visualization of high-dimensional data in a 2D or 3D-map, capturing much of the local structure of the data while also revealing global structure (e.g., the presence of clusters at several scales).
  • the method converts high-dimensional Euclidean distances between data points into Gaussian similarities.
  • the same process is applied using a Student-t distribution instead of a Gaussian distribution to compute the similarity between pairs of points. Then, iteratively, the method searches for a low- dimensional representation of the original data set that minimizes the mismatch between the similarities computed in the high- and low-dimensional spaces.
  • a 2D or a 3D point map is constructed that allows the visualization and identification of structure in a given dataset and may possibly guide research.
  • the method is introduced by the paper of L.J. P. van der Maaten and G.E. Hinton, Visualizing High-Dimensional Data Using t-SNE, Journal of Machine Learning Research 9 (Nov): 2579-2605 (2008), the content of which is incorporated by reference herein.
  • the accuracies do not seem to be great, the only available clinical variable (the TGS) is also not a perfect method of risk assessment, and it might be that a study including more clinical data that allows the assessment of outcomes might reveal better performances. Better quality mass spectra, from which more features may be extracted, would also represent a good addition to any new data set.
  • step 1 146 of validation of the test defined at step 1 144 on an internal validation set if available, and a step 1 148 of validation of the test on an independent sample set.
  • step 1 148 of validation of the test on an independent sample set.
  • This example involves the analysis of MALDI-TOF mass spectra obtained from plasma samples from patients diagnosed with prostate cancer. All the patients that comprise the data set had their Total Gleason Score (TGS) evaluated as being lower than 8. This range of TGS is considered to be associated with low progression risk and thus these patients are not treated immediately, but instead put in watchful waiting.
  • TGS Total Gleason Score
  • the aim of the work described in this Example was to develop a classifier capable of evaluating the aggressiveness or indolence of the prostate cancer of a patient put in watchful waiting (TGS ⁇ 8).
  • TGS ⁇ 8 watchful waiting
  • the patients had periodic physician visits (quarterly), having blood samples drawn and their disease status assessed.
  • Evidence of progression could be based on the rate of rise in PSA, Chromogramin A or alkaline phosphatase. Progression could also be detected based on a degradation of patient's symptoms. In case of progression, the patient followed a treatment plan and was dropped from the study.
  • a classifier that could be run at the moment of the cancer diagnosis and could give a good prognostic indication would be a valuable addition to the monitoring of PSA level or other biomarkers as an aid to more refined treatment guidance for this group of patients following diagnosis.
  • TTP Time to Progression
  • Table 8 Distribution of the patients according to their outcome and TGS
  • the background was estimated and subtracted. Peaks passing a SNR threshold of 6 were identified.
  • the raw spectra (no background subtraction) were aligned using a subset of 15 peaks (Table 2 above) to correct for slight differences in m/z scale between replicate spectra.
  • the aligned spectra were averaged resulting in a single average spectrum for each patient. With the exception of alignment, no other preprocessing was performed on the spectra prior to averaging.
  • Example 2 Appendix A Further details on partial ion current normalization of mass spectral data are known in the art and therefore omitted for the sake of brevity, see U.S. patent 7,736,905 for further details.
  • Classifier development process Basically, the classifier development process of Figure 1 and described in detail above was used for generation of a new CMC/D classifier using the Arizona data set.
  • Approach 3 We tried an iterative label flip process (loop 1 142), starting with the group definitions of Approach 2 in order to verify if such method would lead to improved discrimination in terms of outcome data (i.e., better Hazard Ratio for time to progression between High and Low risk groups).
  • the development set 1 100 is split into training (1 1 12) and test sets (1 1 10).
  • kNN k-nearest neighbor mini-classifiers
  • Table 1 1 Summary of mC filtering options used Generation of MC by combination of mini-classifiers using logistic regression with dropout (CMC/D) (steps 1 130, 1 132)
  • the mCs are combined in one master classifier (MC) using a logistic regression trained with the training set labels. To help avoid over-fitting, the regression is regularized using extreme drop out. A total of 5 randomly selected mCs are included in each logistic regression iteration and the weights for the mCs averaged over 10,000 dropout iterations.
  • MC master classifier
  • Training/Test splits and analysis of master classifier performance (step 1 136)
  • the use of multiple training/test splits in loop 1 136 avoids selection of a single, particularly advantageous or difficult, training set for classifier creation and avoids bias in performance assessment from testing on a test set that could be especially easy or difficult to classify. Accordingly, loop 1 136 was taken 301 times in Example 2, resulting in 301 different master classifiers (MCs), one per loop.
  • MCs master classifiers
  • a final classifier is defined at step 1 144 from the 301 MCs by taking a majority vote over the MCs. For each approach above this process is described in more detail:
  • the MMV label is obtained. If the sample persistently misclassifies relative to the initial guess as to the risk group, the sample can be moved from the "High” into the “Low” group, or vice versa. Carrying out this procedure for all samples in the development set produces a new, possibly refined version of the group label definitions (1 102) which are the starting point for a second iteration of the CMC/D process. This refinement process can be iterated so that the risk groups are determined at the same time as a classifier is constructed, in an iterative way.
  • Iteration 1 The labels of the patients for which the classification MMV Label (from approach 2) was mismatching the initial guess (9 patients from the "High” group and 1 1 patients from the “Low” group) were flipped and a new CMC/D iteration (steps 1 102, 1 108, 1 120, 1 126, 1 130, 1 134, 1 136) was run. After this label flipping, 53 patients were classified as belonging to the "High” group and 38 to the "Low” group. The 301 test/training splits randomly took 18 patients from the "High” group and 19 from the "Low” group to the training set, while leaving the remaining patients in the test set.
  • Iteration 2 The labels of 6 patients from the "High” group and 1 patient from the "Low” group, whose MMV label didn't match the initial guess were flipped and a new CMC/D iteration was run. After label flipping, 48 patients were classified as belonging to the "High” group and 43 to the "Low” group. The 301 test/training splits randomly took 24 patients from the "High” group and 22 from the “Low” to the training set, while leaving the remaining patients in the test set.
  • Iteration 3 The labels of 5 patients from the "High” group and 1 patient from the “Low” group were flipped and a new CMC/D iteration was run. After label flipping, 44 patients were classified as belonging to the "High” group and 47 to the “Low” group. The 301 test/training splits randomly took 22 patients from the “High” group and 24 from the “Low” group to the training set, while leaving the remaining patients in the test set. Results (Example 2)
  • the final CMC/D classifier defined at step 1 144 as a MMV over all the 301 master classifiers using "Approach 1" above, is characterized in terms of patient outcome by the Kaplan- Meier survival curve shown in Figure 7.
  • the curve is obtained by comparing the groups defined by the samples that were classified with "High” or “Low” MMV labels and the associated time to progression (TTP) from the clinical data associated with the development sample set 1 100.
  • TTP time to progression
  • the log-rank test gives a p-value of 0.51 and the log-rank Hazard Ratio (HR) is 1.34 with a 95% Confidence Interval (CI) of 0.56 - 3.14.
  • HR log-rank Hazard Ratio
  • CI Confidence Interval
  • the final CMC/D classifier obtained for "approach 2" is characterized by the Kaplan-Meier curves shown in Figure 9.
  • the log-rank test gives a p-value of 0.037 and the log-rank Hazard Ratio (HR) is 2.74 with a 95% Confidence Interval (CI) of 1.05 - 5.49.
  • the distribution of the HRs of the 301 MCs is shown in Figure 10 and shows a "well behaved" shape, with a very small fraction of the MCs having a HR ratio lower than 1.
  • the percent progression free for each classified risk group at 3, 4 and 5 years after study entry is shown in the following table 12:
  • t-SNE Visualization t-Distributed Stochastic Neighbor Embedding
  • Figure 13 shows the 2D maps of the data obtained through t-SNE for the initial assignment of group labels for the development set and for the final classification labels, for each of approaches 1 , 2 and 3 described above. Each point is represented with a marker that identifies to which risk label it was assigned ("High” or "Low”). Note that the t-SNE map for the final classification in each of the approaches is more ordered with clustering of the high and low classification labels as compared to the maps of the initial assignments.
  • Figure 14 shows the Kaplan-Meier curves for TTP using classification labels obtained in Approach 2 and including the classification of the patients of the "validation set". For the patients that were used in the test/training splits the MMV label is taken. For the "validation set” patients, the normal majority vote of all the 301 MCs is used.
  • the log-rank p-value is 0.025 and the log-rank Hazard Ratio 2.95 with a 95% CI of [1.13,5.83].
  • a table showing the percent progression free for each classified risk group at 3, 4 and 5 years on study is also shown in Figure 14. Again, like Figure 9 and 12, the Kaplan-Meier plot of TTP in Figure 14 shows clear separation of the High and Low groups.
  • Figure 15 are Box and Whisker plots of the distribution of the PSA baseline levels (taken at the beginning of the study) of the two classification groups (approach 2).
  • the MMV label is taken.
  • the normal majority vote of all the 301 MCs is used.
  • the median PSA of the "High” group is 6.15 ng/ml and that of the "Low” group is 7.42 ng/ml.
  • the performance of the CMC/D classifiers was evaluated in terms of the hazard ratio between the two classification groups ("High” risk and “Low” risk) using the outcome data (inferred Time to Progression) available in the data set, as well as in terms of overall accuracy, sensitivity and specificity in terms of predicting a progression within the time of the study.
  • the best classifier (from Approach 2) is characterized by a hazard ratio of 2.74 with a 95% CI of 1.05 - 5.49, indicating a significantly better prognosis for patients assigned to the "Low” risk group.
  • Our data hint at a better effect size than two commercially available sets: 1. Genomic Health, see Klein, A.E., et al. A 17-gene Assay to Predict Prostate Cancer Aggressiveness in the Context of Gleason Grade Heterogeneity, Tumor Multifocality, and Biopsy Undersampling Euro Urol 66, 550-560 (2014), Odds Ratio — 2.1— 2.3 , in the correct population, but might be because they only have TGS ⁇ 6; and 2.
  • a third example of a method for generating a classifier for predicting aggressiveness or indolence of prostate cancer from a multitude of blood-based samples obtained from prostate cancer patients will be described in this section.
  • the methodology of classifier generation is similar to that described above in Examples 1 and 2, see Figure 1.
  • mass spectral data from the samples using a method we refer to as "Deep MALDI”, see US patent application publication 2013/0320203 of H. Roder et al., inventors.
  • the description of mass spectral acquisition and spectral data processing set forth in the '203 application publication is incorporated by reference. Additionally, there were some differences in the patient population and course of treatment in this data set as compared to the sets of Examples 1 and 2. Nevertheless, in this section we describe several classifiers that we developed which can be used to predict aggressiveness or indolence of prostate cancer.
  • Example 3 The aim of the study of Example 3 was to develop a blood-based test for prognosis in patients with detected prostate cancer classified as low risk based on Gleason scores obtained from diagnostic biopsy.
  • test for prognosis is used to interchangeably with a test for whether the patient's prostate cancer is indolent or aggressive, as explained previously in this document.
  • Previous work on plasma samples obtained from a cohort of patients in a "watchful waiting" protocol (Example 2, "low risk” patients with Gleason scores of 7 or lower assigned to a protocol of monitoring rather than immediate radical prostatectomy (RPE)) had shown the potential for such a blood test with clinical relevant performance, as explained in Examples 1 and 2 above.
  • Serum samples from prostate cancer patients enrolled in the. TPCSDP study were prowled and used in this project, FOE classifier development only patients were considered who underwent biopsy and RPE within a year of the sample collection. Thus, at the time the patients' Mood samples were taken the patients had been diagnosed with prostate cancer but had not yet undergone RPE. in addition, generated mass spectra of the serum samples had to pass quality controls, and clinical data (outcome as well as PSA, %fPSA, and age) had to be available. This left a total of 124 samples for classifier development. The clinical characteristics of the development set of samples are summarized in table 13. All the samples were obtained from prostate cancer patients who, at the time the sample was obtained, had a total Gleason score of 6 or lower.
  • test sample serum from patients with prostate cancer
  • quality control serum a pooled sample obtained from serum of five healthy patients, purchased from ProMedDx, "SerumP3"
  • the cards were allowed to dry for 1 hour at ambient temperature after which the whole serum spot was punched out with a 6mm skin biopsy punch (Acuderm).
  • Each punch was placed in a centrifugal filter with 0.45 ⁇ ⁇ ⁇ nylon membrane (VWR).
  • VWR 0.45 ⁇ ⁇ ⁇ nylon membrane
  • JT Baker HPLC grade water
  • the punches were vortexed gently for 10 minutes then spun down at 14,000 rcf for 2 minutes.
  • the flow-through was removed and transferred back on to the punch for a second round of extraction.
  • the punches were vortexed gently for 3 minutes then spun down at 14,000 rcf for 2 minutes.
  • Twenty microliters of the filtrate from each sample was then transferred to a 0.5 ml eppendorf tube for MALDI analysis. All subsequent sample preparation steps were carried out in a custom designed humidity and temperature control chamber (Coy Laboratory). The temperature was set to 30 °C and the relative humidity at 10%.
  • MALDI spectra were obtained using a MALDI-TOF mass spectrometer (SimulTOF 100 from Virgin Instruments, Sudbury, MA, USA). The instrument was set to operate in positive ion mode, with ions generated using a 349 nm, diode-pumped, frequency-tripled Nd:YLF laser operated at a laser repetition rate of 0.5 kHz. External calibration was performed using a mixture of standard proteins (Bruker Daltonics, Germany) consisting of insulin (m/z 5734.51), ubiquitin (m/z 8565.76 ), cytochrome C (m/z 12360.97), and myoglobin (m/z 16952.30).
  • Spectra from each MALDI spot were collected as 800 shot spectra that were 'hardware averaged' as the laser fires continuously across the spot while the stage is moving at a speed of 0.25 mm/sec.
  • a minimum intensity threshold of 0.01 V was used to discard any 'flat line' spectra. All 800 shot spectra with intensity above this threshold were acquired without any further processing.
  • the spectral acquisition used a raster scanning method which is described in U.S. patent application publication 2013/0320203 of H. Roder et al., inventors.
  • a coarse alignment step was performed to overcome shifts in the m/z grid resulting from instrument calibration. As the instrument is recalibrated prior to batch acquisition, rescaling was performed independently by batch. An m/z grid shift factor was determined for each batch by comparing peaks in the first acquired reference spectrum to a historical reference spectrum. The m/z grid from the historical reference was applied to the newly acquired spectra with the calculated shift.
  • This workflow performs a ripple filter, as it was observed that using this procedure improved the resulting averages in terms of noise.
  • the spectra were then background subtracted and peaks were found in order to perform alignment.
  • the spectra that were used in averaging were the aligned ripple filtered spectra without any other preprocessing.
  • the calibration step used a set of 43 alignment points listed below in table 14. Additional filtering parameters required that the spectra had at least 20 peaks and that at least 5 of the alignment points were used in alignment.
  • Averages were created from the pool of rescaled, aligned and filtered raster spectra. We collected multiple 800 shot spectra per spot, so that we end up with a pool in excess of 500 in number of 800 shot raster spectra from the 8 spots from each sample. We randomly select 500 from this pool, which we average together to create a final 400,000 shot average deep MALDI spectrum. Pre-Processing of Averaged Spectra Background estimation and subtraction
  • Normalization of spectra A normalization scalar was determined for each spectrum using a set of normalization windows. These windows were taken from the bin method parameters from a pre-existing project using Deep-MALDI. While a new set of windows was investigated for this Example dataset, a superior set was not found.
  • the normalization was performed in a two stage process. First, the spectra were normalized using the windows found in table 16. Following, the spectra were normalized using the windows found in table 1 7.
  • the peak alignment of the average spectra is typically very good; however, a fine- tune alignment step was performed to address minor differences in peak positions in the spectra.
  • a set of alignment points was identified and applied to the analysis spectra (table 18).
  • Feature definitions i.e., selection of features or m/z ranges to use for classification
  • the left and right boundaries were assigned manually using an overlay of many spectra.
  • the process was performed iteratively over batches to ensure that the boundaries and features were representative of the whole dataset.
  • a final iteration was performed using the class labels assigned to the spectra of 'Relapse' and 'No Relapse' to ensure selected features were appropriately assigned considering these clinical groupings.
  • a total of 329 features were identified to use in the new classifier development project.
  • Example 3 Appendix A table Al
  • a feature table is created by computing the integrated intensity value of the spectra over each of the features listed in the Example 3 Appendix A table Al .
  • A min (abs (l-ftrvall/ftrval2), abs (l-ftrval2/ftrvall)) where ftrvall (ftrval2) is the value of a feature for the first (second) replicate of the replicate pair.
  • This quantity A gives a measure of how similar the replicates of the pair are.
  • A is reported. If the value is >0.5, then the feature is determined to be discordant, or 'Bad'. A tally of the bad features is reported for each possible combination. If the value of A is ⁇ 0.1 , then the feature is determined to be concordant and reported as 'Good'. A tally of the Good features is reported for each possible combination.
  • Batch 1 was used as the baseline batch to correct all other batches.
  • the reference sample was used to find the correction coefficients for each of the batches 2-6 by the following procedure. Within each batch j (2 ⁇ j ⁇ 6), the ratio and the average amplitude t
  • Example 3 Appendix B (table B. l ).
  • the next step is to correct, for all the samples, all the features (with amplitude A at (m/z)) according to
  • Partial ion current normalization of spectra is known in the art, see e.g., U.S. patent 7,736,905, therefore a detailed description is omitted for the sake of brevity.
  • the feature table was finalized for use in the classifier development process described below. That is, integrated intensity values of the features selected for classification was computed and stored in a table for each of the spectra in the development set.
  • the Serum P3 samples were analyzed across all batches in the initial feature table and following the PIC normalization. Prior to batch correction, the median and average CVs were 14.2% and 17.5% respectively. Following batch correction and the final normalization, the median and average CVs for the SerumP3 samples were 13.7% and 17.4%. These modest improvements reflect the relatively small role of batch correction in the processing of data and demonstrate that little variability is introduced across batches.
  • Classifier development for Example 3 The new classifier development process was carried out using the platform/methodology shown in Figure 1 , and described previously at some length, which we have termed "Diagnostic Cortex"TM .
  • the methodology of Figure 1 is particularly useful for constructing a classifier and building a prognostic test where it is not a priori obvious which patients should be assigned to the better or worse prognosis groups (Low and High Risk, or Early and Late relapse/progression, respectively in Figure 1 , blocks 1 104 and 1 106).
  • the risk of overfitting to the data is minimized by regularization (step 1 132) and the use of majority voting or average probability cutoff in the selection or definition of the final classifier at step 1 144.
  • Confidence in performance metrics for a classifier generated by the method of Figure 1 is enhanced by the observation of many master classifiers (MCs) with similarly good performance and the use of out-of-bag estimates for performance metrics.
  • MCs master classifiers
  • an initial class label assignment is made for each of the samples in the development set 1 100, in this example the 124 blood-based samples that passed QC filtering and for which patient clinical data was available.
  • the correct class label for each sample either Low Risk or High Risk (or, equivalently, Late or Early, respectively), with Low Risk or the equivalent signifying good prognosis, indolence, and late progression of disease and High Risk or the equivalent signifying relatively poor prognosis, aggressiveness of the prostate cancer, and early progression of disease.
  • Time-to-event data in this case time from sample collection to relapse after RJPE was used for assigning the initial class label and classifier training.
  • the method uses an iterative method to refine class labels at the same time as creating the classifier. See loop 1 142.
  • An initial guess is made for the class labels at step 1 102.
  • the samples are sorted on time to relapse and half of the samples with the lowest time-to-event outcome are assigned the "Early" class label (early relapse, i.e. poor outcome, high risk) while the other half are assigned the "Late” class label (late relapse, i.e. good outcome, low risk).
  • a classifier is then constructed using the outcome data and these class labels.
  • This classifier can then be used to generate classifications for all of the development set samples and these are then used as the new class labels for a second iteration of the classifier construction step. This process is iterated until convergence (i.e., the number of persistently misclassified samples is minimized at step 1 140 after multiple iterations through the process of Figure 1 including loop 1 142).
  • the development set samples 1 100 were split into training and test sets in multiple different random realizations. See Step 1 108, Figure 1 and loop 1 136. Six hundred and twenty five realizations (iterations through loop 1 136) were used.
  • step 1 120 many k-nearest neighbor (kNN) mini-classifiers (mCs) that use the training set as their reference set were constructed using subsets of features.
  • kNN k-nearest neighbor
  • mCs mini-classifiers
  • this project we tried two different approaches in terms of the nature of features used by the mini-classifiers. In approach (1), see description below, we used only mass spectral features while in approach (2), see description below, in addition to those mass spectral features, we also used age, PSA and % fPSA as features for classification by the mini-classifiers.
  • Example 3 Appendix A To be able to consider subsets of single, two, or three features and improve classifier performance, it was necessary to deselect features that were not useful for classification from the set of 329 features of Example 3 Appendix A. Feature deselection was carried out using the bagged method outlined in Example 3 Appendix C. In the case of approach (2), age, PSA and % fPSA did not pass the filtering criteria of the bagged method more times than the applied threshold, but we kept these three features for classifier training nevertheless. The methodology of deselection of features is disclosed in U.S. provisional application of J. Roder et al., serial no. 62/154,844 filed April 30, 2015, the contents of which is incorporated by reference herein.
  • these mCs are filtered at step 1 126.
  • Each mC is applied to its training set and performance metrics are calculated from the resulting classifications of the training set. Only mCs that satisfy thresholds on these performance metrics pass filtering to be used further in the process. The mCs that fail filtering are discarded.
  • hazard ratio filtering was used, i.e. the classifier was applied to the training set of samples and the hazard ratio calculated between the time to relapse for the two classification groups had to lie within a preset range for the mC to pass filtering.
  • the filtering options used in this project are listed in table 20
  • iteration means an exercise of classifier generation using the through the loop 1 142 of Figure 1 with “iteration 0" referring to an initial iteration through the process, "iteration 1" referring to a second iteration, etc.
  • parameters for the classifier generation process such as for example filtering parameters for the mini-classifiers, the number of features used by the mini- classifiers, or inclusion of additional non-mass spectral features for classification such as PSA level, age, etc.
  • step 1 130 the mini-classifiers are combined into one master classifier using logistic regression trained using the training set labels as indicated 1 132 in Figure 1.
  • the number of dropout iterations in step 1 132 was selected based on the typical number of mCs passing filtering to ensure that each mC was likely to be included within the drop out process multiple times. For this project 10 mCs were randomly selected for each drop out iteration. The number of drop out iterations that were carried out in each iteration are listed in table 21.
  • Training/test set splits (loop 1 136) The use of multiple training/test splits (loop 1 136) and evaluation of Master
  • Classifier (MC) performance on the new test set in each iteration) avoids selection of a single, particularly advantageous or difficult, training set for classifier creation and avoids bias in performance assessment from testing on a test set that could be especially easy or difficult to classify.
  • the output of the logistic regression performed at step 1 132 that defines each MC is a probability of being in one of the two training classes (Early or Late).
  • classifications were assigned by majority vote of the individual MC labels obtained with a cutoff of 0.5 applied to the logistic regression output. This process was modified to incorporate only MCs where the sample was not in the training set (modified, or "out-of-bag" majority vote, MMV).
  • Table 23 Percent relapse free for each classification risk group at 3, 4 and 5 years after sample collection
  • Table 25 Clinical characteristics by classification group
  • test classification remains a significant predictor of TTR and is the only available significantly predictive factor of TTR in multivariate analysis. While there is an indication that patients with higher TGS from RPE tend to be assigned an Early classification (5/6 patients with TGS 8 from RPE are classified as Early), larger sample numbers would be required to demonstrate this conclusively.
  • the next step in the development of this potentially clinically useful test is to validate the current results in an independent cohort of patients in a similar indication. (See Figure 1 step 1 148). This is planned using an additional sample set collected from patients in the TPCSDP.
  • Example 2 (cohort of patients on watchful waiting with TGS of 7 or lower) at five years after sample collection, 88% of patients were progression-free in the good prognosis group compared with 69% of patients in the poor prognosis group, and the hazard ratio for time to progression between good and poor prognosis groups was 2.95 (95% CI: 1.13-5.83).
  • the indication was similar (low risk prostate cancer with Gleason score of 6 or below); however, in this present cohort all patients underwent RPE soon after diagnosis.
  • Example 3 it would seem that clinical utility of the test in Example 3 may lie more in the prediction of outcomes following diagnosis of prostate cancer with Gleason score from biopsy of 6 or lower in an active surveillance setting, than in prediction of outcomes following RPE in this population.
  • the test could indicate which patients in this "low risk" setting are really good candidates for active surveillance/watchful waiting and which patients should go straight on to more aggressive treatment regimens such as immediate RPE. Acquiring a set of serum samples from an active surveillance population to test performance of this test in that setting is therefore an important next step. As explained above, one might expect an even better separation in outcomes between classification groups in the active surveillance setting.
  • test is prognostic of relapse following RPE, it could be useful to predict prognosis of patients with higher risk prostate cancer who undergo immediate RPE. Presumably the test should still have some predictive power for time to relapse even in the setting of patients with higher biopsy Gleason scores and it may be able to provide additional information to physicians trying to assess how aggressive a patient's prostate cancer is prior to RPE and possibly indicate the need for additional supportive therapies.
  • a classifier for predicting indolence or aggressiveness of prostate cancer After a classifier for predicting indolence or aggressiveness of prostate cancer has been generated and defined as explained in Examples 1 -3 (including specifying the feature table with intensity values, final classifier definition, mini-classifier parameters including filtering etc.), it is now ready for use to classify a blood-based sample from a prostate cancer patient to assign a class label for the sample as either Early (high risk of relapse/aggressive) or Late (low risk/indolence).
  • the class label is provided to the medical practitioner ordering the test.
  • the class label can be used to guide treatment, for example initiating more aggressive treatment if the class label is Early or the equivalent.
  • Figure 21 is an illustration of a system for processing a test sample (in this example a blood-based sample from a prostate cancer patient) using a classifier generated in accordance with Figure 1.
  • the system includes a mass spectrometer 2106 and a general purpose computer 21 10 implementing a final classifier 2120 coded as machine-readable instructions and a constitutive mass spectral data set including a feature table 2122 of class-labeled mass spectrometry data stored in memory 21 14.
  • the mass spectrometer 2106 and computer 21 10 of Figure 21 could be used to generate the classifier in accordance with the classifier development process of Figure 1 .
  • the operation of the system of Figure 21 will be described in the context of a predictive test for indolence or aggressiveness of prostate cancer as explained in the above Examples, but it will be appreciated that the methodology described in this section can be used in other examples.
  • the system of Figure 21 obtains a multitude of samples 2100, e.g., blood-based samples (serum or plasma) from diverse prostate cancer patients.
  • the samples 2100 are used by the classifier (implemented in the computer 21 10) to make predictions as to whether the patient providing the sample is likely to have aggressive or indolent prostate cancer, and typically will be have just been diagnosed with "low risk" prostate cancer (TGS ⁇ 7) with the physician deciding whether watchful waiting/active surveillance is an appropriate treatment protocol or maybe in an indication ready to undergo RPE and the physician may require additional prognostic information to plan additional supportive therapy post RPE.
  • the outcome of the test is a binary class label, such as Low Risk, Low, Late, or the equivalent, or High Risk, High, Early or the equivalent, with Low or the equivalent indicating that the patient is likely to have an indolent form of the cancer and High meaning that the patient is likely to have an aggressive form of the cancer.
  • the particularly moniker for the class label is not important and could be in accordance any binary system.
  • the samples may be obtained on serum cards or the like in which the blood-based sample is blotted onto a cellulose or other type card.
  • the obtaining of the mass spectra and the pre-processing of the spectra will normally follow the methods used in generating the classifier in accordance with Figure 1 and described in the Examples.
  • three aliquots of the sample are obtained. The three aliquots of the sample are spotted onto a MALDI-ToF sample "plate" 2102 and the plate inserted into a MALDI-ToF mass spectrometer 2106.
  • the mass spectrometer 2106 acquires a mass spectrum 2108 from each of the three aliquots of the sample.
  • the mass spectra are represented in digital form and supplied to a programmed general purpose computer 21 10.
  • the computer 21 10 includes a central processing unit 21 12 executing programmed instructions.
  • the memory 21 14 stores the data representing the mass spectra 2108.
  • the memory 21 14 also stores a final classifier 2120 defined as per the procedure of Figure at step 1 144, which includes a) a constitutive mass spectral data set 2122 in the form of a feature table of N class-labeled spectra, where N is some integer number, in this example a development set used to develop the classifier as explained in Examples 1 -3.
  • a final classifier 2120 defined as per the procedure of Figure at step 1 144, which includes a) a constitutive mass spectral data set 2122 in the form of a feature table of N class-labeled spectra, where N is some integer number, in this example a development set used to develop the classifier as explained in Examples 1 -3.
  • the final classifier 2120 includes b) code 2124 representing a KNN classification algorithm (which is implemented in the mini-classifiers as explained above in Figure 1 , as well as values defining the parameters of the mini-classifiers such as features to use, etc.), c) program code 2126 for executing the final classifier generated in accordance with Figure 1 on the mass spectra of patients, including logistic regression weights and data representing master classifier(s) forming the final classifier, and d) a data structure 2128 for storing classification results, including a final class label for the test sample.
  • code 2124 representing a KNN classification algorithm (which is implemented in the mini-classifiers as explained above in Figure 1 , as well as values defining the parameters of the mini-classifiers such as features to use, etc.)
  • program code 2126 for executing the final classifier generated in accordance with Figure 1 on the mass spectra of patients, including logistic regression weights and data representing master classifier(s) forming the final classifier
  • a data structure 2128 for
  • the memory 21 14 also stores program code 2130 for implementing the processing shown at 2150, including code (not shown) for acquiring the mass spectral data from the mass spectrometer in step 2152; a pre-processing routine 2132 for implementing the background subtraction, normalization and alignment step 2154 (details explained above), a module (not shown) for calculating integrated intensity values at predefined m/Z positions in the background subtracted, normalized and aligned spectrum (step 2156), and a code routine 2138 for implementing the final classifier 2120 using the dataset 2122 on the values obtained at step 2156.
  • the process 2158 produces a class label at step 2160.
  • the module 2140 reports the class label as indicated at 2160 (i.e., "low", "Late” or the equivalent).
  • the program code 2130 can include additional and optional modules, for example a feature correction function code 2136 (described in co-pending US patent application serial no. 14/486,442) for correcting fluctuations in performance of the mass spectrometer, a set of routines for processing the spectrum from a reference sample to define a feature correction function, a module storing feature dependent noise characteristics and generating noisy feature value realizations and classifying such noisy feature value realizations, modules storing statistical algorithms for obtaining statistical data on the performance of the classifier on the noisy feature value realizations, or modules to combine class labels defined from multiple individual replicate testing of a sample to produce a single class label for that sample. Still other optional software modules could be included as will be apparent to persons skilled in the art.
  • the system of Figure 21 can be implemented as a laboratory test processing center obtaining a multitude of patient samples from oncologists, patients, clinics, etc., and generating a class label for the patient samples as a fee-for-service.
  • the mass spectrometer 2106 need not be physically located at the laboratory test center but rather the computer 21 10 could obtain the data representing the mass spectra of the test sample over a computer network.
  • Example 3 it is possible to obtain much more spectral information from the samples used in generation of the classifier using the techniques termed "Deep- MALDI" described in the pending application of Roder et al., serial no. 13/836,436 filed March 15, 2013, the content of which is incorporated by reference herein.
  • Deep- MALDI the techniques termed "Deep- MALDI” described in the pending application of Roder et al., serial no. 13/836,436 filed March 15, 2013, the content of which is incorporated by reference herein.
  • more than 100,000 laser shots, and potentially hundreds of thousands or even millions of laser shots are applied to the MALDI plate spot containing the sample (or as a sum from shots on several such MALDI plate spots).
  • This technique produces a vastly increased amount of spectral information than obtained from typical 2,000 shot "dilute and shoot” spectra.
  • the data set of class-labeled spectra used in generating the classifier (and in particular a feature table of intensity values at particular m/z ranges) is stored and then used as a reference set for classification using the testing procedure of Figure 21.
  • this "constitutive set" of spectra is obtained from blood-based samples of humans diagnosed with prostate cancer and includes patients both with indolent cancer and with aggressive cancer. This constitutive set can consist of spectra from all of the samples in a classifier development sample set (1 100) or some subset thereof.
  • Example 1 Appendix B Samples from the Oregon Prostate Cancer data set used Classifier Development
  • Example 1 Appendix C MMV labels attributed to each patient after 3 label flips
  • Appendix B Samples from the Oregon Prostate Cancer data set used in Classifier Development
  • Figure C.1 shows an example of the distribution of how many features pass filtering in how many subset realizations.
  • Figure C.1 Number of features passing filtering for a given number of subset realizations f y axis ⁇ vs. the number of subset realizations. ⁇ Red iirse shows the cut off for which features were deselected for that specific iteration)

Abstract

A programmed computer functioning as a classifier operates on mass spectral data obtained from a blood-based patient sample to predict indolence or aggressiveness of prostate cancer. Methods of generating the classifier and conducting a test on a blood-based sample from a prostate cancer patient using the classifier are described.

Description

Predictive test for aggressiveness or indolence of prostate cancer from mass
spectrometry of blood-based sample
Related Application
This application claims priority benefits to U.S. provisional application serial no. 62/058,792 filed October 2, 2014, the content of which is incorporated by reference herein.
This application is related to U.S. application serial no. 14/486,442 filed September 15, 2014, of H. Roder et al., U.S. patent application publication no. 2015/0102216, assigned to the assignee of the present invention. The content of the '442 application is incorporated by reference herein. The '442 application is not admitted to depict prior art.
Background
Prostate cancer is a cancer that forms in tissues of the prostate, a gland in the male reproductive system. Prostate cancer usually occurs in older men. More than one million prostate biopsies are performed each year in the United States, leading to over 200,000 prostate cancer diagnoses. Managing the care of these patients is challenging, as the tumors can range from quite indolent to highly aggressive.
Current practice is to stratify patients according to risk based on serum prostate specific antigen (PSA) measurements, TNM staging, and Gleason score. High baseline PSA (PSA>20 ng/ml) is taken as a signal of increased risk of aggressive disease and indicates immediate therapeutic intervention. TNM staging of T3a or worse, including metastatic disease, places the patient in the high risk category, whereas a staging of Tl to T2a is required for the patient to be classified as low or very low risk.
In order to have the Gleason score evaluated, a set of biopsies are taken from different regions of the prostate, using hollow needles. When seen through a microscope, the biopsies may exhibit five different patterns (numbered from 1 to 5), according to the distribution/shape/lack of cells and glands. A pathologist decides what the dominant pattern is (Primary Gleason Score) and the next-most frequent pattern (Secondary Gleason Score). The Primary and Secondary scores are then summed up and a Total Gleason Score (TGS) is obtained, ranging from 2 to 10. As the TGS increases the prognosis worsens. Patients with Gleason score of 8 or higher are classified as high risk and are typically scheduled for immediate treatment, such as radical prostatectomy, radiation therapy and/or systemic androgen therapy. Patients with Gleason score of 7 are placed in an intermediate risk category, while patients with Gleason score of 6 or lower are classified as low or very low risk. Patients diagnosed with very low, low, and intermediate risk prostate cancer are assigned to watchful waiting, an active surveillance protocol. For these patients, levels of serum PSA are monitored and repeat biopsies maybe ordered every 1-4 years. However, despite low baseline PSA and favorable biopsy results, some patients defined as low risk do experience rapid progression. These patients, especially in the younger age group, would benefit from early intervention. Bill-Axelson, A. et al. Radical prostatectomy versus watchful waiting in early prostate cancer. N Engl J Med 364, 1708-17 (201 1). Improved identification of prostate cancer patients who in fact have poor prognosis and need to be actively treated is of significant clinical importance.
Investigations into various biomarkers which may help in this indication are ongoing. While measurement of total PSA remains one of the most widely accepted tests for prostate cancer diagnostics, a lot of research is focused on finding additional circulating biomarkers of prognosis of the course of the disease. Several alternative types of PSA measurements, such as percentage of free PSA (% fPSA) and PSA kinetics have been evaluated most extensively. Observed % fPSA seems to be a significant predictor of time to treatment in patients in active surveillance, while PSA velocity and PSA doubling time results are often inconsistent. Trock, B.J. Circulating biomarkers for discriminating indolent from aggressive disease in prostate cancer active surveillance. Curr Opin Urol 24, 293-302 (2014); Cary, K.C. & Cooperberg, M.R. Biomarkers in prostate cancer surveillance and screening: past, present, and future. Ther Adv Urol 5, 318-29 (2013). Another test based on calculating the Prostate Health Index using measurements of [-2]proPSA (a truncated PSA isoform), fPSA and total PSA, has shown promising results. See the Trock paper, supra. Several studies evaluated potential biomarkers in urine, such as prostate cancer antigen3 (PCA3) and fusion gene TMPRSS2-EGR, though the results were contradictory. Id. In addition, there are several recent tissue based tests employing gene expression profiles, such as Oncotype DX Prostate Cancer Assay (Genomic health) see Klein, A.E., et al. A 17-gene Assay to Predict Prostate Cancer Aggressiveness in the Context of Gleason Grade Heterogeneity, Tumor Multifocality, and Biopsy Undersampling, Euro Urol 66, 550-560 (2014) and the Prolans assay (Myriad Genetics), see Cooperberg, M.R., et al. Validation of a Cell-Cycle Progression Gene Panel to Improve Risk Stratification in a Contemporary Prostatectomy Cohort, J Clin Oncol 31 , 1428- 1434 (2013), which are associated with the risk of disease progression (see Sartori, D.A. & Chan, D.W. Biomarkers in prostate cancer: -what's new? Curr Opin Oncol 26, 259-64 (2014)) however they require an invasive procedure. Though the results on a number of biomarkers are promising, most are in early stages of validation and none of them has yet been shown to reliably predict the course of the disease. Thus, there is an unmet need for non-invasive clinical tests that would improve risk discrimination of prostate cancer in order to help select appropriate candidates for watchful waiting and identify men who need an immediate active treatment. The methods and systems of this invention meet that need.
Other prior art of interest includes US patents 8,440,409 and 7,81 1 ,772, and U.S. patent application publication 2009/0208921. The assignee of the present invention has several patents disclosing classifiers for predictive tests using mass spectrometry data including, among others, U.S. 7,736,905; 8,718,996 and 7,906,342.
Summary
In a first aspect, a method for predicting the aggressiveness or indolence of prostate cancer in a patient previously diagnosed with prostate cancer is disclosed. The method includes the steps of: obtaining a blood-based sample from the prostate cancer patient; conducting mass spectrometry of the blood-based sample with a mass spectrometer and thereby obtaining mass spectral data including intensity values at a multitude of m/z features in a spectrum produced by the mass spectrometer, and performing pre-processing operations on the mass spectral data, such as for example background subtraction, normalization and alignment. The method continues with a step of classifying the sample with a programmed computer implementing a classifier.
In preferred embodiments the classifier is defined from one or more master classifiers generated as combination of filtered mini-classifiers with regularization. The classifier operates on the intensity values of the spectra obtained from the sample after the preprocessing operations have been performed and a set of stored values of m/z features from a constitutive set of mass spectra. In this document we use the term "constitutive set of mass spectra" to mean a set of feature values of mass spectral data which are used in the construction and application of a classifier. The final classifier produces a class label for the blood based sample of High, Early, or the equivalent, signifying the patient is at high risk of early progression of the prostate cancer indicating aggressiveness of the prostate cancer, or Low, Late or the equivalent, signifying that the patient is at low risk of early progression of the prostate cancer indicating indolence of the cancer.
In one embodiment, in which the classifier is defined from one or more master classifiers generated as a combination of filtered mini-classifiers with regularization, the mini-classifiers execute a K-nearest neighbor classification (k-NN) algorithm on features selected from a list of features set forth in Example 1 Appendix A, Example 2 Appendix A, or Example 3 Appendix A. The mini-classifiers could alternatively execute another supervised classification algorithm, such as decision tree, support vector machine or other. In one embodiment, the master classifiers are generated by conducting logistic regression with extreme drop-out on mini-classifiers which meet predefined filtering criteria.
In another aspect, a system for prostate cancer aggressiveness or indolence prediction is disclosed. The system includes a computer system including a memory storing a final classifier defined as a majority vote of a plurality of master classifiers, a set of mass spectrometry feature values, subsets of which serve as reference sets for the mini-classifiers, a classification algorithm (e.g., k-NN), and a set of logistic regression weighting coefficients defining one or more master classifiers generated from mini-classifiers with regularization. The computer system includes program code for executing the master classifier on a set of mass spectrometry feature values obtained from mass spectrometry of a blood-based sample of a human with prostate cancer. In still another example, a laboratory test system for conducting a test on a blood- based sample from a prostate cancer patient to predict aggressiveness or indolence of the prostate cancer is disclosed. The system includes, in combination, a mass spectrometer conducting mass spectrometry of the blood-based sample thereby obtaining mass spectral data including intensity values at a multitude of m/z features in a spectrum produced by the mass spectrometer, and a programmed computer including code for performing preprocessing operations on the mass spectral data and classifying the sample with a final classifier defined by one or more master classifiers generated as a combination of filtered mini-classifiers with regularization. The final classifier operates on the intensity values of the spectra from a sample after the pre-processing operations have been performed and a set of stored values of m/z features from a constitutive set of mass spectra. The programmed computer produces a class label for the blood-based sample of High, Early or the equivalent, signifying the patient is at high risk of early progression of the prostate cancer indicating aggressiveness of the prostate cancer, or Low, Late or the equivalent, signifying that the patient is at low risk of early progression of the prostate cancer indicating indolence of the cancer.
In yet another aspect, a programmed computer operating as a classifier for predicting prostate cancer aggressiveness or indolence is described. The programmed computer includes a processing unit and a memory storing a final classifier in the form of a set of feature values for a set of mass spectrometry features forming a constitutive set of mass spectra obtained from blood-based samples of prostate cancer patients, and a final classifier defined as a majority vote or average probability cutoff, of a multitude of master classifiers constructed from a combination of mini-classifiers with dropout regularization.
In one possible embodiment, the mass spectrum of the blood-based sample is obtained from at least 100,000 laser shots in MALDI-TOF mass spectrometry, e.g., using the techniques described in the patent application of H. Roder et al., U.S. Serial No. 13/836,436 filed March 15, 2013, the content of which is incorporated by reference herein.
Brief Description of the Drawings
Figure 1 is a flow chart showing a classifier generation process referred to herein as combination of mini-classifiers with drop-out (CMC/D) which was used in generation of the classifiers of Examples 1 , 2 and 3. Figures 2A-2C are plots of the distribution of the performance metrics among the master classifiers (MCs) for Approach 1 of Example 1.
Figures 3A-3C are plots of the distribution of the performance metrics among the MCs for Approach 2 of Example 1.
Figures 4A-4L are plots of the distribution of the performance metrics among the obtained MCs for approach 2 of Example 1 when flipping labels. Each row of plots corresponds to a sequential iteration of loop 1 142 in the classification development process of Figure 1.
Figures 5A-5C are t-Distributed Stochastic Neighbor Embedding (t-SNE) 2D maps of the development sample set labeled according to the initial assignment of group labels for the development sample set in Approach 1 of Example (Figure 5A); an initial assignment for Approach 2 of Example (Figure 5B); and final classification labels after 3 iterations of label flips (Approach 3 of Example l)(Figure 5C). "1" (triangles) corresponds to "High" and "0" (circles) to "Low" group label assignments.
Figure 6 is a plot of the distribution of the times on study for patients in Example 2 leaving the study early without a progression event.
Figure 7 is a plot of Kaplan-Meier curves for time to progression (TTP) using the modified majority vote (MMV) classification labels obtained by a final classifier in Approach 1 of Example 2.
Figure 8 is a plot of the Kaplan-Meier curves for TTP for the classifications obtained in Approach 1 of Example 2, including half (46) of the patients who dropped out of the study. For the patients who were used in the test/training splits, the MMV label is taken. For those patients who dropped out of the study the normal Majority Vote of all the 301 MCs is used. Log-rank test p-value = 0.42, log-rank HR = 1.42 with a 95% CI - [0.61 - 3.33].
Figure 9 is a plot of the Kaplan-Meier curves for TTP using the MMV classification labels obtained in Approach 2 of Example 2.
Figure 10 is a plot of the distribution of Cox Hazard Ratios of the individual 301 master classifiers (MCs) created in Approach 2 of Example 2.
Figures 1 1 A-l 1 C are plots of the distribution of the performance metrics among the MCs in Approach 2 of Example 2. Figure 12 are Kaplan-Meier curves for TTP obtained using the MMV classification labels after each iteration of label flips (using Approach 2 of Example 2 as the starting point) in the classifier development process of Figure 1. The log-rank p-value and the log-rank Hazard Ratio (together with its 95% Confidence Interval) are also shown for each iteration. Figure 13 are t-Distributed Stochastic Neighbor Embedding (t-SNE) two dimensional maps of the classifier development data set, labeled according to (left) the initial assignment for the group labels in the training set and (right) the final classification labels, for each of three approaches to classifier development used in Example 2. Figure 14 is a plot of Kaplan-Meier curves for TTP using classification labels obtained in approach 2 of Example 2 and including the patients of the "validation set" cohort. For the patients that were used in the test/training splits the MMV label is taken. For the "validation set" patients, the normal majority vote of all the 301 MCs is used. The log-rank p- value is 0.025 and the log-rank Hazard Ratio 2.95 with a 95% CI of [1.13,5.83]. A table showing the percent progression free for each classified risk group at 3, 4 and 5 years on study is also shown.
Figure 15 are Box and Whisker plots of the distribution of the PSA baseline levels (taken at the beginning of the study) of the two classification groups in Approach 2 of Example 2. For the patients that were used in the test/training splits the MMV label is taken. For the "validation set" patients, the normal majority vote of all the 301 MCs is used. The plot takes into account only the 1 19 patients (from the development and "validation" sample sets), for whom baseline PSA levels were available.
Figure 16 is a plot of the distribution of the Total Gleason Score (TGS) values of the two classification groups (using Approach 2 of Example 2). For the patients that were used in the test/training splits the MMV label is taken. For the "validation set" patients, the normal majority vote of all the 301 MCs is used. Only the 133 patients (from the development and validation sets) for whom TGSs were available are considered in this plot.
Figure 17 is a box and whisker plot showing normalization scalars for spectra for Relapse and No Relapse patient groups in Example 3. Figure 18 is a plot of a multitude of mass spectra showing example feature definitions; i.e., m/z ranges over which integrated intensity values are calculated to give feature values for use in classification.
Figure 19 is a box and whisker plot showing normalization scalars found by partial ion current normalization analysis comparison between clinical groups Relapse and No Relapse. Figures 20A and 20B are Kaplan-Meier plots for time to relapse (TTR) by Early and Late classification groups, showing the performance of the classifiers generated in Example 3. Figure 20A shows the classifier performance for Approach (1) of Example 3, which uses only mass spectral data for classification, whereas Figure 20B shows classifier performance for Approach (2) of Example 3, which uses non-mass spectral information, including patient's age, PSA and % fPSA, in addition to the mass spectral data.
Figure 21 is an illustration of a testing process and system for conducting a test on a blood-based sample of a prostate cancer patient to predict indolence or aggressiveness of the cancer. Detailed Description
Introduction
A programmed computer is described below which implements a classifier for predicting from mass spectrometry data obtained from a blood-based sample from a prostate cancer patient whether the cancer is aggressive or indolent. The method for development of this classifier will be explained in three separate Examples using three different sets of prostate cancer blood-based samples. The classifier development process, referred to herein as "CMC/D" (combination of mini-classifiers with dropout) incorporates the techniques which are disclosed in US application serial no. 14/486,442 filed September 15, 2014, the content of which is incorporated by reference herein. The pertinent details of the classifier development process are described in this document in conjunction with Figure 1. A testing system, which may be implemented in a laboratory test center including a mass spectrometer and the programmed computer, is also described later on in conjunction with Figure 21.
Example 1 : Classifier Development from Oregon Data Set
In this Example, we will describe the generation of a classifier to predict prostate cancer aggressiveness or indolence from a set of prostate cancer patient data in the form of blood-based samples obtained from prostate cancer patients and associated clinical data. This Example will describe the process we used for generating mass spectrometry data, preprocessing steps which were performed on the mass spectra, and the specific steps we used in development of a classifier from the set of data. This set of data is referred to as the "development set" 1 100 of Figure 1. The patients included in this data set all had prostate biopsies and an evaluation of their Gleason Scores made (distributed according to Table 1 ). 18 of them were classified as low risk, 28 as intermediate risk and 29 as high risk, according to existing guidelines.
Available Samples
Serum samples were available from 79 patients diagnosed with prostate cancer. Mass Spectral Data Acquisition
A. Sample Preparation
Samples were thawed on ice and spun at 1500g for 5 minutes at 4°C. Each sample was diluted 1 : 10 with water and then mixed 1 : 1 with sinapinic acid (25 mg/ml in 50%ACN/0.1% TFA). The samples were spotted in triplicate.
B. Acquisition of mass spectra
Spectra of nominal 2,000 shots were collected on a MALDI-TOF mass spectrometer using acquisition settings we used in the commercially available VeriStrat test of the assignee Biodesix, Inc., see U.S. Patent 7,736,905, the details of which are not particularly important. Spectra could not be acquired from two samples.
C. Spectral Pre-Processing
The data set consists originally of 237 spectra corresponding to 79 patients (3 replicates per patient). The spectra of 4 patients were not used for the study:
• Patient 28 did not have any clinical data available
• Patients 30 and 31 had clinical data available but spectra were not available for them
• Patient N--37— 1 had the Total Gleason Score (TGS) available but neither of the
Primary or Secondary Scores
In total 75 patients were used in the study, distributed through the following Primary
/Secondary Gleason Score combinations:
Table 1 : Distribution of the patients included in this analysis according to their primary and secondary Gleason Score combinations
Figure imgf000012_0001
D. Averaging of spectra to produce one spectrum per sample
For each of the 3 replicate spectra available for each patient, the background was estimated and then subtracted. Peaks passing a SNR threshold of 6 were identified. The raw spectra (no background subtraction) were aligned using a subset of 15 peaks (Table 2) to correct for slight differences in mass divided by charge (m/z) scale between replicate spectra. The aligned spectra were averaged resulting in a single average spectrum for each patient. With the exception of alignment, no other preprocessing was performed on the spectra prior to averaging.
Table 2: Calibration points used to align the raw spectra prior to averaging
Figure imgf000012_0002
Figure imgf000013_0001
Feature Definitions for New Classifier Development
Using a subset of 20 of the averaged spectra, background was subtracted using the same parameters as in the previous step. They were then normalized using Partial Ion Current (PIC) normalization and the normalization windows shown in Table 3. A total of 84 features were identified by overlaying the spectral sample averages and assessing the spread of the band from the overlay to define the left and right boundaries. When identified, oxidation states were combined into single features. The feature definitions are given in Example 1, Appendix A at the end of this document. Table 3: Windows used in the initial PIC normalization, before feature definition Min m/z Max m/z 3000 4138 4205 1 1320 12010 15010 16320 23000
Normalization of the averaged spectra
Using all pre-processed, averaged spectra, a set of features, stable across patient spectra, was determined that was suitable for a refined Partial Ion Current (PIC) normalization. These features are listed in Table 4.
Table 4: Features used in the final PIC normalization. For further details on the feature ranges see Example 1 Appendix A.
Feature (m/z position)
3330
5071
5109
5293
6591
6653
6797
6860
6891
6836
6947 13706 13758 13798 13877 13970
Using this optimized PIC normalization, a new feature table, containing all feature values for all samples, was constructed for all the patients and used during the subsequent classifier development steps of Figure 1.
CMC/D Process for New Classifier Development
The new classifier development process using the method of combination of mini- classifiers (mCs) with dropout (CMC/D) is shown schematically in Figure 1. The steps in this process are explained in detail below. The methodology, and its various advantages are explained in great detail in US patent application serial no. 14/486,442 filed September 15, 2014. See U.S. patent application publication no. 2015/0102216, H. Roder et al. inventors, which is incorporated by reference herein.
Division of Samples into Development and Validation Sets
Given the low number of patients (75), all of them were used as a development set 1 100 (Figure 1 ) for classifier development and no separate validation set was available.
Step 1 102 Definition of Initial Groups
The only available clinical data for each patient was the Primary, Secondary and Total Gleason Scores. Generally, the higher the Total Gleason Score (TGS) the poorer is the prognosis for the patient (although the same TGS, obtained from two different combinations of Primary and Secondary Gleason Scores might be considered of different risk). Because there is no well-defined boundary between High and Low risk based in this grading system and because the evaluation of a score is somewhat subjective, we considered two different arrangements of the patients in terms of group labels: Approach 1. The patients were arranged according to the prognostic risk depicted in Table 1. The "Low" (18 patients) and "High" (29 patients) were used to construct a binary CMC/D classifier (considering as "positive" outcome the "High" group). The patients with intermediate cancer risk (labeled as "Int") were left aside and later evaluated with the resulting CMC/D classifier.
Approach 2. In this approach, the "Low" training/test group 1 104 consisted of the patients with both low and intermediate prognostic risks, comprising a total of 46 patients. The "High" group 1 106 was the same as in Approach 1 , comprising the 29 patients with high prognostic risk in Table 1. Thus, in this approach all the samples were used in the test/training splits when creating the CMC/D classifiers.
Step 1 108 Select training and test sets
Once the initial definition of the class groupings has been established and assignment of group labels to the members of the development set is made, the development set 1 100 is split in step 1 108 into test and training sets, shown in Figure 1 as 1 1 10 and 1 1 12. The training set group 1 1 12 was then subject to the CMC/D classifier development process shown in steps 1 120, 1 126 and 1 130 and the master classifier generated at step 1 130 was evaluated by classifying those samples which were assigned to the test set group 1 1 10 and comparing the resulting labels with the initial ones.
Step 1 120 Creation of Mini-Classifiers Many k-nearest neighbor (kNN) mini-classifiers (mCs) that use the training set as their reference set are constructed using single features or pairs of features from the 84 mass spectral features identified (1 124), and listed in Example 1 Appendix A. Basically, as explained in this example, samples are spotted in triplicate on a MALDI-TOF sample plate and a 2,000 shot spectrum is acquired from each spot. The three replicate spectra are aligned and averaged to yield one average spectrum per sample. Features for use in classification are defined as mass/charge (m/z) regions in MALD1 spectra (shown as the distinct regions in the inset of 1 124) and feature values are the integrated area under the curve for these regions (integrated intensity values). For 84 features, this amounts to considering 3,570 possible mCs. The parameters used to traverse the space of mCs for this project are listed in Table 5. Table 5: Parameters used to create mCs kNN parameters: k = 5 mC traversal parameters: Max number of features = 2
Each mini-classifier is created using the known k-NN algorithm and either a single feature or a pair of features from feature space 1 122.
Step 1 126 Filtering of mini-classifiers
To target a final classifier that has optimal performance characteristics, these mCs were filtered. Each mC was applied to its training set and performance metrics were calculated from the resulting classifications. Only mCs that satisfied thresholds on these performance metrics (shown as + in step 1 128) passed filtering to be used further in the process. For this project filtering was based on classification accuracy, overall and within each reference class ("High" and "Low") separately.
Step 1 130 and 1 132 Generation of Master Classifier (MC) by combination of mini- classifiers using logistic regression with dropout (CMC/D)
Once the filtering of the mCs is complete, a master classifier (MC) is generated in step 1 130. In this step, the mCs are combined in one master classifier (MC) using a logistic regression trained using the training set labels as indicated at 1 132. To help avoid over- fitting, the regression is regularized using extreme drop out. A total of 5 randomly selected mCs are included in each logistic regression iteration and the weights for the mCs averaged over 6,000 dropout iterations.
While similar in spirit to standard classifier combination methods (see e.g. S. Tulyakov et al, Review of Classifier Combination Methods, Studies in Computational Intelligence, Volume 90, 2008, pp. 361 -386), we have the particular problem (with many more mCs than instances (samples in training set) that some "mini-classifiers" could be artificially perfect just by random chance, and hence would dominate the combinations. To avoid this overfitting to particular dominating "mini-classifiers", we generate many logistic training steps by randomly selecting only a small fraction of the "mini-classifiers" for each of these logistic training steps. This is a regularization of the problem in the spirit of dropout as used in deep learning theory. In this case, where we have many mini-classifiers and a small training set we use extreme dropout, where in excess of 99% of pre-filtered mini-classifiers are dropped out in each iteration. Other methods for performing the regularized combination of the mini-classifiers that could be used include:
Logistic regression with a penalty function like ridge regression (based on Tikhonov regularization, Tikhonov, Andrey Nikolayevich (1943)
Figure imgf000018_0002
[On the stability of inverse problems]. Doklady Akademii Nauk SSSR 39 (5): 195-198.)
• The Lasso method (Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. J. Royal. Statist. Soc B., Vol. 58, No. 1 , pagel 138s 267-288).
Neural networks regularized by drop-out (Nitish Shrivastava, "Improving Neural Networh with Dropout", Master's Thesis, Graduate Department of Computer Science, University of Toronto; available at online from the Computer Science department of the University of Toronto).
• General regularized neural networks (Girosi F. et al, Neural computation, (7), 219 (1995)). The above-cited publications are incorporated by reference herein.
In more detail, in step 1 132, the result of each mini-classifier is one of two values, either "Low" or "High". We can then use logistic regression to combine the results of the mini-classifiers in the spirit of a logistic regression by defining the probability of obtaining a "Low" via standard logistic regression (see e.g.
http://en.wikipedia.org/wiki/Logistic_regression)
Eq. (l)
Figure imgf000018_0001
where I(mc(feature values)) = 1 , if the mini-classifier mc applied to the feature values of a sample returns "Low", and 0 if the mini-classifier returns "High". The weights wmc are unknown and need to be determined from a regression fit of the above formula for all samples in the training set using 1 for the left hand side of the formula for the Low-labeled samples in the training set, and 0 for the High-labeled samples, respectively. As we have many more mini-classifiers, and therefore weights, than samples, typically thousands of mini- classifiers and only tens of samples, such a fit will always lead to nearly perfect classification, and can easily be dominated by a mini-classifier that, possibly by random chance, fits the particular problem very well. We do not want our final test to be dominated by a single special mini-classifier which only performs well on this particular set and is unable to generalize well. Hence we designed a method to regularize such behavior: Instead of one overall regression to fit all the weights for all mini-classifiers to the training data at the same time, we use only a few of the mini-classifiers for a regression, but repeat this process many times. For example we randomly pick three of the mini-classifiers, perform a regression for their three weights, pick another set of three mini-classifiers, and determine their weights, and repeat this process many times, generating many random picks, i.e. realizations of three mini-classifiers. The final weights defining the CMC/D master classifier are then the averages of the weights over all such realizations. The number of realizations should be large enough that each mini-classifier is very likely to be picked at least once during the entire process. This approach is similar in spirit to "drop-out" regularization, a method used in the deep learning community to add noise to neural network training to avoid being trapped in local minima of the objective function.
Step 1 134 Evaluate Master Classifier performance
At step 1 134, the MC created at step 1 130 is then evaluated by performing classification on the test set 1 1 10 and evaluating the results. Methods of evaluating classifier performance are described in US Serial no. 14/486,442 filed September 15, 2014 and include, among others, the distribution of Hazard Ratios, overall accuracy, sensitivity and specificity.
Step 1 136 Loop over many Training/Test set splits
At step 1 136, the process loops back to step 1 108 and a new separation of the development set 1 100 into training and test sets is performed and the steps 1 120, 1 126, 1 130 and 1 132 are performed on a new random realization of the training set and test set split. The use of multiple training/test splits avoids selection of a single, particularly advantageous or difficult, training set for classifier creation and avoids bias in performance assessment from testing on a test set that could be especially easy or difficult to classify.
We tried two different approaches to splitting over the sample set into training and test sets and repetition of the classifier development steps, depending on the approach used to define the initial groups. Approach 1. In this approach, the training/test sets split is performed 301 times. A total of 10 samples of each group are randomly assigned, in each realization, to the training set while the remaining samples are used in the test set (8 for the "Low" group and 19 for the "High" group). Each training/test split produces a MC which is applied to the split test set to assess performance.
Approach 2. In this approach, the training/test splits are performed randomly 301 times. A total of 15 samples of each group are assigned, in each realization, to the training set while the remaining samples are used in the test set (31 for the "Low" group and 19 for the "High" group). The performance of each MC is evaluated considering the classification output of the test set.
Step 1 137 analyze data from the training/test set splits
At step 1 137, the MC performance over all the training and test set splits is performed. This can be done by obtaining performance characteristics of the MCs and their classification results, for example as indicated in block 1 138.
Step 1 140 Redefine training labels
One other advantage of these multiple training/test splits (and reiteration of steps 1 120, 1 126 and 1 130 many times) is that it allows for the refinement of the initial assignment for the "High'V'Low" groups, particularly for those samples which are persistently misclassified. For the training/test splits where a particular sample from the reference group is in the test set, the resulting classifications for the sample can be obtained by the majority vote of the MCs (or by a Modified Majority Vote, MMV, explained below). If the sample persistently misclassifies relative to the initial guess as to the risk group, the sample can be moved from the "High" into the "Low" group, or vice versa, as indicated in loop 1 142. Carrying out this procedure for all samples in the development set produces a new, refined version of the risk groups (1 102) which is the starting point for a second iteration of the CMC/D classifier development process as indicated by the loop 1 142. This refinement process can be iterated so that the risk groups are determined at the same time as a classifier is constructed, in an iterative way. Approach 3. We performed three successive iterations of the loop 1 142:
Iteration 1 : The labels of the patients for which the classification MMV Label (from approach 2) was mismatching the initial classification group assignment (for 9 patients from the "High" group and 1 8 patients from the "Low" group) were flipped and a new CMC/D iteration was run. After label flipping, 37 patients were defined as belonging to the "Low" group and 38 to the "High" group. The 301 test/training splits took randomly 15 patients from each group and assigned them to the training set, while leaving the remaining patients in the test set.
Iteration 2: The labels of the patients for which the classification MMV Label was mismatching the classification from Iteration 1 (3 patients from the "High" group and 4 patients from the "Low" group) were flipped and a new CMC/D iteration was run. After label flipping, 36 patients were defined as belonging to the "Low" group and 39 to the "High" group. The 301 test/training splits took randomly 15 patients from each group and assigned them to the training set, while leaving the remaining patients in the test set. Iteration 3: The labels of the patients for which the classification MMV Label was mismatching the classification from Iteration 2 (1 patient from the "High" group and 2 patients from the "Low" group) were flipped and a new CMC/D iteration was run. After label flipping, 35 patients were defined as belonging to the "Low" group and 40 to the "High" group. The 301 test/training splits took randomly 15 patients from each group and assigned them to the training set, while leaving the remaining patients in the test set.
Step 1 144 Define final test/classifier
At step 1 144, a final classifier is defined from one or more of the master classifiers (MCs) generated in the previous iterations of the process. There are several possibilities for defining the final classifier, including by selection of one master classifier which has typical performance, by majority vote of all master classifier from each realization of the sample set into training and test sets, by modified majority vote, or other. In this example, the final classifier is created from 301 MCs (301 different realizations of the training/test set split) by taking a majority vote over the MCs.
Modified Majority Vote (MMV) Within the CMC/D process, each training/test split realization produces one master classifier (MC) generated from the combination of mini-classifiers (mCs) through logistic regression with dropout regularization. The output of this logistic regression is, in the first instance, not a binary label but a continuous probability taking values between 0 and 1. Applying a cutoff (e.g. 0.5, but any choice is possible) to these MC probabilities, we can turn them from a continuous variable into a binary label. So, each MC produces a classification label for a given sample. However, this step is not essential, and one can choose not to apply a cutoff here, but instead to retain the information in the continuous probability variable.
Having obtained the outputs from the MCs (either in terms of binary labels via use of a cutoff or in terms of probabilities), these need to be combined ("bagged" in learning theory language) across the MCs to produce a single binary classification for a particular sample. The way the CMC/D process is implemented means that when a sample is used in the training set of the MC for a realization, the sample almost always classifies correctly (in terms of binary labels after implementation of a cutoff or in terms of probabilities close to target of 0 for one class and 1 for the other class). Hence, use of a simple majority vote over all MCs can produce an artificially good assessment of classifier performance for samples that are used in the training set for some of the MCs. To avoid this, we can use a modified majority vote (MMV) to obtain a classification for samples used directly in the development of the classifier. This procedure is a majority vote over the MC outputs only when the sample is not included in the training set of the MC. (For samples never used in training the MCs, the majority vote and MMV are the same.) This MMV can be used after implementation of a cutoff by taking a majority vote of the classifications produced by all MCs for which the sample is not included in the training set. If, instead, we want to avoid the use of a cutoff at this point and work with the MC probability outputs, the average of the probabilities across the MCs for which the sample is not included in the training set can be calculated. Taking the latter approach, the MMV produces another, averaged, continuous variable that can take values between 0 and 1 , an average probability of being in a particular class. This can be converted into a binary classification label via implementation of a cutoff after averaging over MCs. Direct averaging of the probabilities provides some advantages. If we obtain an average probability for each sample, it is possible to assess simultaneously the performance of the whole family of classifiers that can be produced by imposing different cutoffs on the average probability. This can be done by using the standard receiver operating characteristic (ROC) curve approach, a well-known method. For a particular choice of cutoff on the average probabilities, classification labels are generated for all samples and these labels can be compared with the known or initially defined class labels to calculate the sensitivity and specificity of the classifier defined by this cutoff. This can be carried out for many values of the cutoff and the results plotted in terms of sensitivity versus 1 -specificity (the ROC curve). Overall performance of the family of classifiers can be characterized by the area under the curve (AUC). The ROC curve can be inspected and a particular cutoff selected that best suits the target performance desired for the classifier, in terms of sensitivity and specificity.
Results for Example 1
Approach 1 (no label flips). The resulting CMC/D classifier obtained using the group definitions of this approach achieves a performance described by the following metrics, obtained by comparing the classification label with the defined label only when a given sample is in the test set (Modified Majority Vote, MMV).
Figure imgf000023_0001
The distribution of each of these metrics across the 301 MCs created is shown in Figure 2. All the metrics are centered between 60 and 70 %, indicating some performance of the classifiers and some hint that, with better MALDI spectra or a new sample set incorporating more detailed clinical data, a reasonable test might be created. Regarding the patients assigned to the "Int" group, 10 of them (36 %) are classified as belonging to the "High" group and 18 of them (64 %) to group "Low". This shows a tendency for the intermediate risk patients to be classified as low risk, which justifies the reference set arrangement chosen in approach 2.
Approach 2 (no label flips). The resulting CMC/D classifier obtained achieves a performance described by the following metrics, obtained through MMV.
Figure imgf000023_0002
Figure imgf000024_0003
The distributions of each of these metrics across the created 301 MCs are shown in Figure 3. The average performance is similar to that of approach 1 although the accuracy and specificity distributions seem to be narrower. One hypothesis for this behavior might be the larger training sets (15 patients for each group instead of 10).
Approach 3 (with label flips). The resulting CMC/D classifiers, created in each iteration of the labels flips are described by the following average metrics (obtained through MMV):
Figure imgf000024_0001
It should be noted that the metrics, after iteration 0, do not correspond to accuracy relative to the initial group definitions, due to the label flips. The distributions of these metrics for all the 301 MCs are shown in Figure 4.
After 3 iterations of labels flips, we tried to correlate the final classification labels with the only available clinical data: the Gleason Score. Table 6 summarizes the distribution of the final labels among the different Primary + Secondary Gleason Scores combinations and Table 7 shows the frequency distributions of the final labels versus the initial guess based on TGS. The individual MMV classification labels, obtained after 3 iterations, are shown in the table of Example 1 Appendix C for all the patients.
Table 6: Distribution of the classification labels, obtained after 3 iterations of label flips, according to the different Primary + Secondary Gleason Scores combinations
Figure imgf000024_0002
Figure imgf000025_0002
Table 7: Contingency table showing the frequency distribution according to the initial assignment and the final classification labels achieved after 3 iterations of label flipping.
Figure imgf000025_0001
By applying a Fisher's exact statistical test to the numbers of Table 7, we get a 9.6 % probability of getting these results or results with stronger correlation between classification labels and those based on TGS assuming that the final classification labels "High" and "Low" are not correlated with TGS risk groups. This p-value is small enough to believe that the final labels may be meaningful and still are somehow related to the TGS distribution and our initial guess for the indolence or aggressiveness (Low, High) labels.
t-SNE visualization
t-Distributed Stochastic Neighbor Embedding (t-SNE) is a tool that allows the visualization of high-dimensional data in a 2D or 3D-map, capturing much of the local structure of the data while also revealing global structure (e.g., the presence of clusters at several scales). The method converts high-dimensional Euclidean distances between data points into Gaussian similarities. In the low-dimensional (2D or 3D) space, the same process is applied using a Student-t distribution instead of a Gaussian distribution to compute the similarity between pairs of points. Then, iteratively, the method searches for a low- dimensional representation of the original data set that minimizes the mismatch between the similarities computed in the high- and low-dimensional spaces. In this way, a 2D or a 3D point map is constructed that allows the visualization and identification of structure in a given dataset and may possibly guide research. The method is introduced by the paper of L.J. P. van der Maaten and G.E. Hinton, Visualizing High-Dimensional Data Using t-SNE, Journal of Machine Learning Research 9 (Nov): 2579-2605 (2008), the content of which is incorporated by reference herein.
In Figure 5A-5C, the 2D maps of the data obtained through t-SNE are shown for 3 different situations: the initial group definitions for approaches 1 and 2 (no label flips), and the final classification labels after 3 iterations of label flips (approach 2 with label flips). Each point is represented with a marker that identifies to which risk label it was assigned ("1 " corresponds to "High" and "0" to "Low"). In Figure 5A-5C, the data points are labeled according to the initial group assignments based on TGS for approach 1 (Figure 5A); initial assignment for approach 2 (Figure 5B); final classification labels after 3 iterations of label flips (approach 3) (Figure 5C). "1 " (triangles) corresponds to "High" and "0" (circles) to "Low".
Example 1 conclusions
By using MALDI-TOF mass spectra obtained from serum samples from 75 patients for whom Gleason Scores were available, it was possible to create CMC/D binary classifiers that assigned a "High" or a "Low" risk label to each patient and were described by accuracies, sensitivities and specificities of 60-70%, when using Modified Majority Votes taken from 301 Master Classifiers. Two different approaches, differing in the initial group definitions were tried achieving very similar performances. The distributions of the performance metrics of the 301 Master Classifiers are, for both approaches, peaked at the previously mentioned averages, not showing unreasonable shapes. Although the accuracies do not seem to be great, the only available clinical variable (the TGS) is also not a perfect method of risk assessment, and it might be that a study including more clinical data that allows the assessment of outcomes might reveal better performances. Better quality mass spectra, from which more features may be extracted, would also represent a good addition to any new data set.
Starting with the output of approach 2, we have also tried to iteratively flip the initial classification group assignment in order to achieve better performance based on the accuracy metrics (>95 %). The final labels seem to be statistically significantly correlated with risk as assessed by Gleason score (at the 10 % confidence level), deserving further investigation, in which additional clinical data would help. Hence, we obtained a second set of data (Arizona data set) and applied the process of generating a classifier to this new data set which will be described below in Example 2.
Note that in the procedure of Figure 1 there is step 1 146 of validation of the test defined at step 1 144 on an internal validation set if available, and a step 1 148 of validation of the test on an independent sample set. In the work described in Example 1 we had no internal validation set since the sample size was small and step 1 146 was not performed. We could have used the samples described below in Example 2 as a validation set to perform step 1 148, however they were plasma and not serum samples, and it was not known whether the classifier would transfer across sample type. So, instead we decided in Example 2 to repeat the classifier generation process of Figure 1.
Example 2: Arizona Data Set
This example involves the analysis of MALDI-TOF mass spectra obtained from plasma samples from patients diagnosed with prostate cancer. All the patients that comprise the data set had their Total Gleason Score (TGS) evaluated as being lower than 8. This range of TGS is considered to be associated with low progression risk and thus these patients are not treated immediately, but instead put in watchful waiting.
The aim of the work described in this Example was to develop a classifier capable of evaluating the aggressiveness or indolence of the prostate cancer of a patient put in watchful waiting (TGS<8). During the clinical study the patients had periodic physician visits (quarterly), having blood samples drawn and their disease status assessed. Evidence of progression could be based on the rate of rise in PSA, Chromogramin A or alkaline phosphatase. Progression could also be detected based on a degradation of patient's symptoms. In case of progression, the patient followed a treatment plan and was dropped from the study. A classifier that could be run at the moment of the cancer diagnosis and could give a good prognostic indication would be a valuable addition to the monitoring of PSA level or other biomarkers as an aid to more refined treatment guidance for this group of patients following diagnosis.
Although the clinical data does not include a precise record of the Time to Progression (TTP) of the patients, we have records of the dates when the patients had their physician visits and their PSA levels assessed. This allows us to make a crude estimation of the TTP by considering it to be the time difference between the last recorded patient visit and the date of entry into the study.
Available Samples
The dataset used in this classifier feasibility assessment was obtained from another study that investigated the ability of Selenium (Se) to delay the progression of prostate cancer after diagnosis. Patients were randomized into three groups which received placebo or two different doses of Se supplementation. It turned out that Se did not show a protective effect, and thus we assume that the dataset can be used without taking into consideration the supplementation doses given to each patient. A total of 441 mass spectra acquired from plasma samples of prostate cancer patients were available, corresponding to 147 patients (3 replicates per patient). The spectra of 10 patients (Patient IDs: WW000059, WW000062, WW000068, WW000070, WW000073, WW000074, WW000076, WW000079, WW001835 and WW040568) were not used in the study because there was no clinical/outcome data available for them. The remaining 137 patients, with valid data for the study, were distributed according to the progression outcome and TGS presented in Table 8.
Table 8: Distribution of the patients according to their outcome and TGS
Figure imgf000028_0001
Figure imgf000029_0001
Note: Patients WW001545, WW001636 and WW040733 did not have their TGS available, but were still included in study, because the construction of the classifier is based on the progression outcome data and not on TGS.
Spectral Acquisition
Sample Preparation
Samples were thawed on ice and spun at 1500g for 5 minutes at 4°C. Each sample was diluted 1 : 10 with water and then mixed 1 : 1 with sinapinic acid (25 mg/ml in 50%ACN/0.1 % TFA). The samples were spotted in triplicate.
Acquisition of mass spectra
Spectra of nominal 2,000 shots were collected on a MALDI-TOF mass spectrometer. Spectral Pre-Processing
Averaging of spectra to produce one spectrum per sample
For each of the 3 replicate spectra available for each patient, the background was estimated and subtracted. Peaks passing a SNR threshold of 6 were identified. The raw spectra (no background subtraction) were aligned using a subset of 15 peaks (Table 2 above) to correct for slight differences in m/z scale between replicate spectra. The aligned spectra were averaged resulting in a single average spectrum for each patient. With the exception of alignment, no other preprocessing was performed on the spectra prior to averaging.
Feature Definitions for New Classifier Development using all valid samples
The averaged spectra from the patients that either progressed during the study or completed the study without progression were background subtracted using the same parameters as in the previous step. They were then initially normalized using PIC with the normalization windows shown in Table 3. Such windows were defined to avoid the peaks due to the known contaminant at m/z ~ 4138 - 4205 Da, the hemoglobin peaks, the peaks used in applicants' VeriStrat test noted in US patent 7,736,905, and everything with poor reproducibility above m/z = 23000 Da. A total of 104 features were identified by overlaying the spectral sample averages and assessing the spread of the band from the overlay to define the left and right boundaries. Oxidation states were combined into single features when seen. The feature definitions are given in Example 2 Appendix A. Further details on partial ion current normalization of mass spectral data are known in the art and therefore omitted for the sake of brevity, see U.S. patent 7,736,905 for further details.
Normalization of the averaged spectra
Using these specified feature definitions, a feature table for non-normalized spectra (just background subtracted) was constructed for all the 137 patients. The feature values were normalized using partial ion current (PIC) based on the ranges of the features listed in Table 9.
Table 9: Features used in the final PIC normalization. For further details on the feature ranges see Example 2 Appendix A.
Figure imgf000030_0001
Using this optimized PIC normalization, a new feature table was constructed for all the patients and used downstream in the classifier development process (Figure 1 ).
Classifier development process Basically, the classifier development process of Figure 1 and described in detail above was used for generation of a new CMC/D classifier using the Arizona data set.
Division of Samples into Development and Validation Sets
After randomization, patients could leave the study by withdrawal of consent. In addition, Se levels in the blood were monitored regularly during the study and, if three (not necessarily consecutive) Se blood levels above 1,000 ng/ml were measured for a given patient, he was dropped from the study. Although dropped from the study without progression, these patients give us additional information, as we do know that they did not progress while on the study. The distribution of the time on study of this subset of patients is shown in Figure 6. We split this set of samples (from patients leaving the study without progression) into two halves, one of which was added to the other samples (from patients completing the study or progressing during the study) to make the development set (1 100, Figure 1) and the second half was used as a partial "validation set" (step 1 146 of Figure 1 ). Note that this "validation" set does not contain any patients with progression during the study, so it will be of limited utility in classifier validation. The splitting of these patients leaving the study without progression into two subsets was made randomly, but stratified to ensure a nearly balanced number of patients with similar TGS and time on study in both sets.
Definition of Initial Classifier Reference Set Groups (step 1 102)
We tried to develop a classifier for assessing the aggressiveness or indolence of a patient's cancer and used the inferred progression outcome data for its performance assessment. With this in mind we tried a few different approaches. For each approach, a plot of the 2D mapped space, obtained using t-SNE, is shown in Figure 13 together with the labels shown for the initial development set assignments and for the final classification labels.
Approach 1. We used the samples from patients completing the study without progression (22 patients) and the samples from patients progressing during the study (23 patients) to construct a final (binary) CMC/D classifier that would distinguish between "High" and "Low" risk of cancer progression within 5 years. Patients without progression during the 5 years of the trial were assigned to the "Low" risk reference group and patients who progressed on the study to the "High" risk. The patients who dropped out of the study without progression were left aside and later evaluated with the CMC/D classifier resulting from this approach. This arrangement would presumably give the clearest separation in terms of progression risk, because we leave aside the patients that dropped out of the study (and for whom we do not really know what happened).
Approach 2. We included half of the patients who dropped out of the study without progression in the test/training splits, by considering the label assigned by the classifier developed in Approach 1 as the initial guess for their risk group.
Approach 3. We tried an iterative label flip process (loop 1 142), starting with the group definitions of Approach 2 in order to verify if such method would lead to improved discrimination in terms of outcome data (i.e., better Hazard Ratio for time to progression between High and Low risk groups).
Once the initial definition of the groups for the mini-classifiers has been established, the development set 1 100 is split into training (1 1 12) and test sets (1 1 10).
Creation and Filtering of Mini-Classifiers (steps 1 120 and 1 126)
Many k-nearest neighbor (kNN) mini-classifiers (mCs) that use the training set as their reference set are constructed using single features or pairs of features from the 104 mass spectral features identified. This corresponds to a total of 5,460 possible mCs. The parameters used to traverse the space of mCs for this project are listed in Table 12.
Table 12: Parameters used to create mCs
Figure imgf000032_0001
To target a final classifier that has optimal performance characteristics, these mCs were filtered. Each mC was applied to its training set and the Hazard Ratio (HR) was calculated using the resulting classifications. Only mCs that satisfied thresholds in terms of HR (Table 1 1) passed filtering and were used further in the process.
Table 1 1 : Summary of mC filtering options used
Figure imgf000032_0002
Generation of MC by combination of mini-classifiers using logistic regression with dropout (CMC/D) (steps 1 130, 1 132)
Once the filtering of the mCs is complete, the mCs are combined in one master classifier (MC) using a logistic regression trained with the training set labels. To help avoid over-fitting, the regression is regularized using extreme drop out. A total of 5 randomly selected mCs are included in each logistic regression iteration and the weights for the mCs averaged over 10,000 dropout iterations.
Training/Test splits and analysis of master classifier performance (step 1 136) The use of multiple training/test splits in loop 1 136 avoids selection of a single, particularly advantageous or difficult, training set for classifier creation and avoids bias in performance assessment from testing on a test set that could be especially easy or difficult to classify. Accordingly, loop 1 136 was taken 301 times in Example 2, resulting in 301 different master classifiers (MCs), one per loop. A final classifier is defined at step 1 144 from the 301 MCs by taking a majority vote over the MCs. For each approach above this process is described in more detail:
Approach 1. A total of 12 samples from the "High" group and 1 1 samples from the "Low" group are randomly assigned, in each realization, to the training set while the remaining samples are used in the test set (1 1 for each of the groups). Each training/test split produces a MC which is applied to the test set at step 1 134. At step 1 134, the Hazard Ratio is assessed taking into consideration the risk groups defined by the Modified Majority Vote (MMV) classifications.
Approach 2. When the process loops back to step 1 108, and samples from patients leaving the study without progression are fed into the development set with risk labels guessed from the results of approach 1 , a total of 21 samples from the "High" group and 20 samples from the "Low" group are randomly assigned, in each realization, to the training set 1 1 12 while 30 from the "High" group and 20 for the "Low" are designated as members of the test set 1 1 10 and used for testing at step 1 134. The Hazard Ratio is then assessed considering the MMV labels. Approach 3. At step 1 140, one other advantage of these multiple training/test splits is that it might allow for the refinement of the initial assignment of High and Low group labels for the development set at step 1 102. In particular, for the training/test splits where a particular sample from the development set is in the test set, the MMV label is obtained. If the sample persistently misclassifies relative to the initial guess as to the risk group, the sample can be moved from the "High" into the "Low" group, or vice versa. Carrying out this procedure for all samples in the development set produces a new, possibly refined version of the group label definitions (1 102) which are the starting point for a second iteration of the CMC/D process. This refinement process can be iterated so that the risk groups are determined at the same time as a classifier is constructed, in an iterative way.
In our development of the CMC/D classifier, we performed three different iterations of loop 1 142 after the initial iteration (iteration 0):
Iteration 1 : The labels of the patients for which the classification MMV Label (from approach 2) was mismatching the initial guess (9 patients from the "High" group and 1 1 patients from the "Low" group) were flipped and a new CMC/D iteration (steps 1 102, 1 108, 1 120, 1 126, 1 130, 1 134, 1 136) was run. After this label flipping, 53 patients were classified as belonging to the "High" group and 38 to the "Low" group. The 301 test/training splits randomly took 18 patients from the "High" group and 19 from the "Low" group to the training set, while leaving the remaining patients in the test set. Iteration 2: The labels of 6 patients from the "High" group and 1 patient from the "Low" group, whose MMV label didn't match the initial guess were flipped and a new CMC/D iteration was run. After label flipping, 48 patients were classified as belonging to the "High" group and 43 to the "Low" group. The 301 test/training splits randomly took 24 patients from the "High" group and 22 from the "Low" to the training set, while leaving the remaining patients in the test set.
Iteration 3: The labels of 5 patients from the "High" group and 1 patient from the "Low" group were flipped and a new CMC/D iteration was run. After label flipping, 44 patients were classified as belonging to the "High" group and 47 to the "Low" group. The 301 test/training splits randomly took 22 patients from the "High" group and 24 from the "Low" group to the training set, while leaving the remaining patients in the test set. Results (Example 2)
Approach 1. The final CMC/D classifier, defined at step 1 144 as a MMV over all the 301 master classifiers using "Approach 1" above, is characterized in terms of patient outcome by the Kaplan- Meier survival curve shown in Figure 7. The curve is obtained by comparing the groups defined by the samples that were classified with "High" or "Low" MMV labels and the associated time to progression (TTP) from the clinical data associated with the development sample set 1 100. The final CMC/D classifier does not seem to be able to distinguish between patients who progressed early and those who progressed later, with the Kaplan-Meier curves for TTP being similar for both groups. The log-rank test gives a p-value of 0.51 and the log-rank Hazard Ratio (HR) is 1.34 with a 95% Confidence Interval (CI) of 0.56 - 3.14. The accuracy metrics of this classifier do not show any particularly interesting performance.
Figure imgf000035_0001
While the CMC/D classifier seems to give a sensitivity better than a coin-flip, it seems to do poorly with the "Low" risk patients, misidentifying more than half of them as "High" risk (low specificity).
Regarding the patients left out of the training / test sets (those who left the study without progression), 25 were classified with the label "High" and 21 with the label "Low". Figure 8 is a plot of the Kaplan-Meier curves for TTP for the classifications obtained in Approach 1 , including half (46) of the patients who dropped out of the study. For the patients who were used in the test/training splits, the MMV label is taken. For those patients who dropped out of the study (code "8"), the normal Majority Vote of all the 301 MCs is used. Log-rank test p-value = 0.42, log-rank HR = 1.42 with a 95% CI = [0.61 - 3.33].
Approach 2. The final CMC/D classifier obtained for "approach 2" is characterized by the Kaplan-Meier curves shown in Figure 9. The log-rank test gives a p-value of 0.037 and the log-rank Hazard Ratio (HR) is 2.74 with a 95% Confidence Interval (CI) of 1.05 - 5.49. The distribution of the HRs of the 301 MCs is shown in Figure 10 and shows a "well behaved" shape, with a very small fraction of the MCs having a HR ratio lower than 1. The percent progression free for each classified risk group at 3, 4 and 5 years after study entry is shown in the following table 12:
Table 12
Figure imgf000036_0001
The accuracy metrics (using the MMV labels) are also quite promising in this approach:
Figure imgf000036_0002
The distributions of each of these metrics across the created 301 MCs is shown in Figures 1 1 A- 1 1 C. The performance of this classifier is fairly good in terms of overall accuracy as well as accuracy within each risk group ("High" and "Low"). In addition, the distributions of the metrics for the 301 MCs are well behaved and centered on the average values.
One hypothesis for this significantly better performance relative to Approach 1 has to do with the bigger training set (24 samples for "High" and 22 for "Low") used in Approach 2 while only 1 1 of each group were used in Approach 1. The statistically significant difference between the two Kaplan-Meier curves ("High" and "Low), as demonstrated in Figure 9, supported by the accuracy performances, points to a good discrimination power of the classifier. Taking the development set, those patients classified (by MMV) as "Low" have 87.3 % probability of not progressing in a period of 3 years or 82.9 % in a period of 4 years. This compares to a probability of not progressing of 63.9 % and 58.8 % in a period of 3 and 4 years, respectively, for the patients classified as "High" risk. Approach 3. The label flip process explained above in Approach 3 did not significantly improve the overall discrimination power of the classifier as compared to Approach 2, as assessed on the associated test sets. However, based on our experience with other projects, we expect the generalization power of a test derived from a convergence of label flips to be better than one derived without label flips. The Kaplan-Meier curves constructed using the MMV labels after each iteration are shown in the Figure 12, along with the outcome statistical metrics. Like the Kaplan-Meier plot of Figure 9, the plots of Figure 12 show a clear separation of the TTP curves between those samples testing Low and High. t-SNE Visualization t-Distributed Stochastic Neighbor Embedding (t-SNE) is a tool that allows the visualization of high-dimensional data in a 2D or 3D-map, and is introduced previously in Example 1. Figure 13 shows the 2D maps of the data obtained through t-SNE for the initial assignment of group labels for the development set and for the final classification labels, for each of approaches 1 , 2 and 3 described above. Each point is represented with a marker that identifies to which risk label it was assigned ("High" or "Low"). Note that the t-SNE map for the final classification in each of the approaches is more ordered with clustering of the high and low classification labels as compared to the maps of the initial assignments.
Assessment of the final classifier on the 46 patients reserved in the "validation set" cohort did not prove to be informative on the accuracy of the above classifier performance estimates, as analysis was limited by the lack of any progression events in this subgroup. Hence, the 46 patients not included in classifier development were simply combined with the development set to assess the performance of the classifier on the full study population. The results are shown in Figure 14. In particular, Figure 14 shows the Kaplan-Meier curves for TTP using classification labels obtained in Approach 2 and including the classification of the patients of the "validation set". For the patients that were used in the test/training splits the MMV label is taken. For the "validation set" patients, the normal majority vote of all the 301 MCs is used. The log-rank p-value is 0.025 and the log-rank Hazard Ratio 2.95 with a 95% CI of [1.13,5.83]. A table showing the percent progression free for each classified risk group at 3, 4 and 5 years on study is also shown in Figure 14. Again, like Figure 9 and 12, the Kaplan-Meier plot of TTP in Figure 14 shows clear separation of the High and Low groups.
Assessment of correlation of the classification groups with TGS and PSA It is interesting to assess if the classification groups ("High" and "Low") resulting from the classifier developed in Approach 2 (the one with best performance) are correlated with the Total Gleason Score (TGS) values and PSA baseline levels determined at the beginning of the study. Note that baseline PSA level was available for only 1 1 9 of the 137 patients and TGS only for 133 patients.
The distribution of the baseline PSA levels (taken at the beginning of the study) of both the "High" and the "Low" groups as classified in approach 2 are shown in Figure 15. Figure 15 are Box and Whisker plots of the distribution of the PSA baseline levels (taken at the beginning of the study) of the two classification groups (approach 2). For the patients that were used in the test/training splits the MMV label is taken. For the "validation set" patients, the normal majority vote of all the 301 MCs is used. The median PSA of the "High" group is 6.15 ng/ml and that of the "Low" group is 7.42 ng/ml. An unpaired Mann- Whitney test, which compares the ranks of the two groups, gives a p-value of 0.19, which indicates that the PSA distributions of the two groups are not significantly different. Thus, no correlation between the baseline PSA level and the cancer progression risk as given by the classifier is evident. This indicates that the classifier of this Example 2 is, in some sense, an orthogonal measurement to PSA as a predictor of risk of prostate cancer progression.
The distribution of the TGS values of both the "High" and the "Low" groups after classification in Approach 2 is shown in Figure 16. In particular, in Figure 16 for the patients that were used in the test/training splits the MMV label is taken. For the "validation set" patients, the normal majority vote of all the 301 MCs is used. Only the 133 patients (from the development and validations sets) for whom TGS was available are considered in this plot. A Fisher's exact test applied to the table shown in Figure 16 gives a p-value of 0.61 for getting the observed correlation or stronger, assuming that there is no correlation between the TGS values and the classification labels. Thus, the null-hypothesis cannot be rejected and there is no evidence for a correlation between TGS and progression risk category, as given by the developed classifier. Again, this indicates that the classifier of this Example 2 is, in some sense, an orthogonal measurement to TGS as a predictor of risk of prostate cancer progression. The classifier developed in Approach 2 discriminates fairly well between "High" and
"Low" prostate cancer progression risk as evaluated considering the outcome data of the patients. However, neither the TG scores nor the PSA baseline values, which constitute the only available additional clinical data in the studied data set, seem to be correlated with such risk, as labeled by the classifier. It is possible that other clinical data could show some significant correlation, but this could only be assessed with a more complete data set containing other relevant baseline prognostic factors. Conclusions for Example 2
Three different approaches were tried in order to develop a CMC/D classifier capable of assessing the aggressiveness or indolence of a patient's cancer in a population with low Total Gleason Score (TGS<8) and in watchful waiting. A development set of MALDI mass spectra obtained from plasma samples from 137 patients was used. Two of the approaches were different in terms of the chosen initial risk group definitions, while the third one consisted of a sequence of label flip iterations. The performance of the CMC/D classifiers was evaluated in terms of the hazard ratio between the two classification groups ("High" risk and "Low" risk) using the outcome data (inferred Time to Progression) available in the data set, as well as in terms of overall accuracy, sensitivity and specificity in terms of predicting a progression within the time of the study.
The best classifier (from Approach 2) is characterized by a hazard ratio of 2.74 with a 95% CI of 1.05 - 5.49, indicating a significantly better prognosis for patients assigned to the "Low" risk group. Our data hint at a better effect size than two commercially available sets: 1. Genomic Health, see Klein, A.E., et al. A 17-gene Assay to Predict Prostate Cancer Aggressiveness in the Context of Gleason Grade Heterogeneity, Tumor Multifocality, and Biopsy Undersampling Euro Urol 66, 550-560 (2014), Odds Ratio — 2.1— 2.3 , in the correct population, but might be because they only have TGS <=6; and 2. Myriad (Cooperberg, M.R., et al. Validation of a Cell-Cycle Progression Gene Panel to Improve Risk Stratification in a Contemporary Prostatectomy Cohort, J Clin Oncol 31 , 1428-1434 (2013) in a radical prostatectomy population, Odds Ratio 2.1 -2.3). When considering the whole population of the sample set, the percent progression free in the "High" risk group is 73 % and 69 % at 3 and 4 years, respectively, while in the "Low" group the percent of patients progression free is 92 % and 88 % for the same times after study entry. Although this remains to be validated on an internal validation set (step 1 146, Figure 1 , which was not available due to the small number of samples available) or, better, an independent validation set from a separate study (step 1 148 of Figure 1), these classifier performance estimates are promising: they could possibly lead to a test that would guide actions to take regarding prostate cancer patients with low TGS. Further investigation of CMC/D classification within this prostate cancer indication is definitely worthwhile.
Example 3: Tyrol Prostate Cancer Screening Demonstration Project Data Set and Deep-MALDI Spectra
A third example of a method for generating a classifier for predicting aggressiveness or indolence of prostate cancer from a multitude of blood-based samples obtained from prostate cancer patients will be described in this section. The methodology of classifier generation is similar to that described above in Examples 1 and 2, see Figure 1. However, in this example we obtained mass spectral data from the samples using a method we refer to as "Deep MALDI", see US patent application publication 2013/0320203 of H. Roder et al., inventors. The description of mass spectral acquisition and spectral data processing set forth in the '203 application publication is incorporated by reference. Additionally, there were some differences in the patient population and course of treatment in this data set as compared to the sets of Examples 1 and 2. Nevertheless, in this section we describe several classifiers that we developed which can be used to predict aggressiveness or indolence of prostate cancer.
The samples analyzed in this study were collected as part of the Tyrol Prostate Cancer Screening Demonstration Project. See Bartsch G, Horninger W, Klocker H, Pelzer A, Bektic J, Oberaigner W et al., Tyrol Prostate Cancer Demonstration Project: early detection, treatment, outcome, incidence and mortality. BJU Int 2008: 101(7):809-816. doi: 10.1 1 1 1/j. l464-410x.2008.07502.x. This is an exemplary study of the use of PSA measurement for prostate cancer screening. The Tyrol region of Austria, with a population of around 7.8 million, is geographically compact, with most of the population within 100 km of the main health care center of Innsbruck. This geographical situation and the willingness of the well-educated population to participate in preventative screening programs make this an ideal location for a population-wide screening study. PSA testing is freely available and encouraged for all men in Tyrol aged between 45 and 75 (and to men over 40 years old with a family history of prostate cancer) at the University Hospital of Innsbruck. Patients taking part in screening could volunteer to participate in the Tyrol Prostate Cancer Screening Demonstration Project (TPCSDP), which implemented an early detection algorithm, which was updated to keep pace with advances in clinical practice during the course of more than 20 years. In addition to collecting samples in the screening setting, the study continued to collect samples from patients once a diagnosis of prostate cancer was made and through various stages of treatment. In addition, clinical, treatment and outcome data were collected. The biobank created as part of the TPCSDP and the associated well-curated clinical data is an invaluable resource for studies aimed at understanding all stages of prostate cancer and its treatment, including investigations directed at the development of test and biomarkers that could improve patient care.
The aim of the study of Example 3 was to develop a blood-based test for prognosis in patients with detected prostate cancer classified as low risk based on Gleason scores obtained from diagnostic biopsy. Here, the term "test for prognosis" is used to interchangeably with a test for whether the patient's prostate cancer is indolent or aggressive, as explained previously in this document. Previous work on plasma samples obtained from a cohort of patients in a "watchful waiting" protocol (Example 2, "low risk" patients with Gleason scores of 7 or lower assigned to a protocol of monitoring rather than immediate radical prostatectomy (RPE)) had shown the potential for such a blood test with clinical relevant performance, as explained in Examples 1 and 2 above. While the group of patients with a Gleason score of six or lower is at relatively low risk of aggressive prostate cancer with quick disease progression and associated impact on survival, the cancer of some patients within this group is aggressive and does progress quickly. It is of clinical relevance to be able to identify which patients within this general low risk category are indeed at higher risk of quick progression of aggressive disease so that these patients can be directed to immediate intervention with appropriate therapies, which patients at genuine low risk can still be assigned to a watchful waiting or active surveillance protocol and avoid possibilities of side effects of unnecessary treatment. Hence, the test described in this Example is of clinical significance.
The option of active surveillance was not commonly offered in Tyrol during the period for which the TPCSDP has adequate follow up for collected samples to be of use for this study. Hence, this project involves analysis of samples collected from patients at time points close to their diagnosis with prostate cancer (diagnosis was always confirmed by biopsy) with Gleason scores of 6 or lower, who went on to undergo radical prostatectomy (RPE). The relative level of aggression of disease could then be assessed by the time to relapse of prostate cancer following RPE. Samples
Serum samples from prostate cancer patients enrolled in the. TPCSDP study were prowled and used in this project, FOE classifier development only patients were considered who underwent biopsy and RPE within a year of the sample collection. Thus, at the time the patients' Mood samples were taken the patients had been diagnosed with prostate cancer but had not yet undergone RPE. in addition, generated mass spectra of the serum samples had to pass quality controls, and clinical data (outcome as well as PSA, %fPSA, and age) had to be available. This left a total of 124 samples for classifier development. The clinical characteristics of the development set of samples are summarized in table 13. All the samples were obtained from prostate cancer patients who, at the time the sample was obtained, had a total Gleason score of 6 or lower.
Figure imgf000042_0001
Figure imgf000043_0001
Sample preparation
Samples were thawed and 3 μΐ aliquots of each test sample (serum from patients with prostate cancer) and quality control serum (a pooled sample obtained from serum of five healthy patients, purchased from ProMedDx, "SerumP3") were spotted onto VeriStrat ® serum cards (Therapak). The cards were allowed to dry for 1 hour at ambient temperature after which the whole serum spot was punched out with a 6mm skin biopsy punch (Acuderm). Each punch was placed in a centrifugal filter with 0.45 μηι nylon membrane (VWR). One hundred μΐ of HPLC grade water (JT Baker) was added to the centrifugal filter containing the punch. The punches were vortexed gently for 10 minutes then spun down at 14,000 rcf for 2 minutes. The flow-through was removed and transferred back on to the punch for a second round of extraction. For the second round of extraction, the punches were vortexed gently for 3 minutes then spun down at 14,000 rcf for 2 minutes. Twenty microliters of the filtrate from each sample was then transferred to a 0.5 ml eppendorf tube for MALDI analysis. All subsequent sample preparation steps were carried out in a custom designed humidity and temperature control chamber (Coy Laboratory). The temperature was set to 30 °C and the relative humidity at 10%.
An equal volume of freshly prepared matrix (25 mg of sinapinic acid per 1 ml of 50% acetonitrile:50% water plus 0.1% TFA) was added to each 20μ1 serum extract and the mix vortexed for 30 sec. The first three aliquots (2 x 2μ1) of sample:matrix mix were discarded into the tube cap. Eight aliquots of 2μ1 sampleimatrix mix were then spotted onto 8 different sample spot locations of a stainless steel MALDI target plate (SimulTOF). The MALDI target was allowed to dry in the chamber before placement in the MALDI mass spectrometer.
This set of samples was processed for MALDI analysis in 6 batches. QC samples were added to the beginning (2 preparations) and end (2 preparations) of each batch run.
Spectral acquisition
MALDI spectra were obtained using a MALDI-TOF mass spectrometer (SimulTOF 100 from Virgin Instruments, Sudbury, MA, USA). The instrument was set to operate in positive ion mode, with ions generated using a 349 nm, diode-pumped, frequency-tripled Nd:YLF laser operated at a laser repetition rate of 0.5 kHz. External calibration was performed using a mixture of standard proteins (Bruker Daltonics, Germany) consisting of insulin (m/z 5734.51), ubiquitin (m/z 8565.76 ), cytochrome C (m/z 12360.97), and myoglobin (m/z 16952.30).
Spectra from each MALDI spot were collected as 800 shot spectra that were 'hardware averaged' as the laser fires continuously across the spot while the stage is moving at a speed of 0.25 mm/sec. A minimum intensity threshold of 0.01 V was used to discard any 'flat line' spectra. All 800 shot spectra with intensity above this threshold were acquired without any further processing. The spectral acquisition used a raster scanning method which is described in U.S. patent application publication 2013/0320203 of H. Roder et al., inventors.
Raster Spectral Preprocessing
Raster spectra rescaling by batch
A coarse alignment step was performed to overcome shifts in the m/z grid resulting from instrument calibration. As the instrument is recalibrated prior to batch acquisition, rescaling was performed independently by batch. An m/z grid shift factor was determined for each batch by comparing peaks in the first acquired reference spectrum to a historical reference spectrum. The m/z grid from the historical reference was applied to the newly acquired spectra with the calculated shift.
Alignment and filtering of raster spectra
This workflow performs a ripple filter, as it was observed that using this procedure improved the resulting averages in terms of noise. The spectra were then background subtracted and peaks were found in order to perform alignment. The spectra that were used in averaging were the aligned ripple filtered spectra without any other preprocessing. The calibration step used a set of 43 alignment points listed below in table 14. Additional filtering parameters required that the spectra had at least 20 peaks and that at least 5 of the alignment points were used in alignment.
Table 14 Alignment points used to align the raster spectra
Figure imgf000045_0001
Figure imgf000046_0001
Raster Spectra Averaging
Averages were created from the pool of rescaled, aligned and filtered raster spectra. We collected multiple 800 shot spectra per spot, so that we end up with a pool in excess of 500 in number of 800 shot raster spectra from the 8 spots from each sample. We randomly select 500 from this pool, which we average together to create a final 400,000 shot average deep MALDI spectrum. Pre-Processing of Averaged Spectra Background estimation and subtraction
Details regarding background subtraction are known in the art and describe in US Patent 7,736,905, the content of which is incorporated by reference. Estimation of background was performed with additional consideration for the high mass region. The two window method of background estimation and subtraction was used (Table 15).
Table 15: Background estimation windows
Figure imgf000047_0001
Normalization of spectra A normalization scalar was determined for each spectrum using a set of normalization windows. These windows were taken from the bin method parameters from a pre-existing project using Deep-MALDI. While a new set of windows was investigated for this Example dataset, a superior set was not found. The normalization was performed in a two stage process. First, the spectra were normalized using the windows found in table 16. Following, the spectra were normalized using the windows found in table 1 7.
Table 16: Step 1 normalization windows
Figure imgf000047_0002
Figure imgf000048_0001
Table 17: Step 2 normalization windows
Figure imgf000048_0002
The normalization scalars that were found for each average were compared by t-test by clinical group Relapse (patients relapsing after RPE) versus NoRelapse (patients not relapsing after RPE). As shown in Figure 17, the scalars were not found to be significantly associated with patient relapse status. (Note, at this point we have not yet initiated the classifier development process of Figure 1 and hence have not yet generated or assigned class labels for the samples. We just used the Relapse and NoRelapse labels to confirm that our normalization scalars were acceptable.)
Average spectra alignment
The peak alignment of the average spectra is typically very good; however, a fine- tune alignment step was performed to address minor differences in peak positions in the spectra. A set of alignment points was identified and applied to the analysis spectra (table 18).
Table 18: Calibration points used to align the spectral averages
Figure imgf000048_0003
Figure imgf000049_0001
Feature definitions
Feature definitions (i.e., selection of features or m/z ranges to use for classification) were selected interactively by viewing the spectra. The left and right boundaries were assigned manually using an overlay of many spectra. The process was performed iteratively over batches to ensure that the boundaries and features were representative of the whole dataset. A final iteration was performed using the class labels assigned to the spectra of 'Relapse' and 'No Relapse' to ensure selected features were appropriately assigned considering these clinical groupings. A total of 329 features were identified to use in the new classifier development project. These feature definitions were applied to all spectra to create a feature table of feature values. An example of the selected features is shown in Figure 18. The full list of feature definitions can be found in Example 3 Appendix A, table Al . After the feature definitions are assigned, a feature table is created by computing the integrated intensity value of the spectra over each of the features listed in the Example 3 Appendix A table Al . Batch correction of spectra SerumP3 Analysis
Two preparations of the reference sample, SerumP3, were plated at the beginning (1 , 2) and end (3, 4) of each run. The purpose of these samples is to ensure that variations by batch due to slight changes in instrument performance (for example, aging of the detector) can be corrected for. The section below describes the batch correction procedure. To perform batch correction, one spectrum must serve as the reference for the batch which is an average of one of the preparations from the beginning and one from the end of the batch. A procedure for selecting the pair is first described. The reference samples were preprocessed as described above. All 329 features were used to evaluate the possible combinations (1 -3, 1 -4, 2-3, 2-4). We compared each possible combination of replicates using the function:
A = min (abs (l-ftrvall/ftrval2), abs (l-ftrval2/ftrvall)) where ftrvall (ftrval2) is the value of a feature for the first (second) replicate of the replicate pair. This quantity A gives a measure of how similar the replicates of the pair are. For each feature, A is reported. If the value is >0.5, then the feature is determined to be discordant, or 'Bad'. A tally of the bad features is reported for each possible combination. If the value of A is <0.1 , then the feature is determined to be concordant and reported as 'Good'. A tally of the Good features is reported for each possible combination. Using the tallies of Bad and Good features from each possible combination, we computed the ratio of Bad/Good. The combination with the lowest ratio was reported as the most similar combination and unlikely to contain any systematic or localized outlier behavior in either of the reference spectra. Finally, if no ratio can be found that is less than 0.25, then the batch is a failure. This threshold was easily met for all batches. The highest threshold was 0.125. Batch Correction
Batch 1 was used as the baseline batch to correct all other batches. The reference sample was used to find the correction coefficients for each of the batches 2-6 by the following procedure. Within each batch j (2≤j≤6), the ratio and the average amplitude
Figure imgf000051_0005
t
Figure imgf000051_0004
are defined for each feature centered at
Figure imgf000051_0006
where
Figure imgf000051_0001
is the average
Figure imgf000051_0013
reference spectra amplitude of feature i in the batch being corrected and
Figure imgf000051_0007
is the reference spectra amplitude of feature i in batch 1 (the reference standard). It is assumed that the ratio of amplitudes between two batches follows the dependence
Figure imgf000051_0002
On a batch to batch basis, a continuous fit is constructed by minimizing the sum of the square residuals, , and using the experimental data of
Figure imgf000051_0003
the reference sample. The SerumP3 reference samples are used to calculate the correction function. Steps were taken to not include outlier points in order to avoid bias in the parameter estimates. The values of the coefficients α0, α1, b0, b1 and c0, obtained for the different batches are listed in Example 3 Appendix B (table B. l ). The projection in the
Figure imgf000051_0012
versus
Figure imgf000051_0008
plane of the points used to construct the fit for each batch of reference spectra, together with the surface defined by the fit itself, is shown in figure B. l of Appendix B.
Once the final fit,
Figure imgf000051_0009
is determined for each batch, the next step is to correct, for all the samples, all the features (with amplitude A at (m/z)) according to
After this correction, the corrected feature values
Figure imgf000051_0010
Figure imgf000051_0011
calculated for reference spectra lie around the horizontal line defined by r = 1, as shown in Figure B.2 of Example 3 Appendix B. Post correction coefficients are calculated to compare to quality control thresholds. These coefficients can be found in Example 3 Appendix B table B.2 and the corresponding plots in Figure B.2 of the appendix.
Final feature table assembly
Normalization by Partial Ion Current (PIC) method The batch corrected feature table was examined to find regions on intrinsic stability to use as the final normalization windows. First, the univariate p values were found by comparing the clinical groups Relapse and No Relapse. Features with p values less than 0.15 were excluded from the PIC analysis as these features may contribute meaningful information in test development. A set of 188 features were used in the PIC analysis, of which 13 features were used in normalization (see table 19).
Table 19: Features used in the final normalization
Figure imgf000052_0001
Partial ion current normalization of spectra is known in the art, see e.g., U.S. patent 7,736,905, therefore a detailed description is omitted for the sake of brevity.
The normalization scalars computed using the features found in table 19 were compared by clinical group (Relapse, NoRelapse) to ensure normalization would not impede the new classifier development effort. As shown in Figure 19, no association was found between the scalars and the clinical group.
Following PIC normalization, the feature table was finalized for use in the classifier development process described below. That is, integrated intensity values of the features selected for classification was computed and stored in a table for each of the spectra in the development set.
SerumP3 analysis of features
As a final assessment of the preprocessing procedure, the Serum P3 samples were analyzed across all batches in the initial feature table and following the PIC normalization. Prior to batch correction, the median and average CVs were 14.2% and 17.5% respectively. Following batch correction and the final normalization, the median and average CVs for the SerumP3 samples were 13.7% and 17.4%. These modest improvements reflect the relatively small role of batch correction in the processing of data and demonstrate that little variability is introduced across batches.
Classifier development for Example 3 The new classifier development process was carried out using the platform/methodology shown in Figure 1 , and described previously at some length, which we have termed "Diagnostic Cortex"™ . The methodology of Figure 1 is particularly useful for constructing a classifier and building a prognostic test where it is not a priori obvious which patients should be assigned to the better or worse prognosis groups (Low and High Risk, or Early and Late relapse/progression, respectively in Figure 1 , blocks 1 104 and 1 106). The risk of overfitting to the data is minimized by regularization (step 1 132) and the use of majority voting or average probability cutoff in the selection or definition of the final classifier at step 1 144. Confidence in performance metrics for a classifier generated by the method of Figure 1 is enhanced by the observation of many master classifiers (MCs) with similarly good performance and the use of out-of-bag estimates for performance metrics.
The classifier generation procedure is described in some detail in Examples 1 and 2 above. The reader is also directed to the US patent application publication no. 2015/0102216, H. Roder et al. inventors, for a further description and examples of the methodology. The following discussion will provide further explanations of the method in the present Example 3.
Definition of class labels
As shown in Figure 1 step 1 102, an initial class label assignment is made for each of the samples in the development set 1 100, in this example the 124 blood-based samples that passed QC filtering and for which patient clinical data was available. In this example, we are trying to assign the correct class label for each sample, either Low Risk or High Risk (or, equivalently, Late or Early, respectively), with Low Risk or the equivalent signifying good prognosis, indolence, and late progression of disease and High Risk or the equivalent signifying relatively poor prognosis, aggressiveness of the prostate cancer, and early progression of disease. Time-to-event data, in this case time from sample collection to relapse after RJPE was used for assigning the initial class label and classifier training. In this situation, class labels are not obvious and, as shown in Figure 1 , the method uses an iterative method to refine class labels at the same time as creating the classifier. See loop 1 142. An initial guess is made for the class labels at step 1 102. The samples are sorted on time to relapse and half of the samples with the lowest time-to-event outcome are assigned the "Early" class label (early relapse, i.e. poor outcome, high risk) while the other half are assigned the "Late" class label (late relapse, i.e. good outcome, low risk). A classifier is then constructed using the outcome data and these class labels. This classifier can then be used to generate classifications for all of the development set samples and these are then used as the new class labels for a second iteration of the classifier construction step. This process is iterated until convergence (i.e., the number of persistently misclassified samples is minimized at step 1 140 after multiple iterations through the process of Figure 1 including loop 1 142).
Creation and Filtering of Mini-Classifiers (steps 1 120 and 1 126)
The development set samples 1 100 were split into training and test sets in multiple different random realizations. See Step 1 108, Figure 1 and loop 1 136. Six hundred and twenty five realizations (iterations through loop 1 136) were used. In step 1 120, many k-nearest neighbor (kNN) mini-classifiers (mCs) that use the training set as their reference set were constructed using subsets of features. In this project we tried two different approaches in terms of the nature of features used by the mini-classifiers. In approach (1), see description below, we used only mass spectral features while in approach (2), see description below, in addition to those mass spectral features, we also used age, PSA and % fPSA as features for classification by the mini-classifiers.
To be able to consider subsets of single, two, or three features and improve classifier performance, it was necessary to deselect features that were not useful for classification from the set of 329 features of Example 3 Appendix A. Feature deselection was carried out using the bagged method outlined in Example 3 Appendix C. In the case of approach (2), age, PSA and % fPSA did not pass the filtering criteria of the bagged method more times than the applied threshold, but we kept these three features for classifier training nevertheless. The methodology of deselection of features is disclosed in U.S. provisional application of J. Roder et al., serial no. 62/154,844 filed April 30, 2015, the contents of which is incorporated by reference herein. To target a final classifier that has certain performance characteristics, these mCs are filtered at step 1 126. Each mC is applied to its training set and performance metrics are calculated from the resulting classifications of the training set. Only mCs that satisfy thresholds on these performance metrics pass filtering to be used further in the process. The mCs that fail filtering are discarded. For this project only hazard ratio filtering was used, i.e. the classifier was applied to the training set of samples and the hazard ratio calculated between the time to relapse for the two classification groups had to lie within a preset range for the mC to pass filtering. The filtering options used in this project are listed in table 20
Table 20 Filtering parameters used in step 1126 Figure 1
Figure imgf000055_0001
Here in Table 20 and below, "iteration" means an exercise of classifier generation using the through the loop 1 142 of Figure 1 with "iteration 0" referring to an initial iteration through the process, "iteration 1" referring to a second iteration, etc. It will be appreciated that by experimenting with the parameters for the classifier generation process, such as for example filtering parameters for the mini-classifiers, the number of features used by the mini- classifiers, or inclusion of additional non-mass spectral features for classification such as PSA level, age, etc., and performing the process of Figure 1 many times, one can explore the performance of classifiers generated using the process of Figure 1 to find one that has optimal performance.
Combination of mini-classifiers using logistic regression with drop-out
Once the filtering step 1 126 is complete, at step 1 130, the mini-classifiers are combined into one master classifier using logistic regression trained using the training set labels as indicated 1 132 in Figure 1. To help avoid overfitting the regression is regularized using extreme drop out with only a small number of the mCs chosen randomly for inclusion in each of the logistic regression iterations. The number of dropout iterations in step 1 132 was selected based on the typical number of mCs passing filtering to ensure that each mC was likely to be included within the drop out process multiple times. For this project 10 mCs were randomly selected for each drop out iteration. The number of drop out iterations that were carried out in each iteration are listed in table 21.
Table 21: Number of drop out iterations used
Figure imgf000056_0001
Training/test set splits (loop 1 136) The use of multiple training/test splits (loop 1 136) and evaluation of Master
Classifier (MC) performance on the new test set in each iteration) avoids selection of a single, particularly advantageous or difficult, training set for classifier creation and avoids bias in performance assessment from testing on a test set that could be especially easy or difficult to classify. The output of the logistic regression performed at step 1 132 that defines each MC is a probability of being in one of the two training classes (Early or Late). During the iterative classifier construction and label refinement process, classifications were assigned by majority vote of the individual MC labels obtained with a cutoff of 0.5 applied to the logistic regression output. This process was modified to incorporate only MCs where the sample was not in the training set (modified, or "out-of-bag" majority vote, MMV).
Example 3 Results
The performance of the classifiers was assessed using Kaplan-Meier plots of time to relapse (time between sample collection and relapse after RPE), TTR, of samples classified as Early and Late, together with corresponding hazard ratios (HRs) and log-rank p values. Kaplan-Meier plots corresponding to the data in table 22 are shown in Figure 20. The classifications per sample are listed in Example 3 Appendix E. Note in Figure 20 that the classifiers generated in both approaches show a clear separation in time to relapse between the Early and Late class label groups. The results are summarized in table 22. Table 22: Performance summary for time to relapse (Early vs Late)
Figure imgf000057_0001
Table 23: Percent relapse free for each classification risk group at 3, 4 and 5 years after sample collection
Figure imgf000057_0002
Table 24: Multivariate analysis of time to relapse
Figure imgf000057_0003
Baseline clinical characteristics are summarized by classification group in table 25.
Table 25: Clinical characteristics by classification group
Figure imgf000057_0004
Figure imgf000058_0001
The sample classifications were identical for the two approaches except for three samples which swapped classifications between the two. Inclusion of PSA, %fPSA and age may improve classification (Approach 2), but any improvement seems to be quite marginal. This is consistent with the lack of significance of PSA, %fPSA, and age as predictive factors for outcome in the multivariate analysis of table 25. Test classification remains a significant predictor of TTR and is the only available significantly predictive factor of TTR in multivariate analysis. While there is an indication that patients with higher TGS from RPE tend to be assigned an Early classification (5/6 patients with TGS 8 from RPE are classified as Early), larger sample numbers would be required to demonstrate this conclusively. As the vast majority of patients in this study had TGS by biopsy of 6, it is clear that the classifications obtained from the mass spectral analysis provide information in addition to Gleason score at time of diagnosis, before additional, more reliable tumor staging can be obtained after RPE. Furthermore, this information is independent of PSA and %fPSA measurements as shown by Mann- Whitney tests performed to assess association between these variables and the classification groups (table 26).
Table 26: Mann-Whitney test p-values
Figure imgf000059_0001
Conclusions and clinical significance of classifier generated in Example 3 Applying the procedure of Figure 1 to the feature table obtained from Deep MALDI spectra generated from serum samples collected from low risk prostate cancer patients and associated outcome data, it was possible to create a test able to stratify patients into two groups with better and worse prognosis following RPE, thus differentiating indolent from aggressive prostate cancer using a blood-based sample prior to RPE. The difference in TTR between the two classification groups was statistically significant and clinically meaningful, with a hazard ratio of around 2.5. See Figure 20 and Tables 22-25. Slightly less than half of the patients were assigned to the poor prognosis group (Early). Five years after sample collection (at least 4 years after RPE), 92% of the patients in the good prognosis group were disease free compared with only 77% in the poor prognosis group (Late). This difference increased at ten years post sample collection, with 83% of patients relapse-free in the good prognosis group compared with 59% in the poor prognosis group.
The next step in the development of this potentially clinically useful test is to validate the current results in an independent cohort of patients in a similar indication. (See Figure 1 step 1 148). This is planned using an additional sample set collected from patients in the TPCSDP.
These results are in line with previous work on low risk prostate cancer based on plasma samples collected from patients in a watchful waiting protocol. See Examples 1 and 2. In the case of Example 2 (cohort of patients on watchful waiting with TGS of 7 or lower) at five years after sample collection, 88% of patients were progression-free in the good prognosis group compared with 69% of patients in the poor prognosis group, and the hazard ratio for time to progression between good and poor prognosis groups was 2.95 (95% CI: 1.13-5.83). In the present study, the indication was similar (low risk prostate cancer with Gleason score of 6 or below); however, in this present cohort all patients underwent RPE soon after diagnosis. As one would expect that this latter treatment paradigm should improve outcomes for the poor prognosis group more than the good prognosis group, one would expect that the hazard ratio in the present setting should be smaller than that in the watchful waiting setting. The consistency between the two development projects adds to our confidence in the classifiers described in this disclosure and their performance estimates.
As watchful waiting or active surveillance protocols are now becoming more widely applied to these "low risk" prostate cancer patients (see Klotz L, Zhang L, Lam A, et al, Long-term follow up of a large active surveillance cohort of patients with prostate cancer J. Clin. Oncol. 2015 (33):272-277; Morash C, Tey R, Agbassi C, et al., Can Urol Assoc 2015: 9(5-6): 171 -178) and there are recognized issues determining whether all these patients should be considered as really "low risk" (see Cooperberg M., Long-Term Active Surveillance for Prostate Cancer: Answers and Questions. J. Clin. Oncol. 2015: 33 (3): 238- 240), it would seem that clinical utility of the test in Example 3 may lie more in the prediction of outcomes following diagnosis of prostate cancer with Gleason score from biopsy of 6 or lower in an active surveillance setting, than in prediction of outcomes following RPE in this population. The test could indicate which patients in this "low risk" setting are really good candidates for active surveillance/watchful waiting and which patients should go straight on to more aggressive treatment regimens such as immediate RPE. Acquiring a set of serum samples from an active surveillance population to test performance of this test in that setting is therefore an important next step. As explained above, one might expect an even better separation in outcomes between classification groups in the active surveillance setting. In addition, as this test is prognostic of relapse following RPE, it could be useful to predict prognosis of patients with higher risk prostate cancer who undergo immediate RPE. Presumably the test should still have some predictive power for time to relapse even in the setting of patients with higher biopsy Gleason scores and it may be able to provide additional information to physicians trying to assess how aggressive a patient's prostate cancer is prior to RPE and possibly indicate the need for additional supportive therapies.
Testing system
After a classifier for predicting indolence or aggressiveness of prostate cancer has been generated and defined as explained in Examples 1 -3 (including specifying the feature table with intensity values, final classifier definition, mini-classifier parameters including filtering etc.), it is now ready for use to classify a blood-based sample from a prostate cancer patient to assign a class label for the sample as either Early (high risk of relapse/aggressive) or Late (low risk/indolence). The class label is provided to the medical practitioner ordering the test. The class label can be used to guide treatment, for example initiating more aggressive treatment if the class label is Early or the equivalent.
Figure 21 is an illustration of a system for processing a test sample (in this example a blood-based sample from a prostate cancer patient) using a classifier generated in accordance with Figure 1. The system includes a mass spectrometer 2106 and a general purpose computer 21 10 implementing a final classifier 2120 coded as machine-readable instructions and a constitutive mass spectral data set including a feature table 2122 of class-labeled mass spectrometry data stored in memory 21 14. It will be appreciated that the mass spectrometer 2106 and computer 21 10 of Figure 21 could be used to generate the classifier in accordance with the classifier development process of Figure 1 . The operation of the system of Figure 21 will be described in the context of a predictive test for indolence or aggressiveness of prostate cancer as explained in the above Examples, but it will be appreciated that the methodology described in this section can be used in other examples.
The system of Figure 21 obtains a multitude of samples 2100, e.g., blood-based samples (serum or plasma) from diverse prostate cancer patients. The samples 2100 are used by the classifier (implemented in the computer 21 10) to make predictions as to whether the patient providing the sample is likely to have aggressive or indolent prostate cancer, and typically will be have just been diagnosed with "low risk" prostate cancer (TGS <7) with the physician deciding whether watchful waiting/active surveillance is an appropriate treatment protocol or maybe in an indication ready to undergo RPE and the physician may require additional prognostic information to plan additional supportive therapy post RPE. The outcome of the test is a binary class label, such as Low Risk, Low, Late, or the equivalent, or High Risk, High, Early or the equivalent, with Low or the equivalent indicating that the patient is likely to have an indolent form of the cancer and High meaning that the patient is likely to have an aggressive form of the cancer. The particularly moniker for the class label is not important and could be in accordance any binary system.
The samples may be obtained on serum cards or the like in which the blood-based sample is blotted onto a cellulose or other type card. The obtaining of the mass spectra and the pre-processing of the spectra will normally follow the methods used in generating the classifier in accordance with Figure 1 and described in the Examples. As one possible example, in which typical "Dilute and Shoot" ~ 2000 shot spectra are acquired for each sample, three aliquots of the sample are obtained. The three aliquots of the sample are spotted onto a MALDI-ToF sample "plate" 2102 and the plate inserted into a MALDI-ToF mass spectrometer 2106. The mass spectrometer 2106 acquires a mass spectrum 2108 from each of the three aliquots of the sample. The mass spectra are represented in digital form and supplied to a programmed general purpose computer 21 10. The computer 21 10 includes a central processing unit 21 12 executing programmed instructions. The memory 21 14 stores the data representing the mass spectra 2108.
The memory 21 14 also stores a final classifier 2120 defined as per the procedure of Figure at step 1 144, which includes a) a constitutive mass spectral data set 2122 in the form of a feature table of N class-labeled spectra, where N is some integer number, in this example a development set used to develop the classifier as explained in Examples 1 -3. The final classifier 2120 includes b) code 2124 representing a KNN classification algorithm (which is implemented in the mini-classifiers as explained above in Figure 1 , as well as values defining the parameters of the mini-classifiers such as features to use, etc.), c) program code 2126 for executing the final classifier generated in accordance with Figure 1 on the mass spectra of patients, including logistic regression weights and data representing master classifier(s) forming the final classifier, and d) a data structure 2128 for storing classification results, including a final class label for the test sample. The memory 21 14 also stores program code 2130 for implementing the processing shown at 2150, including code (not shown) for acquiring the mass spectral data from the mass spectrometer in step 2152; a pre-processing routine 2132 for implementing the background subtraction, normalization and alignment step 2154 (details explained above), a module (not shown) for calculating integrated intensity values at predefined m/Z positions in the background subtracted, normalized and aligned spectrum (step 2156), and a code routine 2138 for implementing the final classifier 2120 using the dataset 2122 on the values obtained at step 2156. The process 2158 produces a class label at step 2160. The module 2140 reports the class label as indicated at 2160 (i.e., "low", "Late" or the equivalent). The program code 2130 can include additional and optional modules, for example a feature correction function code 2136 (described in co-pending US patent application serial no. 14/486,442) for correcting fluctuations in performance of the mass spectrometer, a set of routines for processing the spectrum from a reference sample to define a feature correction function, a module storing feature dependent noise characteristics and generating noisy feature value realizations and classifying such noisy feature value realizations, modules storing statistical algorithms for obtaining statistical data on the performance of the classifier on the noisy feature value realizations, or modules to combine class labels defined from multiple individual replicate testing of a sample to produce a single class label for that sample. Still other optional software modules could be included as will be apparent to persons skilled in the art.
The system of Figure 21 can be implemented as a laboratory test processing center obtaining a multitude of patient samples from oncologists, patients, clinics, etc., and generating a class label for the patient samples as a fee-for-service. The mass spectrometer 2106 need not be physically located at the laboratory test center but rather the computer 21 10 could obtain the data representing the mass spectra of the test sample over a computer network.
Further considerations:
Deep-MALDI spectra
As explained in Example 3, it is possible to obtain much more spectral information from the samples used in generation of the classifier using the techniques termed "Deep- MALDI" described in the pending application of Roder et al., serial no. 13/836,436 filed March 15, 2013, the content of which is incorporated by reference herein. In that technique, more than 100,000 laser shots, and potentially hundreds of thousands or even millions of laser shots, are applied to the MALDI plate spot containing the sample (or as a sum from shots on several such MALDI plate spots). This technique produces a vastly increased amount of spectral information than obtained from typical 2,000 shot "dilute and shoot" spectra. If this technique is used, during the classifier development process there may be many dozens, if not hundreds or even thousands of potential m/z features which can be used for classifier generation. All of these features may be used for classifier development, or a statistical analysis of the features may be performed to identify those features that are most discriminatory or differentially expressed in the Low and High risk patients. If Deep MALDI is used for generating the classifier then the same procedures are used for obtaining spectral data from the sample under test. For example, the methods described in Example 3 are used in both classifier generation and in the testing environment at Figure 21 , step 2150, and in the pre-processing steps 2154.
Reselection of feature values during, iterative development of the classifier
We have found from other exercises of classifier development using the procedure of Figure 1 that when we have a feature space with a large number of features (typically hundreds or even thousands, as is often the case particular when you use Deep MALDI) and where there is some inherent ambiguity or uncertainty in the initial definition of the class labels during classifier development (as here), it can be advantageous to not only perform label flipping during iterations of the classifier development process of Figure 1 (step 1 140) but also at the same time use the new class label groupings to reselect features from the available feature space for classification (again, using the statistical methods for feature selection). This technique is explained in some detail in the related US application serial no. 14/486,442 filed September 15, 2014. In essence, and with reference to Figure 1 , when the loop 1 142 is entered and new groupings defined at the new iteration of step 1 102, at the same time new features are selected in the feature space of available mass spectrometry features using statistical analysis of the features for each of the group labels in the development set. Then, in the subsequent iteration of the step 1 120 the mini-classifiers are constructed and executed using the redefined group labels and new features. Repeated iteration of this process tends to converge on a generalizable and unique definition of both group labels and classification features. m/z features
Note that, in the above classifier development process and in applying a final classifier to a test sample, we have not found it necessary to correlate the m/z features we use for classification to particular proteins or biomarkers circulating in blood. The validity of the classifier is established by whether it works or not and whether it is generalizable to new samples. The methods we have described demonstrate that the classifier works and is generalizable. Constitutive set for classification of test samples
Once the classifier generation process of Figure 1 is followed and a final classifier defined for future testing, the data set of class-labeled spectra used in generating the classifier (and in particular a feature table of intensity values at particular m/z ranges) is stored and then used as a reference set for classification using the testing procedure of Figure 21. As noted, this "constitutive set" of spectra is obtained from blood-based samples of humans diagnosed with prostate cancer and includes patients both with indolent cancer and with aggressive cancer. This constitutive set can consist of spectra from all of the samples in a classifier development sample set (1 100) or some subset thereof.
The appended claims are offered as further descriptions of the disclosed inventions.
Appendices
Example 1 Appendix A: Feature Definitions Used in New Classifier Development for Prostate Cancer All feature definitions
Figure imgf000066_0001
Figure imgf000067_0001
Figure imgf000068_0002
Example 1 Appendix B: Samples from the Oregon Prostate Cancer data set used Classifier Development
Samples used in the Classifier Development and clinical data available
Figure imgf000068_0001
Figure imgf000069_0001
Example 1 Appendix C: MMV labels attributed to each patient after 3 label flips
Risk levels as defined in Table 1 are also included.
Figure imgf000070_0001
Figure imgf000071_0001
Example 2 appendices
Appendix A: Feature Definitions Used in New Classifier Development for Prostate Cancer All feature definitions
Figure imgf000072_0001
Figure imgf000073_0001
Figure imgf000074_0002
Example 2
Appendix B: Samples from the Oregon Prostate Cancer data set used in Classifier Development
Samples used in the Classifier development and clinical data available
Figure imgf000074_0001
Figure imgf000075_0001
Figure imgf000076_0001
Figure imgf000077_0001
Example 3
Appendix A: Feature Definitions Table A.l Feature definitions n=329
Figure imgf000079_0001
Figure imgf000079_0002
Figure imgf000080_0001
Figure imgf000080_0002
Figure imgf000081_0002
Figure imgf000081_0001
Figure imgf000082_0002
Figure imgf000082_0001
Example 3 Appendix B: Batch Correction Table B.l Batch correction coefficients
Figure imgf000083_0001
Figure B.l Batch correction plots pre-correction Batch 2 Pre Correction
Figure imgf000083_0002
Batch 3 Pre Correction
Figure imgf000084_0001
Batch 4 Pre Correction
Figure imgf000085_0001
Batch 5 'Pre Correction
Figure imgf000086_0001
Batch 6 Pre Correction
Figure imgf000087_0002
Table B.2 Batch correction coefficients on corrected tables
Figure imgf000087_0001
Figure B.2 Batch correction plots post-correction Batch 2 Post Correction
Figure imgf000088_0001
Batch 3 Post Correction
Figure imgf000089_0001
Batch 4 Post Correction
Figure imgf000090_0001
Batch 5 Post Correction
Figure imgf000091_0001
Batch 6 Post Correction
Figure imgf000092_0001
Example 3 Appendix C: Feature Deselection Method
A multitude of splits (a total of 625) of the development set samples into two subsets is created. One of the subsets is used for feature (deselection and the remainder is left aside. For each split a kNN classifier is created using the given subset as the training set of the classifier and one single feature. For this project k = 7 was used. The created classifier is applied to the training subset and the classifier performance is assessed in terms of hazard ratio between classification groups (Early vs Late). A filter is applied to these performance estimates, such that the feature only passes filtering if the classifier using this sample subset for training has adequate performance. For the approaches used in this report, the feature deselection step used K = 7 for me kNN classifiers and a hazard ratio range for filtering between 2.5 and 10.0, for both approaches in all label flip iterations.
All features that pass filtering for a given subset choice are added to a list. Tins is repeated for all the subset realizations generated. The lists of features passing filtering are then compiled across the subset realizations to determine how often a feature passes filtermg. Features that pass filtering in most of the subsets are likely to be useful and robust for the question being addressed, as they are not dependent on any particular sample subset. Features that pass filtering for very few subset realizations are likely to have been overfitted to those few subsets and are not likely to be useful.
Figure C.1 shows an example of the distribution of how many features pass filtering in how many subset realizations.
It is apparent: thai the distribution falls off quite quickly with a tail containing features that occur in a relatively large proportion of subset realizations, which are those winch are likely to be most useful for classifier development.
Figure C.1 : Number of features passing filtering for a given number of subset realizations f y axis} vs. the number of subset realizations. {Red iirse shows the cut off for which features were deselected for that specific iteration)
Figure imgf000094_0001
Example 3 Appendix D: Features used in final classifiers
Figure imgf000095_0001
Figure imgf000096_0001
Figure imgf000097_0001
ge at diagnosis; 30002: PSA {ng / ml}; 30003: fPSA (%). All other features refer to m/z values. Example 3 Appendix E: Classifications by sample
Figure imgf000098_0001
Figure imgf000099_0001
Figure imgf000100_0001

Claims

Claims We claim:
1. A method for predicting the aggressiveness or indolence of prostate cancer in a patient previously diagnosed with prostate cancer, comprising the steps of: obtaining a blood-based sample from the prostate cancer patient; conducting mass spectrometry of the blood-based sample with a mass spectrometer and thereby obtaining mass spectral data including intensity values at a multitude of m/z features in a spectrum produced by the mass spectrometer; performing pre-processing operations on the mass spectral data; classifying the sample with a programmed computer implementing a classifier operating on the intensity values of the sample after the pre-processing operations are performed and a set of stored intensity values of m/z features from a constitutive set of mass spectra obtained from blood-based samples of a multitude of prostate cancer patients; wherein the classifier produces a class label for the blood based sample of High, Early, or the equivalent signifying the patient is at high risk of early progression/relapse of the prostate cancer indicating aggressiveness of the prostate cancer, or Low, Late or the equivalent, signifying that the patient is at low risk of early progression/relapse of the prostate cancer indicating indolence of the prostate cancer.
2. The method of claim 1, wherein the mini-classifiers execute a K-nearest neighbor classification algorithm on a set of features selected from the list of features set forth in Example 1 Appendix A, Example 2 Appendix A, or Example 3 Appendix A.
3. The method of claim 1, wherein the classifier is defined from one or more master classifiers generated by conducting logistic regression with extreme drop-out on a multitude of mini-classifiers which meet predefined filtering criteria.
4. The method of claim 1, wherein non-mass spectral information on the patient whose sample is tested in claim 1 is obtained, including at least one of age, PSA and % fPSA, wherein such non-mass spectral information is also obtained for each prostate cancer patient whose blood-based sample is a member of the constitutive set and stored in a computer memory, and wherein the final classifier uses such non-mass spectral information in addition to the mass spectral data when generating a class label for the sample.
5. The method of claim 1, wherein each prostate cancer patient whose sample is a member of the constitutive set supplied the sample after diagnosis with prostate cancer but before radical prostatectomy (RPE).
6. The method of claim 1, wherein each prostate cancer patient whose sample is a member of the constitutive set has a Total Gleason Score of 6 or lower at the time the blood- based sample from such patient was obtained.
7. A system for prostate cancer aggressiveness or indolence prediction, comprising: a computer system including a memory storing a final classifier in memory defined from one or more master classifiers generated by conducting logistic regression with extreme drop-out on a multitude of mini-classifiers which meet predefined filtering criteria, a set of mass spectrometry feature values for a constitutive set for classification, the set of mass spectrometry feature values obtained from blood-based samples of prostate cancer patients, a classification algorithm and a set of logistic regression weighting coefficients derived from a combination of filtered mini-classifiers with dropout regularization; the computer system including program code for executing the final classifier on a set of mass spectrometry feature values obtained from mass spectrometry of a blood-based sample of a human with prostate cancer.
8. The computer system of claim 7. wherein non-mass spectral information for each prostate cancer patient whose blood-based samples are in the constitutive set is stored in the memory, including at least one of age, PSA and % fPSA.
9. The computer system of claim 7, wherein each prostate cancer patient whose sample is a member of the constitutive set supplied the sample after diagnosis with prostate cancer but before radical prostatectomy (RPE).
10. The computer system of claim 7, wherein each prostate cancer patient whose sample is a member of the constitutive set has a Total Gleason Score of 6 or lower at the time the blood-based sample from such patient was obtained.
11. A laboratory test system for conducting a test on a blood-based sample from a prostate cancer patient to predict aggressiveness or indolence of the prostate cancer comprising, in combination: a mass spectrometer conducting mass spectrometry of the blood-based sample with a mass spectrometer and thereby obtaining mass spectral data including intensity values at a multitude of m/z features in a spectrum produced by the mass spectrometer; and a programmed computer including code for performing pre-processing operations on the mass spectral data and classifying the sample with a final classifier defined by one or more master classifiers generated as a combination of filtered mini-classifiers with regularization, the final classifier operating on the intensity values of the sample after the preprocessing operations are performed and a set of stored values of m/z features from a constitutive set of mass spectra obtained from blood-based samples of prostate cancer patients; the programmed computer producing a class label for the blood-based sample of High, Early or the equivalent signifying the patient is at high risk of early progression/relapse of the prostate cancer indicating aggressiveness of the prostate cancer, or Low, Late or the equivalent, signifying that the patient is at low risk of early progression/relapse of the prostate cancer indicating indolence of the cancer.
12. The system of claim 11, wherein the m/z features are selected from the list of features comprising Example 1 Appendix A, Example 2 Appendix A, or Example 3
Appendix A.
13. The system of claim 11, wherein the mass spectrum of the blood-based sample is obtained from at least 100,000 laser shots applied to the blood-based sample using
MALDI-TOF mass spectrometry.
14. The method of claim 1, wherein the mass spectrum of the blood-based sample is obtained from at least 100,000 laser shots applied to the sample using MALDI-TOF mass spectrometry
15. A programmed computer operating as a classifier for predicting prostate cancer aggressiveness or indolence, comprising a processing unit and a memory storing a final classifier in the form of a set of feature values for a set of mass spectrometry features forming a constitutive set of mass spectra obtained from blood-based samples of prostate cancer patients, and a final classifier defined as a majority vote or average probability cutoff, of a multitude of master classifiers constructed from a combination of mini-classifiers with dropout regularization.
PCT/US2015/052927 2014-10-02 2015-09-29 Predictive test for aggressiveness or indolence of prostate cancer from mass spectrometry of blood-based sample WO2016054031A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP15846544.3A EP3201812B1 (en) 2014-10-02 2015-09-29 Predictive test for aggressiveness or indolence of prostate cancer from mass spectrometry of blood-based sample

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201462058792P 2014-10-02 2014-10-02
US62/058,792 2014-10-02

Publications (1)

Publication Number Publication Date
WO2016054031A1 true WO2016054031A1 (en) 2016-04-07

Family

ID=55631358

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2015/052927 WO2016054031A1 (en) 2014-10-02 2015-09-29 Predictive test for aggressiveness or indolence of prostate cancer from mass spectrometry of blood-based sample

Country Status (4)

Country Link
US (2) US9779204B2 (en)
EP (1) EP3201812B1 (en)
TW (1) TW201617030A (en)
WO (1) WO2016054031A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019118873A3 (en) * 2017-12-15 2019-10-24 Iovance Biotherapeutics, Inc. Systems and methods for determining the beneficial administration of tumor infiltrating lymphocytes, and methods of use thereof and beneficial administration of tumor infiltrating lymphocytes, and methods of use thereof
CN110383069A (en) * 2017-01-05 2019-10-25 佰欧迪塞克斯公司 For identifying the method for persistently benefiting from the cancer patient of immunotherapy in overall poor prognosis subgroup
US11710539B2 (en) 2016-02-01 2023-07-25 Biodesix, Inc. Predictive test for melanoma patient benefit from interleukin-2 (IL2) therapy

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017011439A1 (en) 2015-07-13 2017-01-19 Biodesix, Inc. Predictive test for melanoma patient benefit from pd-1 antibody drug and classifier development methods
US9552548B1 (en) * 2016-07-01 2017-01-24 Intraspexion Inc. Using classified text and deep learning algorithms to identify risk and provide early warning
WO2019140275A1 (en) * 2018-01-12 2019-07-18 Nova Southeastern University Assessment of human comprehension by an automated agent
US11656174B2 (en) 2018-01-26 2023-05-23 Viavi Solutions Inc. Outlier detection for spectroscopic classification
US11009452B2 (en) * 2018-01-26 2021-05-18 Viavi Solutions Inc. Reduced false positive identification for spectroscopic quantification
US10810408B2 (en) 2018-01-26 2020-10-20 Viavi Solutions Inc. Reduced false positive identification for spectroscopic classification
BR102020015916A2 (en) * 2020-08-04 2022-02-15 Universidade Estadual De Campinas - Unicamp Automatic method for molecular selection
US11476003B2 (en) 2020-12-15 2022-10-18 Biodesix, Inc. Method for predicting risk of unfavorable outcomes, e.g., in COVID-19 hospitalization, from clinical characteristics and basic laboratory findings
WO2023141569A1 (en) 2022-01-21 2023-07-27 Biodesix, Inc. Sensitive and accurate feature values from deep maldi spectra

Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6578003B1 (en) * 1997-07-31 2003-06-10 Schering Corporation Method and apparatus for improving patient compliance with prescriptions
US20050282199A1 (en) * 2004-05-11 2005-12-22 Slawin Kevin M Method to predict prostate cancer
US20090208921A1 (en) 2005-08-16 2009-08-20 Sloan Kettering Institute For Cancer Research Methods of detection of cancer using peptide profiles
US7736905B2 (en) 2006-03-31 2010-06-15 Biodesix, Inc. Method and system for determining whether a drug will be effective on a patient with a disease
US7811772B2 (en) 2005-01-06 2010-10-12 Eastern Virginia Medical School Apolipoprotein A-II isoform as a biomarker for prostate cancer
US7906342B2 (en) 2006-03-31 2011-03-15 Biodesix, Inc. Monitoring treatment of cancer patients with drugs targeting EGFR pathway using mass spectrometry of patient samples
US20110142301A1 (en) * 2006-09-22 2011-06-16 Koninklijke Philips Electronics N. V. Advanced computer-aided diagnosis of lung nodules
US20110218950A1 (en) * 2008-06-02 2011-09-08 New York University Method, system, and computer-accessible medium for classification of at least one ictal state
US20120121618A1 (en) * 2009-02-12 2012-05-17 Dana-Farber Cancer Institute, Inc. Predicting And Treating Prostate Cancer
US8440409B2 (en) 2005-09-19 2013-05-14 The Johns Hopkins University Protein C inhibitor as a biomarker for prostate cancer
US20130320203A1 (en) * 2012-05-29 2013-12-05 Biodesix, Inc. Deep-MALDI TOF mass spectrometry of complex biological samples, e.g., serum, and uses thereof
US20140106369A1 (en) * 2011-03-22 2014-04-17 The Johns Hopkins University Biomarkers for aggressive prostate cancer
US8718996B2 (en) 2012-07-05 2014-05-06 Biodesix, Inc. Method for predicting whether a cancer patient will not benefit from platinum-based chemotherapy agents
WO2014074821A1 (en) * 2012-11-09 2014-05-15 Dana-Farber Cancer Institute, Inc. Metabolic profiling in tissue and serum is indicative of tumor differentiation in prostate cancer
US8731839B2 (en) 2006-07-27 2014-05-20 International Business Machines Corporation Method and system for robust classification strategy for cancer detection from mass spectrometry data
US20140284468A1 (en) * 2010-02-24 2014-09-25 Biodesix, Inc. Cancer patient selection for administration of therapeutic agents using mass spectral analysis of blood-based samples

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7991557B2 (en) * 2004-06-19 2011-08-02 Genenews Corporation Computer system and methods for constructing biological classifiers and uses thereof
US7858389B2 (en) * 2006-03-31 2010-12-28 Biodesix, Inc. Selection of non-small-cell lung cancer patients for treatment with monoclonal antibody drugs targeting EGFR pathway
CA2924320A1 (en) 2013-09-16 2015-03-19 Biodesix, Inc. Classifier generation method using combination of mini-classifiers with regularization and uses thereof

Patent Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6578003B1 (en) * 1997-07-31 2003-06-10 Schering Corporation Method and apparatus for improving patient compliance with prescriptions
US20050282199A1 (en) * 2004-05-11 2005-12-22 Slawin Kevin M Method to predict prostate cancer
US7811772B2 (en) 2005-01-06 2010-10-12 Eastern Virginia Medical School Apolipoprotein A-II isoform as a biomarker for prostate cancer
US20090208921A1 (en) 2005-08-16 2009-08-20 Sloan Kettering Institute For Cancer Research Methods of detection of cancer using peptide profiles
US8440409B2 (en) 2005-09-19 2013-05-14 The Johns Hopkins University Protein C inhibitor as a biomarker for prostate cancer
US7736905B2 (en) 2006-03-31 2010-06-15 Biodesix, Inc. Method and system for determining whether a drug will be effective on a patient with a disease
US7906342B2 (en) 2006-03-31 2011-03-15 Biodesix, Inc. Monitoring treatment of cancer patients with drugs targeting EGFR pathway using mass spectrometry of patient samples
US8731839B2 (en) 2006-07-27 2014-05-20 International Business Machines Corporation Method and system for robust classification strategy for cancer detection from mass spectrometry data
US20110142301A1 (en) * 2006-09-22 2011-06-16 Koninklijke Philips Electronics N. V. Advanced computer-aided diagnosis of lung nodules
US20110218950A1 (en) * 2008-06-02 2011-09-08 New York University Method, system, and computer-accessible medium for classification of at least one ictal state
US20120121618A1 (en) * 2009-02-12 2012-05-17 Dana-Farber Cancer Institute, Inc. Predicting And Treating Prostate Cancer
US20140284468A1 (en) * 2010-02-24 2014-09-25 Biodesix, Inc. Cancer patient selection for administration of therapeutic agents using mass spectral analysis of blood-based samples
US20140106369A1 (en) * 2011-03-22 2014-04-17 The Johns Hopkins University Biomarkers for aggressive prostate cancer
US20130320203A1 (en) * 2012-05-29 2013-12-05 Biodesix, Inc. Deep-MALDI TOF mass spectrometry of complex biological samples, e.g., serum, and uses thereof
US8718996B2 (en) 2012-07-05 2014-05-06 Biodesix, Inc. Method for predicting whether a cancer patient will not benefit from platinum-based chemotherapy agents
WO2014074821A1 (en) * 2012-11-09 2014-05-15 Dana-Farber Cancer Institute, Inc. Metabolic profiling in tissue and serum is indicative of tumor differentiation in prostate cancer

Non-Patent Citations (7)

* Cited by examiner, † Cited by third party
Title
"Improve Risk Stratification in a Contemporary Prostatectomy Cohort", J CLIN ONCOL, vol. 31, 2013, pages 1428 - 1434
FARIA ET AL.: "Use of low free to total PSA ratio in prostate cancer screening: detection rates, clinical and pathological findings in Brazilian men with serum PSA levels < 4.0 ng/mL", BJU INTERNATIONAL, vol. 110, 1 December 2012 (2012-12-01), pages E653 - E657, XP055424330 *
J A AL-RUWAILI ET AL., CANCER GENOMICS PROTEOMICS, 2010, pages 93 - 104
LADJEVARDI ET AL.: "Prostate Biopsy Sampling Causes Hematogenous Dissemination of Epithelial Cellular Matcrial", DISEASE MARKERS, vol. 2014, 28 January 2014 (2014-01-28), pages 1 - 6, XP055424323 *
SARTORI, D.A.CHAN, D.W.: "Biomarkers in prostate cancer: what's new?", CURR OPIN ONCOL, vol. 26, 2014, pages 259 - 64
See also references of EP3201812A4
SRIVASTAVA, N.: "Improving Neural Networks with Dropout", THESIS, 18 February 2013 (2013-02-18), University of Toronto, Department of Computer Science, pages 1 - 26, XP055112918, Retrieved from the Internet <URL:www.cs.toronto.edu/~nitish/msc_thesis.pdf> [retrieved on 20151223] *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11710539B2 (en) 2016-02-01 2023-07-25 Biodesix, Inc. Predictive test for melanoma patient benefit from interleukin-2 (IL2) therapy
CN110383069A (en) * 2017-01-05 2019-10-25 佰欧迪塞克斯公司 For identifying the method for persistently benefiting from the cancer patient of immunotherapy in overall poor prognosis subgroup
US11150238B2 (en) 2017-01-05 2021-10-19 Biodesix, Inc. Method for identification of cancer patients with durable benefit from immunotherapy in overall poor prognosis subgroups
WO2019118873A3 (en) * 2017-12-15 2019-10-24 Iovance Biotherapeutics, Inc. Systems and methods for determining the beneficial administration of tumor infiltrating lymphocytes, and methods of use thereof and beneficial administration of tumor infiltrating lymphocytes, and methods of use thereof
JP2021508104A (en) * 2017-12-15 2021-02-25 アイオバンス バイオセラピューティクス,インコーポレイテッド Systems and methods for determining beneficial administration of tumor-infiltrating lymphocytes and their use, as well as beneficial administration of tumor-infiltrating lymphocytes and their use.

Also Published As

Publication number Publication date
US20160098514A1 (en) 2016-04-07
US10489550B2 (en) 2019-11-26
EP3201812A4 (en) 2018-06-20
US9779204B2 (en) 2017-10-03
EP3201812A1 (en) 2017-08-09
EP3201812B1 (en) 2021-02-17
US20180129780A1 (en) 2018-05-10
TW201617030A (en) 2016-05-16

Similar Documents

Publication Publication Date Title
US10489550B2 (en) Predictive test for aggressiveness or indolence of prostate cancer from mass spectrometry of blood-based sample
US10217620B2 (en) Early detection of hepatocellular carcinoma in high risk populations using MALDI-TOF mass spectrometry
JP6063447B2 (en) Cluster analysis of biomarker expression in cells
US11621057B2 (en) Classifier generation methods and predictive test for ovarian cancer patient prognosis under platinum chemotherapy
US11664126B2 (en) Clinical predictor based on multiple machine learning models
CN105512669A (en) Treatment selection for lung cancer patients using mass spectrum of blood-based sample
CN115295074B (en) Application of gene marker in malignant pulmonary nodule screening, construction method of screening model and detection device
JP2016200435A (en) Mass spectrum analysis system, method, and program
Devetyarov et al. Conformal predictors in early diagnostics of ovarian and breast cancers
US9563744B1 (en) Method of predicting development and severity of graft-versus-host disease
CN116047074A (en) Marker for diagnosing and/or predicting lung cancer, diagnostic model and construction method thereof
EP3566054A1 (en) Method for identification of cancer patients with durable benefit from immunotherapy in overall poor prognosis subgroups
CN113711313A (en) Predictive test for identifying early-stage NSCLC patients at high risk of relapse after surgery
Scalco et al. Automatic feature construction based on genetic programming for survival prediction in lung cancer using CT images
EP3773691A1 (en) Apparatus and method for identification of primary immune resistance in cancer patients
US20230197426A1 (en) Predictive test for prognosis of myelodysplastic syndrome patients using mass spectrometry of blood-based sample
CN117558456A (en) Construction and application of multi-factor esophageal cancer survival prediction model based on biological probability membrane system
CN116106398A (en) Markers for diagnosing CKD
CN115862838A (en) Bile duct cancer diagnosis model based on machine learning algorithm and construction method and application thereof

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15846544

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2015846544

Country of ref document: EP