Results 41 to 50 of about 116,308 (181)
Double regularized matrix factorization for image classification and clustering
EURASIP Journal on Image and Video Processing, 2018 Feature selection, which aims to select an optimal feature subset to avoid the “curse of dimensionality,” is an important research topic in many real-world applications.
Wei Zhou +4 more
doaj +1 more source
Building a Graph Signal Processing Model Using Dynamic Time Warping for Load Disaggregation
Sensors, 2020 Building on recent unsupervised Non-intrusive load monitoring (NILM) algorithms that use graph Laplacian regularization (GLR) and achieve state-of-the-art performance, in this paper, we propose a novel unsupervised approach to design an underlying graph ...
Kanghang He +2 more
doaj +1 more source
Edge-distance-regular graphs [PDF]
Journal of Combinatorial Theory, Series A, 2011 Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same ...
Cámara Vallejo, Marc +4 more
openaire +4 more sources
发电技术ObjectivesIn order to solve the problems of low efficiency of fault feature extraction, inaccurate feature representation, and difficulty in adapting existing methods to complex signal requirements in wind turbine bearing fault diagnosis, a fault ...
LIU Zhan +3 more
doaj +1 more source
An algorithm to prescribe the configuration of a finite graph [PDF]
, 2010 We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization of an ...
Baird, Paul, Tiba, Marius
core
Tight Distance-Regular Graphs [PDF]
Journal of Algebraic Combinatorics, 2000 We consider a distance-regular graph $\G$ with diameter $d \ge 3$ and eigenvalues $k= _0> _1>... > _d$. We show the intersection numbers $a_1, b_1$ satisfy $$ ( _1 + {k \over a_1+1}) ( _d + {k \over a_1+1}) \ge - {ka_1b_1 \over (a_1+1)^2}. $$ We say $\G$ is {\it tight} whenever $\G$ is not bipartite, and equality holds above.
Jurišić, Aleksandar +2 more
openaire +2 more sources
IEEE AccessGraph Neural Networks have emerged as powerful tools for analyzing graph-structured data. However, their performance often varies across datasets due to challenges such as noisy edges, sparse connectivity, and over-smoothing in deep layers.
Vinay Santhosh Chitla +3 more
doaj +1 more source
Molecular Therapy: Nucleic Acids, 2019 Precision medicine has become a novel and rising concept, which depends much on the identification of individual genomic signatures for different patients.
Na-Na Guan +5 more
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
Graph-Based Clustering via Group Sparsity and Manifold Regularization
IEEE Access, 2019 Clustering refers to the problem of partitioning data into several groups according to the predefined criterion. Graph-based method is one of main clustering approaches and has been shown impressive performance in many literatures.
Jianyu Miao +3 more
doaj +1 more source