-
Notifications
You must be signed in to change notification settings - Fork 0
/
article.tex
34 lines (24 loc) · 859 Bytes
/
article.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
\documentclass[12pt]{article}
%
% CiteSeerX
%
\usepackage[backend=biber, style=apa, backref=true]{biblatex}
\DeclareLanguageMapping{english}{american-apa}
\usepackage[autostyle=false]{csquotes}
\addbibresource{bibliography.bib}
\DeclareFieldFormat{eprint:citeseerx}{%
CiteSeerX\addcolon
\ifhyperref
{\href{http://citeseer.ist.psu.edu/viewdoc/summary?doi=#1}{\nolinkurl{#1}}}
{\nolinkurl{#1}}}
\usepackage[unicode=true]{hyperref}
\usepackage{setspace}
\onehalfspacing
\begin{document}
\section{Introduction}
A training algorithm that maximizes the margin between the training patterns and
the decision boundary is presented. The technique is applicable to a wide
variety of classifiaction functions, including Perceptrons, polynomials, and
Radial Basis Functions~\parencite{Boser1992}.
\printbibliography[heading=bibintoc]
\end{document}