FastMap Algorithm

Algorithm Steps

The simple steps of FastMap algorithm works as follows:

1. Find the objects which have most long distance each other among all documents.
   
2. These objects are called the pivot objects.
   
3. Calculate xi by cosine law to project the objects on a line.
   
4. To map objects in k-d space, use Euclidean distance function D'().
   
5. Do loop depend on the expected dimensional space.
   
6. Eventually it will give 'images' of objects by which mapping in space is possible.
   

The FastMap algorithm works as below.: