Zaloguj się

Gotowe bibliografie tematyczne / Hypergraph-structure

Spis treści

Artykuły w czasopismach

Gotowa bibliografia na temat „Hypergraph-structure”

Autor: Grafiati

Data publikacji: 6 września 2023

Data aktualizacji: 7 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Hypergraph-structure”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Hypergraph-structure"

1

Xu, Jinhuan, Liang Xiao, and Jingxiang Yang. "Unified Low-Rank Subspace Clustering with Dynamic Hypergraph for Hyperspectral Image." Remote Sensing 13, no. 7 (2021): 1372. http://dx.doi.org/10.3390/rs13071372.

Pełny tekst źródła

Streszczenie:

Low-rank representation with hypergraph regularization has achieved great success in hyperspectral imagery, which can explore global structure, and further incorporate local information. Existing hypergraph learning methods only construct the hypergraph by a fixed similarity matrix or are adaptively optimal in original feature space; they do not update the hypergraph in subspace-dimensionality. In addition, the clustering performance obtained by the existing k-means-based clustering methods is unstable as the k-means method is sensitive to the initialization of the cluster centers. In order to

Style APA, Harvard, Vancouver, ISO itp.

2

Feng, Yifan, Haoxuan You, Zizhao Zhang, Rongrong Ji, and Yue Gao. "Hypergraph Neural Networks." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 3558–65. http://dx.doi.org/10.1609/aaai.v33i01.33013558.

Pełny tekst źródła

Streszczenie:

In this paper, we present a hypergraph neural networks (HGNN) framework for data representation learning, which can encode high-order data correlation in a hypergraph structure. Confronting the challenges of learning representation for complex data in real practice, we propose to incorporate such data structure in a hypergraph, which is more flexible on data modeling, especially when dealing with complex data. In this method, a hyperedge convolution operation is designed to handle the data correlation during representation learning. In this way, traditional hypergraph learning procedure can be

Style APA, Harvard, Vancouver, ISO itp.

3

Liu, Jian, Dong Chen, Jingyan Li, and Jie Wu. "Neighborhood hypergraph model for topological data analysis." Computational and Mathematical Biophysics 10, no. 1 (2022): 262–80. http://dx.doi.org/10.1515/cmb-2022-0142.

Pełny tekst źródła

Streszczenie:

Abstract Hypergraph, as a generalization of the notions of graph and simplicial complex, has gained a lot of attention in many fields. It is a relatively new mathematical model to describe the high-dimensional structure and geometric shapes of data sets. In this paper,we introduce the neighborhood hypergraph model for graphs and combine the neighborhood hypergraph model with the persistent (embedded) homology of hypergraphs. Given a graph,we can obtain a neighborhood complex introduced by L. Lovász and a filtration of hypergraphs parameterized by aweight function on the power set of the vertex

Style APA, Harvard, Vancouver, ISO itp.

4

Yang, Zhe, Liangkui Xu, and Lei Zhao. "Multimodal Feature Fusion Based Hypergraph Learning Model." Computational Intelligence and Neuroscience 2022 (May 16, 2022): 1–13. http://dx.doi.org/10.1155/2022/9073652.

Pełny tekst źródła

Streszczenie:

Hypergraph learning is a new research hotspot in the machine learning field. The performance of the hypergraph learning model depends on the quality of the hypergraph structure built by different feature extraction methods as well as its incidence matrix. However, the existing models are all hypergraph structures built based on one feature extraction method, with limited feature extraction and abstract expression ability. This paper proposed a multimodal feature fusion method, which firstly built a single modal hypergraph structure based on different feature extraction methods, and then extend

Style APA, Harvard, Vancouver, ISO itp.

5

Mahmood Shuker, Faiza. "Improved Blockchain Network Performance using Hypergraph Structure." Journal of Engineering and Applied Sciences 14, no. 2 (2019): 5579–84. http://dx.doi.org/10.36478/jeasci.2019.5579.5584.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Peng, Hao, Cheng Qian, Dandan Zhao, Ming Zhong, Jianmin Han, and Wei Wang. "Targeting attack hypergraph networks." Chaos: An Interdisciplinary Journal of Nonlinear Science 32, no. 7 (2022): 073121. http://dx.doi.org/10.1063/5.0090626.

