Results 71 to 80 of about 10,205 (230)
Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem
The formal description of weighted hypergraph partitioning problem is presented. We describe the solution of the weighted hypergraph partitioning problem based on the multi-level method.
Leng Ming, Sun Ling-yu, Guo Kai-qiang
doaj +1 more source
On $\alpha$-spectral theory of a directed k-uniform hypergraph [PDF]
In this paper, we study a k-uniform directed hypergraph in general form and introduce its adjacency tensor, Laplacian tensor and signless Laplacian tensor. For the $k$-uniform directed hypergraph $\mathcal{H}$ and $0\leq \alpha
Gholam-Hasan Shirdel +2 more
doaj
A Dynamic Correlation‐Information‐Fusion‐Based Spatiotemporal Network for Traffic Flow Forecasting
ABSTRACT Traffic Flow Forecasting (TFF) is a foundational task in the development of Intelligent Transport Systems (ITSs). The primary challenge is to undertake a comprehensive exploration of the intrinsic dynamic spatiotemporal correlations of the road network, unveiling the long‐term evolutionary traffic trends.
Dawen Xia +6 more
wiley +1 more source
Person Re-identification by Multi-hypergraph Fusion
Matching people across nonoverlapping cameras, also known as person re-identification, is an important and challenging research topic. Despite its great demand in many crucial applications such as surveillance, person re-identification is still far ...
Chen, Xiaojing (xchen010@ucr.edu) +4 more
core +1 more source
ABSTRACT As an attestation engagement, auditing is required to provide reasonable assurance for its conclusions. Traditional auditing has limited capacity to handle unstructured data and is usually based on audit sampling techniques, which can lead to the neglect of important audit evidence during the auditing process and result in a higher audit risk,
Xiaojia Wang, Ziqing Luo, Chaoxu Mu
wiley +1 more source
Abstract An effective method for detecting cyberattacks is essential to the security of smart grids (SGs). In SGs, data from both cyber and physical domains can support attack detection. However, existing works insufficiently consider the heterogeneity, high dimensionality, and cross‐domain correlations of multi‐source data, affecting model ...
Qize Gao +5 more
wiley +1 more source
Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraphs. We show that a characterization by generalized degree sequences is impossible, unlike in the well-known case of split graphs. We also give an algorithm to decide whether a
openaire +2 more sources
Decomposing hypergraphs into k-colorable hypergraphs
For a given hypergraph $H$ with chromatic number $chi(H)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${E_1,E_2,ldots,E_l}$ for $E(H)$, such that the hypergraph induced by $E_i$ for each $1leq ileq l$ is $k$-colorable, is $lceil log_{k} chi(H) rceil$.
Omidi, Gholamreza, Tajbakhsh, Khosro
openaire +2 more sources
CLusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source

