Please use this identifier to cite or link to this item: https://dspace.univ-guelma.dz/jspui/handle/123456789/18253
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAMIRI, LINA-
dc.date.accessioned2025-10-15T13:32:01Z-
dc.date.available2025-10-15T13:32:01Z-
dc.date.issued2025-
dc.identifier.urihttps://dspace.univ-guelma.dz/jspui/handle/123456789/18253-
dc.description.abstractHigh-dimensional data is increasingly prevalent across diverse domains such as bioinfor matics, medical imaging, and natural language processing, posing significant challenges due to the curse of dimensionality and computational complexity. This thesis proposes a novel two-phase dimensionality reduction framework that combines representative selec tion through clustering with Uniform Manifold Approximation and Projection (UMAP) training. In the first phase, representative samples are selected using clustering algorithms such as Mini-Batch KMeans and BIRCH to reduce data size while preserving its structure. In the second phase, UMAP is trained on these representatives to learn a low-dimensional embedding, which is then used to transform the entire dataset efficiently. Experimental results on the IoTID20 dataset; a high-dimensional dataset, demonstrate that the pro posed method significantly reduces computational time and memory usage compared to standard UMAP, while maintaining comparable embedding quality and classification per formance. This hybrid approach offers a scalable and effective solution for dimensionality reduction in large-scale high-dimensional data analysisen_US
dc.language.isoenen_US
dc.publisherUniversity of Guelmaen_US
dc.subjectDimensionality reduction, high-dimensional data, representative selec tion, clustering, UMAP, manifold learning, computational efficiency.en_US
dc.titleTwo-Phase Dimensionality Reduction Using Representative Selection and UMAP Trainingen_US
dc.typeWorking Paperen_US
Appears in Collections:Master

Files in This Item:
File Description SizeFormat 
F5_8_AMIRI_LINA.pdf2,7 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.