Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,042 papers · 148 categories

Trend · papers per month

36912 · May 201819922001200920172026
48 results for IMDB movie comments

Study analyzes IMDB movie comments and Twitter data using machine learning and vector space techniques.

problem Sentiment analysis of IMDB movie comments and Twitter data.
method Created a vector space in KNIME Analytics platform, used Decision Trees, Naïve Bayes, and SVM algorithms for classification.
result SVM algorithm provided the best classification results for both IMDB movie comments and Twitter data sets.

Much work has been done in understanding human creativity and defining measures to evaluate creativity. This is necessary mainly for the reason of having an objective and automatic way of quantifying creative artifacts. In this work, we propose a regression-based learning framework which takes into account quantitative…

2017-07-18abs ↗pdf ↗

This paper presents a novel model for multimodal learning based on gated neural networks. The Gated Multimodal Unit (GMU) model is intended to be used as an internal unit in a neural network architecture whose purpose is to find an intermediate representation based on a combination of data from different modalities. Th…

2017-02-07abs ↗pdf ↗

Dataset pruning is the process of removing sub-optimal tuples from a dataset to improve the learning of a machine learning model. In this paper, we compared the performance of different algorithms, first on an unpruned dataset and then on an iteratively pruned dataset. The goal was to understand whether an algorithm (s…

2019-01-11abs ↗pdf ↗

A new method selects models for ensemble learning to maximize mutual information, outperforming existing approaches.

problem Selecting models for ensemble learning to improve performance and reduce correlation issues.
method Formulate budgeted ensemble selection as maximizing mutual information, use Gaussian-copula to model correlated errors, propose a greedy mutual-information selection algorithm.
result Our method consistently outperforms strong baselines across multiple datasets.

A new teacher-class network method compresses DNNs by distributing knowledge to multiple student networks.

problem Overwhelming size of Deep Neural Networks (DNNs).
method Single teacher with multiple student networks, transferring knowledge to each student.
result The combined knowledge of the class of students achieves better performance and reduces parameters.

We present a grid diagram analogue of Carter, Rieger and Saito's smooth movie theorem. Specifically, we give definitions for grid movies, grid movie isotopies and present a definition of grid planar isotopy as a particular subset of the grid diagram moves: stabilization, destabilization and commutation. We show that gr…

2013-03-07abs ↗pdf ↗

Paper classifies movie genres using multimodal data.

problem Challenging task of multi-label movie genre classification.
method Created dataset from video clips, subtitles, synopses, and posters. Extracted features using various descriptors. Evaluated using different classifiers and late fusion strategy.
result Best F-Score result of 0.628 achieved by combining LSTM on synopses and CNN on movie trailer frames.

A movie multilayer network model captures narration from script, subtitles, and content.

problem Discovering content and stories in movies using network models.
method Developed a multilayer network model using visual and textual semantic cues.
result Demonstrated the effectiveness of the model on the Star Wars saga.

'There is no terror in the bang, only is the anticipation of it' - Alfred Hitchcock. Yet there is everything in correctly anticipating the bang a movie would make in the box-office. Movies make a high profile, billion dollar industry and prediction of movie revenue can be very lucrative. Predicted revenues can be used …

2018-04-03abs ↗pdf ↗

A shadow diagram is a knot diagram with under-over information omitted; a shadow movie is a sequence of shadow diagrams related by shadow Reidemeister moves. We show that not every shadow movie arises as the shadow of a Reidemeister movie, meaning a sequence of classical knot diagrams related by classical Reidemeister …

2011-06-17abs ↗pdf ↗

Two singular links are cobordant if one can be obtained from the other by singular link isotopy together with a combination of births or deaths of simple unknotted curves, and saddle point transformations. A movie description of a singular link cobordism in 4-space is a sequence of singular link diagrams obtained from …

2015-07-15abs ↗pdf ↗

We present a marked analogue of Carter and Saito's movie theorem. Our definition of marking was chosen to coincide with the markings that arise in link Floer homology. In order to deal with complications arising from certain isotopies, we define three equivalence relations for marked surfaces and work over an equivalen…

2014-07-17abs ↗pdf ↗

In today's day and age when almost every industry has an online presence with users interacting in online marketplaces, personalized recommendations have become quite important. Traditionally, the problem of collaborative filtering has been tackled using Matrix Factorization which is linear in nature. We extend the wor…

2018-07-14abs ↗pdf ↗

Comment classification on cookery channels using BERT and traditional models.

problem Volume of multilingual comments, variable lengths, slang, symbols, and abbreviations make comment classification challenging.
method Evaluated traditional machine learning models (Naive Bayes, KNN, SVM, Random Forest, Decision Trees) and BERT-based models (BERT, DISTILBERT, XLM) for multilingual comment classification.
result XLM was the top-performing BERT model with an accuracy of 67.31, while Random Forest with Term Frequency Vectorizer was the best traditional model with 63.59 accuracy.

Solves the film scheduling and staggered showtimes problem for movie theaters.

problem Maximize attendance and revenue by scheduling films with staggered showtimes.
method Binary integer linear optimization to find optimal schedules for each cluster of neighboring locations.
result Optimal scheduling cannot be done for all locations at once, but must be done for each cluster.

Adapting momentum from optimization to reinforcement learning.

problem Improving the convergence and stability of reinforcement learning algorithms.
method Introducing Momentum Value Iteration (MoVI) by incorporating an average of consecutive state-action value functions, inspired by the concept of momentum in optimization.
result MoVI improves the convergence and stability of reinforcement learning algorithms, as demonstrated by experiments on Atari games.

This project explores several Machine Learning methods to predict movie genres based on plot summaries. Naive Bayes, Word2Vec+XGBoost and Recurrent Neural Networks are used for text classification, while K-binary transformation, rank method and probabilistic classification with learned probability threshold are employe…

2018-01-15abs ↗pdf ↗

The study explains YouTube commenters' behavior using rational inattention models.

problem Understanding and predicting YouTube commenters' behavior.
method Deep embedded clustering for user grouping, Bayesian revealed preferences for rationality testing, and behavioral economics constraints for attention span modeling.
result Most YouTube user groups optimize a Bayesian utility with rationally inattentive constraints.

Relational probabilistic models have the challenge of aggregation, where one variable depends on a population of other variables. Consider the problem of predicting gender from movie ratings; this is challenging because the number of movies per user and users per movie can vary greatly. Surprisingly, aggregation is not…

2017-07-25abs ↗pdf ↗

This comment reexamines Simard et al.'s work in [D. Simard, L. Nadeau, H. Kroger, Phys. Lett. A 336 (2005) 8-15]. We found that Simard et al. calculated mistakenly the local connectivity lengths Dlocal of networks. The right results of Dlocal are presented and the supervised learning performance of feedforward neural n…

2010-02-27abs ↗pdf ↗

DGDS uses documents to center conversations, promising broader AI understanding.

problem DS classification by function is insufficient for complex conversations.
method Classify DS based on document grounding, analyzing classification, architecture, datasets, and models.
result DGDS can better represent current DS development trends and future AI understanding.

Predict missing movie ratings or graph embeddings with low rank matrices.

problem Predicting missing entries in a ratings matrix or graph embeddings with known linear relations.
method Low rank matrix completion approach applied to graph embeddings.
result Effective methods for predicting missing entries in matrices and graph embeddings.

New attacks exploit transfer learning to misclassify text models.

problem Misclassification attacks against transfer learned text classifiers.
method Novel attack algorithms using unintended features from teacher models.
result Transfer learning increases vulnerability to misclassification attacks.