Results 101 to 110 of about 596,753 (209)
Non-negative matrix factorization with sinkhorn distance
, 2016 Non-negative Matrix Factorization (NMF) has received considerable attentions in various areas for its psychological and physiological interpretation of naturally occurring data whose representation may be parts-based in the human brain.
Cai, Deng +4 more
core
On Some Distance Spectral Characteristics of Trees
AxiomsGraham and Pollack in 1971 presented applications of eigenvalues of the distance matrix in addressing problems in data communication systems. Spectral graph theory employs tools from linear algebra to retrieve the properties of a graph from the spectrum ...
Sakander Hayat +2 more
doaj +1 more source
Resistance distance, information centrality, node vulnerability and vibrations in complex networks
, 2010 We discuss three seemingly unrelated quantities that have been introduced in different fields of science for complex networks. The three quantities are the resistance distance, the information centrality and the node displacement.
Estrada, Ernesto +3 more
core +1 more source
, 2013 Cochlear implants (CIs) require efficient speech processing to maximize information transmission to the brain, especially in noise. A novel CI processing strategy was proposed in our previous studies, in which sparsity-constrained non-negative matrix ...
Mark Lutman +7 more
core +1 more source
scBatch: batch-effect correction of RNA-seq data through sample distance matrix adjustment. [PDF]
Bioinformatics, 2020 Fei T, Yu T.
europepmc +1 more source
The Tower Matrix, an Alternative to Deal with Distances and Quasi-distances.
J. Multiple Valued Log. Soft Comput., 2019 To any given n × n matrix D, associate a so-called tower matrix T with n × n rows and n columns. This matrix T deserves attention because it gives more information than D: in fact, the tower matrix exhibits, not only the shortest length of the paths from point p to point q, but also, for each third point k, the shortest length of the paths from p to q ...
Zhang, Yulin +2 more
openaire +2 more sources
On the spectral radius and energy of the degree distance matrix of a connected graph
Open MathematicsLet GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
doaj +1 more source
On the uniqueness of Euclidean distance matrix completions
Linear Algebra and its Applications, 2003 An \(n\times n\) real matrix \(D=(d_{ij})\) is called a Euclidean distance matrix iff there exist points \(x^1,x^2,\ldots ,x^n\) in some Euclidean space such that \(d_{ij}=\| x^i-x^j\| ^2\) for all \(i,j=1,2,\ldots ,n.\) An \(n\times n\) real matrix \(A=(a_{ij})\) is called symmetric partial matrix if only some of its entries are specified and if \(a_ ...
openaire +1 more source
The distance matrix and its variants for graphs and digraphs
, 2022 The distance matrix $\mathcal{D}(G)$ of a connected graph $G$ is the matrix whose entries are the pairwise distances between vertices. The distance matrix was defined by Graham and Pollak in 1971 in order to study the problem of loop switching in routing
Reinhart, Carolyn
core
Fuzzy clustering with Minkowski distance
Distances in the well known fuzzy c-means algorithm of Bezdek (1973) are measured by the squared Euclidean distance.Other distances have been used as well in fuzzy clustering.
Groenen, P.J.F. +2 more
core