Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features

View through CrossRef
Abstract Background Metabolic networks are complex systems that describe the biochemical reactions within an organism through pairwise interactions between chemical compounds. While this representation is widely used to study biological function, it fails to capture the full structure of metabolic reactions, many of which involve more than two compounds. Hypergraphs offer a more natural representation, where nodes represent metabolites and hyperedges represent reactions involving multiple participants. Clustering such metabolic hypergraphs can reveal systematic differences among evolutionarily distinct organisms, providing insight into ecological constraints and evolutionary pressures. Methods In this study, we investigate how different graphs and hypergraphs embedding methods influence their unsupervised clustering, with the goal of capturing taxonomy-based classes. We apply 14 distinct embedding strategies to a large-scale dataset of 8,467 metabolic hypergraphs. Each embedding was followed by hierarchical clustering using a fixed linkage method. To assess performance, we compared the resulting clusters against known taxonomic groupings. Results Our findings show that the choice of hypergraph embedding has a significant effect on clustering outcomes. Among the tested methods, Bag of Hyperedges with Jaccard distance, Histogram Cosine Kernel, and a Hypergraph Auto-Encoder consistently performed best. We also advocate that the embedding method should be chosen based on the goal of the downstream task.
Title: Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features
Description:
Abstract Background Metabolic networks are complex systems that describe the biochemical reactions within an organism through pairwise interactions between chemical compounds.
While this representation is widely used to study biological function, it fails to capture the full structure of metabolic reactions, many of which involve more than two compounds.
Hypergraphs offer a more natural representation, where nodes represent metabolites and hyperedges represent reactions involving multiple participants.
Clustering such metabolic hypergraphs can reveal systematic differences among evolutionarily distinct organisms, providing insight into ecological constraints and evolutionary pressures.
Methods In this study, we investigate how different graphs and hypergraphs embedding methods influence their unsupervised clustering, with the goal of capturing taxonomy-based classes.
We apply 14 distinct embedding strategies to a large-scale dataset of 8,467 metabolic hypergraphs.
Each embedding was followed by hierarchical clustering using a fixed linkage method.
To assess performance, we compared the resulting clusters against known taxonomic groupings.
Results Our findings show that the choice of hypergraph embedding has a significant effect on clustering outcomes.
Among the tested methods, Bag of Hyperedges with Jaccard distance, Histogram Cosine Kernel, and a Hypergraph Auto-Encoder consistently performed best.
We also advocate that the embedding method should be chosen based on the goal of the downstream task.

Related Results

Complement Reducible Uniform Hypergraphs
Complement Reducible Uniform Hypergraphs
We investigate a generalization of complement reducible graphs, called co-graphs, for r-uniform hypergraphs. The operations of r-co-hypergraphs are the disjoint union of two given ...
A Systematic Research on Various Types of Hausdorff Hypergraphs
A Systematic Research on Various Types of Hausdorff Hypergraphs
A hypergraph H = (V, E) is said to be a Hausdorff hypergraph if for any two distinct vertices u, v of V there exist hyperedges e1, e2 ∈ E such that u ∈ e1, v ∈ e2 and e1 ∩ e2 = ∅. ...
Completion and decomposition of hypergraphs by domination hypergraphs
Completion and decomposition of hypergraphs by domination hypergraphs
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every ve...
Hypergraph partitioning using tensor eigenvalue decomposition
Hypergraph partitioning using tensor eigenvalue decomposition
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturingsuper-dyadicinteractions among entities. In t...
Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges
Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges
An attributed hypergraph comprises nodes with attributes and hyperedges that connect varying numbers of nodes. Attributed hypergraph node and hyperedge embedding ...
Effective Attributed Network Embedding with Information Behavior Extraction
Effective Attributed Network Embedding with Information Behavior Extraction
Abstract Network embedding has shown its effectiveness in many tasks such as link prediction, node classification, and community detection. Most attributed network embeddin...
Effective attributed network embedding with information behavior extraction
Effective attributed network embedding with information behavior extraction
Network embedding has shown its effectiveness in many tasks, such as link prediction, node classification, and community detection. Most attributed network embedding methods consid...

Back to Top