Results 21 to 30 of about 24,126 (306)
Better Inference with Graph Regularization
, 2022 Improved storage, sensing, and automated data collection technology has resulted in a world full of data that are noisy, incomplete, high-dimensional, and of astronomical size.This abundance of data motivates data-driven approaches to signal processing ...
Harlin Lee (4930525)
core +1 more source
Abnormal Electricity Behavior Recognition of Graph Regularization Nonlinear Ridge Regression Model [PDF]
Jisuanji gongcheng, 2018 For the detection of abnormal electricity behavior by users,power companies usually adopt manual inspection methods,however,this method requires a lot of manpower and material resources,and is influened by subjective factors.Therefore,an abnormal ...
ZHANG Xiaofei,GENG Juncheng,SUN Yubao
doaj +1 more source
Formalized Mathematics, 2023 Abstract In this article regular graphs, both directed and undirected, are formalized in the Mizar system [7], [2], based on the formalization of graphs as described in [10]. The handshaking lemma is also proven.
openaire +2 more sources
Independent Distribution Regularization for Private Graph Embedding
, 2023 Learning graph embeddings is a crucial task in graph mining tasks. An effective graph embedding model can learn low-dimensional representations from graph-structured data for data publishing benefiting various downstream applications such as node ...
Song, Yangqiu, Hu, Qi
core +1 more source
Regular Partitions of Regular Graphs [PDF]
Canadian Mathematical Bulletin, 1978 In the study of the combinatorial structure of edge-graphs of convex polytopes one may ask whether a given graph possesses a partition consisting of certain kinds of subgraphs.In this paper we describe some special partitions of 3-valent and 4-valent graphs.
openaire +2 more sources
Ars Mathematica Contemporanea, 2019 20 pages, 6 ...
Primoz Potocnik, Janos Vidali
openaire +5 more sources
The American Mathematical Monthly, 2011 A graph G=(V,E) is called a unit-distance graph in the plane if there is an injective embedding of V in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are non-crossing and all vertices have the same degree r we talk of a regular matchstick graph.
Sascha Kurz, Rom Pinchasi
openaire +2 more sources
Mathematics, 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.
Jie Li, Yaotang Li, Chaoqian Li
doaj +1 more source
Nim-Regularity of Graphs [PDF]
The Electronic Journal of Combinatorics, 1999 Ehrenborg and Steingrímsson defined simplicial Nim, and defined Nim-regular complexes to be simplicial complexes for which simplicial Nim has a particular type of winning strategy. We completely characterize the Nim-regular graphs by the exclusion of two vertex-induced subgraphs, the graph on three vertices with one edge and the graph on five ...
openaire +2 more sources
Remote Sensing, 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.
Lei Pan +5 more
doaj +1 more source