Mathematical Programming for Data Mining: Formulations and Challenges

References

• Abatzoglou T. J., Mendel J. M., Harada G. A. The constrained total least squares technique and its application to harmonic superposition. IEEE Trans. Signal Processing (1991) 39:1070–1087Crossref, Google Scholar
• Agrawal R., Gehrke J., Gunopulos D., Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. (1998) Proc. ACM SIGMOD Internat. Conf. management dataNew York(ACM)94–105Crossref, Google Scholar
• Agrawal R., Mannila H., Srikant R., Toivonen H., Verkamo I., Fayyad U., Piatetsky-Shapiro G., Smyth P., Uthurusamy R. Fast discovery of association rules. Advances in Knowledge discovery and data mining (1996) (MIT Press, Cambridge, MA) 307–328Google Scholar
• Anderberg M. R.Cluster Analysis for Applications (1973) (Academic Press, New York) Google Scholar
• Bank B., Guddat J., Klatte D., Kummer B., Tammer K.Nonlinear Parametric Optimization (1982) (Akamie-Verlag, Berlin) Crossref, Google Scholar
• Bennett K. P., Evans M. Decision tree construction via linear programming. (1992) Proc. 4th midwest Artificial Intelligence and Cognitive Sci. Soc. Conf.Utica, Illinois:97–101Google Scholar
• Bennett K. P., Blue J. A. A support vector machine approach to decision trees. (1997) Proc. IJCNN'98Anchorage, Alaska:2396–2401 http://www.math.rpi.edu/~bennek/Google Scholar
• Bennett K. P., Mangasarian O. L., Pardalos P. M. Neural network training via linear programming. Advances Optimization parallel computing (1992) (North Holland, Amsterdam) 56–67Google Scholar
• Bennett K. P., Mangasarian O. L. Robust linear programming discrimination of two linearly inseparable sets. Optim. Methods Software (1992) 1:23–34Crossref, Google Scholar
• Bennett K. P., Mangasarian O. L. Bilinear separation of two sets in n-space. comput. Optim. Appl. (1993) 2:207–227Crossref, Google Scholar
• Bennett K. P., Mangasarian O. L. Multicategory separation via linear programming. Optim. methods software (1993) 3:27–39Crossref, Google Scholar
• Bertsekas D. P.Nonlinear Programming (1995) (Athena Scientific, Belmont, MA) Google Scholar
• Bishop C. M.Neural Networks for Pattern Recognition (1995) (Oxford University Press, New York) Crossref, Google Scholar
• Bös S. A realizable learning task which shows overfitting. Advances in Neural Information Processing Systems (1996) 8(The MIT Press, Cambridge, MA) 218–224Google Scholar
• Brachman R., Khabaza T., Kloesgen W., Piatetskyshaprio G., Simoudis E. Industrial Applications of Data Mining and Knowledge Discovery. Comm. ACM (1996) 39:42–48Crossref, Google Scholar
• Bradley P. S., Fayyad U. M., Shavlik J. Refining initial points for k-means clustering. (1998) Proc. Fifteenth Internat. Conf. Machine Learn. (ICML '98)San Francisco, CA(Morgan Kaufmann)91–99 http://www.research.microsoft.com/research/dtg/fayyad/papers/icml98.htmGoogle Scholar
• Bradley P. S., Fayyad U. M., Reina C. Scaling clustering to large databases. (1998) Proc. fourth Internat. Conf. Knowledge Discovery Data Mining, KDD98Menlo Park, CA(AAAI Press)9–15 http://www.research.microsoft.com/research/dtg/fayyad/papers/kdd98cluster.htmlGoogle Scholar
• Bradley P. S., Fayyad U. M., Reina C. Scaling EM clustering to large databases. (1998) . Technical report MSR-TR-98-35, Microsoft Research, Redmond, WA, 1999 ACM SIGMOD Internat. Conf. Management Data, submittedGoogle Scholar
• Bradley P. S., Mangasarian O. L. Parsimonious side propagation. (1997) 3:1873–1876Technical report 97-11, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin. ICASSP98: IEEE Internat. Conf. Acoustics, Speech Signal Processing, Seattle May 12–15, 1998 ftp://ftp.cs.wisc.edu/math-prog/tech-reports/97-11.ps.ZGoogle Scholar
• Bradley P. S., Mangasarian O. L., Shavlik J. Feature selection via concave minimization and support vector machines. (1998) Machine Learn. Proc. Fifteenth Internat. Conf. (ICML '98)(San Francisco, California, Morgan Kaufmann)82–90 ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98-03.ps.ZGoogle Scholar
• Bradley P. S., Mangasarian O. L. Massive data discrimination via linear support vector machines. (1998) . Technical report 98-05, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin. ftp://ftp.cs.wisc.edu/mathprog/tech-reports/98-03.ps.ZGoogle Scholar
• Bradley P. S., Mangasarian O. L., Rosen J. B. Parsimonious least norm approximation. Comput. Optim. Appl. (1998) 11:5–21 ftp://ftp.cs.wisc.edu/mathprog/tech-reports/97-03.ps.ZCrossref, Google Scholar
• Bradley P. S., Mangasarian O. L., Street W. N., Mozer M. C., Jordan M. I., Petsche T. Clustering via concave minimization. Advances Neural Information Processing Systems (1997) 9(MIT Press, Cambridge, MA) 368–374 ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-03.ps.ZGoogle Scholar
• Bradley P. S., Mangasarian O. L., Street W. N. feature selection via mathematical programming. INFORMS J. Comput. (1998) 10:209–217 ftp://ftp.cs.wisc.edu/mathprog/tech-reports/95-21.ps.ZLink, Google Scholar
• Bredensteiner E. J., Bennett K. P. Feature minimization within decision trees. Comput. Optim. Appl. (1998) 10:111–126Google Scholar
• Breiman L., Friedman J., Olshen R., Stone C.Classification and Regression Trees (1984) (Wadsworth & Brooks, Monterey, CA) Google Scholar
• Brooke A., Kendrick D., Meeraus A.Gams: A User's Guide (1988) (The Scientific Press, South San Francisco, CA) Google Scholar
• Burges C. J. C., Saita L. Simplified support vector decision rules. Machine Learn.—Proc. Thirteenth Internat. Conf. (ICML '96)-Bari, Italy July 3–6, 1996 (1996) (Morgan Kaufmann, San Francisco, CA) 71–77Google Scholar
• Burges C. J. C. A tutorial on support vector machines for pattern recognition. Data Mining Knowledge Discovery (1998) 2:121–167Crossref, Google Scholar
• Burke J. V., Moreé J. J. On the identification of active constraints. SIAM J. Numer. Anal. (1988) 25:1197–1211Crossref, Google Scholar
• Carter C. L., Allen C., Henson D. E. Relation of tumor size, lymph node status, and survival in 24,740 breast cancer cases. Cancer 63 (1989) 181–187SEER: Surveillence, Epidemiology and End Results Program of the National Cancer InstituteCrossref, Google Scholar
• Chaudhuri S., Dayal U. An overview of data warehousing and OLAP technology. ACM SIGMOD RECORD (1997) 26:507–508Crossref, Google Scholar
• Chaudhuri S., Fayyad U. M., Bernhardt J. Scalable classification over SQL databases. (1997) . Technical report MSRTR-97-35, Microsoft Research, Redmond, WAGoogle Scholar
• Cheeseman P., Stutz J. Bayesian classification (autoclass): Theory and Results. Advances in Knowledge Discovery and Data Mining (1996) (AAAI Press, Menlo Park, CA) 153–180Google Scholar
• Chen C., Mangasarian O. L. Hybrid misclassification minimization. Adv. Comput. Math. (1996) 5:127–136 ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-05.ps.ZCrossref, Google Scholar
• Chen S. S., Donoho D. L., Saunders M. A. Atomic decomposition by basis pursuit. (1996) . Technical report 479, Department of Statistics, Stanford University, Stanford, CA. Available by http://playfair.stanford.EDU/reports/chen.s/BasisPursuit.ps.ZGoogle Scholar
• Codd E. Providing OLAP (on-line analytical processing) to user-analysis: An it mandate. (1993) . Technical report, E. F. Codd and AssociatesGoogle Scholar
• Cordellier F., Fiorot J. C. On the Fermat-Weber problem with convex cost functionals. Math. Programming (1978) 14:295–311Crossref, Google Scholar
• Daubechies I. Time-frequency localization operators: A geometric phase space approach. IEEE Trans. Inform. Theory (1988) 34:605–612Crossref, Google Scholar
• Dempster A. P., Laird N. M., Rubin D. B. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. B (1977) 39:1–38Google Scholar
• Duda R., Hart P.Pattern Classification and Scene Analysis (1973) (John Wiley and Sons, New York) Google Scholar
• Fayyad U., Djorgovski S., Weir N., Wegman E., Azen S. Application of classification and clustering to sky survey cataloging and analysis. Computing Science and Statistics (1997) (Interface Foundation of North America, Fairfax, VA) 178–186Google Scholar
• Fayyad U., Uthurusamy R. Communications of the ACM. Special Issue on Data Mining. (1996) 39:24–26Google Scholar
• Fayyad U., Haussler D., Stolorz P. Mining science data. Comm. ACM (1996) 39:51–57Crossref, Google Scholar
• Fayyad U., Piatetsky-Shapiro G., Smyth P., Fayyad U., Piatetsky-Shapiro G., Smyth P., Uthurusamy R. From data mining to knowledge discovery: An overview. Advances in Knowledge Discovery and Data Mining (1996) (MIT Press, Cambridge, MA) 1–36Google Scholar
• Fayyad U., Piatetsky-Shapiro G., Smyth P., Uthurusamy R.Advances in Knowledge Discovery and Data Mining (1996) (MIT Press, Cambridge, MA) Google Scholar
• Fayyad U. M., Reina C., Bradley P. S. Initialization of iterative refinement clustering algorithms. (1998) Proc. Fourth Internat. Conf. Knowledge Discovery Data Mining, KDD98Menlo Park, CA(AAAI Press)194–198 http://www.research.microsoft.com/research/dtg/fayyad/papers/kdd98-init.htmlGoogle Scholar
• Ferris M. C., Mangasarian O. L. Finite perturbation of convex programs. Appl. Math. Optim. (1991) 23:263–273Crossref, Google Scholar
• Ferris M. C., Mangasarian O. L. Parallel constraint distribution. SIAM J. Optim. (1991) 1:487–500Crossref, Google Scholar
• Ferris M. C., Mangasarian O. L. Parallel variable distribution. SIAM J. Optim. (1994) 4:815–832Crossref, Google Scholar
• Fiacco A. V., Mccormick G. P.Nonlinear Programming: Sequential Unconstrained Minimization Techniques (1968) (John Wiley & Sons, New York) Google Scholar
• Flam S. D. On finite convergence and constraint identification of subgradient projection methods. Math. Programming (1992) 57:427–437Crossref, Google Scholar
• Fourer R., Gay D., Kernighan B.AMPL (1993) (The Scientific Press, South San Francisco, California) Google Scholar
• Friedman J. On bias variance, 0/1—Loss, and the curse-of-dimensionality. Data Mining Knowledge Discovery (1997) 1:55–77Crossref, Google Scholar
• Fukunaga K.Statistical Pattern Recognition (1990) (Academic Press, New York) Google Scholar
• Geist A., Beguelin A., Jiang D. J. W., Mancheck R., Sunderam V.PVM—Parallel Virtual Machine (1994) (MIT Press, Cambridge, MA) Google Scholar
• Giordano A. A.Least Square Estimation With Applications to Digital Signal Processing (1985) (John Wiley & Sons, New York) Crossref, Google Scholar
• Glymour C., Scheines R., Kelly P. S. A. K.Discovering Causal Structure (1987) (Academic Press, New York) Google Scholar
• Gray J., Chaudhuri S., Bosworth A., Layman A., Reichart D., Venkatrao M., Pellow F., Pirahesh H. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub totals. Data Mining Knowledge Discovery (1997) 1:29–53Crossref, Google Scholar
• Guha S., Rastogi R., Shim K. CURE: An efficient clustering algorithm for large databases. (1998) Proc. ACM SIGMOD Internat. Conf. Management Data(ACM, New York) 73–84Crossref, Google Scholar
• Harinarayan V., Rajaraman A., Ullman J. Implementing data cubes efficiently. (1996) Proc. ACM SIGMOD-96 Conf.(ACM Press, New York) 205–216Crossref, Google Scholar
• Hassoun M. H.Fundamentals of Artificial Neural Networks (1995) (MIT Press, Cambridge, MA) Google Scholar
• Heckerman D. Bayesian networks for data mining. Data Mining Knowledge Discovery (1997) 1:79–119Crossref, Google Scholar
• Hertz J., Krogh A., Palmer R. G.Introduction to the Theory of Neural Computation (1991) (Addison-Wesley, Redwood City, CA) Google Scholar
• Huber P. J.Robust Statistics (1981) (John Wiley & Sons, New York) Crossref, Google Scholar
• Huffel S. V., Vandewalle J.The Total Least Squares Problem, Computational Aspects and Analysis (1991) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• IBM Optimization Subroutine LibraryGAMS—The Solver Manuals: OSL (1994) (GAMS Development Corporation, Washington, D.C.) Google Scholar
• Jain A. K., Dubes R. C.Algorithms for Clustering Data (1988) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• John G. H., Kohavi R., Pfleger K. Irrelevant features and the subset selection problem. (1994) Proc. 11th Internat. Conf. Machine Learn.(Morgan Kaufmann, San Mateo, CA) 121–129Crossref, Google Scholar
• Kaplan E. L., Meier P. Nonparametric estimation from incomplete observations. J. Amer. Statist. Assoc. (1958) 53:457–481Crossref, Google Scholar
• Kearns M., Mansour Y., Ng A. Y. An information-theoretic analysis of hard and soft assignment methods for clustering. (1997) Proc. Thirteenth Conf. Uncertainty Artificial Intelligence(Morgan Kaufmann, San Mateo, CA) 282–293Google Scholar
• Statistics and Massive Data Sets, Report to the Committee on Applied and Theoretical Statistics (1996) (National Research Council, Washington, D.C.) Google Scholar
• Koller K., Sahami M., Kettenring J., Pregibon D. Toward optimal feature selection. (1996) Machine Learn.: Proc. Thirteenth Internat. Conf.(Morgan Kaufmann, San Mateo, CA) 284–292Google Scholar
• Le Cun Y., Denker J. S., Solla S. A. Optimal brain damage. D. S. Touretzky, ed. Advances in Neural Information Processing Systems II (Denver 1989) (1990) (Morgan Kaufmann, San Mateo, CA) 598–605Google Scholar
• Leamer E. E.Specification Searches: Ad Hoc Inference with Nonexperimental Data (1978) (John Wiley & Sons, New York) Google Scholar
• Li W. Sharp condition constants for feasible and optimal solutions of a perturbed linear program. Linear Algebra and Its Applications (1993) 187:15–40Crossref, Google Scholar
• Litzkow M., Livny M. Experience with the condor distributed batch system. (1990) Proc. IEEE Workshop Experimen. Distributed Systems(IEEE Computer Society Press, Huntsville, AL) 97–101Crossref, Google Scholar
• Livny M., Ramakrishnan R., Zhang T. Fast density and probability estimations using CF-kernal method for very large databases. (1996) . Technical report, University of WisconsinGoogle Scholar
• Luo Z.-Q., Pang J.-S., Ralph D.Mathematical Programs with Equilibrium Constraints (1996) (Cambridge University Press, Cambridge, England) Crossref, Google Scholar
• Mangasarian O. L. Linear and nonlinear separation of patterns by linear programming. Oper. Res. (1965) 13:444–452Link, Google Scholar
• Mangasarian O. L. Multi-surface method of pattern separation. IEEE Trans. Inform. Theory (1968) IT-14:801–807Crossref, Google Scholar
• Mangasarian O. L. Mathematical programming in neural networks. ORSA J. Comput. (1993) 5:349–360Link, Google Scholar
• Mangasarian O. L. Misclassification minimization. J. Global Optim. (1994) 5:309–323Crossref, Google Scholar
• Mangasarian O. L.Nonlinear Programming (1994) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Mangasarian O. L., Fischer H., Riedmueller B. Machine learning via polyhedral concave minimization. Applied Mathematics and Parallel Computing—Festschrift for Klaus Ritter (1996) (Physica-Verlag a Springer-Verlag Company, Heidelberg) 175–188 ftp://ftp.cs.wisc.edu/mathprog/tech-reports/95-20.ps.ZCrossref, Google Scholar
• Mangasarian O. L., Pillo G. D., Giannessi F. Mathematical programming in machine learning. Nonlinear Optimization and Applications (1996) (Plenum Publishing, New York) 283–295Crossref, Google Scholar
• Mangasarian O. L. Arbitrary-norm separating plane. (1997) . Technical report 97-07, Computer Sciences Department, University of Wisconsin, Madison, WI. ftp://ftp.cs.wisc.edu/mathprog/tech-reports/97-07.ps.ZGoogle Scholar
• Mangasarian O. L., Setiono R., Wolberg W. H., Coleman T. F., Li Y. Pattern recognition via linear programming: Theory and application to medical diagnosis. Large-Scale Numerical Optimization (1990) (SIAM, Philadelphia, PA) 22–31Proc. Workshop Large-Scale Numerical Optim., Cornell University, Ithaca, NY, October 19–20, 1989Google Scholar
• Mangasarian O. L., Solodov M. V., Cowan G. T. J. D., Alspector J. Backpropagation convergence via deterministic nonmonotone perturbed minimization. Advances in Neural Information Processing Systems (1994) 6(Morgan Kaufmann, San Francisco, CA) 383–390Google Scholar
• Mangasarian O. L., Solodov M. V. Serial and parallel backpropagation convergence via nonmonotone perturbed minimization. Optim. Methods Software (1994) 4:103–116Crossref, Google Scholar
• Mangasarian O. L., Street W. N., Wolberg W. H. Breast cancer diagnosis and prognosis via linear programming. Oper. Res. (1995) 43:570–577Link, Google Scholar
• Mangasarian O. L., Wolberg W. H. Cancer diagnosis via linear programming. SIAM News (1990) 23:1–18Google Scholar
• Mannila H., Toivonen H., Verkamo A. Discovery of frequent episodes in event sequence. Data Mining Knowledge Discovery (1997) 1:259–289Crossref, Google Scholar
• MATLABUser's Guide (1992) (The MathWorks, Natick, MA) Google Scholar
• Mehta M., Agrawal R., Rissanen J. SLIQ: A fast scalable classifier for data mining. (1996) Proc. EDBT-96Berlin(Springer Verlag)Crossref, Google Scholar
• Murthy S., Kasif S., Salzberg S., Beigel R. OC1: Randomized induction of oblique decision trees. (1993) Proc. Eleventh National Conf. Artificial IntelligenceCambridge, MA(The AAAI Press/The MIT Press)322–327Google Scholar
• Neal R. M., Hinton G. E. A view of the EM algorithm that justifies incremental, sparse, and other variants. (1997) . Technical report, Department of Statistics and Department of Computer Science, University of Toronto, Toronto, Ontario, CanadaGoogle Scholar
• Osuna E., Freund R., Girosi F. Improved training algorithm for support vector machines. (1997) Proc. IEEE NNSP'97, Amelia Island, FL, September 1997New York(IEEE press)276–285 http://www.ai.mit.edu/people/girosi/homepage/svm.htmlCrossref, Google Scholar
• Osuna E., Freund R., Girosi F. Training support vector machines: An application to face detection. (1997) IEEE Conf. Comput. Vision and Pattern Recognition, Puerto Rico, June 1997New York(IEEE Press)130–136 http://www. ai.mit.edu/people/girosi/home-page/svm.htmlCrossref, Google Scholar
• Overton M. L. A quadratically convergent method for minimizing a sum of euclidean norms. Math. Programming (1983) 27:34–63Crossref, Google Scholar
• Piatetsky-Shapiro G., Frawley W.Knowledge Discovery in Databases (1991) (MIT Press, Cambridge, MA) Google Scholar
• Platt J., Schölkopf B., Burges C. J. C., Smola A. J. Sequential minimal optimization: A fast algorithm for training support vector machines. Advances in Kernel Methods—Support Vector Learning (1999) (MIT Press, Cambridge, MA) 185–208 http://www.research.microsoft.com/~jplatt/smo.htmlGoogle Scholar
• Rissanen J. Modeling by shortest data description. Automatica (1978) 14:465–471Crossref, Google Scholar
• Robinson S. M. Bounds for error in the solution of a perturbed linear program. Linear Algebra Its Appl. (1973) 6:69–81Crossref, Google Scholar
• Robinson S. M. Perturbations in finite-dimensional systems of linear inequalities and equations. (1973) . Technical Summary Report No. 1357, Mathematics Research Center, University of Wisconsin, Madison, WIGoogle Scholar
• Schaffer C. Overfitting avoidance as bias. Machine Learn. (1993) 10:153–178Crossref, Google Scholar
• Schölkopf B., Burges C., Vapnik V. Extracting support data for a given task. (1995) Proc. First Internat. Conf. Knowledge Discovery Data MiningMenlo Park, CA(AAAI Press)Google Scholar
• Scott D. W.Multivariate Density Estimation (1992) (John Wiley & Sons, New York) Crossref, Google Scholar
• Selim S. Z., Ismail M. A. K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis and Machine Intelligence (1984) PAMI-6:81–87Crossref, Google Scholar
• Shavlik J. W., Dietterich T. G.Readings in Machine Learning (1990) (Morgan Kaufmann, San Mateo, CA) Google Scholar
• Silberschatz A., Tuzhilin A., Fayyad U., Uthurusamy R. On subjective measures of interestingness in knowledge discovery. (1995) Proc. KDD-95: First Internat. Conf. Knowledge Discovery Data MiningMenlo Park, CA(AAAI Press)275–281Google Scholar
• Smyth P. Clustering using monte carlo cross-validation. (1996) Proc. 2nd Internat. Conf. Knowledge Discovery Data Mining (KDD96)Menlo Park, CA(AAAI press)Google Scholar
• Solodov M. V. Incremental gradient algorithms with stepsizes bounded away from zero. Comput. Optim. Appl. (1999) . To appearGoogle Scholar
• Stone M. Cross-validatory choice and assessment of statistical predictions. J. Roy. Statist. Soc. (1974) 36:111–147Google Scholar
• Street W. N., Mangasarian O. L. Improved generalization via tolerant training. J. Optim. Theory Appl. (1998) 96:259–279 ftp://ftp.cs.wisc.edu/mathprog/tech-reports/95-11.ps.ZCrossref, Google Scholar
• Sung K., Poggio T. Example-based learning for view-based human face detection, A.I. Lab. A.I. Memo 1521 (1994) (MIT, Cambridge, MA) Google Scholar
• Therrien C. W.Discrete Random Signals and Statistical Signal Processing (1992) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Tseng P. Incremental gradient(-projection) method with momentum term and adaptive stepsize rule. SIAM J. Optim. (1998) . To appearGoogle Scholar
• Vapnik V., Golowich S. E., Smola A., Mozer M. C., Jordan M. I., Petsche T. Support vector method for function approximation, regression estimation, and signal processing. Advances in Neural Information Processing Systems (1997) 9(MIT Press, Cambridge, MA) Google Scholar
• Vapnik V. N.The Nature of Statistical Learning Theory (1995) (Springer, New York) Crossref, Google Scholar
• Wahba G.Spline Models for Observational Data (1990) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Wahba G., Schölkopf B., Burges C. J. C., Smola A. J. Support vector machines reproducing kernel Hilbert spaces and the randomized GACV. Advances in Kernel Methods—Support Vector Learning (1999) (MIT Press, Cambridge, MA) 69–88 ftp://ftp.stat.wisc.edu/pub/wahba/index.htmlGoogle Scholar
• Wallace C., Patrick J. Coding decision trees. (1991) . Technical Report TR 151, Monash University, Melbourne, AustraliaGoogle Scholar
• Wright S. J. Identifiable surfaces in constrained optimization. SIAM J. Control Optim. (1993) 31:1063–1079Crossref, Google Scholar
• Zhang T., Ramakrishnan R., Livny M. Birch: A new data clustering algorithm and its applications. Data Mining Knowledge Discovery (1997) 1:141–182Crossref, Google Scholar