Karma tamsayılı üstel konik programlama uygulamaları: Seyrek lojistik regresyon ve eniyi histogram inşaası

In this study, two problems namely as Feature Subset Selection In Logistic Regression and Optimal Histogram Construction are formulated and solved using solver MOSEK. The common characteristic of both problems is that the objective functions are Exponential Cone-representable. In the first problem, a prediction model is derived to predict the dichotomous dependent variable using labeled datasets which is known as classification in the context of machine learning. Different versions of the model are derived by the means of regularization and goodness of fit measures including Akaike Information Criteria, Bayesian Information Criteria, and Adjusted McFadden. Furthermore, the performance of these different versions are evaluated over a set of toy examples and benchmark datasets. The second model is developed to find the optimal bin width of histograms with the aim of minimizing Kullback–Leibler divergence, which is called Information gain in machine learning. The success of the proposed model is demonstrated over randomly generated instances from different probability distributions including Normal, Gamma and Poission.