Buscar
Mostrando ítems 1-10 de 660
StructMatrix: large-scale visualization of graphs by means of structure detection and dense matrices
(Institute of Electrical and Electronics Engineers – IEEEAtlantic City, 2015-11)
Given a large-scale graph with millions of nodes and edges, how to reveal macro patterns of interest, like cliques, bi-partite cores, stars, and chains? Furthermore, how to visualize such patterns altogether getting insights ...
An Analysis of Distributed Programming Models and Frameworks for Large-scale Graph Processing
(Taylor & Francis, 2020-04-30)
In recent years, processing and analysing large graphs has become a major need in many research areas. Distributed graph processing programming models and frameworks arised as a natural solution to process linked data of ...
An Architecture and Platform for Developing Distributed Recommendation Algorithms on Large-Scale Social Networks
(Sage Publications Ltd, 2015-06)
The creation of new and better recommendation algorithms for social networks is currently receiving much attention owing to the increasing need for new tools to assist users. The volume of available social data as well as ...
DPM: A novel distributed large-scale social graph processing framework for link prediction algorithms
(Elsevier Science, 2018-01)
Large-scale graphs have become ubiquitous in social media. Computer-based recommendations in these huge graphs pose challenges in terms of algorithm design and resource usage efficiency when processing recommendations in ...
The jamming constant of uniform random graphs
(Elsevier Science, 2017-07)
By constructing jointly a random graph and an associated exploration process, we define the dynamics of a “parking process” on a class of uniform random graphs as a measure-valued Markov process, representing the empirical ...
Gibbs random graphs on point processes
(American Institute Of Physics, 2010-11)
Consider a discrete locally finite subset G of Rd and the complete graph (G, E), with vertices G and edges E. We consider Gibbs measures on the set of sub-graphs with vertices G and edges E´ ⊂ E. The Gibbs interaction acts ...
A survey of RDF stores & SPARQL engines for querying knowledge graphs
(Springer, 2021)
RDF has seen increased adoption in recent years, prompting the standardization of the SPARQL query language for RDF, and the development of local and distributed engines for processing SPARQL queries. This survey paper ...
Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models
(Springer, 2015)
In this paper we study distributed algorithms on massive
graphs where links represent a particular relationship between
nodes (for instance, nodes may represent phone numbers
and links may indicate telephone calls). ...
Online change point detection for weighted and directed random dot product graphs
(IEEE, 2022)
Given a sequence of random (directed and weighted) graphs, we address the problem of online monitoring and detection of changes in the underlying data distribution. Our idea is to endow sequential change-point detection ...
Regular graph construction for semi-supervised learning
(IOP PublishingBristol, 2014)
Semi-supervised learning (SSL) stands out for using a small amount of labeled points for data clustering and classification. In this scenario graph-based methods allow the analysis of local and global characteristics of ...