Pełny tekst źródła

Streszczenie:

In modern systems, from brain neural networks to social group networks, pairwise interactions are not sufficient to express higher-order relationships. The smallest unit of their internal function is not composed of a single functional node but results from multiple functional nodes acting together. Therefore, researchers adopt the hypergraph to describe complex systems. The targeted attack on random hypergraph networks is still a problem worthy of study. This work puts forward a theoretical framework to analyze the robustness of random hypergraph networks under the background of a targeted at

Style APA, Harvard, Vancouver, ISO itp.

7

Xu, Xixia, Qi Zou, and Xue Lin. "Adaptive Hypergraph Neural Network for Multi-Person Pose Estimation." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 3 (2022): 2955–63. http://dx.doi.org/10.1609/aaai.v36i3.20201.

Pełny tekst źródła

Streszczenie:

This paper proposes a novel two-stage hypergraph-based framework, dubbed ADaptive Hypergraph Neural Network (AD-HNN) to estimate multiple human poses from a single image, with a keypoint localization network and an Adaptive-Pose Hypergraph Neural Network (AP-HNN) added onto the former network. For providing better guided representations of AP-HNN, we employ a Semantic Interaction Convolution (SIC) module within the initial localization network to acquire more explicit predictions. Build upon this, we design a novel adaptive hypergraph to represent a human body for capturing high-order semantic

Style APA, Harvard, Vancouver, ISO itp.

8

Huang, Yuan, Liping Wang, Xueying Wang, and Wei An. "Joint Probabilistic Hypergraph Matching Labeled Multi-Bernoulli Filter for Rigid Target Tracking." Applied Sciences 10, no. 1 (2019): 99. http://dx.doi.org/10.3390/app10010099.

Pełny tekst źródła

Streszczenie:

The likelihood determined by the distance between measurements and predicted states of targets is widely used in many filters for data association. However, if the actual motion model of targets is not coincided with the preset dynamic motion model, this criterion will lead to poor performance when close-space targets are tracked. For rigid target tracking task, the structure of rigid targets can be exploited to improve the data association performance. In this paper, the structure of the rigid target is represented as a hypergraph, and the problem of data association is formulated as a hyperg

Style APA, Harvard, Vancouver, ISO itp.

9

Kosian, David A., and Leon A. Petrosyan. "Two-Level Cooperative Game on Hypergraph." Contributions to Game Theory and Management 14 (2021): 227–35. http://dx.doi.org/10.21638/11701/spbu31.2021.17.

Pełny tekst źródła

Streszczenie:

In the paper, the cooperative game with a hypergraph communication structure is considered. For this class of games, a new allocation rule was proposed by splitting the original game into a game between hyperlinks and games within them. The communication possibilities are described by the hypergraph in which the nodes are players and hyperlinks are the communicating subgroups of players. The game between hyperlinks and between players in each hyperlink is described. The payoff of each player is influenced by the actions of other players dependent on the distance between them on hypergraph. Con

Style APA, Harvard, Vancouver, ISO itp.

10

Siriwong, Pinkaew, and Ratinan Boonklurb. "k-Zero-Divisor and Ideal-Based k-Zero-Divisor Hypergraphs of Some Commutative Rings." Symmetry 13, no. 11 (2021): 1980. http://dx.doi.org/10.3390/sym13111980.

Pełny tekst źródła

Streszczenie:

Let R be a commutative ring with nonzero identity and k≥2 be a fixed integer. The k-zero-divisor hypergraph Hk(R) of R consists of the vertex set Z(R,k), the set of all k-zero-divisors of R, and the hyperedges of the form {a1,a2,a3,…,ak}, where a1,a2,a3,…,ak are k distinct elements in Z(R,k), which means (i) a1a2a3⋯ak=0 and (ii) the products of all elements of any (k−1) subsets of {a1,a2,a3,…,ak} are nonzero. This paper provides two commutative rings so that one of them induces a family of complete k-zero-divisor hypergraphs, while another induces a family of k-partite σ-zero-divisor hypergrap

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!