Skip to Content
You are currently on the new version of our website. Access the old version .

667 Results Found

  • Article
  • Open Access
1 Citations
2,812 Views
19 Pages

28 May 2020

Dimensionality reduction (DR) methods based on graph embedding are widely used for feature extraction. For these methods, the weighted graph plays a vital role in the process of DR because it can characterize the data’s structure information. M...

  • Article
  • Open Access
1 Citations
375 Views
18 Pages

2 August 2026

This study forecasts attrition or job-change risk for individual employee records; department- and city-level quantities are secondary aggregates of those predictions. We propose Graph-Regularized Survival Learning with Optimal Transport (GRSOT), whi...

(This article belongs to the Special Issue Advances in Statistical Analysis for Health, Finance, Industry and Digital Economy, 2nd Edition)
  • Article
  • Open Access
800 Views
19 Pages

28 February 2026

To address the nonlinear dynamics and strong multivariate coupling inherent in complex industrial data, while overcoming the high computational costs and deployment challenges of deep learning, this paper proposes a Channel-Independent Anchor Graph-R...

(This article belongs to the Section Signal and Data Analysis)
  • Article
  • Open Access
437 Views
26 Pages

Unsupervised learning often relies on non-negative matrix factorization (NMF) for extracting low-dimensional features. Standard deep NMF models, however, tend to miss complex hierarchical patterns and may warp the intrinsic geometry of high-dimension...

  • Article
  • Open Access
437 Views
21 Pages

Missing labels are common in multi-label learning and can bias both label-correlation estimation and classifier induction. Existing missing-label methods often recover incomplete supervision mainly through global label correlations. However, correlat...

  • Article
  • Open Access
1 Citations
772 Views
32 Pages

31 March 2026

High-speed railway catenary maintenance increasingly requires knowledge bases that can connect maintenance records with geometric infrastructure models for reliable digital twin-enabled decision support. However, existing knowledge graph construction...

(This article belongs to the Section Fault Diagnosis & Sensors)
  • Article
  • Open Access
1,863 Views
20 Pages

22 December 2025

Single-cell RNA sequencing (scRNA-seq) provides a high-resolution view of cellular heterogeneity, yet accurate cell-type annotation remains challenging due to data sparsity, technical noise, and variability across tissues, platforms, and species. Man...

(This article belongs to the Special Issue Machine Learning and Bioinformatics in Human Health and Disease: 2nd Edition)
  • Article
  • Open Access
29 Citations
4,675 Views
14 Pages

Co-differential Gene Selection and Clustering Based on Graph Regularized Multi-View NMF in Cancer Genomic Data

  • Na Yu,
  • Ying-Lian Gao,
  • Jin-Xing Liu,
  • Junliang Shang and ,
  • Rong Zhu and
  • Ling-Yun Dai
  • + 1 author+ 0 author

28 November 2018

Cancer genomic data contain views from different sources that provide complementary information about genetic activity. This provides a new way for cancer research. Feature selection and multi-view clustering are hot topics in bioinformatics, and the...

(This article belongs to the Special Issue Selected Papers from the Third CFF Bioinformatics Conference (CBC2018))
  • Article
  • Open Access
3 Citations
2,689 Views
14 Pages

17 April 2023

Non-negative matrix factorization (NMF) is widely used as a powerful matrix factorization tool in data representation. However, the traditional NMF, measured by Euclidean distance or Kullback–Leibler distance, does not take into account the int...

  • Article
  • Open Access
5 Citations
3,380 Views
23 Pages

21 May 2021

The spectral mismatch between a multispectral (MS) image and its corresponding panchromatic (PAN) image affects the pansharpening quality, especially for WorldView-2 data. To handle this problem, a pansharpening method based on graph regularized spar...

(This article belongs to the Section Remote Sensors)
  • Feature Paper
  • Article
  • Open Access
1 Citations
5,167 Views
21 Pages

14 March 2025

This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós in 1966. The proof relies on a closed-form expression for the Lovász ϑ-function of stron...

(This article belongs to the Special Issue Advances in Combinatorics, Discrete Mathematics and Graph Theory)
  • Article
  • Open Access
6 Citations
7,954 Views
12 Pages

