Results 21 to 30 of about 116,308 (181)
Graph Regularization Methods in Soft Detector Fusion
IEEE Access, 2023 This paper presents a theoretical derivation of two new graph-based regularization methods for fusing the individual results of multiple detectors (two-class classifiers).
Addisson Salazar +3 more
doaj +1 more source
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.
Kurz, Sascha, Pinchasi, Rom
openaire +2 more sources
Impact of regularization on Spectral Clustering [PDF]
, 2014 The performance of spectral clustering can be considerably improved via regularization, as demonstrated empirically in Amini et. al (2012). Here, we provide an attempt at quantifying this improvement through theoretical analysis.
Joseph, Antony, Yu, Bin
core +1 more source
Two distance-regular graphs [PDF]
Journal of Algebraic Combinatorics, 2011 We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B_3(q) induced on the vertices far from a fixed point, and the subgraph of the dual polar graph of type D_4(q) induced on the vertices far from a fixed edge. The latter is the extended bipartite double of the former.
Brouwer, Andries E. +1 more
openaire +5 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
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
JONNEE: Joint Network Nodes and Edges Embedding
IEEE Access, 2021 Recently, graph embedding models significantly improved the quality of graph machine learning tasks, such as node classification and link prediction. In this work, we propose a model called JONNEE (JOint Network Nodes and Edges Embedding), which learns ...
Ilya Makarov +2 more
doaj +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
Edge Regular Graph Products [PDF]
The Electronic Journal of Combinatorics, 2013 A regular nonempty graph $\Gamma$ is called edge regular, whenever there exists a nonegative integer $\lambda_{\Gamma}$, such that any two adjacent vertices of $\Gamma$ have precisely $\lambda_{\Gamma}$ common neighbours. An edge regular graph $\Gamma$ with at least one pair of vertices at distance 2 is called amply regular, whenever there exists a ...
Frelih, Boštjan, Miklavič, Štefko
openaire +3 more sources
Querying Regular Graph Patterns [PDF]
Journal of the ACM, 2014 Graph data appears in a variety of application domains, and many uses of it, such as querying, matching, and transforming data, naturally result in incompletely specified graph data, that is, graph patterns. While queries need to be posed against such data, techniques for querying patterns are generally lacking, and properties of such queries are not ...
Barcelo, Pablo +2 more
openaire +6 more sources