The naked subset is the first, and most basic elimination technique in Sudoku. Most people will actually be using this
technique, although they may have a different term for it, or have not even thought about at all. The basic premise is this:
If a number of cells in a unit (row,col, or zone) contain exactly the same number of candidates between them,
then these candidates can be removed from every other cell in that unit.
In the example left, the candidates are shown against each cell. In column 8 (highlighted) you can see the following candidates:
{4}{2,5,9}{6}{1,3,5,9}{2,5,9}{1,2,3,5,9}{7}{5,9}{8}.
You will notice the candidates 2,5 and 9 are the only values in the following candidate sets: {5,9}{2,5,9}{2,5,9}
Although you do not know exactly where 2,5 and 9 go, you know it must be within these three cells, and can therefore be eliminated
from the cells {1,3,5,9}{1,2,3,5,9}.
This leaves the column candidates as: {4}{2,5,9}{6}{1,3}{2,5,9}{1,3}{7}{5,9}{8}.
A more familiar example may be a naked pair i.e. {1,6}{1,6}, but in fact, naked subsets can be found in 2s,3s, or 4s (naked quads).