The Ferrety Algorithm for the KDD Cup 2005 Problem Zsolt T. Kardkovács, Domonkos Tikk, and Zoltán Bánsághi   View Paper (PDF)   Return to December 2005, Volume 7, Issue 2 Abstract In this paper, we present a general solution for the KDD Cup 2005 problem. It uses the Internet as source of knowl- edge and extends it to categorize very short (less than 5 words) documents with reasonable accuracy. Our approach consists of three main parts: i.) a central knowledge fil- ter ii.) an on-demand web crawler and iii.) a very efficient categorizer system. Our solution obtained Creativity and Precision Runner-up Awards at the competition. The main idea of Ferrety Algorithm can be generalized for mapping one taxonomy to another if training documents are avail- able. ©2006 Association for Computing Machinery