Mathematical programming in data mining

Data Mining and Knowledge Discovery

Volumn 1, Issue 2, 1997, Pages 183-201

  Mangasarian, O L ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Clustering; Feature selection; Mathematical programming; Robust representation

Indexed keywords

EID: 21944433431     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009735908398     Document Type: Article

References (19)

1. K. Al-Sultan. A Tabu search approach to the clustering problem. Pattern Recognition, 28(9): 1443-1451, 1995.
2. K. P. Bennett and E. J. Bredensteiner. Geometry in learning. In C. Gorini, E. Hart, W. Meyer, and T. Phillips, editors, Geometry at Work, Washington, D.C., 1997. Mathematical Association of America. To appear, www.rpi.math.edu/bennek/geometry2.ps.
3. K. P. Bennett and O. L. Mangasarian. Neural network training via linear programming. In P. M. Pardalos, editor, Advances in Optimization and Parallel Computing, pages 56-67, Amsterdam, 1992. North Holland.
4. K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23-34, 1992.
5. K. P. Bennett and O. L. Mangasarian. Bilinear separation of two sets in n-space. Computational Optimization & Applications, 2:207-227, 1993.
6. D. P. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, MA, 1995.
7. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation. Prentice-Hall, Inc, Englewood Cliffs, New Jersey, 1989.
8. R. E. Bixby, J. W. Gregory, I. J. Lustig, R. E. Marsten, and D. F. Shanno. Very large-scale linear programming: a case study combining interior point and simplex methods. Operations Research, 40:885-897, 1992.
9. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's razor. Information Processing Letters, 24:377-380, 1987.
10. P. S. Bradley, O. L. Mangasarian, and W. N. Street. Feature selection via mathematical programming. Technical Report 95-21, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, December 1995. Submitted to INFORMS Journal on Computing. Available by ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-21.ps.Z.
11. P. S. Bradley, O. L. Mangasarian, and W. N. Street. Clustering via concave minimization. Technical Report 96-03, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, May 1996. Advances in Neural Information Processing Systems 9, MIT Press, Cambridge, MA 1997, 368-374, M.C. Mozer, M.I. Jordan and T. Petsche, editors. Available by ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-03.ps.Z.
12. E. J. Bredensteiner and K. P. Bennett. Feature minimization within decision trees. Department of Mathematical Sciences Math Report No. 218, Rensselaer Polytechnic Institute, Troy, NY 12180, 1995.
13. F. Cordellier and J. Ch. Fiorot. On the Fermat-Weber problem with convex cost functional. Mathematical Programming, 14:295-311, 1978.
14. CPLEX Optimization Inc., Incline Village, Nevada. Using the CPLEX(TM) Linear Optimizer and CPLEX(TM) Mixed Integer Optimizer (Version 2.0), 1992.
15. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, New Jersey, 1963.
16. R. De Leone and O. L. Mangasarian. Serial and parallel solution of large scale linear programs by augmented Lagrangian successive overrelaxation. In A. Kurzhanski, K. Neumann, and D. Pallaschke, editors, Optimization, Parallel Processing and Applications, pages 103-124, Berlin, 1988. Springer-Verlag. Lecture Notes in Economics and Mathematical Systems 304.
17. R. De Leone and M. A. Tork Roth. Massively parallel solution of quadratic programs via successive overrelaxation. Concurrency: Practice and Experience, 5:623-634, 1993.
18. U. Fayyad, G. Piatetsky-Shapiro, and P. Smyth. The KDD process for extracting useful knowledge from volumes of data. Communications of the ACM, 39:27-34, 1996.
19. M. C. Ferris and O. L. Mangasarian. Parallel variable distribution. SIAM Journal on Optimization, 4(4):815-832, 1994.