← All parts of this equation

Equation 11 · Part 5 · Comparing the Main Approaches to AI and Cybersecurity

multiplication

P(attack∣flagged)=π⋅TPRπ⋅TPR+(1−π)⋅FPR.P(\text{attack} \mid \text{flagged}) = \frac{\pi \cdot \mathrm{TPR}}{\pi \cdot \mathrm{TPR} + (1-\pi)\cdot \mathrm{FPR}}.
multiplication

What this part means

Multiply the quantities on either side.

Its job in the formula

Multiply the quantities on either side.

The passage around this formula

The arithmetic behind that claim generalizes directly to any detector, rule-based or AI-driven, and it is worth stating because it is the crux of why the two kinds of tooling are hard to compare on accuracy alone. If the base rate of genuine attacks among all monitored events is π\pi , and a detector has true-positive rate TPR\mathrm{TPR} and false-positive rate FPR\mathrm{FPR} , Bayes’ rule gives the probability that a flagged event is a real attack as P(attack∣flagged)=π⋅TPRπ⋅TPR+(1−π)⋅FPRP(\text{attack} \mid \text{flagged}) = \frac{\pi \cdot \mathrm{TPR}}{\pi \cdot \mathrm{TPR} + (1-\pi)\cdot \mathrm{FPR}}. When π\pi is very small, as it genuinely is in most enterprise traffic, even a detector with a low false-positive rate in isolation produces an alert stream that is mostly false alarms, because the enormous volume of benign…

Read this part in the article →

Learn the underlying idea

Multiplication scales one quantity by another. A dot, a cross, or adjacent symbols can indicate a product.

Open the illustrated multiplication: combining factors guide →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.