A new computational search technique for AI based on the Cantor set

摘要

This paper discusses the development of a new search algorithm for artificial intelligence systems. The search technique is based on the mathematical theory of the Cantor set. The search algorithm will be efficient for specialized search domains where the distribution of the data elements to be searched is approximately normal. The approach uses the iterative procedure of deleted middle thirds. This facilitates quick pruning of a search space. The new search technique has potential applications in computational systems with large input-output data handling. Extensive experiments comparing the Cantor set search (CSS) to binary search indicate that the new search technique holds good promise.