Results 1 to 10 of about 1,720 (139)
Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering [PDF]
European Journal of Operational Research, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Julien Ah-Pine
exaly +4 more sources
On the spectral norm of a doubly stochastic matrix and level-k circulant matrix
Special MatricesA simple proof using Birkhoff theorem is given for the result that the spectral norm of a doubly stochastic matrix is 1. We also show that the result generalizes the results of İpek, Bozkurt, and Jiang and Zhou on circulant matrices and rr-circulant ...
Jiang Zhao-Lin, Tam Tin-Yau
doaj +2 more sources
A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem
Mathematics of Operations ResearchWe study a semismooth Newton-type method for the nearest doubly stochastic matrix problem where the nonsingularity of the Jacobian can fail. The optimality conditions for this problem are formulated as a system of strongly semismooth functions. We show that the nonsingularity of the Jacobian does not hold for this system.
Xinxin Li, Henry Wolkowicz, Hao Hu
exaly +3 more sources
A note on multivariate majorization [PDF]
Journal of Mahani Mathematical Research, 2022 A matrix $A$ is said to be multivariate majorized by a matrix $B$, written $A\prec B$, if there exists a doubly stochastic matrix $D$ such that $A = BD$ .
Mehdi Dehghanian, Ahmad Mohammadhasani
doaj +1 more source
Structured Doubly Stochastic Matrix for Graph Based Clustering [PDF]
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016 As one of the most significant machine learning topics, clustering has been extensively employed in various kinds of area. Its prevalent application in scientific research as well as industrial practice has drawn high attention in this day and age. A multitude of clustering methods have been developed, among which the graph based clustering method ...
Xiaoqian Wang 0001 +2 more
openaire +1 more source
On Double Stochastic Lumped Chains [PDF]
The Egyptian Statistical Journal, 2008 In this paper, the problem of aggregation Markov chains has been considered. The necessary and sufficient conditions of the transition probability matrix of the original Markov chain to be a doubly stochastic matrix when the transition probability matrix
Ahmed Amin El-Sheikh
doaj +1 more source
A community partitioning algorithm based on network enhancement
Connection Science, 2021 In recent years, as an effective method to mine information from the complex network, community discovery has been widely used in social network, financial risk control and other fields.
Junjie Hu +3 more
doaj +1 more source
Some Results on Majorization of Matrices
Axioms, 2022 For two n×m real matrices X and Y, X is said to be majorized by Y, written as X≺Y if X=SY for some doubly stochastic matrix of order n. Matrix majorization has several applications in statistics, wireless communications and other fields of science and ...
Divya K. Udayan +1 more
doaj +1 more source
Computational and Structural Biotechnology Journal, 2021 The high-throughput genome-wide chromosome conformation capture (Hi-C) method has recently become an important tool to study chromosomal interactions where one can extract meaningful biological information including P(s) curve, topologically associated ...
Honglong Wu +5 more
doaj +1 more source
Clustering by Low-Rank Doubly Stochastic Matrix Decomposition [PDF]
CoRR, 2012 Clustering analysis by nonnegative low-rank approximations has achieved remarkable progress in the past decade. However, most approximation approaches in this direction are still restricted to matrix factorization. We propose a new low-rank learning method to improve the clustering performance, which is beyond matrix factorization. The approximation is
Zhirong Yang, Erkki Oja
openaire +6 more sources