summaryrefslogtreecommitdiff
path: root/paper/method.tex
diff options
context:
space:
mode:
authorTimotej Lazar <timotej.lazar@fri.uni-lj.si>2017-04-17 16:32:08 +0200
committerTimotej Lazar <timotej.lazar@fri.uni-lj.si>2017-04-17 16:32:36 +0200
commitfa38d4ca99f863573b8900ef78d5191b8f2db561 (patch)
tree2102c9f88b1c52e1fce2b2b62b3b7138de9dd195 /paper/method.tex
parentc3615b45b84e81e421763d76d01fa363dd79f985 (diff)
Fit the twelve (publisher remix)
Because the message should fit the medium.
Diffstat (limited to 'paper/method.tex')
-rw-r--r--paper/method.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/paper/method.tex b/paper/method.tex
index 0c3fdff..c2c828f 100644
--- a/paper/method.tex
+++ b/paper/method.tex
@@ -36,7 +36,7 @@ To discover buggy patterns, the algorithm first learns \emph{negative rules} tha
\begin{itemize}
\item classification accuracy of each learned rule must exceed a threshold (we selected 90\%, as 10\% error seems acceptable for our application);
- \item each conjunct in a condition must be significant with respect to the likelihood-ratio test (in our experiments we set significance threshold to $p=0.05$);
+ \item each conjunct in a condition must be significant according to the likelihood-ratio test (in our experiments we set significance threshold to $p=0.05$);
\item a conjunct can only specify the presence of a pattern (in other words, we only allow feature-value pairs with the value \textsf{true}).
\end{itemize}