Clustering via concave minimization

Advances in Neural Information Processing Systems

Volumn , Issue , 1997, Pages 368-374

  Bradley, P S ^a   Mangasarian, O L ^a   Street, W N ^b  

^a Computer Sciences Department University of Wisconsin ^*  (United States)

^b Computer Science Department Oklahoma State University 205 Mathematical Sciences ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DISEASES; PIECEWISE LINEAR TECHNIQUES;

BILINEAR FUNCTIONS; COMPUTATIONAL TESTING; CONCAVE FUNCTION; CONCAVE MINIMIZATION; MEDIAN ALGORITHMS; PIECEWISE-LINEAR; REAL-WORLD DATABASE; STATIONARY POINTS;

ALGORITHMS;

EID: 84898974025     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. K. Al-Sultan. A Tabu search approach to the clustering problem. Pattern Recognition, 28(9): 1443-1451, 1995.
2. K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23-34, 1992.
3. K. P. Bennett and O. L. Mangasarian. Bilinear separation of two sets in n-space. Computational Optimization & Applications, 2:207-227, 1993.
4. S.-J. Chung. NP-completeness of the linear complementarity problem. Journal of Optimization Theory and Applications, 60:393-399, 1989.
5. F. Cordellier and J. Ch. Fiorot. On the Fermat-Weber problem with convex cost functionals. Mathematical Programming, 14:295-311, 1978.
6. 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.
7. D. Fisher. Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2:139-172, 1987.
8. K. Fukunaga. Statistical Pattern Recognition. Academic Press, NY, 1990.
9. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, Inc, Englewood Cliffs, NJ, 1988.
10. E. L. Kaplan and P. Meier. Nonparametric estimation from incomplete observations. J. Am. Stat. Assoc., 53:457-481, 1958.
11. O. L. Mangasarian. Characterization of linear complementarity problems as linear programs. Mathematical Programming Study, 7:74-87, 1978.
12. O. L. Mangasarian. Misclassification minimization. Journal of Global Optimization, 5:309-323, 1994.
13. O. L. Mangasarian. Nonlinear Programming. SIAM, Philadelphia, PA, 1994.
14. O. L. Mangasarian. The linear complementarity problem as a separable bilinear program. Journal of Global Optimization, 6:153-161, 1995.
15. P. M. Murphy and D. W. Aha. UCI repository of machine learning databases. Department of Information and Computer Science, University of California, Irvine, www.ics.uci.edu/Al/ML/MLDBRepository.html, 1992.
16. S. Odewahn, E. Stockwell, R. Pennington, R. Hummphreys, and W. Zumach. Automated star/galaxy discrimination with neural networks. Astronomical Journal, 103(1):318-331, 1992.
17. M. L. Overton. A quadratically convergent method for minimizing a sum of euclidean norms. Mathematical Programming, 27:34-63, 1983.
18. S. Z. Selim and M. A. Ismail. K-Means-Type algorithms: a generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6.-81-87, 1984.