Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Nearest neighbour search is one of the most simple and used technique in Pattern Recognition.#R##N##R##N#One of the most known fast nearest neighbour algorithms was proposed by Fukunaga and Narendra. The algorithm builds a tree in preprocess time that is traversed on search time using some elimination rules to avoid its full exploration.#R##N##R##N# tests two new types of improvements in a real data environment, a spelling task. The first improvement is a new (and faster to build) type of tree, and the second is the introduction of two new elimination rules.#R##N##R##N#Both techniques, even taken independently, reduce significantly both: the number of distance computations and the search time expended to find the nearest neighbour.
['Eva Gómez-Ballester', 'Luisa Micó', 'Jose Oncina']
I am writing a research paper on a idea Testing some improvements of the fukunaga and narendra's fast nearest neighbour search algorithm in a spelling task
[{"from": "human", "value": "I am writing a research paper on a idea Testing some improvements of the fukunaga and narendra's fast nearest neighbour search algorithm in a spelling task"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Nearest neighbour search is one of the most simple and used technique in Pattern Recognition.#R##N##R##N#One of the most known fast nearest neighbour algorithms was proposed by Fukunaga and Narendra. The algorithm builds a tree in preprocess time that is traversed on search time using some elimination rules to avoid its full exploration.#R##N##R##N# tests two new types of improvements in a real data environment, a spelling task. The first improvement is a new (and faster to build) type of tree, and the second is the introduction of two new elimination rules.#R##N##R##N#Both techniques, even taken independently, reduce significantly both: the number of distance computations and the search time expended to find the nearest neighbour."}]