Results 11 to 20 of about 10,068 (229)
PLoS ONE, 2013 Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks.
Arda Halu +3 more
doaj +9 more sources
ESAIM: Mathematical Modelling and Numerical Analysis, 2021 In this work we introduce and study a nonlocal version of the PageRank. In our approach, the random walker explores the graph using longer excursions than just moving between neighboring nodes. As a result, the corresponding ranking of the nodes, which takes into account along-range interactionbetween them, does not exhibit concentration phenomena ...
Stefano Cipolla +2 more
openaire +6 more sources
Google PageRank as mean playing time for pinball on the reverse web [PDF]
, 2005 It is known that the output from Google's PageRank algorithm may be interpreted as (a) the limiting value of a linear recurrence relation that is motivated by interpreting links as votes of confidence, and (b) the invariant measure of a teleporting ...
Higham, D.J.
core +4 more sources
A Novel Adaptive Feature Fusion Strategy for Image Retrieval
Entropy, 2021 In the era of big data, it is challenging to efficiently retrieve the required images from the vast amount of data. Therefore, a content-based image retrieval system is an important research direction to address this problem. Furthermore, a multi-feature-
Xiaojun Lu +4 more
doaj +1 more source
Towards Supporting Exploratory Search over the Arabic Web Content: The Case of ArabXplore [PDF]
Journal of Information Technology Management, 2020 Due to the huge amount of data published on the Web, the Web search process has become more difficult, and it is sometimes hard to get the expected results, especially when the users are less certain about their information needs.
Al-Agha Iyad, Abed Ahmed
doaj +1 more source
CoRR, 2021 Connections among entities are everywhere. From social media interactions to web page hyperlinks, networks are frequently used to represent such complex systems. Node ranking is a fundamental task that provides the strategy to identify central entities according to multiple criteria. Popular node ranking metrics include degree, closeness or betweenness
José Luís Devezas, Sérgio Nunes 0001
openaire +2 more sources
Local clustering via approximate heat kernel PageRank with subgraph sampling
Scientific Reports, 2021 Graph clustering, a fundamental technique in network science for understanding structures in complex systems, presents inherent problems. Though studied extensively in the literature, graph clustering in large systems remains particularly challenging ...
Zhenqi Lu +2 more
doaj +1 more source
A Novel Machine Learning Model for Identifying Patient-Specific Cancer Driver Genes
IEEE Access, 2022 The identification of patient-specific cancer driver genes plays a crucial role in the development of personalized cancer treatment and drug development.
Heewon Jung +3 more
doaj +1 more source
Axiomatic characterization of PageRank
Artificial Intelligence, 2023 This paper examines the fundamental problem of identifying the most important nodes in a network. We use an axiomatic approach to this problem. Specifically, we propose six simple properties and prove that PageRank is the only centrality measure that satisfies all of them.
Tomasz Was, Oskar Skibski
openaire +3 more sources
Graph technologies in an intelligent system of complex analysis of data from Internet sources
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2020 The purpose of the work outlined in the article is to review and demonstrate the use of graph technologies for deep data analysis. The first part of the article discusses the Intelligent System for the Comprehensive Analysis of Internet Sources Data and ...
I. I. Piletski +2 more
doaj +1 more source