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.
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.
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.
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.
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.
A new tensor-based layer reduces neural network dimensions without losing important features.
problem Reducing dimensionality in tensor-structured feature data for deep neural networks.
method TensorProjection layer that projects input tensors into output tensors with reduced dimensions through mode-wise projections.
result The TensorProjection layer outperforms traditional downsampling methods in tasks like medical image classification and segmentation.
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.
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.
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.
A set of molecular descriptors whose length is independent of molecular size is developed for machine learning models that target thermodynamic and electronic properties of molecules. These features are evaluated by monitoring performance of kernel ridge regression models on well-studied data sets of small organic mole…
This paper summarizes AI methods for detecting credit card fraud.
problem Detecting credit card fraud from millions of transactions.
method Rule-based and AI approaches, addressing imbalanced datasets, real-time scenarios, and feature engineering.
result Summarizes state-of-the-art AI methods for fraud detection.
Paper develops a statistical model for summarizing event sequences.
problem Discovering frequent serial episodes from sequential data.
method Minimum Description Length (MDL) principle with modifications.
result Reduces dictionary size by more than four-fold without losing accuracy.
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.
Persistence diagrams are two-dimensional plots that summarize the topological features of functions and are an important part of topological data analysis. A problem that has received much attention is how deal with sets of persistence diagrams. How do we summarize them, average them or cluster them? One approach -- th…
Graph neural networks improve financial modeling of complex data.
problem Complex financial data and market volatility.
method Review and categorize GNN models for financial graphs.
result GNN models enhance performance in financial tasks.
This paper uses PCA and FA for feature selection in credit rating.
problem Selecting important features for credit rating prediction.
method Principal Component Analysis and Factor Analysis.
result Factor Analysis reduces feature set significantly without losing much accuracy.
Paper proposes new features to improve Bitcoin address classification.
problem Identifying criminal activities in Bitcoin transactions.
method New features based on transaction history summarized by block height.
result Improved performance of Bitcoin address classification significantly.
This is a survey work on Lie algebras with ad-invariant metrics. We summarize main features, notions and constructions, in the aim of bringing into consideration the main research on the topic. We also give some list of examples in low dimensions.
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.
Many prediction problems can be phrased as inferences over local neighborhoods of graphs. The graph represents the interaction between entities, and the neighborhood of each entity contains information that allows the inferences or predictions. We present an approach for applying machine learning directly to such graph…
Summarizes quantum field theories with discrete symmetry, classifying representations and anomalies.
problem Classifying representations and anomalies in quantum field theories with discrete symmetry.
method Classification of representations and anomalies using the ring of profinite integers.
result Rich and complex classification of representations and anomalies.
We develop the Latent Multi-group Membership Graph (LMMG) model, a model of networks with rich node feature structure. In the LMMG model, each node belongs to multiple groups and each latent group models the occurrence of links as well as the node feature structure. The LMMG can be used to summarize the network structu…
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.
Sampling methods that choose a subset of the data proportional to its diversity in the feature space are popular for data summarization. However, recent studies have noted the occurrence of bias (under- or over-representation of a certain gender or race) in such data summarization methods. In this paper we initiate a s…
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.
The study compares machine learning models for depression detection and highlights the importance of feature selection.
problem The choice of features in machine learning models for depression detection is crucial.
method Comparison of seven machine learning models on depression detection tasks.
result Optimal feature selection is essential for accurate and clinically acceptable classification solutions.
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.
Apricot selects subsets from large data sets efficiently using submodular optimization.
problem Efficiently selecting representative subsets from large data sets.
method Submodular optimization with efficient greedy algorithm.
result Strong theoretical guarantees on the quality of selected subsets.
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.
A new framework for generating predictive features in noisy multivariate time series.
problem Predicting noisy multivariate time series with limited user effort.
method Develops a feature programming framework based on spin-gas dynamical Ising models.
result Validated the method on synthetic and real-world datasets.
We find that CNNs with BN and ReLU exhibit feature sparsity through selective feature penalization.
problem Feature sparsity in CNNs trained with specific techniques.
method Empirical study and hypothesis testing on sparsification mechanisms.
result Selective feature penalization leads to feature sparsity in CNNs, comparable to explicit pruning.
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.
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.
Infinite mixture models are commonly used for clustering. One can sample from the posterior of mixture assignments by Monte Carlo methods or find its maximum a posteriori solution by optimization. However, in some problems the posterior is diffuse and it is hard to interpret the sampled partitionings. In this paper, we…
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.
Develops ACE to automatically identify meaningful concepts from neural network predictions.
problem Challenges in interpreting feature importance scores for machine learning models.
method Proposes concept-based explanation principles and develops ACE algorithm to extract visual concepts.
result Demonstrates ACE discovers human-meaningful, coherent concepts for neural network predictions.
Adapts DR objectives for both sample and feature size reduction.
problem Simultaneously reduce sample and feature sizes.
method Semi-relaxed Gromov-Wasserstein optimal transport.
result OT plan delivers competitive hard clustering.
A new method assigns anomaly scores to features for better interpretation.
problem Interpreting anomaly scores from feature attributions.
method Proposes a characteristic function to attribute anomaly scores using Shapley value.
result Demonstrates the potential utility of the proposed attribution methods.
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.
Unified framework for model explanation methods based on feature removal.
problem Unclear relationships and preferences among various model explanation methods.
method Characterizes removal-based explanations along three dimensions.
result Unified 26 existing methods, including widely used approaches.
VEST automates feature engineering for time series forecasting.
problem Challenges in time series forecasting with improved performance.
method VEST combines auto-regression with statistical summarization of recent past dynamics.
result VEST significantly improves forecasting performance.
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.
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.