Algorithms for Hash Coding and Document Classification.

The thesis consists of two parts. The first part introduces four different searching algorithms in hash coding which is a technique to resolve the collision problem. The second part introduces a new technique for calculating the similarity coefficients between documents and clusters, and also includes an algorithm for document classification. In general, the new technique will use less time than the old technique, the computation complexity of the algorithm will use less time than the old technique, the computation complexity of the algorithm being only linearly proportional to the number of total amount of documents. In addition, experimental results and analyses on the operational time of the new techniques are also presented and compared with traditional techniques. Author