tokens: Researchers have also tried the boosting approach to Similarity Sensitive Coding ( SSC ) and Forgiving Hashing ( FgH ) - they first train AdaBoost classifiers with similar pairs of items as positive examples ( and also non - similar pairs of items as negative examples in SCC ) , and then take the output of all ( decision stump ) weak learners on a given document as its binary code .