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 c...

Full description

Saved in:
Bibliographic Details
Published in:Applied numerical mathematics 2025-02, Vol.208, p.390-407
Main Authors: Zahir, Alaeddine, Jbilou, Khalide, Ratnani, Ahmed
Format: Article
Language:English
Subjects:
Graph based multi-view clustering
Multi-view clustering
Multilinear algebra
Subspace based multi-view clustering
Tensors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0168-9274
DOI:10.1016/j.apnum.2023.11.009