no code implementations • 10 Oct 2022 • Ekta Gujral
How can we identify dynamic patterns in those graphs, and how can we deal with streaming data, when the volume of data to be processed is very large?
no code implementations • 19 Dec 2019 • Ravdeep Pasricha, Ekta Gujral, Evangelos E. Papalexakis
Data collected at very frequent intervals is usually extremely sparse and has no structure that is exploitable by modern tensor decomposition algorithms.
no code implementations • 3 Jul 2018 • Ekta Gujral, Ravdeep Pasricha, Tianxiong Yang, Evangelos E. Papalexakis
Tensor decompositions are powerful tools for large data analytics as they jointly model multiple aspects of data into one framework and enable the discovery of the latent structures and higher-order correlations within the data.
no code implementations • 3 May 2018 • Saba A. Al-Sayouri, Ekta Gujral, Danai Koutra, Evangelos E. Papalexakis, Sarah S. Lam
Contrary to baseline methods, which generally learn explicit graph representations by solely using an adjacency matrix, t-PINE avails a multi-view information graph, the adjacency matrix represents the first view, and a nearest neighbor adjacency, computed over the node features, is the second view, in order to learn explicit and implicit node representations, using the Canonical Polyadic (a. k. a.
1 code implementation • 25 Apr 2018 • Ravdeep Pasricha, Ekta Gujral, Evangelos E. Papalexakis
In this paper, we define "concept" and "concept drift" in the context of streaming tensor decomposition, as the manifestation of the variability of latent concepts throughout the stream.
no code implementations • 3 Sep 2017 • Ekta Gujral, Ravdeep Pasricha, Evangelos E. Papalexakis
In this paper we introduce SaMbaTen, a Sampling-based Batch Incremental Tensor Decomposition algorithm, which incrementally maintains the decomposition given new updates to the tensor dataset.