Abstract: A method for classifying features in a digital medical image includes providing a plurality of feature points in an N-dimensional space, wherein each feature point is a member of one of two sets, determining a classifying plane that separates feature points in a first of the two sets from feature points in a second of the two sets, transforming the classifying plane wherein a normal vector to said transformed classifying plane has positive coefficients and a feature domain for one or more feature points of one set is a unit hypercube in a transformed space having n axes, obtaining an upper bound along each of the n-axes of the unit hypercube, inversely transforming said upper bound to obtain a new rule containing one or more feature points of said one set, and removing the feature points contained by said new rule from said one set.

Abstract: A list of biomarkers indicative of patient outcome is reduced. A computer program is applied to a set of biomarkers indicative of a patient outcome (e.g., prognosis, diagnosis, or treatment result). The computer program models the set of biomarkers with a subset of the biomarkers. The subset is identified without labeling based on the patient outcome. Instead, biomarker scores (e.g., sequence score) are used to identify the subset of biomarkers.

Abstract: A method for predicting survival rates of medical patients includes providing a set D of survival data for a plurality of medical patients, providing a regression model having an associated parameter vector ?, providing an example x0 of a medical patient whose survival probability is to be classified, calculating a parameter vector {circumflex over (?)} that maximizes a log-likelihood function of ? over the set of survival data, l(?|D), wherein the log likelihood l(?|D) is a strictly concave function of ? and is a function of the scalar x?, calculating a weight w0 for example x0, calculating an updated parameter vector ?* that maximizes a function l(?|D?{(y0,x0,w0)}), wherein data points (y0,x0,w0) augment set D, calculating a fair log likelihood ratio ?ƒ from {circumflex over (?)} and ?* using ?ƒ=?(?*|x0)+sign(?({circumflex over (?)}|x0)){l({circumflex over (?)}|D)?l(?*|D)}, and mapping the fair log likelihood ratio ?ƒ to a fair price y0ƒ, wherein said fair price is a probability that class label y0 for exam

Abstract: A method and device having instructions for analyzing input data-space by learning classifiers include choosing a candidate subset from a predetermined training data-set that is used to analyze the input data-space. Candidates are temporarily added from the candidate subset to an expansion set to generate a new kernel space for the input data-space by predetermined repeated evaluations of leave-one-out errors for the candidates added to the expansion set. This is followed by removing the candidates temporarily added to the expansion set after the leave-one-out error evaluations are performed, and selecting the candidates to be permanently added to the expansion set based on the leave-one-out errors of the candidates temporarily added to the expansion set to determine the one or more classifiers.

Abstract: A method for multiple-label data analysis includes: obtaining labeled data points from more than one labeler; building a classifier that maximizes a measure relating the data points, labels on the data points and a predicted output label; and assigning an output label to an input data point by using the classifier.

Abstract: A method and system correlate candidate information and provide batch classification of a number of related candidates. The batch of candidates may be identified from a single data set. There may be internal correlations and/or differences among the candidates. The candidates may be classified taking into consideration the internal correlations and/or differences. The locations and descriptive features of a batch of candidates may be determined. In turn, the locations and/or descriptive features determined may used to enhance the accuracy of the classification of some or all of the candidates within the batch. In one embodiment, the single data set analyzed is associated with an internal image of patient and the distance between candidates is accounted for. Two different algorithms may each simultaneously classify all of the samples within a batch, one being based upon probabilistic analysis and the other upon a mathematical programming approach. Alternate algorithms may be used.

Abstract: A method of training a classifier for computer aided detection of digitized medical images, includes providing a plurality of bags, each bag containing a plurality of feature samples of a single region-of-interest in a medical image, wherein said features include texture, shape, intensity, and contrast of said region-of-interest, wherein each region-of-interest has been labeled as either malignant or healthy, and training a classifier on said plurality of bags of feature samples, subject to the constraint that at least one point in a convex hull of each bag, corresponding to a feature sample, is correctly classified according to the labeled of the associated region-of-interest.

Abstract: A method for computer aided detection of anatomical abnormalities in medical images includes providing a plurality of abnormality candidates and features of said abnormality candidates, and classifying said abnormality candidates as true positives or false positives using a hierarchical cascade of linear classifiers of the form sign(wTx+b), wherein x is a feature vector, w is a weighting vector and b is a model parameter, wherein different weights are used to penalize false negatives and false positives, and wherein more complex features are used for each successive stage of said cascade of classifiers.

Abstract: A method for finding a ranking function ƒ that classifies feature points in an n-dimensional space includes providing a plurality of feature points xk derived from tissue sample regions in a digital medical image, providing training data A comprising training samples Aj where A = ? j = 1 S ? ( A j = { x i j } i = 1 m j ) , providing an ordering E={(P,Q)|APAQ} of at least some training data sets where all training samples xi?AP are ranked higher than any sample xj?AQ, solving a mathematical optimization program to determine the ranking function ƒ that classifies said feature points x into sets A. For any two sets Ai, Aj, AiAj, and the ranking function ƒ satisfies inequality constraints ƒ(xi)?ƒ(xj) for all xi?conv(Ai) and xj?conv(Aj), where conv(A) represents the convex hull of the elements of set A.