Antimagic Labeling for Product of Regular Graphs

  • Vinothkumar Latchoumanane and
  • Murugan Varadhan

14 June 2022

An antimagic labeling of a graph G=(V,E) is a bijection from the set of edges of G to 1,2,⋯,E(G) and such that any two vertices of G have distinct vertex sums where the vertex sum of a vertex v in V(G) is nothing but the sum of all the incident...

(This article belongs to the Special Issue Graph Labelings and Their Applications)
  • Article
  • Open Access
3,249 Views
19 Pages

Regularity Index of Uncertain Random Graph

  • Lin Chen,
  • Li Zeng,
  • Jin Peng,
  • Junren Ming and
  • Xianghui Zhu

3 January 2023

A graph containing some edges with probability measures and other edges with uncertain measures is referred to as an uncertain random graph. Numerous real-world problems in social networks and transportation networks can be boiled down to optimizatio...

  • Article
  • Open Access
2,212 Views
11 Pages

30 October 2023

In this paper, in the environment of Euclidean Jordan algebras, we establish some inequalities over the Krein parameters of a symmetric association scheme and of a strongly regular graph. Next, we define the modified Krein parameters of a strongly re...

(This article belongs to the Special Issue Simulation and Modelling in Natural Sciences, Biomedicine and Engineering III)
  • Article
  • Open Access
252 Views
22 Pages

Physics-Regularized Graph Temporal Frequency Prediction with Conformal Auditing and Bounded Storage Support in Low-Inertia Transmission Systems

  • Runtao Zhang,
  • Jiaxin Li,
  • Lei Wang,
  • Haoyu Liu and ,
  • Yueran Liu,
  • Peng Liao and
  • Yang Wang
  • + 2 authors+ 0 author

24 September 2026

Early assessment of frequency security in low-inertia transmission systems requires nodal forecasts that account for post-contingency topology, electromechanical consistency, and predictive uncertainty. This study develops a dynamic-topology graph re...

(This article belongs to the Special Issue Networked Microgrids and Distributed Energy Systems: Intelligent Control, Optimization and Resilient Operation)
  • Feature Paper
  • Article
  • Open Access
8 Citations
4,818 Views
13 Pages

The Regularity of Some Families of Circulant Graphs

  • Miguel Eduardo Uribe-Paczka and
  • Adam Van Tuyl

22 July 2019

We compute the Castelnuovo–Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs. A feature of our approach is to combine bounds on the regularity, the projective dimension, and the...

(This article belongs to the Special Issue Current Trends on Monomial and Binomial Ideals)
  • Article
  • Open Access
1,700 Views
16 Pages

31 January 2025

For an undirected graph G, a zero-sum flow is an assignment of nonzero integer weights to the edges such that each vertex has a zero-sum, namely the sum of all incident edge weights with each vertex is zero. This concept is an undirected analog of no...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
881 Views
16 Pages

A Logical Characterization for Approximate Matching of Pattern Graphs with Regular Expressions

  • Xinfei Liao,
  • Zuoli Zhang,
  • Xinyu Cui,
  • Jin Wang and ,
  • Yu Zhang and
  • Xuelei Chen
  • + 1 author+ 0 author

5 October 2025

A graph simulation and its variants are widely used in graph pattern matching. Among them, there have been related works involving the addition of regular expressions to graph patterns, which can discover more meaningful data and solve problems in po...

(This article belongs to the Special Issue Applications Based on Symmetry in Applied Cryptography)
  • Article
  • Open Access
2 Citations
2,575 Views
13 Pages

Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs

  • Wahyuni Abidin,
  • Anm Salman and
  • Suhadi Wido Saputro

17 March 2022

Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)). The set W is called a resolving set...

  • Article
  • Open Access
3 Citations
1,499 Views
14 Pages

16 September 2025

With the growth of e-commerce platforms, the number of fraud reviews has rapidly increased, making fraud detection for platform data critically important. To detect fraud reviews in platform data, recent approaches have leveraged graph neural network...

(This article belongs to the Special Issue Future Trends and Challenges of Ubiquitous Computing and Smart Systems, 2nd Edition)
  • Article
  • Open Access
