Zaloguj się

Gotowe bibliografie tematyczne / Hypergraph-structure / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Hypergraph-structure.

Artykuły w czasopismach 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:

Sprawdź 50 najlepszych artykułów w czasopismach 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.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

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.

11

Manimaran, P., and K. Duraiswamy. "Identifying Overlying Group of People through Clustering." International Journal of Information Technology and Web Engineering 7, no. 4 (2012): 50–60. http://dx.doi.org/10.4018/jitwe.2012100104.

Pełny tekst źródła

Streszczenie:

Folksonomies like Delicious and LastFm are modeled as multilateral (user-resource-tag) hypergraphs for studying their network properties. Detecting communities of similar nodes from such networks is a challenging problem. Most existing algorithms for community detection in folksonomies assign unique communities to nodes, whereas in reality, users have multiple relevant interests and same resource is often tagged with semantically different tags. Few attempts to perceive overlapping communities work on forecasts of hypergraph, which results in momentous loss of information contained in original

Style APA, Harvard, Vancouver, ISO itp.

12

ARNDT, TIMOTHY, SHI-KUO CHANG, and ANGELA GUERCIO. "FORMAL SPECIFICATION AND PROTOTYPING OF MULTIMEDIA APPLICATIONS." International Journal of Software Engineering and Knowledge Engineering 10, no. 04 (2000): 377–409. http://dx.doi.org/10.1142/s0218194000000250.

Pełny tekst źródła

Streszczenie:

Multimedia systems incorporating hyperlinks and user interaction can be prototyped using TAOML, an extension of HTML. TAOML is used to define a Teleaction Object (TAO) which is a multimedia object with associated hypergraph structure and knowledge structure The hypergraph structure supports the effective presentation and efficient communication of multimedia information. In this paper, a formal specification methodology for TAOs using Symbol Relation (SR) grammars is described. An attributed SR grammar is then introduced in order to associate knowledge with the TAO. The limitations to achieve

Style APA, Harvard, Vancouver, ISO itp.

13

HAXELL, PENNY, and LOTHAR NARINS. "A Stability Theorem for Matchings in Tripartite 3-Graphs." Combinatorics, Probability and Computing 27, no. 5 (2018): 774–93. http://dx.doi.org/10.1017/s0963548318000147.

Pełny tekst źródła

Streszczenie:

It follows from known results that every regular tripartite hypergraph of positive degree, with n vertices in each class, has matching number at least n/2. This bound is best possible, and the extremal configuration is unique. Here we prove a stability version of this statement, establishing that every regular tripartite hypergraph with matching number at most (1 + ϵ)n/2 is close in structure to the extremal configuration, where ‘closeness’ is measured by an explicit function of ϵ.

Style APA, Harvard, Vancouver, ISO itp.

14

Vertigan, Dirk, and Geoff Whittle. "Recognizing Polymatroids Associated with Hypergraphs." Combinatorics, Probability and Computing 2, no. 4 (1993): 519–30. http://dx.doi.org/10.1017/s0963548300000882.

Pełny tekst źródła

Streszczenie:

Two natural classes of polymatroids can be associated with hypergraphs: the so-called Boolean and hypergraphic polymatroids. Boolean polymatroids carry virtually all the structure of hypergraphs; hypergraphic polymatroids generalize graphic matroids. This paper considers algorithmic problems associated with recognizing members of these classes. Let k be a fixed positive integer and assume that the k-polymatroid ρ is presented via a rank oracle. We present an algorithm that determines in polynomial time whether ρ is Boolean, and if it is, finds the hypergraph. We also give an algorithm that dec

Style APA, Harvard, Vancouver, ISO itp.

15

Hodkinson, Ian, and Martin Otto. "Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures." Bulletin of Symbolic Logic 9, no. 3 (2003): 387–405. http://dx.doi.org/10.2178/bsl/1058448678.

Pełny tekst źródła

Streszczenie:

