Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samuel V. Singh

dblp:418/2005 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › neural network representation learning › deep representation learning
autoencoder representation learning
0.912025
Shape-Informed Clustering of Multi-Dimensional Functional Data via Deep Functional Autoencoders · NeurIPS 2025
Data mining
clustering
0.912025
Shape-Informed Clustering of Multi-Dimensional Functional Data via Deep Functional Autoencoders · NeurIPS 2025
Data mining › clustering
functional data clustering
0.912025
Shape-Informed Clustering of Multi-Dimensional Functional Data via Deep Functional Autoencoders · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

shape-informed clustering loss · 1.7deep functional autoencoder · 1.7
YearPublicationVenuePosition
2025 Shape-Informed Clustering of Multi-Dimensional Functional Data via Deep Functional Autoencoders
abstract
We introduce FAEclust, a novel functional autoencoder framework for cluster analysis of multi-dimensional functional data, data that are random realizations of vector-valued random functions. Our framework features a universal-approximator encoder that captures complex nonlinear interdependencies among component functions, and a universal-approximator decoder capable of accurately reconstructing both Euclidean and manifold-valued functional data. Stability and robustness are enhanced through innovative regularization strategies applied to functional weights and biases. Additionally, we incorporate a clustering loss into the network's training objective, promoting the learning of latent representations that are conducive to effective clustering. A key innovation is our shape-informed clustering objective, ensuring that the clustering results are resistant to phase variations in the functions. We establish the universal approximation property of our non-linear decoder and validate the effectiveness of our model through extensive experiments.
Samuel V. Singh, Shirley Coyle, Mimi Zhang
NeurIPS1