Signed network representation with novel node proximity evaluation (Q6072446): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.neunet.2022.01.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210803304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverses. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple generalisation of the area under the ROC curve for multiple class classification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic stability and generalized Gelfand spectral radius formula / 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: Low-complexity Graph Sampling With Noise and Signal Reconstruction via Neumann Series / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:31, 3 August 2024

scientific article; zbMATH DE number 7749952
Language Label Description Also known as
English
Signed network representation with novel node proximity evaluation
scientific article; zbMATH DE number 7749952

    Statements

    Signed network representation with novel node proximity evaluation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 October 2023
    0 references
    The paper studies signed network representation with novel node proximity evaluation. The paper attempts to generalize the basic distance metric average first-passage time to signed networks and investigates the theoretical foundation of signed average first-passage time and its analytical solution. Three node proximity metrics are proposed based on signed average first-passage time. A signed network representation method is designed to preserve the proposed node proximity. Experiments on some real-world datasets are performed to illustrate the method on two downstream tasks.
    0 references
    0 references
    signed social network
    0 references
    network representation
    0 references
    node proximity
    0 references

    Identifiers