AbstractWe provide a canonical construction of conformal covers for finite hypergraphs and present two immediate applications to the finite model theory of relational structures. In the setting of relational structures, conformal covers serve to construct guarded bisimilar companion structures that avoid all incidental Gaifman cliques—thus serving as a partial analogue in finite model theory for the usually infinite guarded unravellings. In hypergraph theoretic terms, we show that every finite hypergraph admits a bisimilar cover by a finite conformal hypergraph. In terms of relational structur

Style APA, Harvard, Vancouver, ISO itp.

16

Ancona, Massimo, and Leila De Floriani. "A hypergraph-based hierarchial data structure and its applications." Advances in Engineering Software (1978) 11, no. 1 (1989): 2–11. http://dx.doi.org/10.1016/0141-1195(89)90030-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Ali Rasheed Alrowily, Ibtesam. "Hypergraphs: Application in Food networks." JOURNAL OF ADVANCES IN MATHEMATICS 21 (March 13, 2022): 50–57. http://dx.doi.org/10.24297/jam.v21i.9207.

Pełny tekst źródła

Streszczenie:

A hypergraph is a generalization of a graph since, in a graph an edge relates only a pair of points, but the edges of a hypergraph known as hyperedges can relate groups of more than two points. The representation of complex systems as graphs is appropriate for the study of certain problems. We give several examples of social, biological, ecological and technological systems where the use of graphs gives very limited information about the structure of the system. We propose to use hypergraphs to represent these systems.

Style APA, Harvard, Vancouver, ISO itp.

18

Liu, Yang, He Zhao, and Qiao Xin Zhang. "A Multi-Scale Data Fusion-Based Method for Modular Decomposition." Applied Mechanics and Materials 220-223 (November 2012): 2794–98. http://dx.doi.org/10.4028/www.scientific.net/amm.220-223.2794.

Pełny tekst źródła

Streszczenie:

Facing the module division for the product life cycle, this paper presents a hierarchical module decomposition based on the multi-scale data fusion, use the hypergraph and multi-scale theory to divide modules into classification, and realize hierarchical expression of modules. First use the process model of modular design process established by associated hypergraph, which provide the mapping network basis for user needs, then reference the hypergraph on the formal description of the parts information to establish the parts associated matrix, and achieve primary modules division through calcul

Style APA, Harvard, Vancouver, ISO itp.

19

Hu, Yu, and Hongmin Cai. "Hypergraph-Supervised Deep Subspace Clustering." Mathematics 9, no. 24 (2021): 3259. http://dx.doi.org/10.3390/math9243259.

Pełny tekst źródła

Streszczenie:

Auto-encoder (AE)-based deep subspace clustering (DSC) methods aim to partition high-dimensional data into underlying clusters, where each cluster corresponds to a subspace. As a standard module in current AE-based DSC, the self-reconstruction cost plays an essential role in regularizing the feature learning. However, the self-reconstruction adversely affects the discriminative feature learning of AE, thereby hampering the downstream subspace clustering. To address this issue, we propose a hypergraph-supervised reconstruction to replace the self-reconstruction. Specifically, instead of enforci

Style APA, Harvard, Vancouver, ISO itp.

20

Huang, Hong, Meili Chen, and Yule Duan. "Dimensionality Reduction of Hyperspectral Image Using Spatial-Spectral Regularized Sparse Hypergraph Embedding." Remote Sensing 11, no. 9 (2019): 1039. http://dx.doi.org/10.3390/rs11091039.

Pełny tekst źródła

Streszczenie:

Many graph embedding methods are developed for dimensionality reduction (DR) of hyperspectral image (HSI), which only use spectral features to reflect a point-to-point intrinsic relation and ignore complex spatial-spectral structure in HSI. A new DR method termed spatial-spectral regularized sparse hypergraph embedding (SSRHE) is proposed for the HSI classification. SSRHE explores sparse coefficients to adaptively select neighbors for constructing the dual sparse hypergraph. Based on the spatial coherence property of HSI, a local spatial neighborhood scatter is computed to preserve local struc

Style APA, Harvard, Vancouver, ISO itp.

21

