Column Generation for the Minimum Hyperplanes Clustering Problem

References

• Agarwal PK, Procopiuc CM. Approximation algorithms for projective clustering. J. Algorithms (2003) 46(2):115–139Crossref, Google Scholar
• Amaldi E, Kann V. The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoret. Comput. Sci. (1995) 147(1-2):181–210Crossref, Google Scholar
• Amaldi E, Mattavelli M. The MIN PFS problem and piecewise linear model estimation. Discrete Appl. Math. (2002) 118(1-2):115–143Crossref, Google Scholar
• Amaldi E, Belotti P, Hauser R. Randomized relaxation methods for the maximum feasible subsystem problem. Proc. 11th Integer Programming and Combinatorial Optim. (IPCO) Conf., Vol. 3509 (2005) Berlin(Springer)249–264LNCSCrossref, Google Scholar
• Amaldi E, Coniglio S, Dhyani K. k-hyperplane clustering problem: Column generation and a metaheuristic. Proc. CT Workshop on Graphs and Combinatorial Optim. (2009) Paris:355–358Google Scholar
• Amaldi E, Pfetsch ME, Trotter LE. On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Math. Programming A (2003) 95(3):533–554Crossref, Google Scholar
• Arthanari TS, Dodge Y. Mathematical Programming in Statistics (1993) (Wiley Classics Library Edition, Wiley-Interscience, New York) Google Scholar
• Bertsimas D, Shioda R. Classification and regression via integer optimization. Oper. Res. (2006) 55(2):252–271Link, Google Scholar
• Bonami P, Lee J. BONMIN users' manual. (2007) . [Online] http://projects.coin-or.org/BonminGoogle Scholar
• Bradley PS, Mangasarian OL. k-plane clustering. J. Global Optim. (2000) 16(1):23–32Crossref, Google Scholar
• Bradley PS, Fayyad UM, Mangasarian OL. Mathematical programming for data mining: Formulations and challenges. INFORMS J. Comput. (1999) 11(3):217–238Link, Google Scholar
• Censor Y, Zenios SA. Parallel Optimization: Theory, Algorithms, and Application (1997) (Oxford University Press, New York) Google Scholar
• CPLEX ILOG CPLEX 11.0 User's Manual. (2008) . ILOG S.A., Gentilly, FranceGoogle Scholar
• Desaulniers G, Desrosiers J, Solomon MM. Column Generation (2005) (Springer Science+Business Media, Inc., New York) Crossref, Google Scholar
• Dhyani K. Optimization models and algorithms for the hyperplane clustering problem. (2009) . Ph.D. thesis, Politecnico di MilanoGoogle Scholar
• Drezner Z, Hamacher HW. Facility Location: Applications and Theory (2004) (Springer-Verlag, Berlin-Heidelberg) Google Scholar
• Ferrari-Trecate G, Muselli M, Liberati D, Morari M. A clustering technique for the identification of piecewise affine systems. Automatica (2003) 39(2):205–217Crossref, Google Scholar
• Fourer R, Gay D. The AMPL Book (2002) (Duxbury Press, Pacific Grove) Google Scholar
• Gill P, Murray W, Saunders M. SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Rev. (2005) 47(1):99–131Crossref, Google Scholar
• Grantson M, Levcopoulos C. Covering a set of points with a minimum number of lines. Proc. CIAC, Vol. 3998 (2006) Rome(Springer)6–17LNCSCrossref, Google Scholar
• Har-Peled S, Varadarajan K. Projective clustering in high dimensions using core-sets. Proc. 18th Annual Sympos. Computational Geometry (SCG'02) (2002) (ACM, New York, USA) 312–318Crossref, Google Scholar
• Jain AK, Murty MN, Flynn PJ. Data cluster: A review. ACM Comput. Surveys (1999) 31(3):264–323Crossref, Google Scholar
• Kumar VSA, Arya S, Ramesh H. Hardness of set cover with intersection 1. Proc. 27th ICALP, Vol. 1853 (2000) Geneva(Springer)624–635LNCSCrossref, Google Scholar
• Mangasarian OL. Arbitrary-norm separating plane. Oper. Res. Lett. (1999) 24(1-2):15–23Crossref, Google Scholar
• Martini H, Schöbel A. Median hyperplanes in normed spaces a survey. Discrete Appl. Math. (1998) 89(1-3):181–195Crossref, Google Scholar
• Megiddo N, Tamir A. On the complexity of locating linear facilities in the plane. Oper. Res. Lett. (1982) 1(5):194–197Crossref, Google Scholar
• Mishra N, Motwani R, Vassilvitskii S. Sublinear projective clustering with outliers. Proc. 15th Annual Fall Workshop on Computational Geometry and Visualization (2005) 45–47Google Scholar
• Parsons L, Haque E, Liu H. Subspace clustering for high dimensional data: A review. ACM SIGKDD Explorations Newsletter (2004) 6(1):90–105Crossref, Google Scholar
• Schöbel A. Locating lines and hyperplanes: Theory and algorithms. (1998) . Ph.D. thesis, TU KaiserslauternGoogle Scholar
• Schrijver A. Theory of Linear and Integer Programming (1986) (Wiley and Sons)Google Scholar
• Vanderbeck F. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper. Res. (2000) 48(1):111–128Link, Google Scholar
• Vapnik V. The Nature of Statistical Learning Theory (1999) (Springer-Verlag, New York) Google Scholar