Results 1 to 10 of about 547,023 (266)
Entropy measures of distance matrix [PDF]
Bonchev and Trinajstic defined two distance based entropy measures to measure the molecular branching of molecular graphs in 1977 [Information theory, distance matrix, and molecular branching, J. Chem. Phys., 38 (1977), 4517–4533]. In this paper we use these entropy measures which are based on distance matrices of graphs.
Bünyamin Şahin, Abdulgani Şahin
doaj +7 more sources
A Distance-Preserving Matrix Sketch
38 pages, 13 ...
Wilkinson, Leland, Luo, Hengrui
openaire +2 more sources
Multi-distance support matrix machines [PDF]
Real-world data such as digital images, MRI scans and electroencephalography signals are naturally represented as matrices with structural information. Most existing classifiers aim to capture these structures by regularizing the regression matrix to be low-rank or sparse.
Yunfei Ye, Dong Han
openaire +2 more sources
Analysis of amino acids network based on transition and transversion mutation of codons [PDF]
In this paper, we have developed a network of 20 amino acids based on a distance matrix of amino acids. This distance matrix is obtained by considering the transition and transversion mutation of codons.
Tazid Ali, Chandra Borah
doaj
Squared distance matrices of trees with matrix weights
Let T be a tree on n vertices whose edge weights are positive definite matrices of order s. The squared distance matrix of T, denoted by Δ, is the ns × ns block matrix with [Formula: see text], where d(i, j) is the sum of the weights of the edges in the ...
Iswar Mahato, M. Rajesh Kannan
doaj +1 more source
Algebraic structures and distance based analysis of genetic code [PDF]
This paper explores the genetic code's algebraic structures associated with the four mRNA (or DNA) bases A, G, C, and U. We have obtained quotient group structures of codons by considering the transition and substitution mutation. In these quotient group
Chandra Borah, Tazid Ali
doaj
On the distance energy of k-uniform hypergraphs
In this article, we extend the concept of distance energy for hypergraphs. We first establish a relation between the distance energy and the distance spectral radius.
Sharma Kshitij, Panda Swarup Kumar
doaj +1 more source
Keberadaan outlier pada dataset dapat menyebabkan rendahnya hasil akurasi pada proses klasifikasi. Outlier pada dataset dapat dihilangkan pada tahapan prapemrosesan algoritme klasifikasi.
Sugriyono Sugriyono, Maria Ulfah Siregar
doaj +1 more source
Distance matrix of weighted cactoid-type digraphs [PDF]
A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance matrix for weighted cactoid-type digraphs and find its inverse, whenever it exists.
Joyentanuj Das, Sumit Mohanty
openaire +2 more sources
Application of Floyd's Algorithm on Transport Network of South Bohemian Region
The introductory part of the paper deals with the theory of searching for optimal routes in transport networks, including a description of each type of optimization tasks. The aim of the article is demonstration of Floyd algorithm application to find the
Jiri Hanzl +3 more
doaj +1 more source

