This study improves text summarization and fake news detection using neural models.
problem Improving text summarization and detecting fake news.
method Exploring and comparing different neural models for text summarization, including LSTM-encoder-decoder, pointer-generator networks, and transformers. Applying these models as a feature extractor for fake news detection.
result The proposed neural models enhance text summarization and improve fake news detection accuracy.
Improved text summarization using belief propagation on weighted bipartite graphs.
problem Text summarization from a graph theory perspective.
method Generalized belief propagation algorithm for weighted bipartite graphs.
result Our algorithm outperforms greedy methods in text summarization tasks.
SuTaT creates dialogue summaries for tete-a-tetes without labeled data.
problem Lack of high-quality paired dialogue-summary data.
method Unsupervised model for tete-a-tetes, modeling customer and agent roles separately.
result SuTaT outperforms on automatic and human evaluations.
Model creates summaries of patient notes to save time and reduce errors.
problem Improper summarization of patient notes leads to inefficiencies and errors.
method Developed an LSTM model to sequentially label topics in history of present illness notes.
result Achieved an F1 score of 0.876, indicating the model's effectiveness.
This review compares extractive and abstractive summarization methods.
problem Improving abstractive summarization in natural language processing.
method Compared various approaches including supervised and unsupervised methods, deep learning, and NLP.
result Current research uses combinations of approaches, but abstractive summarization remains unsolved.
Develops efficient algorithms for summarizing large datasets.
problem Summarizing large datasets efficiently.
method Two-stage submodular approach for linear-time optimization.
result Achieves nearly-optimal solutions for summarizing data.
BERT helps summarize lecture content efficiently.
problem Efficiently summarize lecture content for students.
method Used BERT for text embeddings and KMeans clustering.
result Improved text summarization for lecture content.
Survey of seq2seq models for neural text summarization.
problem Improving fluency and quality of text summaries.
method Comprehensive review of seq2seq models for abstractive text summarization.
result Benchmarking of two models on recent datasets.
Develops a hybrid model for text summarization.
problem Summarizing long text sequences concisely.
method Extends sequence encoders with a graph component to handle long-distance relationships in text.
result Hybrid models outperform pure sequence or graph models on summarization tasks.
Improves document summarization by combining word embeddings and n-grams.
problem Exact word matching fails to measure semantic similarity between sentences.
method Uses deep embedding features and tf-idf features to improve sentence similarity measure; builds an improved sentence similarity graph; employs a submodular objective function; develops a Transformer-based compression model.
result Outperforms tf-idf based approach and achieves state-of-the-art performance on DUC04 dataset.
Transformer model improves source code summarization.
problem Generating readable summaries of source code.
method Transformer model with self-attention mechanism for code representation.
result Transformer model outperforms state-of-the-art techniques.
Paper explores models for summarizing AI agent policies.
problem Improving human understanding of AI agent behavior.
method Imitation learning-based approach to policy summarization.
result Matching summary extraction model to user model improves performance.
Balancing graph summarization and change detection in streaming data.
problem Balancing compression rate in graph summarization and accuracy in change detection.
method Introducing a probabilistic hierarchical latent variable model and optimizing parameters based on the minimum description length principle to balance the trade-off.
result Guaranteed suppression of Type I error probability (false alarms) in change detection.
Study improves summarization reliability in risky scenarios.
problem Reliability of automatic summarization in high-risk contexts.
method Conditional generation with Bayesian inference and entropy regularization.
result Significant improvement in robustness and reliability of summarization.
Proposes RDASS for better Korean text summarization evaluation.
problem ROUGE scores fail to capture semantic meaning in Korean text summarization.
method Introduces RDASS metrics and a method to improve their correlation with human judgment.
result RDASS metrics correlate better with human judgment than ROUGE scores.
Paper proposes a reinforcement learning framework for text summarization.
problem Transfer learning effectiveness in text summarization is not well explored.
method Reinforcement learning with a self-critic policy gradient approach.
result Achieves good generalization and state-of-the-art results on various datasets.
This study tackles Gaussian process regression with summarized data.
problem Learning and inference with summarized data (summary statistics, counts) in spatial modeling.
method Sample quasi-likelihood approach to Gaussian process regression.
result Approximation performance of the method is influenced by data granularity and covariance function length scale.
Convolutional neural network summarizes code comments across multiple languages.
problem Insufficient or missing comments in source code.
method Language-agnostic encoder-decoder model with open vocabulary.
result Comparable results to state-of-the-art on single-language data; first results on multi-language data.
Abstract: Summarizes Bernstein property results for differential equations.
problem Summarizing Bernstein property results for differential equations.
method Not specified in the abstract, likely involves mathematical analysis and differential equations.
result Not specified in the abstract, likely involves proving or disproving the Bernstein property for specific equations.
A new model improves text summarization by integrating topic information.
problem Improving the coherence, diversity, and informativeness of text summarization.
method Integrates topic information into ConvS2S model and uses SCST for optimization.
result The proposed model outperforms state-of-the-art methods in abstractive summarization.
Automates summarizing federal grant audits with machine learning.
problem Manual analysis of large federal grant audits is time-consuming and error-prone.
method Sentence clustering, k-means, proximity to centroids, human input for refinement.
result Automated summaries are comparable to human-generated ones using ROUGE metric.
This paper improves video summarization using a new algorithm and dataset.
problem Efficiently summarizing videos for browsing and searching.
method Improves sequential determinantal point process (SeqDPP) with a large-margin algorithm and a new probabilistic distribution.
result Significantly improved video summarization model with better user input integration and diversity.
This paper explores sentence vector properties for automatic summarization.
problem Understanding the internal structure and properties of sentence vectors.
method Compositional sentence vector representations using artificial neural networks.
result Cosine similarity correlates with sentence importance and can identify gaps in summaries.
Paper introduces methods to automatically generate SOAP notes from patient-physician conversations.
problem Burden of creating digital SOAP notes by physicians.
method Cluster2Sent algorithm for summarizing patient-physician conversations.
result Cluster2Sent algorithm outperforms existing methods by 8 ROUGE-1 points.
In this paper we introduce a micro-clustering strategy for Functional Boxplots. The aim is to summarize a set of streaming time series splitted in non overlapping windows. It is a two step strategy which performs at first, an on-line summarization by means of functional data structures, named Functional Boxplot micro-c…
This paper presents a method to summarize directed graphs while preserving edge information.
problem Summarizing directed graphs while maintaining edge directionality.
method A model based on minimizing reconstruction error with non-negative constraints, related to Max-Cut criterion, using multiplicative update algorithms.
result The proposed method identifies compressed nodes and directed compressed relations, providing a more accurate representation of directed graphs.
The paper tackles fair and diverse data summarization using DPPs.
problem Tackles bias in data summarization methods.
method Uses determinantal measures of diversity and corresponding distributions (DPPs) to incorporate fairness constraints.
result Developed a fast sampler for constrained determinantal distributions that is provably good under certain conditions.
Improved text summarization using neural semantic encoders with hierarchical structure.
problem Capturing long-term dependencies in text summarization.
method Proposed a novel hierarchical Neural Semantic Encoder (NSE) model augmented with lemma and PoS tags.
result Significantly outperformed state-of-the-art models in ROUGE metric.
Improved source code summarization using extended Tree-LSTM.
problem Challenges in applying LSTM to structured source code.
method Extended Tree-LSTM for abstract syntax trees (ASTs).
result Multi-way Tree-LSTM achieves better results than state-of-the-art techniques.
SummerTime summarizes variable-length time series for machine learning applications.
problem Classical machine learning methods struggle with variable-length time series data.
method Summarizes time series into a fixed-length feature vector using Gaussian Mixture Models (GMM).
result Improves classification and regression performance in physical activity analysis.
Few summaries enable automatic summarization of product reviews.
problem Lack of large labeled datasets for training supervised models in opinion summarization.
method Conditional Transformer model trained to generate summaries given other reviews, fine-tuned to predict summary properties.
result Few summaries (5-10) are sufficient to generate fluent, informative, and sentiment-preserving summaries.
A new method uses PSO to optimize sentence weights for user-oriented document summaries.
problem Handling information overload in documents through efficient summarization.
method Particle Swarm Optimization (PSO) to identify and weight sentence features.
result Improved accuracy in summarization compared to previous methods.
We address the problem of maximizing an unknown submodular function that can only be accessed via noisy evaluations. Our work is motivated by the task of summarizing content, e.g., image collections, by leveraging users' feedback in form of clicks or ratings. For summarization tasks with the goal of maximizing coverage…
New method reduces labeling costs in semi-supervised learning.
problem Efficiently label data with limited labeled samples.
method Formulates batch acquisition as bilevel optimization.
result Shows effectiveness in keyword detection tasks.
Summarizes financial news for better investment decisions.
problem Information overload from financial news hinders timely investment decisions.
method Personalized Chain-of-Thought summarization framework integrating user-specified keywords.
result Personalized summaries highlight relevant market signals, improving investment narratives.
A neural network tackles emotion recognition, attribution, and summarization.
problem Sparsity of emotional expressions in videos.
method Bi-stream Emotion Attribution-Classification Network (BEAC-Net) with two networks: attribution and classification.
result Superior performance on emotion attribution, recognition, and summarization tasks.
New algorithm for fair clustering reduces time complexity.
problem Fair clustering of data with multiple demographic groups.
method Simple approximation algorithm for k-center problem with linear time complexity. result Linear time algorithm for fair k-center clustering. Summarizes geometric connections between sigma models and Gross-Neveu models.
problem Understanding geometric connections between sigma models and Gross-Neveu models.
method Geometric facts and connections to nilpotent orbits, Springer resolutions, and quiver varieties.
result Sheds light on the general setup of the correspondence.
Attention models boost speaker verification accuracy.
problem Improving text-dependent speaker verification accuracy.
method Exploring attention mechanisms in sequence summarization for speaker recognition.
result Attention-based models improve EER by 14%.
A new algorithm ThreeSieves maximizes submodular functions efficiently in streaming data.
problem Maximizing submodular functions in high-dimensional data streams efficiently.
method ThreeSieves algorithm, designed for streaming data, ignoring worst-case guarantees for high probability solutions.
result ThreeSieves outperforms state-of-the-art methods in terms of performance and resource usage.
We introduce a method to learn a mixture of submodular "shells" in a large-margin setting. A submodular shell is an abstract submodular function that can be instantiated with a ground set and a set of parameters to produce a submodular function. A mixture of such shells can then also be so instantiated to produce a mor…
Unsupervised summarization generates novel reviews reflecting consensus opinions.
problem Creating summaries that reflect subjective information in multiple documents.
method Generative model with hierarchical variational autoencoder, pointer-generator mechanism.
result Model produces fluent and coherent summaries reflecting common opinions.
Centroid Transformers reduce memory and computation by summarizing inputs into centroids.
problem Efficiently summarize inputs with reduced memory and computation.
method Generalizes self-attention to map N inputs to M centroids (M ≤ N), reducing complexity.
result Centroid Transformers reduce memory and computation while preserving key information.
SemSentSum uses embeddings to link facts across documents efficiently.
problem Linking facts across documents is challenging due to language variability.
method Develops SemSentSum, a fully data-driven model using universal and domain-specific sentence embeddings to build a semantic relation graph.
result SemSentSum achieves competitive results on multi-document summarization tasks.
This paper tackles the reduction of redundant repeating generation that is often observed in RNN-based encoder-decoder models. Our basic idea is to jointly estimate the upper-bound frequency of each target vocabulary in the encoder and control the output words based on the estimation in the decoder. Our method shows si…
The Blaschke conjecture claims that every compact Riemannian manifold whose injectivity radius equals its diameter is, up to constant rescaling, a compact rank one symmetric space. We summarize the intuition behind this problem, the proof that such manifolds have the cohomology of compact rank one symmetric spaces, and…
New method for summarizing Bayesian mixture models using sliced Wasserstein distances.
problem Estimating the mixing measure in nonparametric Bayesian mixture models.
method Decision-theoretic approach using sliced Wasserstein distances for Gaussian mixtures.
result Effective estimation of the mixing measure and mixture density.
A new model generates summaries by conditioning on input text and latent topics.
problem Improving abstractive summarization quality.
method Conditioning decoder output on both input text and latent topics identified by LDA.
result Strongly improved ROUGE scores on CNN/Daily Mail and WikiHow datasets.