Multilinear algebra methods for higher-dimensional graphs

In this paper, we will explore the use of multilinear algebra-based methods for higher dimensional graphs. Multi-view clustering (MVC) has gained popularity over the single-view clustering due to its ability to provide more comprehensive insights into the data. However, this approach also presents challenges, particularly in combining and utilizing multiple views or features effectively. Most of recent work in this field focuses mainly on tensor representation instead of treating the data as simple matrices. Accordingly, we will examine and compare these approaches, particularly in two categories, namely graph-based clustering and subspace-based clustering. We will report on experiments conducted using benchmark datasets to evaluate the performance of the main clustering methods.