Concepts inThe relationship between Precision-Recall and ROC curves
Algorithm
In mathematics and computer science, an algorithm Listen/ˈælɡərɪðəm/ (originating from al-Khwārizmī, the famous mathematician Muḥammad ibn Mūsā al-Khwārizmī) is a step-by-step procedure for calculations. Algorithms are used for calculation, data processing, and automated reasoning. More precisely, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function.
more from Wikipedia
Time complexity
In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O notation, which suppresses multiplicative constants and lower order terms. When expressed this way, the time complexity is said to be described asymptotically, i.e. , as the input size goes to infinity.
more from Wikipedia
Convex hull
In mathematics, the convex hull or convex envelope for a set X of points in the Euclidean plane or Euclidean space is the minimal convex set containing X. For instance, when X is a bounded subset of the plane, the convex hull may be visualized as the shape formed by a rubber band stretched around X. Formally, the convex hull may be defined as the intersection of all convex sets containing X, the intersection of all halfspaces containing X, or the set of all convex combinations of points in X.
more from Wikipedia
Euclidean space
In mathematics, Euclidean space is the Euclidean plane and three-dimensional space of Euclidean geometry, as well as the generalizations of these notions to higher dimensions. The term “Euclidean” distinguishes these spaces from the curved spaces of non-Euclidean geometry and Einstein's general theory of relativity, and is named for the Greek mathematician Euclid of Alexandria.
more from Wikipedia
Point (geometry)
In geometry, topology, and related branches of mathematics, a spatial point is a primitive notion upon which other concepts may be defined. In geometry, points are zero-dimensional; i.e. , they do not have volume, area, length, or any other higher-dimensional analogue. In branches of mathematics dealing with set theory, an element is sometimes referred to as a point.
more from Wikipedia
Linear interpolation
Linear interpolation is a method of curve fitting using linear polynomials. Lerp is an abbreviation for linear interpolation, which can also be used as a verb.
more from Wikipedia
Curve
In mathematics, a curve (also called a curved line in older texts) is, generally speaking, an object similar to a line but which is not required to be straight. This entails that a line is a special case of curve, namely a curve with null curvature. Often curves in two-dimensional or three-dimensional (space curves) Euclidean space are of interest.
more from Wikipedia
If and only if
↔ ⇔ ≡ Logical symbolsrepresenting iff In logic and related fields such as mathematics and philosophy, if and only if (shortened iff) is a biconditional logical connective between statements. In that it is biconditional, the connective can be likened to the standard material conditional ("only if," equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other, i.e.
more from Wikipedia