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,181 papers · 148 categories

Trend · papers per month

24497397 · Jun 202019922001200920182026
48 results for hybrid recommender

A hybrid approach uses RNNs to recommend news articles based on context and session history.

problem Challenging news recommendation due to varying user interests and factors.
method Context-aware, hybrid, deep learning approach using RNNs with additional information types.
result Significantly higher recommendation accuracy and catalog coverage compared to other session-based algorithms.

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.

Hybrid system matches patients with family doctors based on trust and history.

problem Matching patients with suitable family doctors in primary care.
method Hybrid recommender system combining patient trust from consultation histories and temporal dynamics.
result Predictive accuracy is higher than heuristic and collaborative filtering approaches, and trust measure improves performance.

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 …

2014-06-09abs ↗pdf ↗

Hybrid Deep Embedding for aspect-level explanations in recommendations.

problem Challenges in personalization, dynamic explanations, and aspect-level granularity in recommendation systems.
method Proposes Hybrid Deep Embedding (HDE) to learn dynamic embeddings for user and item preferences, and aspect-level quality vectors.
result Demonstrates improved recommending performance and dynamic aspect-level explanations.

HyperFair integrates fairness in recommender systems using probabilistic soft logic.

problem Ensuring fairness in recommender systems across diverse domains.
method Soft fairness constraints integrated as regularization in a joint inference objective function.
result HyperFair improves fairness of predictions from black-box models and hybrid systems.

ASOS improves fashion product recommendations by learning from unstructured data.

problem Lack of consistent product information in e-commerce.
method Developed a hybrid recommender system to learn product attributes from unstructured data.
result Quantitative understanding of products improves recommendation accuracy.

Paper proposes DCT for efficient hybrid parallel training of large recommendation models.

problem Training large recommendation models at scale with efficient communication.
method Dynamic Communication Thresholding (DCT) for both Data Parallelism and Model Parallelism.
result Reduces communication by 100x and 20x during DP and MP, respectively, improving training time by 37%.

A deep learning architecture for news session-based recommendations.

problem Challenges in news recommendation systems, including sparse user profiling and dynamic user preferences.
method Hybrid approach combining text and metadata features, session-based recommendations with Recurrent Neural Networks, and temporal offline evaluation.
result Significant improvement in top-n accuracy and ranking metrics (10% Hit Rate and 13% MRR) over best benchmark methods.

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.

HybridSVD combines user and item info for efficient, flexible recommendations.

problem Lack of effective methods for incorporating both user and item side information in collaborative filtering.
method Hybrid algorithm using PureSVD with generalized singular value decomposition and cold start solution.
result Superior performance compared to similar hybrid models on various datasets.

We present our solution to the job recommendation task for RecSys Challenge 2016. The main contribution of our work is to combine temporal learning with sequence modeling to capture complex user-item activity patterns to improve job recommendations. First, we propose a time-based ranking model applied to historical obs…

2016-08-11abs ↗pdf ↗

CHAMELEON tackles news recommendation using deep learning, addressing cold-start issues.

problem Personalizing user experiences in a dynamic news search space.
method Modular reference architecture with different neural building blocks, leveraging user and article context, and modeling temporal decay and concept drift.
result CHAMELEON outperforms traditional and state-of-the-art session-based recommendation algorithms in accuracy, item coverage, novelty, and reduced item cold-start problem.

A new model VCM improves collaborative filtering by synchronously linking two VAEs.

problem Cold start and data sparsity issues in CF-based recommender systems.
method Proposes a variational collaborative model (VCM) that synchronously links two VAEs.
result VCM outperforms state-of-the-art methods on real-life datasets.

Survey of deep learning methods for recommender systems challenges.

problem Cold start and candidate generation challenges in recommender systems.
method Taxonomy of deep learning techniques addressing cold start and candidate generation problems.
result Taxonomy of deep learning techniques to address recommender systems challenges.

Adverts optimize organic traffic by strategically bidding in e-commerce feeds.

problem Maximizing organic traffic through strategic advertising in e-commerce feeds.
method Proposes a novel Leverage optimization problem and a Hybrid Training Leverage Bidding (HTLB) algorithm to optimize traffic.
result Demonstrates superior performance of the HTLB algorithm in optimizing organic traffic.

CATA++ improves scientific article recommendations by learning latent spaces with attention.

problem Natural data sparsity limits MF performance in recommender systems.
method CATA++ uses a dual autoencoder with attention to learn latent spaces from content and contextual information.
result CATA++ significantly improves MF performance on real-world datasets.

A fast method estimates correlations in hybrid systems using observable market data.

problem Estimating instantaneous correlations in hybrid systems from observable data.
method Empirical correlations between observable market quantities are used to estimate state variables' correlations. Linear systems are involved, and the matrix is converted to positive semidefinite if necessary.
result The estimates are reasonably accurate, especially with more than 1,000 data points.

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.

Hybrid model improves wind speed prediction accuracy using MLP and WOA.

problem Improving wind speed prediction accuracy for renewable energy control.
method Combining MLP with Whale Optimization Algorithm (WOA) for data preprocessing and model optimization.
result The hybrid MLP-WOA model outperformed standalone MLP model in wind speed prediction accuracy.

KGAT uses knowledge graphs to improve recommendation accuracy and explainability.

problem Accurate, diverse, and explainable recommendations require side information and collaborative signals.
method KGAT models high-order relations in a knowledge graph by propagating embeddings and using attention mechanisms.
result KGAT significantly outperforms state-of-the-art methods on public benchmarks.

HabitatAgent offers a multi-agent system for transparent housing consultation.

problem Opaque reasoning and brittle multi-constraint handling in housing recommendation systems.
method HabitatAgent is a multi-agent architecture with specialized roles for memory, retrieval, generation, and validation.
result HabitatAgent achieves 95% accuracy in real user consultation scenarios, significantly outperforming a strong baseline.

Hybrid approach combines topic and graph embeddings for legal document clustering.

problem Challenges in classifying legal texts due to domain-specific language and limited labeled data.
method Combines unsupervised topic and graph embeddings with a supervised model.
result Improves clustering quality over text-only or graph-only embeddings.

Defines non-parabolic curves in spatial hybrid space with applications.

problem Defining and analyzing non-parabolic spatial hybrid framed curves.
method Definition and proof of existence and uniqueness theorem for non-parabolic spatial hybrid framed curves.
result Existence and uniqueness theorem for non-parabolic spatial hybrid framed curves.

xDeepInt learns both vector-wise and bit-wise feature interactions.

problem Learning feature interactions for CTR prediction and recommendation.
method Polynomial Interaction Network (PIN) architecture with subspace-crossing mechanism.
result xDeepInt outperforms state-of-the-art models in CTR prediction and recommendation.

Hybrid subgroups found in non-arithmetic PU(2,1) lattices.

problem Exploring hybrid subgroups in non-arithmetic PU(2,1) lattices.
method Exploring hybrid subgroups of certain non-arithmetic lattices in PU(2,1). Showing that Mostow's lattices are virtually hybrids and some are hybrids of two non-commensurable arithmetic lattices in PU(1,1).
result Mostow's lattices are virtually hybrids and some are hybrids of two non-commensurable arithmetic lattices in PU(1,1).