Results 251 to 260 of about 56,162 (272)
Some of the next articles are maybe not open access.
Next-item Recommendation with Sequential Hypergraphs
Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2020There is an increasing attention on next-item recommendation systems to infer the dynamic user preferences with sequential user interactions. While the semantics of an item can change over time and across users, the item correlations defined by user ...
Jianling Wang +4 more
semanticscholar +1 more source
Semisupervised Feature Extraction of Hyperspectral Image Using Nonlinear Geodesic Sparse Hypergraphs
IEEE Transactions on Geoscience and Remote Sensing, 2021Recently, the sparse representation (SR)-based graph embedding method has been extensively used in feature extraction (FE) tasks, but it is hard to reveal the complex manifold structure and multivariate relationship of samples in the hyperspectral image (
Yule Duan, Hong Huang, Tao Wang
semanticscholar +1 more source
Multicriteria cuts and size-constrained k-cuts in hypergraphs
Mathematical programming, 2020We address counting and optimization variants of multicriteria global min-cut and size-constrained min- k -cut in hypergraphs. 1. For an r -rank n -vertex hypergraph endowed with t hyperedge-cost functions, we show that the number of multiobjective min ...
Calvin Beideman +2 more
semanticscholar +1 more source
HypeBoy: Generative Self-Supervised Representation Learning on Hypergraphs
International Conference on Learning RepresentationsHypergraphs are marked by complex topology, expressing higher-order interactions among multiple nodes with hyperedges, and better capturing the topology is essential for effective representation learning.
Sunwoo Kim +5 more
semanticscholar +1 more source
2016
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmovà, Kateřina +4 more
openaire +5 more sources
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmovà, Kateřina +4 more
openaire +5 more sources
SIAM Journal on Discrete Mathematics, 1996
A subsystem of an inconsistent set of inequalities is an irreducibly inconsistent subsystem (IIS) if it is inconsistent and if it has no inconsistent proper subsystem. Each IIS can be considered the edge of a hypergraph. The paper presents several properties of this special class of hypergraphs (IIS-hypergraphs).
openaire +1 more source
A subsystem of an inconsistent set of inequalities is an irreducibly inconsistent subsystem (IIS) if it is inconsistent and if it has no inconsistent proper subsystem. Each IIS can be considered the edge of a hypergraph. The paper presents several properties of this special class of hypergraphs (IIS-hypergraphs).
openaire +1 more source
Hypergraph isomorphism using association hypergraphs
Pattern Recognition Letters, 2019Abstract Association graphs represent a classical tool to deal with the graph matching problem and recently the idea has been generalized to the case of hypergraphs. In this article, the potential of this approach is explored. The proposed framework uses a class of dynamical systems derived from the Baum-Eagon inequality in order to find the maximum (
Giulia Sandi +2 more
openaire +1 more source