A Triclustering Approach for Time Evolving Graphs

Guigourès, Romain; Boullé, Marc; Rossi, Fabrice

doi:10.1109/icdmw.2012.61

Cited by 13 publications

(24 citation statements)

References 25 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the context of two relational datasets that share labels among one of the dimensions, Mahiskar et al [19] simultaneously process two datasets to unveil triclusters and presented a triclustering algorithm that searches for meaningful combinations of biclusters in two related datasets. Guigourès et al [20] introduced a novel technique to track structures in time evolving graphs, based on a parameter free approach for three-dimensional coclustering of the source vertices, the target vertices, and the time. Above algorithms implement triclustering process without fuzzy sets theory, which means they concentrate on hard clustering.…”

Section: Proposed Ftc Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

A Partitioning Based Algorithm to Fuzzy Tricluster

Liu

Yang

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Fuzzy clustering allows an object to exist in multiple clusters and represents the affiliation of objects to clusters by memberships. It is extended to fuzzy coclustering by assigning both objects and features membership functions. In this paper we propose a new fuzzy triclustering (FTC) algorithm for automatic categorization of three-dimensional data collections. FTC specifies membership function for each dimension and is able to generate fuzzy clusters simultaneously on three dimensions. Thus FTC divides a threedimensional cube into many little blocks which should be triclusters with strong coherent bonding among its members. The experimental studies on MovieLens demonstrate the strength of FTC in terms of accuracy compared to some recent popular fuzzy clustering and coclustering approaches.

show abstract

Section: Proposed Ftc Algorithmmentioning

confidence: 99%

“…Equations (19), (20), and (21) are the update equations for the three dimensions memberships, through which the solution of the constrained optimization problem in (17) can be approximated by Picard iteration. Therefore FTC can be written as Pseudocode 1.…”

Section: Proposed Ftc Algorithmmentioning

confidence: 99%

A Partitioning Based Algorithm to Fuzzy Tricluster

Liu

Yang

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…In addition to the diversity of structures that can be inferred from the network, co-clustering approaches are also able to deal with continuous variables [Nadif and Govaert, 2010], [Boullé, 2012]. Blocks are extracted from the data that yields a discretization of the continuous variables.…”

Section: Related Workmentioning

confidence: 99%

“…MODL optimizes a criterion to find the co-clustering structure. The detailed formulation of the criterion as well as the optimization algorithms and the asymptotic properties are detailed in for a co-clustering with nominal variables and in [Boullé, 2012] for a co-clustering with heterogeneous variables, i.e nominal and continuous. The criterion is formulated following a MAP (Maximum a Posteriori) approach and is made up of a prior probability on the parameters of the co-clustering model and of the likelihood:…”

Section: Applying the Modl Approachmentioning

confidence: 99%

A Study of the Spatio-Temporal Correlations in Mobile Calls Networks

Guigourès¹,

Boullé²,

Rossi³

2015

Advances in Knowledge Discovery and Management

Self Cite

View full text Add to dashboard Cite

For the last few years, the amount of data has significantly increased in the companies. It is the reason why data analysis methods have to evolve to meet new demands. In this article, we introduce a practical analysis of a large database from a telecommunication operator. The problem is to segment a territory and characterize the retrieved areas owing to their inhabitant behavior in terms of mobile telephony. We have call detail records collected during five months in France. We propose a two stages analysis. The first one aims at grouping source antennas which originating calls are similarly distributed on target antennas and conversely for target antenna w.r.t. source antenna. A geographic projection of the data is used to display the results on a map of France. The second stage discretizes the time into periods between which we note changes in distributions of calls emerging from the clusters of source antennas. This enables an analysis of temporal changes of inhabitants behavior in every area of the country.Comment: Advances in Knowledge Discovery and Management, 615, Springer International Publishing, pp.3-17, 2015, Studies in Computational Intelligenc

show abstract

“…This is the case of e.g. Dubois et al (2013) and of Guigourès et al (2012Guigourès et al ( , 2015. A temporal stochastic block model, related to the one presented in this paper is independently developed by Matias et al (2015).…”

Section: Related Workmentioning

confidence: 99%

Block modelling in dynamic networks with non-homogeneous Poisson processes and exact ICL

Corneli

Latouche

Rossi

2016

Soc. Netw. Anal. Min.

Self Cite

View full text Add to dashboard Cite

We develop a model in which interactions between nodes of a dynamic network are counted by non homogeneous Poisson processes. In a block modelling perspective, nodes belong to hidden clusters (whose number is unknown) and the intensity functions of the counting processes only depend on the clusters of nodes. In order to make inference tractable we move to discrete time by partitioning the entire time horizon in which interactions are observed in fixed-length time subintervals. First, we derive an exact integrated classification likelihood criterion and maximize it relying on a greedy search approach. This allows to estimate the memberships to clusters and the number of clusters simultaneously. Then a maximum-likelihood estimator is developed to estimate non parametrically the integrated intensities. We discuss the over-fitting problems of the model and propose a regularized version solving these issues. Experiments on real and simulated data are carried out in order to assess the proposed methodology.

show abstract

A Triclustering Approach for Time Evolving Graphs

Cited by 13 publications

References 25 publications

A Partitioning Based Algorithm to Fuzzy Tricluster

A Partitioning Based Algorithm to Fuzzy Tricluster

A Study of the Spatio-Temporal Correlations in Mobile Calls Networks

Block modelling in dynamic networks with non-homogeneous Poisson processes and exact ICL

Contact Info

Product

Resources

About