The mining and the visualisation of data in high dimensional feature spaces require the design of efficient algorithms. In high dimensional data spaces distance functions lose their usefulness and optimisation techniques, machine learning and data mining algorithms are very inefficient and ineffective. This problem is referred to as ’the curse of dimensionality’ and is caused by the exponential increase in volume associated with adding extra dimensions to a mathematical space. In general, dimensionality reduction is a fundamental methodology for the success of the knowledge discovery process in many real-world applications. For enquiries please contact [email protected]. Keywords: Data Mining, Data Visualisation, Dimensionality Reduction
You haven’t included a message. Providing a specific message means universities will take your enquiry more seriously and helps them provide the information you need. Why not add a message here
The information you submit to University of Reading will only be used by them or their data partners to deal with your enquiry, according to their privacy notice. For more information on how we use and store your data, please read our privacy statement.