Xu, Yunxia, Linzhang Lu, Qilong Liu, and Zhen Chen. "Hypergraph-Regularized Lp Smooth Nonnegative Matrix Factorization for Data Representation." Mathematics 11, no. 13 (2023): 2821. http://dx.doi.org/10.3390/math11132821.

Pełny tekst źródła

Streszczenie:

Nonnegative matrix factorization (NMF) has been shown to be a strong data representation technique, with applications in text mining, pattern recognition, image processing, clustering and other fields. In this paper, we propose a hypergraph-regularized Lp smooth nonnegative matrix factorization (HGSNMF) by incorporating the hypergraph regularization term and the Lp smoothing constraint term into the standard NMF model. The hypergraph regularization term can capture the intrinsic geometry structure of high dimension space data more comprehensively than simple graphs, and the Lp smoothing constr

Style APA, Harvard, Vancouver, ISO itp.

22

Yi, Sudo, and Deok-Sun Lee. "Structure of international trade hypergraphs." Journal of Statistical Mechanics: Theory and Experiment 2022, no. 10 (2022): 103402. http://dx.doi.org/10.1088/1742-5468/ac946f.

Pełny tekst źródła

Streszczenie:

Abstract We study the structure of the international trade hypergraph consisting of triangular hyperedges representing the exporter–importer–product relationship. Measuring the mean hyperdegree of the adjacent vertices, we first find its behaviors different from those in the pairwise networks and explain the origin by tracing the relation between the hyperdegree and the pairwise degree. To interpret the observed hyperdegree correlation properties in the context of trade strategies, we decompose the correlation into two components by identifying one with the background correlation remnant even

Style APA, Harvard, Vancouver, ISO itp.

23

Ma, Jichao, Chunyu Du, Weifeng Liu, and Yanjiang Wang. "Numerical Simulation of Higher-Order Nonlinearity of Human Brain Functional Connectivity Using Hypergraph p-Laplacian." Mathematics 9, no. 18 (2021): 2345. http://dx.doi.org/10.3390/math9182345.

Pełny tekst źródła

Streszczenie:

Unravelling how the human brain structure gives rise to function is a central question in neuroscience and remains partially answered. Recent studies show that the graph Laplacian of the human brain’s structural connectivity (SC) plays a dominant role in shaping the pattern of resting-state functional connectivity (FC). The modeling of FC using the graph Laplacian of the brain’s SC is limited, owing to the sparseness of the Laplacian matrix. It is unable to model the negative functional correlations. We extended the graph Laplacian to the hypergraph p-Laplacian in order to describe better the

Style APA, Harvard, Vancouver, ISO itp.

24

Xu, Haozheng, Yiwen Zhang, Xing Jin, Jingrui Wang, and Zhen Wang. "The Evolution of Cooperation in Multigames with Uniform Random Hypergraphs." Mathematics 11, no. 11 (2023): 2409. http://dx.doi.org/10.3390/math11112409.

Pełny tekst źródła

Streszczenie:

How to explain the emergence of cooperative behavior remains a significant problem. As players may hold diverse perceptions on a particular dilemma, the concept of multigames has been introduced. Therefore, a multigame is studied within various binary networks. Since group structures are common in human society and a person can participate in multiple groups, this paper studies an evolutionary multigame with high-order interaction properties. For this purpose, a uniform random hypergraph is adopted as the network structure, allowing players to interact with all nodes in the same hyperedge. Fir

Style APA, Harvard, Vancouver, ISO itp.

25

Hu, Feng, Kuo Tian, and Zi-Ke Zhang. "Identifying Vital Nodes in Hypergraphs Based on Von Neumann Entropy." Entropy 25, no. 9 (2023): 1263. http://dx.doi.org/10.3390/e25091263.

Pełny tekst źródła

Streszczenie:

Hypergraphs have become an accurate and natural expression of high-order coupling relationships in complex systems. However, applying high-order information from networks to vital node identification tasks still poses significant challenges. This paper proposes a von Neumann entropy-based hypergraph vital node identification method (HVC) that integrates high-order information as well as its optimized version (semi-SAVC). HVC is based on the high-order line graph structure of hypergraphs and measures changes in network complexity using von Neumann entropy. It integrates s-line graph information