599 Views
18 Pages

25 April 2026

A Cayley graph Σ=Cay(G,S) is called 1-regular core-free if G is core-free in some Y⩽AutΣ and AutΣ acts regularly on the set of 1-arcs of Σ. In this paper, we classify the 14-valent 1-regular core-free Cayley graphs. In...

(This article belongs to the Special Issue New Perspectives of Graph Theory and Combinatorics)
  • Article
  • Open Access
28 Citations
4,449 Views
37 Pages

4 April 2019

Picture fuzzy model is a generalized structure of intuitionistic fuzzy model in the sense that it not only assigns the membership and nonmembership values in the form of orthopair ( μ , ν ) to an element, but it assigns a triplet ( ...

(This article belongs to the Special Issue Symmetry in Classical and Fuzzy Algebraic Hypercompositional Structures)
  • Feature Paper
  • Article
  • Open Access
1,588 Views
12 Pages

12 December 2025

Let G=(V,E) be a finite simple graph with p=|V| vertices and q=|E| edges, without isolated vertices or isolated edges. A vertex magic total labeling is a bijection f from V∪E to the consecutive integers 1,2,…,p+q, with the property that, f...

(This article belongs to the Special Issue Graph Theory and Applications, 3rd Edition)
  • Article
  • Open Access
638 Views
17 Pages

Colored Degree Factors in Regular and Triangle-Inflated Cubic Graphs

  • Li-Hui Wang,
  • Chen-Wei Liang,
  • Mu-Jiang-Shan Wang and
  • Qiu-Ju Bian

27 May 2026

We study two-tone factors in edge-connected regular graphs and claw-free cubic graphs under red-blue vertex colorings. A two-tone factor is a spanning subgraph in which vertices of different colors are assigned different allowed degree sets. For edge...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
3,993 Views
24 Pages

Consensus-based data aggregation in d-regular bipartite graphs poses a challenging task for the scientific community since some of these algorithms diverge in this critical graph topology. Nevertheless, one can see a lack of scientific studies dealin...

(This article belongs to the Section Smart System Infrastructure and Applications)
  • Article
  • Open Access
1 Citations
5,080 Views
18 Pages

17 February 2020

We study the emergence of cooperation in structured populations with any arrangement of cooperators and defectors on the evolutionary graph. In a computational approach using structure coefficients defined for configurations describing such arrangeme...

  • Article
  • Open Access
2 Citations
1,879 Views
10 Pages

27 October 2023

In this paper, motivated by a biodegradable stent problem, we consider a parabolic differential equation on graphs. This kind of equation describes the stent material degradation in time. Since stents are mesh-like structures with thin struts, they c...

  • Article
  • Open Access
3 Citations
4,421 Views
11 Pages

11 June 2018

One of the main problems in the theory of strongly regular graphs (SRGs) is constructing and classifying SRGs with given parameters. Strongly regular graphs with parameters (37,18,8,9), (41,20,9,10), (45,22,10,11), (49,24,11,12), (49,18,7,6) and (50,...

(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
  • Article
  • Open Access
559 Views
24 Pages

19 May 2026

One of the main tasks in the field of directional statistics is to build goodness-of-fit tests for uniformity on circles, spheres or more abstract manifolds. We discuss a goodness-of-fit test for uniformity on a distance-regular graph. Our main tool...

  • Feature Paper
  • Article
  • Open Access
2 Citations
3,367 Views
18 Pages

19 September 2019

Let G be a finite simple graph on n vertices. Let J G ⊂ K [ x 1 , … , x n ] be the cover ideal of G. In this article, we obtain syzygies, Betti numbers, and Castelnuovo–Mumford regularity of J G s for all ...

(This article belongs to the Special Issue Current Trends on Monomial and Binomial Ideals)
  • Article
  • Open Access
24 Citations
4,338 Views
31 Pages

25 November 2021

In recent decades, distributed consensus-based algorithms for data aggregation have been gaining in importance in wireless sensor networks since their implementation as a complementary mechanism can ensure sensor-measured values with high reliability...

(This article belongs to the Special Issue Industrial Big Data and Process Modelling for Smart Manufacturing)
  • Article
  • Open Access
3 Citations
2,797 Views
8 Pages

13 February 2020

In this paper, completely regular endomorphisms of unicyclic graphs are explored. Let G be a unicyclic graph and let c E n d ( G ) be the set of all completely regular endomorphisms of G. The necessary and sufficient conditions under which ...

(This article belongs to the Special Issue Algebra and Discrete Mathematics 2020)
  • Article
  • Open Access
2 Citations
2,537 Views
14 Pages

Fuzzy Graph Learning Regularized Sparse Filtering for Visual Domain Adaptation

  • Lingtong Min,
  • Deyun Zhou,
  • Xiaoyang Li,
  • Qinyi Lv and
  • Yuanjie Zhi

14 May 2021

Distribution mismatch can be easily found in multi-sensor systems, which may be caused by different shoot angles, weather conditions and so on. Domain adaptation aims to build robust classifiers using the knowledge from a well-labeled source domain,...

(This article belongs to the Section Computing and Artificial Intelligence)
  • Article
  • Open Access
82 Views
15 Pages

11 November 2026

For a graph G, let V(G) and E(G) denote its vertex and edge sets, and put n=|V(G)| and m=|E(G)|. For a supereulerian graph G, let ℓ(G) be the maximum number of edges in a spanning Eulerian subgraph of G. Haghparast and Kiani proved that each si...

(This article belongs to the Special Issue Advances in Graph Theory and Its Application)
  • Article
  • Open Access
3,617 Views
13 Pages

20 August 2019

In this article, we discuss new characterizations of Cohen-Macaulay bipartite edge ideals. For arbitrary bipartite edge ideals I ( G ) , we also discuss methods to recognize regular elements on I ( G ) s for all s ≥ 1 in...

(This article belongs to the Special Issue Current Trends on Monomial and Binomial Ideals)
  • Article
  • Open Access
37 Citations
4,872 Views
19 Pages

Double Reweighted Sparse Regression and Graph Regularization for Hyperspectral Unmixing

  • Si Wang,
  • Ting-Zhu Huang,
  • Xi-Le Zhao,
  • Gang Liu and
  • Yougan Cheng

3 July 2018

Hyperspectral unmixing, aiming to estimate the fractional abundances of pure spectral signatures in each mixed pixel, has attracted considerable attention in analyzing hyperspectral images. Plenty of sparse unmixing methods have been proposed in the...

  • Article
  • Open Access
14 Citations
3,963 Views
27 Pages

Hyperspectral Image Super-Resolution Algorithm Based on Graph Regular Tensor Ring Decomposition

  • Shasha Sun,
  • Wenxing Bao,
  • Kewen Qu,
  • Wei Feng and ,
  • Xiaowu Zhang and
  • Xuan Ma
  • + 1 author+ 0 author

16 October 2023

This paper introduces a novel hyperspectral image super-resolution algorithm based on graph-regularized tensor ring decomposition aimed at resolving the challenges of hyperspectral image super-resolution. This algorithm seamlessly integrates graph re...

  • Article
  • Open Access
660 Views
37 Pages

Linear-Time Correlation-Controlled Shuffling on Random Regular Graphs with Spectral Guarantees

  • Vagif Gasimov,
  • Nargiz Mammadzada,
  • Esmira Mustafayeva,
  • Jabir Mammadov and
  • Kamala Alieva

27 August 2026

This article proposes a linear-time correlation-controlled shuffling method that attenuates Pearson correlation by permuting one variable through local swaps on a random regular graph. Each round processes a fixed edge order and accepts only vertex-d...

(This article belongs to the Special Issue AI and Machine Learning in the Big Data Era: Advanced Algorithms and Real-World Applications)
  • Article
  • Open Access
3 Citations
2,375 Views
12 Pages

24 October 2019

We construct several new families of directed strongly regular Cayley graphs (DSRCGs) over the metacyclic group M 4 n = ⟨ a , b | a n = b 4 = 1 , b − 1 a b = a − 1 ⟩ , some of which generalize those ea...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
2 Citations
4,196 Views
16 Pages

A Graph Laplacian Regularizer from Deep Features for Depth Map Super-Resolution

  • George Gartzonikas,
  • Evaggelia Tsiligianni,
  • Nikos Deligiannis and
  • Lisimachos P. Kondi

17 June 2025

Current depth map sensing technologies capture depth maps at low spatial resolution, rendering serious problems in various applications. In this paper, we propose a single depth map super-resolution method that combines the advantages of model-based...

(This article belongs to the Special Issue Advances in Computer Graphics and Visual Computing)
  • Article
  • Open Access
7 Citations
2,702 Views
14 Pages

3 April 2023

Graph regularized non-negative matrix factorization (GNMF) is widely used in feature extraction. In the process of dimensionality reduction, GNMF can retain the internal manifold structure of data by adding a regularizer to non-negative matrix factor...

(This article belongs to the Special Issue Representation Learning for Computer Vision and Pattern Recognition)
  • Article
  • Open Access
9 Citations
3,846 Views
25 Pages

21 May 2024

In a hyperspectral image, there is a close correlation between spectra and a certain degree of correlation in the pixel space. However, most existing low-rank representation (LRR) methods struggle to utilize these two characteristics simultaneously t...

(This article belongs to the Special Issue Feature Extraction and Data Classification in Hyperspectral Imaging II)
  • Article
  • Open Access
608 Views
30 Pages

Weighted Strong Product Graph Laplacian Regularization for Hyperspectral Image Mixed-Noise Removal with Superpixel Segmentation

  • Xiuping Li,
  • Xiyan Sun,
  • Jingjing Li,
  • Yuanfa Ji and ,
  • Wentao Fu,
  • Mou Ma,
  • Wenbin Liang,
  • Xizi Jia and
  • Jian Liu
  • + 4 authors+ 0 author

15 September 2026

Hyperspectral images (HSIs) are inevitably degraded by mixed noise, which hampers downstream interpretation. Recent graph-signal-processing denoisers encode the spatial–spectral structure of an HSI through a product graph over superpixel bodies...

  • Article
  • Open Access
3 Citations
2,654 Views
18 Pages

Latent Low-Rank Projection Learning with Graph Regularization for Feature Extraction of Hyperspectral Images

  • Lei Pan,
  • Hengchao Li,
  • Xiang Dai,
  • Ying Cui and ,
  • Xifeng Huang and
  • Lican Dai
  • + 1 author+ 0 author

27 June 2022

Due to the great benefit of rich spectral information, hyperspectral images (HSIs) have been successfully applied in many fields. However, some problems of concern also limit their further applications, such as high dimension and expensive labeling....

(This article belongs to the Section Remote Sensing Image Processing)
  • Article
  • Open Access
7 Citations
2,354 Views
21 Pages

27 December 2023

NONNEGATIVE matrix factorization (NMF) is an effective technique for dimensionality reduction of high-dimensional data for tasks such as machine learning and data visualization. However, for practical clustering tasks, traditional NMF ignores the man...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
23 Citations
4,470 Views
24 Pages

20 September 2019

Spectral unmixing of hyperspectral images is an important issue in the fields of remote sensing. Jointly exploring the spectral and spatial information embedded in the data is helpful to enhance the consistency between mixing/unmixing models and real...

(This article belongs to the Section Remote Sensing Image Processing)
  • Article
  • Open Access
3 Citations
3,552 Views
20 Pages

15 April 2022

Graph representation learning is a significant challenge in graph signal processing (GSP). The flourishing development of graph neural networks (GNNs) provides effective representations for GSP. To effectively learn from graph signals, we propose a r...

  • Article
  • Open Access
6 Citations
2,442 Views
21 Pages

18 January 2024

In the competitive landscape of online learning, developing robust and effective learning resource recommendation systems is paramount, yet the field faces challenges due to high-dimensional, sparse matrices and intricate user–resource interact...

(This article belongs to the Special Issue Artificial Intelligence and Data Science)
  • Article
  • Open Access
35 Citations
3,747 Views
24 Pages

18 June 2020

Small target detection is a critical step in remotely infrared searching and guiding applications. However, previously proposed algorithms would exhibit performance deterioration in the presence of complex background. It is attributed to two main rea...

(This article belongs to the Section Remote Sensing Image Processing)

of 14