Search Results for author: Matthieu Latapy

Found 9 papers, 2 papers with code

Link Streams as a Generalization of Graphs and Time Series

no code implementations19 Nov 2023 Esteban Bautista, Matthieu Latapy

In this work, we contribute to the development of this formalism by showing that link streams also generalize time series.

Time Series

A Frequency-Structure Approach for Link Stream Analysis

no code implementations7 Dec 2022 Esteban Bautista, Matthieu Latapy

By plugging-in these developments and their time-domain counterpart into our framework, we are able to (i) obtain a new basis for link streams that allow us to represent them in a frequency-structure domain; and (ii) show that many interesting transformations to link streams, like the aggregation of interactions or their embedding into a euclidean space, can be seen as simple filters in our frequency-structure domain.

Time Series Analysis

Full Bitcoin Blockchain Data Made Easy

no code implementations15 Jun 2021 Jules Azad Emery, Matthieu Latapy

Despite the fact that it is publicly available, collecting and processing the full bitcoin blockchain data is not trivial.

Clustering

Computing Betweenness Centrality in Link Streams

no code implementations12 Feb 2021 Frédéric Simard, Clémence Magnien, Matthieu Latapy

Betweeness centrality is one of the most important concepts in graph analysis.

A general graph-based framework for top-N recommendation using content, temporal and trust information

1 code implementation6 May 2019 Armel Jacques Nzekon Nzeko'o, Maurice Tchuente, Matthieu Latapy

Recommending appropriate items to users is crucial in many e-commerce platforms that contain implicit data as users' browsing, purchasing and streaming history.

Recommendation Systems

Link Stream Graph for Temporal Recommendations

no code implementations27 Mar 2019 Armel Jacques Nzekon Nzeko'o, Maurice Tchuente, Matthieu Latapy

Experiments conducted on four real world implicit datasets for temporal recommendation, with 3 evaluation metrics, show that LSG is the best in 9 out of 12 cases compared to BIP and STG which are the most used state-of-the-art recommender graphs.

Recommendation Systems

Stream Graphs and Link Streams for the Modeling of Interactions over Time

1 code implementation11 Oct 2017 Matthieu Latapy, Tiphaine Viard, Clémence Magnien

It is also consistent with graph theory: graph concepts are special cases of the ones we introduce.

Clustering

Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View

no code implementations9 Aug 2006 Pascal Pons, Matthieu Latapy

Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts.

Community Detection Data Structures and Algorithms Disordered Systems and Neural Networks Physics and Society

Computing communities in large networks using random walks (long version)

no code implementations12 Dec 2005 Pascal Pons, Matthieu Latapy

Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts.

Physics and Society Disordered Systems and Neural Networks Statistical Mechanics

Cannot find the paper you are looking for? You can Submit a new open access paper.