Style APA, Harvard, Vancouver, ISO itp.

26

Hu Feng, Zhao Hai-Xing, He Jia-Bei, Li Fa-Xu, Li Shu-Ling, and Zhang Zi-Ke. "An evolving model for hypergraph-structure-based scientific collaboration networks." Acta Physica Sinica 62, no. 19 (2013): 198901. http://dx.doi.org/10.7498/aps.62.198901.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

SUN, Xue-Dong. "Directed Hypergraph Based and Resource Constrained Enterprise Process Structure Optimization." Journal of Software 17, no. 1 (2006): 59. http://dx.doi.org/10.1360/jos170059.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Long, Jane Holsapple, and Sarah Crown Rundell. "The Hodge structure of the coloring complex of a hypergraph." Discrete Mathematics 311, no. 20 (2011): 2164–73. http://dx.doi.org/10.1016/j.disc.2011.06.034.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

KOPONEN, VERA. "BINARY PRIMITIVE HOMOGENEOUS SIMPLE STRUCTURES." Journal of Symbolic Logic 82, no. 1 (2017): 183–207. http://dx.doi.org/10.1017/jsl.2016.51.

Pełny tekst źródła

Streszczenie:

AbstractSuppose that ${\cal M}$ is countable, binary, primitive, homogeneous, and simple. We prove that the SU-rank of the complete theory of ${\cal M}$ is 1 and hence 1-based. It follows that ${\cal M}$ is a random structure. The conclusion that ${\cal M}$ is a random structure does not hold if the binarity condition is removed, as witnessed by the generic tetrahedron-free 3-hypergraph. However, to show that the generic tetrahedron-free 3-hypergraph is 1-based requires some work (it is known that it has the other properties) since this notion is defined in terms of imaginary elements. This is

Style APA, Harvard, Vancouver, ISO itp.

30

Devezas, José, and Sérgio Nunes. "Hypergraph-of-entity." Open Computer Science 9, no. 1 (2019): 103–27. http://dx.doi.org/10.1515/comp-2019-0006.

Pełny tekst źródła

Streszczenie:

AbstractModern search is heavily powered by knowledge bases, but users still query using keywords or natural language. As search becomes increasingly dependent on the integration of text and knowledge, novel approaches for a unified representation of combined data present the opportunity to unlock new ranking strategies. We have previously proposed the graph-of-entity as a purely graph-based representation and retrieval model, however this model would scale poorly. We tackle the scalability issue by adapting the model so that it can be represented as a hypergraph. This enables a significant re

Style APA, Harvard, Vancouver, ISO itp.

31

Lu, Zhiwu, and Yuxin Peng. "Latent Semantic Learning by Efficient Sparse Coding with Hypergraph Regularization." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (2011): 411–16. http://dx.doi.org/10.1609/aaai.v25i1.7896.

Pełny tekst źródła

Streszczenie:

This paper presents a novel latent semantic learning algorithm for action recognition. Through efficient sparse coding, we can learn latent semantics (i.e. high-level features) from a large vocabulary of abundant mid-level features (i.e. visual keywords). More importantly, we can capture the manifold structure hidden among mid-level features by incorporating hypergraph regularization into sparse coding. The learnt latent semantics can further be readily used for action recognition by defining a histogram intersection kernel. Different from the traditional latent semantic analysis based on topi

Style APA, Harvard, Vancouver, ISO itp.

32

Aguiar, Manuela, Christian Bick, and Ana Dias. "Network dynamics with higher-order interactions: coupled cell hypernetworks for identical cells and synchrony." Nonlinearity 36, no. 9 (2023): 4641–73. http://dx.doi.org/10.1088/1361-6544/ace39f.

Pełny tekst źródła

Streszczenie:

