3,135 articles
ISO 8000
ISO 8000 is the ISO international standard series for data quality, defining characteristics, measurement, and exchange requirements for master data such as product and supplier data. Quality data is portable data meeting stated requirements; Part 8 covers syntactic, semantic, and pragmatic quality.
ISO/IEC 11179
ISO/IEC 11179, Metadata Registries (MDR), is an ISO/IEC JTC 1/SC 32 international standard for describing and managing the meaning and representation of data via metadata registries; edition 4 of Parts 1, 3, and 6 was published in January 2023.
Isolation (database systems)
Isolation, also called transaction isolation, is the database property shielding one transaction's operations from concurrently executing ones; the SQL standard defines four levels, from Read Uncommitted to Serializable.
Isolation forest
The isolation forest (iForest) is an unsupervised anomaly detection method that scores points by how few random splits isolate them, needing no distance or density measure.
Isomap
Isomap, or isometric feature mapping, is a nonlinear dimensionality reduction method that preserves geodesic distances, introduced by Tenenbaum, de Silva, and Langford in Science in 2000.
Iterated greedy
Iterated greedy is a stochastic local search metaheuristic that repeatedly destroys part of a candidate solution and greedily reconstructs it, formalized by Ruiz and Stützle in 2007.
Iterated local search
Iterated local search (ILS) is a metaheuristic optimization method that perturbs a solution, runs local search, and accepts or rejects the result, escaping local optima on hard problems.
Iterative closest point
The iterative closest point (ICP) algorithm aligns two point clouds by repeatedly matching closest points and refining the rigid transform, introduced by Besl and McKay in 1992.
Iterative filtering (signal processing)
Iterative filtering is an adaptive signal decomposition method, introduced by Lin, Wang, and Zhou in 2009 as a provably convergent alternative to empirical mode decomposition for nonlinear, nonstationary signals.
IVF-PQ index
The IVF-PQ index is an approximate nearest-neighbor search structure combining inverted file clustering with product quantization compression, introduced by Jégou, Douze, and Schmid at INRIA in 2011.
J.A.R.V.I.S.
J.A.R.V.I.S., short for Just A Rather Very Intelligent System, is the fictional AI assistant Tony Stark created in the Marvel Cinematic Universe, voiced by Paul Bettany.
Java collections framework
The Java collections framework, also known as the Java Collections API, is a unified architecture in Java for representing and manipulating groups of objects, introduced in 1998.
Java Database Connectivity
Java Database Connectivity (JDBC) is Java's standard, low-level API for communicating with relational databases, included in Java Standard Edition since 1.1 and used by tools like Spring JDBC, JPA, and jOOQ.
Jaya algorithm
The Jaya algorithm is a parameter-less, population-based optimization method introduced by R. Venkata Rao in 2015, moving candidates toward the best and away from the worst solution.
JDBC driver
A JDBC driver is a vendor-specific Java library implementing the JDBC API, allowing a Java application to connect to and issue commands against a specific database management system.
Jellyfish search optimizer
The jellyfish search optimizer, also written JSO, is a swarm-based metaheuristic mimicking jellyfish ocean-current and swarm motion, introduced by Chou and Truong in 2020 and needing almost no parameter tuning.
Join (SQL)
A SQL join, also called a database join, combines rows from two or more tables into one result, with types such as INNER and OUTER.
JSTOR
JSTOR (short for Journal Storage) is a nonprofit digital library of academic journals, books, primary sources, and images, founded in 1995 as a Mellon Foundation project.
Jump search
Jump search, also called block search, is a searching algorithm for sorted arrays that jumps ahead in fixed-size blocks and then linearly scans the block that could hold the target.
Junction Tree VAE
The Junction Tree Variational Autoencoder (JT-VAE or JTVAE) is a generative model introduced at MIT in 2018 that produces chemically valid molecules by first generating a scaffold of substructures, then assembling them.
K-2SO
K-2SO, also known as Kaytoo-Esso, is a fictional droid in the Star Wars franchise, a reprogrammed Imperial security droid serving the Rebel Alliance, first appearing in Rogue One (2016).
K-anonymity
K-anonymity is a privacy criterion for published datasets, introduced by Latanya Sweeney in 2002, requiring every record to be indistinguishable from at least k minus 1 others.
K-d tree
A k-d tree is a binary search tree that organizes points in a k-dimensional space, developed by Jon Louis Bentley in 1975 for associative searches.
K-fold cross-validation
K-fold cross-validation is a machine learning method that estimates prediction error by splitting data into k folds, training on all but one, and averaging the k test errors.
K-means clustering
K-means clustering is an unsupervised learning method that partitions data into k clusters by minimizing squared distances to nearest centers, typically using Lloyd's algorithm with k-means++ initialization.
K-medoids
K-medoids is a partitioning clustering method in which each cluster is represented by a medoid, an actual observed data point, making it more robust to noise and outliers than k-means.
K-nearest neighbors algorithm
The k-nearest neighbors algorithm (k-NN) is a supervised machine learning method that classifies a point by majority vote among its k closest labeled training samples.
K-SVD
K-SVD is an iterative dictionary learning algorithm that trains an overcomplete dictionary so signals can be approximated sparsely, introduced by Aharon, Elad, and Bruckstein in 2006.
Kabsch algorithm
The Kabsch algorithm is a closed-form method for finding the rotation that best aligns two sets of points in the least-squares sense, published by Wolfgang Kabsch in 1976.
Kademlia
Kademlia, also known as the Kademlia P2P protocol, is a peer-to-peer distributed hash table algorithm described at New York University in 2002, used in BitTorrent, eMule, IPFS, and Ethereum.