Paper presents content-based models for game recommendation in cold start scenarios.
problem Cold start problem in game recommendation where new games and players have no historical data.
method Uses survey data to develop content-based interaction models that generalize to new games, players, and both.
result Content models outperform collaborative filtering in predicting new interactions.
Hybrid system combines NMF and TV graph for song recommendations.
problem Improving song recommendation systems.
method Formulates a matrix completion problem using NMF and TV on graphs.
result Outperforms models using only low-rank or graph-based information.
Applying traditional collaborative filtering to digital publishing is challenging because user data is very sparse due to the high volume of documents relative to the number of users. Content based approaches, on the other hand, is attractive because textual content is often very informative. In this paper we describe …
Collaborative filtering (CF) and content-based filtering (CBF) have widely been used in information filtering applications. Both approaches have their strengths and weaknesses which is why researchers have developed hybrid systems. This paper proposes a novel approach to unify CF and CBF in a probabilistic framework, n…
Collaborative filtering is used to recommend items to a user without requiring a knowledge of the item itself and tends to outperform other techniques. However, collaborative filtering suffers from the cold-start problem, which occurs when an item has not yet been rated or a user has not rated any items. Incorporating …
Visual spoofing bypasses spam filters and plagiarism detection.
problem Vulnerability in spam filters that can be exploited by visually similar but differently encoded characters.
method Replaces characters with visually similar but differently encoded characters from a different alphabet.
result Spammers can create messages that bypass existing spam filters.
Classical collaborative filtering, and content-based filtering methods try to learn a static recommendation model given training data. These approaches are far from ideal in highly dynamic recommendation domains such as news recommendation and computational advertisement, where the set of items and users is very fluid.…
Proposes a deep hybrid model for better recommendation systems.
problem Limited studies on hybrid recommender systems and the need for more advanced approaches.
method Integrates deep learning with ID embeddings and auxiliary features for improved recommendation.
result Improves recommendation results over deep learning models using ID embeddings.
SeER hybrid model improves song recommendations and explains them.
problem Improving song recommendations and explaining them.
method Collaborative filtering and deep learning sequence models on MIDI content.
result Personalized explanations capture user preferences.
Content based image retrieval, a technique which uses visual contents of image to search images from large scale image databases according to users' interests. This paper provides a comprehensive survey on recent technology used in the area of content based face image retrieval. Nowadays digital devices and photo shari…
Deep learning from manga posters improves anime and manga recommendations.
problem Predicting user preferences for cold-start anime and manga recommendations.
method BALSE model using Illustration2Vec to extract tag information from posters.
result BALSE model significantly improves recommendation quality, especially for less-known mangas.
The paper proposes a framework to recommend suitable conferences for authors.
problem Helping authors choose appropriate conferences for their research papers.
method Three approaches using social network and paper content, applying Correspondence Analysis (CA).
result Models show better performance than existing methods.
A graph traversal algorithm for cold-start news recommendation using named entities.
problem Cold-start news recommendation for articles without user-specific information.
method Graph traversal algorithm and novel weighting scheme for named entities over a knowledge graph.
result Our method produces stronger Pearson correlation to human similarity scores than other cold-start methods.
Study predicts email triage actions using content-based approach.
problem Predicting user triage actions on incoming emails.
method Formulated as a recommendation problem, uses content-based approach with additional similarity features.
result Proposed framework achieves better performance than state-of-the-art deep recommendation methods.
Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and (largely ad-hoc) hybrid systems. We propose a unified probabilistic framework for merging collaborative and content-based recommendations…
Deep learning improves conversational recommender systems.
problem Creating effective goal-oriented dialogue systems through natural language interactions.
method Apply deep learning techniques to conversational recommender systems.
result Deep learning models enhance user preference learning in CRS.
Proposes a new graph-based model for cold-start recommendations.
problem Cold-start problem in Recommender Systems, especially for items with no interaction history.
method Graph-based feature weighting model using probabilities from item-based collaborative filtering.
result Shows improved recommendation quality compared to existing methods.
This paper improves image retrieval accuracy through novel relevance feedback methods.
problem Improving image retrieval accuracy in Content-Based Image Retrieval (CBIR).
method Novel addition to feature re-weighting and classification techniques, focusing on 0-th iteration improvement.
result Significantly improved retrieval accuracy from relevance feedback.
Most content-based image retrieval systems consider either one single query, or multiple queries that include the same object or represent the same semantic information. In this paper we consider the content-based image retrieval problem for multiple query images corresponding to different image semantics. We propose a…
System converts 3D lung nodule images into embeddings for retrieval.
problem Retrieving similar 3D lung nodule images for radiologist decision support.
method 3D deep learning, semantic representation, transfer learning, similarity score.
result System can measure similarity between nodule annotations and CBIR results.
Compression-based similarity measures are effectively employed in applications on diverse data types with a basically parameter-free approach. Nevertheless, there are problems in applying these techniques to medium-to-large datasets which have been seldom addressed. This paper proposes a similarity measure based on com…
Geometric deep learning detects fake news on social media.
problem Detecting fake news on social media due to lack of context understanding.
method Propagation-based geometric deep learning model.
result Highly accurate fake news detection (92.7% ROC AUC).
Efficient sparse attention reduces self-attention complexity and improves model performance.
problem Quadratic compute and memory requirements of self-attention for long sequences.
method Content-based sparse attention with dynamic routing module.
result Routing Transformer achieves state-of-the-art performance on various benchmarks.
Detects fake news with fewer labels using tensor embeddings.
problem Detecting fake news with limited labeled data.
method Represent news articles as tensors, derive embeddings, create graph, propagate labels.
result 75.43% accuracy with 30% labels on a public dataset.
ITAL uses mutual information for active learning in image retrieval.
problem Acquiring meaningful user feedback for content-based image retrieval.
method Information-Theoretic Active Learning (ITAL) maximizing mutual information between predicted relevance and user feedback.
result ITAL achieves state-of-the-art performance across various datasets.
The paper tackles a bandit problem on graphs with smooth functions, aiming to recommend items with high expected ratings.
problem Online learning problems involving graphs, such as content-based recommendation.
method Introduced the notion of effective dimension and proposed two algorithms for solving the problem.
result The algorithms can learn good estimators of user preferences from just tens of nodes evaluations.
Self-supervised method improves CBIR of CT liver images.
problem Limited labeled data and lack of transparency in deep CBIR systems.
method Proposes a self-supervised learning framework with domain-knowledge integration.
result Improved performance and generalization across datasets.
Proposes a graph neural network for personalized news recommendation.
problem Data sparsity in news recommendation systems.
method Heterogeneous graph model + Graph Neural Networks + LSTM attention mechanism.
result Significantly outperforms state-of-the-art methods on news recommendation datasets.
A novel deep learning method predicts Twitter users' locations using multiple data types.
problem Predicting Twitter users' locations on large social networks.
method Combines content-based and network-based approaches using a multi-entry neural network architecture (MENET).
result MENET outperforms state-of-the-art methods by a large margin on three benchmark datasets.
Paper ranks influential Tor Darknet onion domains using content features.
problem Measuring influence of criminal onion domains in Tor Darknet.
method Content-based features from multiple sources, Learning-to-Rank approach.
result Listwise approach outperforms other methods with NDCG of 0.95 for top-10.
Predicts edit survival in peer-production systems.
problem Predicting the survival of edits in large-scale peer-production systems.
method Modeling edit survival as a game between editor skill, component difficulty, and user-component interaction.
result Model significantly outperforms user reputation-based methods and specialized predictors.
Proposes a comprehensive framework for financial product lead recommendations using graph representation learning and link prediction.
problem Challenges in surface lead recommendations for financial products due to changing market scenarios and difficulty in capturing holder's mindset.
method Bi-partite graph representation of financial holders and funds, GraphSage model for learning representations, link prediction model for ranking recommendations.
result The proposed graph ML solution outperforms baseline by 42%, 22%, and 14% in hit rate for top-k recommendations (50, 100, 200) and 18%, 19%, and 18% on unseen holders.
DAM with MRL improves relational reasoning in MANNs.
problem Limited performance of associative memory networks on complex relational reasoning tasks.
method Distributed Associative Memory architecture with Memory Refreshing Loss.
result Enhanced relation reasoning performance of MANNs on long temporal sequence data.
This paper tackles quantizing memory-augmented neural networks, improving their performance and energy efficiency.
problem Quantizing memory-augmented neural networks (MANNs) poses unique challenges not seen in other network types.
method Identified memory addressing as the main issue, proposed a robust quantization method for MANNs.
result Achieved a 22x computation-energy gain with 8-bit fixed-point and binary quantization.
Tutorial on image retrieval techniques for beginners.
problem Efficient image retrieval methods for beginners.
method k-nearest neighbors and support vector machines.
result Provides a hands-on experience with image retrieval techniques.
Deep learning predicts VR head movements for better 360-degree videos.
problem Predicting head movements in 360-degree VR videos.
method Deep learning network using position data and video content for long-term prediction.
result 16.1% improvement in prediction accuracy compared to baseline.
A new system recommends educational content based on student and peer interests.
problem Recommending suitable educational content for students.
method Neural Educational Recommendation Engine (NERE) using a recurrent neural network.
result NERE achieves higher recall and R^2 scores than traditional methods.
New tensor encodings improve retrieval accuracy in deep learning.
problem Deep learning classifiers flatten feature tensors, losing multi-linear structure.
method Proposes structured tensor factorization schemes for improved retrieval.
result Structured tensor encodings achieve retrieval performance similar to Fisher vectors.
Paper proves spectral filters can be transferred between graphs.
problem Proving spectral filters can be transferred between graphs.
method Introducing the Cayley smoothness space and proving filters in this space are linearly stable.
result Graph spectral filters are transferable if they are in the Cayley smoothness space.
This paper studies the problem of learning clusters which are consistently present in different (continuously valued) representations of observed data. Our setup differs slightly from the standard approach of (co-) clustering as we use the fact that some form of `labeling' becomes available in this setup: a cluster is …
In information retrieval, a fundamental goal is to transform a document into concepts that are representative of its content. The term "representative" is in itself challenging to define, and various tasks require different granularities of concepts. In this paper, we aim to model concepts that are sparse over the voca…
This paper discusses sentiment analysis on social media text.
problem Detecting sentiments in short text messages for applications like mental health monitoring.
method Combines concepts from Natural Language Processing and Machine Learning.
result Explains techniques used in sentiment analysis of textual data.
Hierarchical beta process has found interesting applications in recent years. In this paper we present a modified hierarchical beta process prior with applications to hierarchical modeling of multiple data sources. The novel use of the prior over a hierarchical factor model allows factors to be shared across different …
This work prunes CNN filters based on their functionality, not just size.
problem Redundant filters in CNNs waste computation resources.
method Functionality-oriented filter pruning method.
result Pruning based on functionality optimizes computation and interprets filter importance.
A new SOHP filter improves trend estimation in economic time series.
problem Improving trend estimation in nonlinear economic time series.
method Recursive application of one-sided HP filter on updated cyclical components, combined with an incremental HP filtering algorithm.
result Better performance of SOHP filter compared to other HP-type filters on real economic data.
Deep density methods improve filtering in high-dimensional systems.
problem Nonlinear filtering in high-dimensional systems.
method Two deep density methods based on Feynman-Kac formulas and neural networks.
result Logarithmic deep backward stochastic differential equation filter outperforms classical methods in high dimensions.
The paper explores modifications to filter banks for speech recognition.
problem Improving speech recognition accuracy using modified filter banks.
method The authors investigate replacing triangular filters with Gabor or Gammatone filters, and rearranging filter bank computations to integrate features over smaller time scales.
result No significant improvements in phone error rate were observed with the modifications.
Pruning filters in CNNs improves interpretability, showing shape-selective filters are crucial for object recognition.
problem Interpreting the complex decision-making process of CNNs is challenging due to their large number of parameters.
method We developed a greedy structural compression scheme that prunes filters based on the classification accuracy reduction (CAR) index.
result Pruned filters in CNNs, especially those in the first and second layers, are more likely to be shape-selective, indicating their importance in object recognition.