Sparse randomized shortest paths routing with Tsallis divergence regularization (Q2036747): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10618-021-00742-y / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Path Choice Entropy in General Transport Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3452868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern multidimensional scaling: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network analysis. Methodological foundations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistics for high-dimensional data. Methods, theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinary Differential Equation Methods for Markov Decision Processes and Application to Kullback--Leibler Control Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of graph-geodetic distances generalizing the shortest-path and the resistance distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The walk distances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studying New Classes of Graph Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matrix-forest theorem and measuring relations in small social groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proximity measures for graph vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5489870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection onto the simplex and the \(l_1\) ball / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4872462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3100186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bag-of-paths framework for network data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sum-over-paths extension of edit distances accounting for all sequence alignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3531415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data science, learning by latent structures, and knowledge discovery. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5251797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Theory and Statistical Mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control as a graphical model inference problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new status index derived from sociometric analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in the theory of randomized shortest paths with a comparison of graph node distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical analysis of network data. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possibilistic and probabilistic fuzzy clustering: Unification within the framework of the non-extensive thermostatistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for fuzzy clustering. Methods in \(c\)-means clustering with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3091593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3592129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4392284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading Value and Information in MDPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Shortest-Path Problems: Two Related Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Learning in Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303321897735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Nonextensive Statistical Mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting and commute times in large graphs are often misleading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397004 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10618-021-00742-Y / rank
 
Normal rank

Latest revision as of 20:32, 16 December 2024

scientific article
Language Label Description Also known as
English
Sparse randomized shortest paths routing with Tsallis divergence regularization
scientific article

    Statements

    Sparse randomized shortest paths routing with Tsallis divergence regularization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2021
    0 references
    graph mining
    0 references
    link analysis
    0 references
    network data analysis
    0 references
    network science
    0 references
    distances between nodes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references