Results 91 to 100 of about 601,118 (351)
Directional clustering through matrix factorization [PDF]
, 2016 This paper deals with a clustering problem where feature vectors are clustered depending on the angle between feature vectors, that is, feature vectors are grouped together if they point roughly in the same direction.
Blumensath, Thomas
core +1 more source
Distance to the nearest stable Metzler matrix
2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017 This paper considers the non-convex problem of finding the nearest Metzler matrix to a given possibly unstable matrix. Linear systems whose state vector evolves according to a Metzler matrix have many desirable properties in analysis and control with regard to scalability.
openaire +4 more sources
Molecular Oncology, EarlyView.Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura +19 more
wiley +1 more source
Non-negative matrix factorization with sinkhorn distance [PDF]
, 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
Minimum mean square distance estimation of a subspace [PDF]
, 2011 We consider the problem of subspace estimation in a Bayesian setting. Since we are operating in the Grassmann manifold, the usual approach which consists of minimizing the mean square error (MSE) between the true subspace U and its estimate U may not be ...
Jean-Yves Tourneret +5 more
core +1 more source
Four-point condition matrices of edge-weighted trees
Special MatricesFormulas for the determinant of distance matrix DT{D}_{T} of tree TT are known in the unweighted case and in the case when the edges of TT have commuting variable weights. Associated with the four-point condition (4PC) and a tree TT are two matrices, the
Azimi Ali +3 more
doaj +1 more source
The second immanant of some combinatorial matrices [PDF]
Transactions on Combinatorics, 2015 Let $A = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrix where $n geq 2$. Let $dt(A)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$.
R. B. Bapat +1 more
doaj
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
Discussiones Mathematicae Graph Theory, 2014 The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj +1 more source
K-Matrix: A Novel Change-Pattern Mining Method for SAR Image Time Series
Remote Sensing, 2019 In this paper, we present a novel method for change-pattern mining in Synthetic Aperture Radar (SAR) image time series based on a distance matrix clustering algorithm, called K-Matrix.
Dong Peng +3 more
doaj +1 more source
The $M$-matrix group inverse problem for distance-biregular graphs [PDF]
, 2022 Aida Abiad +3 more
openalex +1 more source