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

Characterizing the hypergraph-of-entity and the structural impact of its extensions

View through CrossRef
AbstractThe hypergraph-of-entity is a joint representation model for terms, entities and their relations, used as an indexing approach in entity-oriented search. In this work, we characterize the structure of the hypergraph, from a microscopic and macroscopic scale, as well as over time with an increasing number of documents. We use a random walk based approach to estimate shortest distances and node sampling to estimate clustering coefficients. We also propose the calculation of a general mixed hypergraph density measure based on the corresponding bipartite mixed graph. We analyze these statistics for the hypergraph-of-entity, finding that hyperedge-based node degrees are distributed as a power law, while node-based node degrees and hyperedge cardinalities are log-normally distributed. We also find that most statistics tend to converge after an initial period of accentuated growth in the number of documents. We then repeat the analysis over three extensions—materialized throughsynonym,context, andtf_binhyperedges—in order to assess their structural impact in the hypergraph. Finally, we focus on the application-specific aspects of the hypergraph-of-entity, in the domain of information retrieval. We analyze the correlation between the retrieval effectiveness and the structural features of the representation model, proposing ranking and anomaly indicators, as useful guides for modifying or extending the hypergraph-of-entity.
Springer Science and Business Media LLC
Title: Characterizing the hypergraph-of-entity and the structural impact of its extensions
Description:
AbstractThe hypergraph-of-entity is a joint representation model for terms, entities and their relations, used as an indexing approach in entity-oriented search.
In this work, we characterize the structure of the hypergraph, from a microscopic and macroscopic scale, as well as over time with an increasing number of documents.
We use a random walk based approach to estimate shortest distances and node sampling to estimate clustering coefficients.
We also propose the calculation of a general mixed hypergraph density measure based on the corresponding bipartite mixed graph.
We analyze these statistics for the hypergraph-of-entity, finding that hyperedge-based node degrees are distributed as a power law, while node-based node degrees and hyperedge cardinalities are log-normally distributed.
We also find that most statistics tend to converge after an initial period of accentuated growth in the number of documents.
We then repeat the analysis over three extensions—materialized throughsynonym,context, andtf_binhyperedges—in order to assess their structural impact in the hypergraph.
Finally, we focus on the application-specific aspects of the hypergraph-of-entity, in the domain of information retrieval.
We analyze the correlation between the retrieval effectiveness and the structural features of the representation model, proposing ranking and anomaly indicators, as useful guides for modifying or extending the hypergraph-of-entity.

Related Results

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...
Graph-based entity-oriented search
Graph-based entity-oriented search
Entity-oriented search has revolutionized search engines. In the era of Google Knowledge Graph and Microsoft Satori, users demand an effortless process of search. Whether they expr...
Noise-robust classification with hypergraph neural network
Noise-robust classification with hypergraph neural network
<p>This paper presents a novel version of hypergraph neural network method. This method is utilized to solve the noisy label learning problem. First, we apply the PCA dimensi...
Form Follows Force: A theoretical framework for Structural Morphology, and Form-Finding research on shell structures
Form Follows Force: A theoretical framework for Structural Morphology, and Form-Finding research on shell structures
The springing up of freeform architecture and structures introduces many challenges to structural engineers. The main challenge is to generate structural forms with high structural...
On Graph Representation for Attributed Hypergraph Clustering
On Graph Representation for Attributed Hypergraph Clustering
Attributed Hypergraph Clustering (AHC) aims at partitioning a hypergraph into clusters such that nodes in the same cluster are close to each other with both high connectedness and ...
T-HyperGNNs: Hypergraph Neural Networks Via Tensor Representations
T-HyperGNNs: Hypergraph Neural Networks Via Tensor Representations
<p>Hypergraph neural networks (HyperGNNs) are a family of deep neural networks designed to perform inference on hypergraphs. HyperGNNs follow either a spectral or a spatial a...

Back to Top