Work

An Analysis of How Hypergraph Spectral Clustering Deals with Higher-order Relationships

Year: 2024

Type: conference-paper

Abstract: Spectral clustering has recently been extended to hypergraphs, which are formed by vertices and higher-order relationships between these vertices. In this article, we consider a methodology to qualitatively compare hypergraph spectral clustering against the classical graph spectral clustering. More precisely, we use a graph representation to create a graph from a given hypergraph, thus allowing a comparison between spectral clustering methods. Experiment shows that the hypergraph spectral clustering deals differently with higher-order relationships.

DOI: 10.5753/sibgrapi.est.2024.31660

Authors: Ana Carolina Holzmeister Cunha, Fabiano Petronetto, Alcebiades Dal Col

Institution: Universidade Federal do Espírito Santo

Language: English

Topic: Advanced Clustering Algorithms Research

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Funder: Conselho Nacional de Desenvolvimento Científico e Tecnológico

Awards: G4318380734, G635968748, G6867735897

OpenAlex ID: W4404954957

FWCI:

Cites: 10

Cited by:

Related to: 10