Abstract Network interactions that are nonlinear in the state of more than two nodes—also known as higher-order interactions—can have a profound impact on the collective network dynamics. Here we develop a coupled cell hypernetwork formalism to elucidate the existence and stability of (cluster) synchronization patterns in network dynamical systems with higher-order interactions. More specifically, we define robust synchrony subspace for coupled cell hypernetworks whose coupling structure is determined by an underlying hypergraph and describe those spaces for general such hypernetworks. Since a

Style APA, Harvard, Vancouver, ISO itp.

33

Xi, Zhengtao, Tongqiang Liu, Haifeng Shi, and Zhuqing Jiao. "Hypergraph representation of multimodal brain networks for patients with end-stage renal disease associated with mild cognitive impairment." Mathematical Biosciences and Engineering 20, no. 2 (2023): 1882–902. http://dx.doi.org/10.3934/mbe.2023086.

Pełny tekst źródła

Streszczenie:

<abstract><p>The structure and function of brain networks (BN) may be altered in patients with end-stage renal disease (ESRD). However, there are relatively few attentions on ESRD associated with mild cognitive impairment (ESRDaMCI). Most studies focus on the pairwise relationships between brain regions, without taking into account the complementary information of functional connectivity (FC) and structural connectivity (SC). To address the problem, a hypergraph representation method is proposed to construct a multimodal BN for ESRDaMCI. First, the activity of nodes is determined b

Style APA, Harvard, Vancouver, ISO itp.

34

Mythili, R., Revathi Venkataraman, and T. Sai Raj. "An attribute-based lightweight cloud data access control using hypergraph structure." Journal of Supercomputing 76, no. 8 (2020): 6040–64. http://dx.doi.org/10.1007/s11227-019-03119-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Klonowski, Wlodzimierz. "Probabilistic-topological theory of systems with discrete interactions: II. Calculation of the hypergraph probabilistic representation; the difference a posteriori algorithm." Canadian Journal of Physics 66, no. 12 (1988): 1061–68. http://dx.doi.org/10.1139/p88-170.

Pełny tekst źródła

Streszczenie:

The scheme of calculations, which subsequently will be called the difference a posteriori algorithm (or just DAPOST), is formulated in a general and rigorous manner to make its application to different systems with discrete interactions (SDI) possible. The DAPOST enables one to calculate important probabilistic characteristics of SDI while having only general information about its composition and interactions between system elements. The DAPOST is easily adaptable to very different physicochemical and biophysical systems, especially to the problems of element aggregation and binding. When appl

Style APA, Harvard, Vancouver, ISO itp.

36

Ibrahim, Rania, and David F. Gleich. "Local hypergraph clustering using capacity releasing diffusion." PLOS ONE 15, no. 12 (2020): e0243485. http://dx.doi.org/10.1371/journal.pone.0243485.

Pełny tekst źródła

Streszczenie:

