Clustering for time-varying relational count data

Relational count data are often obtained from sources such as simultaneous purchase in online shops and social networking service information. Clustering such relational count data reveals the latent structure of the relationship between objects such as household items or people. When relational cou...

Full description

Saved in:
Bibliographic Details
Published inComputational statistics & data analysis Vol. 156; p. 107123
Main Authors Goto, Satoshi, Takagishi, Mariko, Yadohisa, Hiroshi
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.04.2021
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Relational count data are often obtained from sources such as simultaneous purchase in online shops and social networking service information. Clustering such relational count data reveals the latent structure of the relationship between objects such as household items or people. When relational count data observed at multiple time points are available, it is worthwhile incorporating the time structure into the clustering result to understand how objects move between the clusters over time. In this paper, we propose two clustering methods for analyzing time-varying relational count data. The first model, the dynamic Poisson infinite relational model (dPIRM), handles time-varying relational count data. In the second model, which we call the dynamic zero-inflated Poisson infinite relational model, we further extend the dPIRM so that it can handle zero-inflated data. Proposing both two models is important as zero-inflated data are often encountered, especially when the time intervals are short. In addition, by explicitly deriving the relevant full conditional distributions, we describe the features of the estimated parameters and, in turn, the relationship between the two models. We show the effectiveness of both models through a simulation study and a real data example.
ISSN:0167-9473
1872-7352
DOI:10.1016/j.csda.2020.107123