A Novel Indexing based Decision tree model on high Dimension Data Stream

摘要

As the dimension increases, the complexity to find the nearest neighbor also increases. In one dimension we can find the nearest point very efficiently. But when the dimension increases, the search efficiency depends on how many points we have to search.