Proposes a method for time-evolving and difficulty-level topic discovery.
problem Discovering evolving and advanced topics in dynamic corpora.
method Constrained Coupled Matrix-Tensor Factorization with expertise-level constraints.
result Identifies evolving and difficulty-level topics in community-contributed content.
Topic models have proven to be a useful tool for discovering latent structures in document collections. However, most document collections often come as temporal streams and thus several aspects of the latent structure such as the number of topics, the topics' distribution and popularity are time-evolving. Several mode…
Proposes tPARAFAC2 for tracking evolving patterns in time-evolving data.
problem Lack of temporal regularization in tensor factorizations for capturing evolving patterns.
method Temporal PARAFAC2 (tPARAFAC2) with temporal regularization.
result tPARAFAC2 accurately captures evolving patterns better than existing methods.
Dynamic networks are a general language for describing time-evolving complex systems, and discrete time network models provide an emerging statistical technique for various applications. It is a fundamental research question to detect the community structure in time-evolving networks. However, due to significant comput…
GraphKKE learns fixed-length feature vectors from time-evolving graphs of human microbiome data.
problem Understanding dynamic changes in human microbiome graphs over time.
method Spectral analysis of transfer operators and graph kernels.
result GraphKKE captures temporal changes in human microbiome graphs.
Predicts path failures in evolving networks using deep learning.
problem Predicting path failures in time-evolving graphs.
method LRGCN, SAPE
result LRGCN outperforms other methods in path failure prediction.
A tutorial on dynamic Laplacian for time-evolving data clusters.
problem Handling data with a time component and lying on a time-evolving manifold.
method Dynamic generalization of the Laplacian, SEBA algorithm for feature separation.
result Clusters correspond to long-lived coherent collections in time-evolving data.
Unified approach detects anomalies in evolving categorical data at multiple scales.
problem Anomaly detection in high-dimensional, time-evolving categorical data without labeled samples.
method Combines Adversarial Autoencoder and Recurrent Neural Network for cross-scale learning and anomaly detection.
result Enhanced two-resolution anomaly detector outperforms state-of-the-art methods.
The paper develops a neural network-based method for detecting change points in large-scale time-evolving data.
problem Detecting and locating change points in multivariate time-evolving data.
method Two-step procedure involving neural network training and test error function calibration over moving windows.
result Consistent estimates for the number and locations of change points under temporal dependence.
Generative adversarial networks generate realistic, time-evolving high-resolution atmospheric fields.
problem Improving spatial resolution of low-resolution atmospheric images.
method Recurrent, stochastic super-resolution GAN for generating ensembles of time-evolving high-resolution atmospheric fields.
result The GAN produces realistic, temporally consistent super-resolution sequences for radar-measured precipitation and cloud optical thickness.
This paper introduces a novel technique to track structures in time evolving graphs. The method is based on a parameter free approach for three-dimensional co-clustering of the source vertices, the target vertices and the time. All these features are simultaneously segmented in order to build time segments and clusters…
A fast spectral algorithm detects community structure in evolving graphs.
problem Detecting community structure in time-evolving sparse graphs.
method Extension of the Bethe-Hessian matrix for spectral community detection.
result The algorithm reaches the optimal detectability threshold and outperforms other methods.
The paper proposes a Gaussian mixture model for Hilbert-space-valued data.
problem Challenges in characterizing probability measures for infinite-dimensional random objects.
method Gaussian mixture framework based on kernel mean embeddings.
result The proposed algorithm yields a dense class of approximations in infinite-dimensional spaces.
New method clusters evolving networks using spatio-temporal graph Laplacian.
problem Clustering communities in time-varying graphs.
method Extends spectral clustering to dynamic graphs using CCA and spatio-temporal graph Laplacian.
result The spatio-temporal graph Laplacian clearly interprets cluster evolution over time.
New method clusters directed graphs using Koopman operators.
problem Challenges in clustering directed graphs, especially complex eigenvalues and lack of cluster definition.
method Relate graph Laplacians to transfer operators and metastable sets in stochastic systems, derive clustering algorithms for directed and time-evolving graphs.
result Clusters can be interpreted as coherent sets, useful for analyzing transport and mixing processes.
We model microbiome interactions as graphs to interpret complex dynamics.
problem Understanding the differences in microbiome profiles between healthy and ill individuals.
method Developed a method to learn low-dimensional graph representations of time-evolving microbiome interactions.
result Extracted graph features that highlight microbes and interactions strongly correlated with clinical diseases.
Graph-based methods pervade the inference toolkits of numerous disciplines including sociology, biology, neuroscience, physics, chemistry, and engineering. A challenging problem encountered in this context pertains to determining the attributes of a set of vertices given those of another subset at possibly different ti…
Artificial neural networks are simple and efficient machine learning tools. Defined originally in the traditional setting of simple vector data, neural network models have evolved to address more and more difficulties of complex real world problems, ranging from time evolving data to sophisticated data structures such …
TATD predicts missing entries in time-evolving tensors by exploiting temporal dependency and sparsity.
problem Predict missing entries in time-evolving tensors with temporal dependency and sparsity issues.
method TATD (Time-Aware Tensor Decomposition) integrates temporal dependency and time-varying sparsity through a smoothing regularization with Gaussian kernel and alternating optimization.
result TATD achieves state-of-the-art accuracy for decomposing temporal tensors.
DynGraph2Seq predicts health stages from user activity graphs in online forums.
problem Predicting health stages from changing user activities in online forums.
method Formulated user activities as dynamic graphs, used DynGraph2Seq model with hierarchical attention.
result Demonstrated effectiveness and interpretability of DynGraph2Seq.
Enhances neural network solvers for PDEs with complex boundary conditions.
problem Challenges in solving PDEs with high accuracy and complex boundary conditions.
method Integrates natural gradient optimization with numerical time-stepping schemes to enforce Dirichlet boundary conditions.
result Superior accuracy and computational efficiency of the proposed methods for solving PDEs.
We show that a simple model of a spatially resolved evolving economic system, which has a steady state under simultaneous updating, shows stable oscillations in price when updated asynchronously. The oscillations arise from a gradual decline of the mean price due to competition among sellers competing for the same reso…
Graph-based approach predicts stock trends using dynamic multi-relational graphs.
problem Predicting future stock movements in complex, time-evolving stock relationships.
method Dynamic multi-relational stock graphs, stochastic diffusion process, parallel retention.
result Outperforms state-of-the-art baselines in stock trend forecasting.
In a dynamic social or biological environment, the interactions between the actors can undergo large and systematic changes. In this paper we propose a model-based approach to analyze what we will refer to as the dynamic tomography of such time-evolving networks. Our approach offers an intuitive but powerful tool to in…
Paper tackles continuous transfer learning with evolving target domains.
problem Challenges of negative transfer in evolving target domains.
method Proposes label-informed C-divergence for measuring distribution shift and negative transfer.
result Demonstrates effectiveness of TransLATE framework in minimizing classification error and C-divergence.
We propose a family of statistical models for social network evolution over time, which represents an extension of Exponential Random Graph Models (ERGMs). Many of the methods for ERGMs are readily adapted for these models, including maximum likelihood estimation algorithms. We discuss models of this type and their pro…
Novel framework synthesizes stochastic trajectories with anticipated structural breaks.
problem Synthesizing forward-looking, time-evolving stochastic trajectories with anticipated structural breaks.
method Anticipatory Neural Jump-Diffusion (ANJD) flow, AVNSG for dynamic spectral whitening.
result The framework effectively captures non-commutative moments and high-order stochastic texture.
Paper finds better words for topic models by reranking top words.
problem Top words in topic models are not always representative.
method Reranking words by considering marginal probability over every topic.
result Reranked top words are more representative of topics.
Proposes a new multi-layer model for topic distributions.
problem Leveraging deep structures for learning word distributions of topics.
method A multi-layer generative process on word distributions of topics, where each topic is drawn from a mixture of topics from the layer above.
result Discover interpretable topic hierarchies and improve topic models' accuracy and interpretability.
Topic-aware chatbot learns from NMF topic vectors.
problem Improving chatbot relevance based on user topics.
method Combines RNN with NMF for topic learning and attention.
result Chatbot provides more relevant answers based on topic.
A new model CDTM improves text classification by concentrating document topics.
problem Unsupervised text classification with diverse topic distributions.
method Imposes an exponential entropy penalty on document topic distribution to encourage concentration.
result More coherent topics and concentrated, sparse document-topic distributions.
New metric correlates local topic quality with human judgments.
problem Evaluation of topic models focuses on global metrics, ignoring token-level assignments.
method Proposed a human evaluation task and automated metrics to assess local topic quality.
result Consistency metric correlates best with human judgments of local topic quality.
Proposes HMHP for joint modeling of user-topic interactions.
problem Complex interactions between users, topics and time on social media.
method Hidden Markov Hawkes Process (HMHP) incorporating topical Markov Chains.
result HMHP outperforms state-of-the-art models in generalization and accuracy.
Document clustering and topic modeling are two closely related tasks which can mutually benefit each other. Topic modeling can project documents into a topic space which facilitates effective document clustering. Cluster labels discovered by document clustering can be incorporated into topic models to extract local top…
ETM discovers interpretable topics in large vocabularies.
problem Existing topic models fail with large, heavy-tailed vocabularies.
method Generative model combining topic models and word embeddings with variational inference.
result ETM discovers interpretable topics even with large vocabularies.
Topic models are probabilistic models for discovering topical themes in collections of documents. In real world applications, these models provide us with the means of organizing what would otherwise be unstructured collections. They can help us cluster a huge collection into different topics or find a subset of the co…
Predictive topic models retain only relevant terms for better prediction and topic coherence.
problem Misspecification of topic models leads to poor prediction and topic coherence.
method Uses supervisory signal to select vocabulary terms improving prediction performance.
result Prediction-focused topic models learn more coherent topics while maintaining competitive predictions.
We propose a simple model for the behaviour of longterm investors on a stock market, consisting of three particles, which represent the current price of the stock and the opinion of the buyers, respectively sellers, about the right trading price. As time evolves, both groups of traders update their opinions with respec…
Paper compares NMF and LDA for topic labeling in customer communications.
problem Automatically labeling topics in customer inquiries.
method Uses NMF and LDA for topic mining and labeling.
result Proposes methods for automated topic subject labeling.
New models discover new topics over time in topic modeling.
problem Discovering new topics over time in topic modeling.
method Nonparametric Bayesian models and Hungarian matching algorithm.
result Significantly faster than existing methods, discovering new topics in large datasets.
We introduce Gaussian Process Topic Models (GPTMs), a new family of topic models which can leverage a kernel among documents while extracting correlated topics. GPTMs can be considered a systematic generalization of the Correlated Topic Models (CTMs) using ideas from Gaussian Process (GP) based embedding. Since GPTMs w…
TopicEq model generates equations and text from scientific papers.
problem Communicating ideas in scientific texts using both mathematics and text.
method Joint topic and equation generation model using correlated topic model and RNN.
result Joint model outperforms existing topic and equation models for scientific texts.
New metric R2 improves topic model evaluation.
problem Lack of standard cross-contextual evaluation metrics for topic modeling.
method Introduces R2 as a coefficient of determination for topic models. result Improves topic model evaluation by providing a standard metric.
AOBTM adapts online topic modeling for short app reviews, revealing coherent topics over time.
problem Challenges in inferring latent topics from short, dynamic app reviews over multiple versions.
method Adaptive Online Biterm Topic Model (AOBTM) that addresses sparsity and considers statistical data from previous versions.
result AOBTM finds more coherent topics and outperforms state-of-the-art baselines.
Neural topic models improve topic discovery in large corpora.
problem Topic discovery in large text corpora.
method Neural auto-encoder based document embedding with PLSA assumptions.
result Neural topic models outperform LDA in capturing relevant topics and perplexity.
Paper proposes a method to monitor research topic evolution.
problem Difficulty in tracking research topic diffusion and evolution.
method Deep Non-negative Autoencoder with information divergence measurement.
result Identifies evolution of research topics and discovers topic diffusions.
This paper improves topic modeling by embedding words and topics together.
problem Topic models struggle with short documents and approximate inference.
method Model each document as a mixture of word embeddings and each topic as a mixture of topic embeddings.
result The method optimizes topic embeddings to minimize semantic differences between words and topics.
Paper proposes a method to discover topic evolutions from text data.
problem Difficulty in identifying new research topics from large text data.
method Uses sparseness-constrained Non-negative Matrix Factorization with generalized Jensen-Shannon divergence.
result Extracts more prominent topics and visualizes term-topic relationships.