Local graph clustering is an important machine learning task that aims to find a well-connected cluster near a set of seed nodes. Recent results have revealed that incorporating higher order information significantly enhances the results of graph clustering techniques. The majority of existing research in this area focuses on spectral graph theory-based techniques. However, an alternative perspective on local graph clustering arises from using max-flow and min-cut on the objectives, which offer distinctly different guarantees. For instance, a new method called capacity releasing diffusion (CRD

Style APA, Harvard, Vancouver, ISO itp.

37

Liu, Yang, He Zhao, and Qiao Xin Zhang. "The Multi-Scale Modeling Technique for Modular Variant Design." Advanced Materials Research 538-541 (June 2012): 3110–14. http://dx.doi.org/10.4028/www.scientific.net/amr.538-541.3110.

Pełny tekst źródła

Streszczenie:

Facing the modularization of existing product variant design requirements, this paper presents a multi-scale modeling technology. Discuss the process of the change scope of the parts and modules according to the needs of the user, so divide the modular product model into process model, modules model and parts model. Use associated hypergraph describe the constraint relation between different stages of modular design process, the process model provides network basis for user needs mapping. Use the structured hypergraph to conduct formal description of parts and modules information and establish

Style APA, Harvard, Vancouver, ISO itp.

38

Sun, Ling, Yuan Rao, Xiangbo Zhang, Yuqian Lan, and Shuanghe Yu. "MS-HGAT: Memory-Enhanced Sequential Hypergraph Attention Network for Information Diffusion Prediction." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 4 (2022): 4156–64. http://dx.doi.org/10.1609/aaai.v36i4.20334.

Pełny tekst źródła

Streszczenie:

Predicting the diffusion cascades is a critical task to understand information spread on social networks. Previous methods usually focus on the order or structure of the infected users in a single cascade, thus ignoring the global dependencies of users and cascades, limiting the performance of prediction. Current strategies to introduce social networks only learn the social homogeneity among users, which is not enough to describe their interaction preferences, let alone the dynamic changes. To address the above issues, we propose a novel information diffusion prediction model named Memory-enha

Style APA, Harvard, Vancouver, ISO itp.

39

Xiao, Guanchen, Jinzhi Liao, Zhen Tan, Yiqi Yu, and Bin Ge. "Hyperbolic Directed Hypergraph-Based Reasoning for Multi-Hop KBQA." Mathematics 10, no. 20 (2022): 3905. http://dx.doi.org/10.3390/math10203905.

Pełny tekst źródła

Streszczenie:

The target of the multi-hop knowledge base question-answering task is to find answers of some factoid questions by reasoning across multiple knowledge triples in the knowledge base. Most of the existing methods for multi-hop knowledge base question answering based on a general knowledge graph ignore the semantic relationship between each hop. However, modeling the knowledge base as a directed hypergraph has the problems of sparse incidence matrices and asymmetric Laplacian matrices. To make up for the deficiency, we propose a directed hypergraph convolutional network modeled on hyperbolic spac

Style APA, Harvard, Vancouver, ISO itp.

40

Fan, Youping, Jingjiao Li, Dai Zhang, Jie Pi, Jiahan Song, and Guo Zhao. "Supporting Sustainable Maintenance of Substations under Cyber-Threats: An Evaluation Method of Cybersecurity Risk for Power CPS." Sustainability 11, no. 4 (2019): 982. http://dx.doi.org/10.3390/su11040982.

Pełny tekst źródła

Streszczenie:

In the increasingly complex cyber-environment, appropriate sustainable maintenance of substation auto systems (SASs) can lead to many positive effects on power cyber-physical systems (CPSs). Evaluating the cybersecurity risk of power CPSs is the first step in creating sustainable maintenance plans for SASs. In this paper, a mathematical framework for evaluating the cybersecurity risk of a power CPS is proposed considering both the probability of successful cyberattacks on SASs and their consequences for the power system. First, the cyberattacks and their countermeasures are introduced, and the

Style APA, Harvard, Vancouver, ISO itp.

41

Li, Yiran, Renchi Yang, and Jieming Shi. "Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation." Proceedings of the ACM on Management of Data 1, no. 2 (2023): 1–23. http://dx.doi.org/10.1145/3589261.

Pełny tekst źródła

Streszczenie:

Hypergraphs are an omnipresent data structure used to represent high-order interactions among entities. Given a hypergraph H wherein nodes are associated with attributes, attributed hypergraph clustering (AHC) aims to partition the nodes in H into k disjoint clusters, such that intra-cluster nodes are closely connected and share similar attributes, while inter-cluster nodes are far apart and dissimilar. It is highly challenging to capture multi-hop connections via nodes or attributes on large attributed hypergraphs for accurate clustering. Existing AHC solutions suffer from issues of prohibiti

Style APA, Harvard, Vancouver, ISO itp.

42

Yang, Kai, Yong Long Jin, and Zhi Jun He. "A Briefest Feature Subset Selection Algorithm Based on Preference Attribute." Advanced Materials Research 774-776 (September 2013): 1816–22. http://dx.doi.org/10.4028/www.scientific.net/amr.774-776.1816.

Pełny tekst źródła

Streszczenie:

Concept lattice is the core data structure of formal concept analysis and represents the order relationship between the concepts iconically. Feature selection has been the focus of research in machine learning.And feature selection has been shown very effective in removing irrelevant and redundant features,also increasing efficiency in learning process and obtaining more intelligible learned results.This paper proposes a new briefest feature subset selection algorithm based on preference attribute on the basis of study of concept lattice theory. User can put forward a preference attribute acco

Style APA, Harvard, Vancouver, ISO itp.

43

Luqman, Anam, Muhammad Akram, and Ali N. A. Koam. "Granulation of Hypernetwork Models under the q-Rung Picture Fuzzy Environment." Mathematics 7, no. 6 (2019): 496. http://dx.doi.org/10.3390/math7060496.

Pełny tekst źródła

Streszczenie:

In this paper, we define q-rung picture fuzzy hypergraphs and illustrate the formation of granular structures using q-rung picture fuzzy hypergraphs and level hypergraphs. Further, we define the q-rung picture fuzzy equivalence relation and q-rung picture fuzzy hierarchical quotient space structures. In particular, a q-rung picture fuzzy hypergraph and hypergraph combine a set of granules, and a hierarchical structure is formed corresponding to the series of hypergraphs. The mappings between the q-rung picture fuzzy hypergraphs depict the relationships among granules occurring at different lev

Style APA, Harvard, Vancouver, ISO itp.

44

Robert Jäschke, Robert, Beate Krause, Andreas Hotho, and Gerd Stumme. "Logsonomy — A Search Engine Folksonomy." Proceedings of the International AAAI Conference on Web and Social Media 2, no. 1 (2021): 192–93. http://dx.doi.org/10.1609/icwsm.v2i1.18646.

Pełny tekst źródła

Streszczenie:

In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Search engines filter the vast information of the web. Queries describe a user's information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance.

Style APA, Harvard, Vancouver, ISO itp.

45

GANEA, E., D. D. BURDESCU, and M. BREZOVAN. "New Method to Detect Salient Objects in Image Segmentation using Hypergraph Structure." Advances in Electrical and Computer Engineering 11, no. 4 (2011): 111–16. http://dx.doi.org/10.4316/aece.2011.04018.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Zheng, Xiaoyao, Yonglong Luo, Liping Sun, Xintao Ding, and Ji Zhang. "A novel social network hybrid recommender system based on hypergraph topologic structure." World Wide Web 21, no. 4 (2017): 985–1013. http://dx.doi.org/10.1007/s11280-017-0494-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Golubski, Antonio J., Erik E. Westlund, John Vandermeer, and Mercedes Pascual. "Ecological Networks over the Edge: Hypergraph Trait-Mediated Indirect Interaction (TMII) Structure." Trends in Ecology & Evolution 31, no. 5 (2016): 344–54. http://dx.doi.org/10.1016/j.tree.2016.02.006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Qiu, Chunhua, Shaoyun Ge, Ting Yang, Jun Wei, and Guoxing Xiang. "Research on Power Generation Energy Sources Structure Adjustment Algorithm Based on HyperGraph." American Journal of Energy Engineering 7, no. 2 (2019): 49. http://dx.doi.org/10.11648/j.ajee.20190702.12.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Konstantinova, E. V., and V. A. Skoroboratov. "Graph and hypergraph models of molecular structure: A comparative analysis of indices." Journal of Structural Chemistry 39, no. 6 (1998): 958–66. http://dx.doi.org/10.1007/bf02903615.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Vasilyeva, Ekaterina, Miguel Romance, Ivan Samoylenko, et al. "Distances in Higher-Order Networks and the Metric Structure of Hypergraphs." Entropy 25, no. 6 (2023): 923. http://dx.doi.org/10.3390/e25060923.

Pełny tekst źródła

Streszczenie:

We explore the metric structure of networks with higher-order interactions and introduce a novel definition of distance for hypergraphs that extends the classic methods reported in the literature. The new metric incorporates two critical factors: (1) the inter-node distance within each hyperedge, and (2) the distance between hyperedges in the network. As such, it involves the computation of distances in a weighted line graph of the hypergraph. The approach is illustrated with several ad hoc synthetic hypergraphs, where the structural information unveiled by the novel metric is highlighted. Mor

Style APA, Harvard, Vancouver, ISO itp.

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!