Aylin Tastan

According to our database, Aylin Tastan authored at least 7 papers between 2021 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Contributions to Robust Graph Clustering: Spectral Analysis and Algorithms.

Aylin Tastan

PhD thesis, 2023

Fast and Robust Sparsity-Aware Block Diagonal Representation.

Aylin Tastan, Michael Muma, Abdelhak M. Zoubir

CoRR, 2023

Sparsity-Aware Block Diagonal Representation for Subspace Clustering.

Aylin Tastan, Michael Muma, Esa Ollila, Abdelhak M. Zoubir

Proceedings of the 31st European Signal Processing Conference, 2023

2022

Eigenvalue-Based Block Diagonal Representation and Application to p-Nearest Neighbor Graphs.

Aylin Tastan, Michael Muma, Abdelhak M. Zoubir

Proceedings of the 30th European Signal Processing Conference, 2022

2021

Sparsity-aware robust community detection (SPARCODE).

Aylin Tastan, Michael Muma, Abdelhak M. Zoubir

Signal Process., 2021

Robust Regularized Locality Preserving Indexing for Fiedler Vector Estimation.

Aylin Tastan, Michael Muma, Abdelhak M. Zoubir

CoRR, 2021

Robust Spectral Clustering: A Locality Preserving Feature Mapping Based on M-estimation.

Aylin Tastan, Michael Muma, Abdelhak M. Zoubir

Proceedings of the 29th European Signal Processing Conference, 2021