Closest Neighbor Search for Hotel Recommendation by Multiple Keywords

Computer Engineering

The searching of nearest neighbor is based on basically k-NN algorithm. In this system the k-NN algorithm is used for finding the closest location which is satisfying the user requirements by fetching the data from the stored database. In the earlier days the nearest neighbor retrieval was based on spatial index. The spatial index algorithm was having some drawbacks like space and time complexities. Also there was less speed for execution and not much user friendly. Our system uses Boyer Moore Horspool algorithm for pattern matching that is matching the keywords given by user with existing database. The main goal of this system is to find out the closest location from the user’s current location with fulfilling all the user entered menus for the hotels. For example instead of mentioning the names of the hotels search for menus required. For example if user searches for “Biryani, Paneer tikka, Chinese” then the system searches for these keywords and matches with database. And recommends the list of hotels with highest priorities. This system deals with multidimensional and give the response of all nearest neighbors in real time.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.