Jaccard similarity coefficient score - The Jaccard similarity coefficient score measures overlap between two sets by dividing the size of their intersection by the size of their union.
Jackknife variance estimates for random forest - Jackknife variance estimates for random forests are methods for estimating how much a forest's prediction would vary across repeated training samples.
Jacobi method - The Jacobi method is an iterative algorithm for solving a linear system Ax=b.
Jacobian - The Jacobian is the matrix of first-order partial derivatives of a vector-valued function.
Jacobian-vector product - A Jacobian-vector product, or JVP, multiplies a function's Jacobian at a chosen input by an input-direction vector.
Jarvis&Patrick clustering - Jarvis-Patrick clustering is a clustering method that groups items by shared near neighbors: two items belong together when they appear high on each other's...
JDBC-ODBC bridge - The JDBC-ODBC bridge is a driver layer that allows Java applications using JDBC, Java Database Connectivity, to access data through an ODBC driver.
Jeffreys prior - A Jeffreys prior is a Bayesian prior constructed from the expected Fisher information of a statistical model.
Jenkins - Traub algorithm - The Jenkins-Traub algorithm is a family of numerical methods for finding polynomial zeros through three stages of auxiliary-polynomial iteration.
Jenks natural breaks optimization - Jenks natural breaks optimization is a method for dividing ordered numerical values into a chosen number of classes.
Jensen bound integration - Jensen bound integration is a technique for approximating an average that is hard to compute exactly: it uses Jensen's inequality, which relates the average...
Job-shop scheduling problem - A job-shop scheduling problem asks when to perform the operations of several jobs on shared machines while respecting each job's required operation order...
Johnson's algorithm - Johnson's algorithm computes shortest paths between all pairs of vertices in a weighted graph.
Join Method - A join method is the physical algorithm a database uses to combine rows from query inputs according to a join condition.
Join-pattern - A join-pattern is a concurrency construct that specifies a reaction requiring messages or calls on several channels together.
Join tree - A join tree is a tree of variable sets or clusters arranged so that every variable appears in a connected group of tree nodes.
Joint action - A joint action is a combination of actions, one for each participating agent, considered together at a decision step.
Joint compatibility branch and bound - Joint compatibility branch and bound, commonly abbreviated JCBB, is a data-association method that searches for a large set of mutually compatible matches...
Joint plan - A joint plan describes coordinated actions for multiple agents so that their combined execution achieves specified goals.
Joint probability - Joint probability is the probability that specified events all occur. For two events A and B, it is written P(A and B), or P(A intersection B).
Joint probability distribution - A joint probability distribution describes how two or more random variables behave together.
Joint source and channel coding - Joint source and channel coding designs information representation and protection against transmission noise together.
Jonckheere's trend test - Jonckheere's trend test, also called the Jonckheere-Terpstra test, is a nonparametric test for an ordered alternative across independent groups.
JTMS - JTMS stands for justification-based truth maintenance system.
Judgment sample - A judgment sample is a non-probability sample whose members are deliberately selected using a researcher's or expert's assessment of their relevance or...
Jump point search - Jump point search, or JPS, is a pathfinding technique that reduces redundant search on suitable grid maps.
Jump search - Jump search is a lookup algorithm for sorted data that checks spaced block boundaries until it locates the block that could contain a target, then searches...
Junction tree algorithm - The junction tree algorithm is a method for exact probabilistic inference in suitable graphical models.
Justification - A justification is an explicit record of the reasons or conditions supporting a conclusion.