Name
Abstract | ||
|---|---|---|
We propose a new semiparametric approach to binary classification that exploits the modeling flexibility of sparse graphical models. Specifically, we assume that each class can be represented by a forest-structured graphical model. Under this assumption, the optimal classifier is linear in the log of the one- and two-dimensional marginal densities. Our proposed procedure non-parametrically estimates the univariate and bivariate marginal densities, maps each sample to the logarithm of these estimated densities and constructs a linear SVM in the transformed space. We prove convergence of the resulting classifier to an oracle SVM classifier and give finite sample bounds on its excess risk. Experiments with simulated and real data indicate that the resulting classifier is competitive with several popular methods across a range of applications. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Machine Learning | Convergence (routing),Binary classification,Oracle,Algorithm,Artificial intelligence,Logarithm,Graphical model,Bivariate analysis,Classifier (linguistics),Univariate,Mathematics,Machine learning |
DocType | Volume | Citations |
Journal | abs/1806.01993 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mary Frances Dorn | 1 | 0 | 0.34 |
| Amit Moscovich | 2 | 0 | 0.68 |
| Boaz Nadler | 3 | 471 | 33.65 |
| Clifford H. Spiegelman | 4 | 0 | 0.34 |