Row-clustering of a Point Process-valued Matrix
Structured point process data harvested from various platforms poses new challenges to the machine learning community. By imposing a matrix structure to repeatedly observed marked point processes, we propose a novel mixture model of multi-level marked point processes for identifying potential heterogeneity in the observed data. Specifically, we study a matrix whose entries are marked log-Gaussian Cox processes and cluster rows of such a matrix. An efficient semi-parametric Expectation-Solution (ES) algorithm combined with functional principal component analysis (FPCA) of point processes is proposed for model estimation. The effectiveness of the proposed framework is demonstrated through simulation studies and a real data analysis.
Code (1)
Tasks
ClusteringPoint ProcessesSimilar Papers 제목 키워드 기반
Concentration inequalities for correlated network-valued processes with applications to community estimation and changepoint analysis
Network-valued time series are currently a common form of network data. However, the study of the aggregate behavior of network sequences generated from network-valued stochastic processes is relatively rare. Most of the…
Time SeriesTime Series AnalysisA dependent partition-valued process for multitask clustering and time evolving network modelling
The fundamental aim of clustering algorithms is to partition data points. We consider tasks where the discovered partition is allowed to vary with some covariate such as space or time. One approach would be to use fragme…
ClusteringGaussian ProcessesTime SeriesTime Series AnalysisSkew-Symmetric Adjacency Matrices for Clustering Directed Graphs
Cut-based directed graph (digraph) clustering often focuses on finding dense within-cluster or sparse between-cluster connections, similar to cut-based undirected graph clustering methods. In contrast, for flow-based clu…
ClusteringGraph ClusteringOptimal Variable Clustering for High-Dimensional Matrix Valued Data
Matrix valued data has become increasingly prevalent in many applications. Most of the existing clustering methods for this type of data are tailored to the mean model and do not account for the dependence structure of t…
ClusteringVocal Bursts Intensity PredictionSemi-Supervised Clustering via Dynamic Graph Structure Learning
Most existing semi-supervised graph-based clustering methods exploit the supervisory information by either refining the affinity matrix or directly constraining the low-dimensional representations of data points. The aff…
ClusteringGraph structure learning