Persistence Homology of TEDtalk: Do Sentence Embeddings Have a Topological Shape?
\emph{Topological data analysis} (TDA) has recently emerged as a new technique to extract meaningful discriminitve features from high dimensional data. In this paper, we investigate the possibility of applying TDA to improve the classification accuracy of public speaking rating. We calculated \emph{persistence image vectors} for the sentence embeddings of TEDtalk data and feed this vectors as additional inputs to our machine learning models. We have found a negative result that this topological information does not improve the model accuracy significantly. In some cases, it makes the accuracy slightly worse than the original one. From our results, we could not conclude that the topological shapes of the sentence embeddings can help us train a better model for public speaking rating.
Code (0)
등록된 구현이 없습니다.
Tasks
SentenceSentence EmbeddingsTopological Data AnalysisSimilar Papers 제목 키워드 기반
$k$-Means Clustering for Persistent Homology
Persistent homology is a methodology central to topological data analysis that extracts and summarizes the topological features within a dataset as a persistence diagram; it has recently gained much popularity from its m…
ClusteringTopological Data AnalysisStory Trees: Representing Documents using Topological Persistence
Topological Data Analysis (TDA) focuses on the inherent shape of (spatial) data. As such, it may provide useful methods to explore spatial representations of linguistic data (embeddings) which have become central in NLP.…
Topological Data AnalysisExploring Dowker Homology for Sentence Similarity
Dowker homology is a topological tool that may be used to analyze the relative position of two point clouds living in a common space. We investigate whether Dowker homology captures sentence similarity information by tre…
Point CloudsPersistent Homology and Graphs Representation Learning
This article aims to study the topological invariant properties encoded in node graph representational embeddings by utilizing tools available in persistent homology. Specifically, given a node embedding representation a…
Representation LearningPersistent Homology and Graphs Representation Learning
This article aims to study the topological invariant properties encoded in node graph representational embeddings by utilizing tools available in persistent homology. Specifically, given a node embedding representation a…
Representation Learning