Browsing Math Prog Technical Reports by Author "Bradley, P.S."

Now showing items 1-9 of 9

    • Clustering via Concave Minimization 

      Street, W.N.; Bradley, P.S.; Mangasarian, O.L. (1996)
      The problem of assigning m points in the n-dimensional real space R^n to k clusters is formulated as that of determining k centers in R^n such that the sum of distance of each point to the nearest center in minimized. If ...

    • Feature Selection Via Concave Minimization and Support Vector Machines 

      Mangasarian, O.L.; Bradley, P.S. (1998)
      Computational comparison is made between two feature selection approaches for finding a separating plane that discriminates between two point sets in an n-dimensional feature space that utilizes as few of the n features ...

    • Feature Selection via Mathematic Programming 

      Mangasarian, O.L.; Street, W. N.; Bradley, P.S. (1997-04)
      The problem of discriminating between two finite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a mathematical program with a parametric ...

    • k-Plane Clustering 

      Mangasarian, O.L.; Bradley, P.S. (1998)
      A finite new algorithm is proposed for clustering m given points in n-dimensional real space into k clusters by generating k planes that constitute a local solution to the nonconvex problem of minimizing the sum of squares ...

    • Massive Data Discrimination via Linear Suppot Vector Machines 

      Mangasarian, O.L.; Bradley, P.S. (1999-03-31)
      A linear support vector machine formulation is used to generate a fast, finitely-terminating linear-programming algorithm for discriminating between two massive sets in n-dimensional space, where the number of points can ...

    • Mathematical Programming for Data Mining: Formulations and Challenges 

      Mangasarian, Olvi; Fayyad, Usama; Bradley, P.S. (1998-07)
      This paper is intended to serve as an overview of a rapidly emerging research and applications area. In addition to providing a general overview, motivating the importance of data mining problems within the area of ...

    • Mathematical Programming for Data Mining: Formulations and Challenges 

      Mangasarian, O.L.; Fayyad, Usama M.; Bradley, P.S. (1998)
      This paper is intended to serve as an overview of a rapidly emerging research and applications area. in addition to providing a general overview, motivating the importance of data mining problems within the area of knowledge ...

    • Parsimonious Least Norm Approximation 

      Rosen, J.B.; Mangasarian, O.L.; Bradley, P.S. (1997)
      A theoretically justifiable fast finite successive linear approximation algorithm is proposed for obtaining a parsimonious solution to a corrupted linear system Ax=b+p, where the corruption p is due to noise or error in ...

    • Parsimonious Side Propagation 

      Mangasarian, O.L.; Bradley, P.S. (1997)
      A fast parsimonious linear-programming-based algorithm for training neural networks is proposed that suppresses redundant features while using a minimal number of hidden units. This is achieved by propagating sideways to ...