Abstract: Cardiac motion is automatically characterized based on spatial relationship to health. A classifier is trained for the characterization of cardiac motion. Regional wall motion abnormality assessment may be improved by combining information from neighboring segments. The structure or relationship between different segments and associated probabilities of different spatial locations being abnormal given another segment being abnormal are used for classification.

Abstract: A method of classifying features in digitized images includes providing a plurality of feature points in an n-dimensional space, wherein said feature points have been extracted from a digitized medical image, formulating a support vector machine to classify said feature point into one of two sets, wherein each said feature classification vector is transformed by an adjacency matrix defined by those points that are nearest neighbors of said feature, and solving said support vector machine by a linear optimization algorithm to determine a classifying plane that separates the feature vectors into said two sets.

Abstract: A method for classifying features in a digital medical image includes providing a plurality of feature points in an N-dimensional space, wherein each feature point is a member of one of two sets, determining a classifying plane that separates feature points in a first of the two sets from feature points in a second of the two sets, transforming the classifying plane wherein a normal vector to said transformed classifying plane has positive coefficients and a feature domain for one or more feature points of one set is a unit hypercube in a transformed space having n axes, obtaining an upper bound along each of the n-axes of the unit hypercube, inversely transforming said upper bound to obtain a new rule containing one or more feature points of said one set, and removing the feature points contained by said new rule from said one set.

Abstract: A method and device having instructions for analyzing input data-space by learning classifiers include choosing a candidate subset from a predetermined training data-set that is used to analyze the input data-space. Candidates are temporarily added from the candidate subset to an expansion set to generate a new kernel space for the input data-space by predetermined repeated evaluations of leave-one-out errors for the candidates added to the expansion set. This is followed by removing the candidates temporarily added to the expansion set after the leave-one-out error evaluations are performed, and selecting the candidates to be permanently added to the expansion set based on the leave-one-out errors of the candidates temporarily added to the expansion set to determine the one or more classifiers.

Abstract: A method and device with instructions for analyzing an image data-space includes creating a library of one or more kernels, wherein each kernel from the library of the kernels maps the image data-space to a first data-space using at least one mapping function; and learning a linear combination of kernels in an automatic manner to generate at least one of a classifier and a regressor which is applied to the first data-space. The linear combination of kernels is used to generate a classified image-data space to detect at least one of the candidates in the classified image-data space.

Abstract: An incremental greedy method to feature selection is described. This method results in a final classifier that performs optimally and depends on only a few features. Generally, a small number of features is desired because it is often the case that the complexity of a classification method depends on the number of features. It is very well known that a large number of features may lead to overfitting on the training set, which then leads to a poor generalization performance in new and unseen data. The incremental greedy method is based on feature selection of a limited subset of features from the feature space. By providing low feature dependency, the incremental greedy method 100 requires fewer computations as compared to a feature extraction approach, such as principal component analysis.

Abstract: We propose using different classifiers based on the spatial location of the object. The intuitive idea behind this approach is that several classifiers may learn local concepts better than a “universal” classifier that covers the whole feature space. The use of local classifiers ensures that the objects of a particular class have a higher degree of resemblance within that particular class. The use of local classifiers also results in memory, storage and performance improvements, especially when the classifier is kernel-based. As used herein, the term “kernel-based classifier” refers to a classifier where a mapping function (i.e., the kernel) has been used to map the original training data to a higher dimensional space where the classification task may be easier.

Abstract: CAD (computer-aided diagnosis) systems and applications for breast imaging are provided, which implement methods to automatically extract and analyze features from a collection of patient information (including image data and/or non-image data) of a subject patient, to provide decision support for various aspects of physician workflow including, for example, automated diagnosis of breast cancer other automated decision support functions that enable decision support for, e.g., screening and staging for breast cancer. The CAD systems implement machine-learning techniques that use a set of training data obtained (learned) from a database of labeled patient cases in one or more relevant clinical domains and/or expert interpretations of such data to enable the CAD systems to “learn” to analyze patient data and make proper diagnostic assessments and decisions for assisting physician workflow.

Abstract: A feature selection technique for support vector machine (SVM) classification makes use of fast Newton method that suppresses input space features for a linear programming formulation of a linear SVM classifier, or suppresses kernel functions for a linear programming formulation of a nonlinear SVM classifier. The techniques may be implemented with a linear equation solver, without the need for specialized linear programming packages. The feature selection technique may be applicable to linear or nonlinear SVM classifiers. The technique may involve defining a linear programming formulation of a SVM classifier, solving an exterior penalty function of a dual of the linear programming formulation to produce a solution to the SVM classifier using a Newton method, and selecting an input set for the SVM classifier based on the solution.