Results 31 to 40 of about 116,308 (181)

Feature representation ‎via‎ graph-regularized ‎entropy-‎weighted nonnegative matrix factorization [PDF]

AUT Journal of Mathematics and Computing
Feature extraction plays a crucial role in dimensionality reduction in machine learning applications. Nonnegative Matrix Factorization (NMF) has emerged as a powerful technique for dimensionality reduction; however, its equal treatment of all features ...
Hazhir Sohrabi, Shahrokh Esmaeili, Parham Moradi   +2 more
doaj   +1 more source

Quadratically-Regularized Optimal Transport on Graphs

, 2018
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to express challenging
Essid, Montacer, Solomon, Justin
core   +1 more source

On regular graphs. II

Journal of Combinatorial Theory, Series B, 1971
AbstractThis paper is a continuation of [1] and we shall use the same terminology. The main result of this part is the following: Suppose that the automorphism group of a connected graph of valency p + 1, p a prime, has a subgroup which acts as a regular permutation group on the set of s-arcs of the graph. Then s ≤ 7 and s ≠ 6.
openaire   +3 more sources

Hamiltonian Strongly Regular Graphs [PDF]

SSRN Electronic Journal, 2008
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.
Brouwer, A.E., Haemers, W.H.
openaire   +5 more sources

A simplifying feature of the heterotic one loop four graviton amplitude

Physics Letters B, 2018
We show that the weight four modular graph functions that contribute to the integrand of the t8t8D4R4 term at one loop in heterotic string theory do not require regularization, and hence the integrand is simple.
Anirban Basu
doaj   +1 more source

Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain

, 2017
Inverse imaging problems are inherently under-determined, and hence it is important to employ appropriate image priors for regularization. One recent popular prior---the graph Laplacian regularizer---assumes that the target pixel patch is smooth with ...
Cheung, Gene, Pang, Jiahao
core   +2 more sources

A Markov Random Field and Adaptive Regularization Embedded Level Set Segmentation Model Solving by Graph Cuts

Journal of Electrical and Computer Engineering, 2019
This paper presents a novel Markov random field (MRF) and adaptive regularization embedded level set model for robust image segmentation and uses graph cuts optimization to numerically solve it.
Dengwei Wang
doaj   +1 more source

Global-Local Consistency Constrained Deep Embedded Clustering for Hyperspectral Band Selection

IEEE Access, 2023
Hyperspectral band selection plays a key role for overcoming the curse of dimensionality in the classification of hyperspectral remote sensing images (HSIs).
Shangfeng Ning, Wenhong Wang
doaj   +1 more source

Light Field Super-Resolution Via Graph-Based Regularization

, 2017
Light field cameras capture the 3D information in a scene with a single exposure. This special feature makes light field cameras very appealing for a variety of applications: from post-capture refocus, to depth estimation and image-based rendering ...
Frossard, Pascal, Rossi, Mattia
core   +1 more source

GrSrNMF: dynamic community detection with graph and symmetry bi-regularized non-negative matrix factorization

Scientific Reports
Community detection in dynamic networks has become an interesting and popular research direction in recent years, widely used in electronic commerce, social media, and other fields.
Wei Yu, Shihong Wu, Shigen Shen, Hongyan Li, Weiyan Yang, Xiaoming Li, Lei Wang   +6 more
doaj   +1 more source