Proposing a Dimensionality Reduction Technique With an Inequality for Unsupervised Learning from High-Dimensional Big Data

Data-clustering task can be considered as the most important unsupervised learning algorithms. For about all clustering algorithms, finding the Nearest Neighbors of a point within a certain radius r (NN- r ), is a critical task. For a high-dimensional dataset, this task becomes too time consuming. T...

Ausführliche Beschreibung