Aesthetic-based clothing recommendation improves user satisfaction.
problem Lack of aesthetic features in existing clothing recommendation methods.
method Introduce aesthetic features extracted by a neural network and incorporate them into a personalized tensor factorization model.
result Our approach significantly outperforms state-of-the-art recommendation methods.
Outfittery uses machine learning to help stylists choose appropriate fashion items.
problem Selecting appropriate fashion items and ensuring relevance to customers.
method Combining machine learning with human expertise to recommend items by style fit and relevance.
result The method successfully recommends fashion items by style fit and relevance.
A new framework uses pixel-based images for realistic cloth animations.
problem Creating virtual cloth deformations that closely match real clothing.
method Reinterpreting cloth deformation as a 2D pattern space and using CNNs.
result Our approach achieves realistic cloth animations without accurate body shapes.
Robotic clothing manipulation improved with fashion image analysis techniques.
problem Automated identification of clothing categories and landmarks for robotic tasks.
method Training data augmentation methods and rotation invariant convolutions.
result Our approach outperforms state-of-the-art models on unseen datasets.
Capsule Networks improve clothing retrieval without landmark info.
problem In-shop clothing retrieval performance improvement.
method Triplet-based Capsule Network architecture with SC and RC blocks.
result Triplet Capsule Networks outperform FashionNet and SOTA architectures.
Understanding customer sentiments is of paramount importance in marketing strategies today. Not only will it give companies an insight as to how customers perceive their products and/or services, but it will also give them an idea on how to improve their offers. This paper attempts to understand the correlation of diff…
Atlas dataset categorizes clothing products with high accuracy.
problem Lack of real-world datasets for e-commerce clothing product categorization.
method Collected and labeled a dataset of 186,150 images, established a benchmark for image classification and sequence models.
result Benchmark model achieved a micro f-score of 0.92.
Proposes ADC for cross-domain recommendation balancing user preferences.
problem Users' preferences change across different domains (e.g., social media, e-commerce).
method Designs a neural architecture and cross-domain loss function to adaptively balance user preferences.
result ADC model effectively balances the impact of domains with different complexities.
A new model for simulating cloth manipulation in robots, accurate to within 1cm.
problem Accurately simulating cloth manipulation in robots, especially in moderate stress environments.
method A continuous, isometric strain model for textiles, treating them as inextensible surfaces with only isometric motions. Aerodynamic effects are incorporated through virtual uncoupling of mass.
result Simulations are accurate to within 1cm compared to real-world manipulation, even with coarse meshes.
This study examines how fashion consumption affects self-confidence and buying behavior in Iranian consumers.
problem Understanding the role of self-confidence in fashion buying behavior.
method A questionnaire was used to collect data from 400 consumers in Tehran's clothing market. Structural equations and factor analysis were employed to test the model.
result Interest in fashion, personal taste, utilitarianism, and new products positively impact self-confidence, and self-confidence positively impacts fashion buying behavior.
Framework learns item representations from text data for complementary and similar items.
problem Generating accurate complementary item recommendations from textual data.
method Quadruplet network learning framework for latent space representation of items.
result Items are placed closer together in latent space for similar and complementary items compared to non-complementary items.
This work learns visual representations for deformable objects using contrastive estimation.
problem Challenges in learning plannable visual representations for deformable objects.
method Jointly optimizes visual representation and dynamics models using contrastive estimation.
result Substantial improvements in performance over standard model-based learning techniques.
NoiseRank reduces label noise without supervision, improving classification accuracy.
problem Label noise in datasets from noisy channels.
method NoiseRank uses Markov Random Fields to estimate and rank instances based on their noise probability.
result NoiseRank improves classification accuracy on noisy datasets.
Generates outfits for e-commerce using neural networks.
problem Manual outfit creation by stylists is inefficient and not scalable.
method Multilayer neural network with visual and textual features.
result Generated outfits are preferred by users 21-34% more often.
In this paper, we propose a method that disentangles the effects of multiple input conditions in Generative Adversarial Networks (GANs). In particular, we demonstrate our method in controlling color, texture, and shape of a generated garment image for computer-aided fashion design. To disentangle the effect of input at…
Paper generates high-resolution fashion images based on body pose.
problem Limited variety of outfit images for shopping.
method Generative model trained on body pose and style transfer.
result Realistic high-resolution images of models in custom outfits.
We present a novel method to solve image analogy problems : it allows to learn the relation between paired images present in training data, and then generalize and generate images that correspond to the relation, but were never seen in the training set. Therefore, we call the method Conditional Analogy Generative Adver…
New method improves semi-supervised learning with missing labels.
problem Reliable classification with missing labels in semi-supervised learning.
method Develops a new semi-supervised learning approach that relaxes assumptions about unlabeled data.
result Provides classifiers that reliably quantify label uncertainty.
Deviation-based learning improves recommender systems by abstaining from recommending choices users might follow.
problem Recommender systems learn from user choices but can stall if users blindly follow recommendations.
method The recommender learns user knowledge by observing choices, abstaining from recommending a choice when multiple alternatives produce similar payoffs.
result Learning rate and social welfare improve when the recommender abstains from recommending certain choices.
CAFL breaks feedback loops in recommender systems using causal inference.
problem Feedback loops in recommender systems compromise recommendation quality and homogenize user behavior.
method Causal Adjustment for Feedback Loops (CAFL) algorithm that breaks feedback loops using causal inference.
result CAFL improves recommendation quality compared to prior correction methods.
Proposes a new model for diversified interactive recommendation.
problem Previous methods focus on optimizing recommendation accuracy, ignoring diversity.
method DC2B model using determinantal point process and Thompson sampling-based variational Bayesian inference. result Demonstrates effectiveness of the proposed method through extensive experiments.
Poisoning attacks improve graph-based recommender system recommendations.
problem Designing effective poisoning attacks for graph-based recommender systems.
method Formulated as an optimization problem, solved with techniques to assign rating scores to fake users.
result Outperforms existing attacks for graph-based recommender systems, recommending target items to 580 times more normal users.
Paper introduces a new job recommendation method using candidate job selection progression.
problem Traditional job recommendation methods are either filter-based or feature-based, limiting serendipitous and cold-start recommendations.
method Uses machine learning to analyze candidate job selection progression and derive latent competencies.
result Achieved best click-through rate in a real-world job recommender system.
Machine learning biases in job recommendations can lead to unfair outcomes.
problem Biased recommendations from recommender systems in job matching.
method Addressing biases at various stages of recommender systems training and deployment.
result Techniques can reduce bias in job recommendations, ensuring fair outcomes.
Paper proposes a hybrid system to address bias in recommender systems.
problem Bias in recommender systems exacerbates existing societal inequalities.
method Hybrid approach combining multiple similarity measures, content, and demographic info.
result Our model provides more accurate and fairer recommendations.
Normalizing flows fail to detect OOD data due to learning local pixel correlations.
problem Detecting out-of-distribution data in machine learning systems.
method Investigated why normalizing flows fail to distinguish between in- and out-of-distribution data, and modified flow architecture to improve OOD detection.
result Modifying flow architecture can improve OOD detection by biasing the flow towards learning semantic structure of the target data.
DeepFair improves fairness in recommender systems without sacrificing accuracy.
problem Lack of bias management in recommender systems leads to unfair recommendations for minority groups.
method Deep Learning based Collaborative Filtering algorithm that balances fairness and accuracy.
result It is possible to make fair recommendations without losing significant accuracy.
We present a theoretically grounded approach to train deep neural networks, including recurrent networks, subject to class-dependent label noise. We propose two procedures for loss correction that are agnostic to both application domain and network architecture. They simply amount to at most a matrix inversion and mult…
The paper aims to define a benchmark for deep learning recommendation models.
problem Insufficient benchmarking for deep learning recommendation models.
method Synthesizes modeling strategies, defines desirable characteristics, and summarizes advice from the MLPerf Recommendation Advisory Board.
result Defines an industry-relevant benchmark for deep learning recommendation models.
Interprets feature interactions in ad-click prediction models.
problem Improving interpretability of black-box recommender systems.
method Interprets feature interactions from a source model and encodes them in a target model.
result Interpretations significantly outperform existing recommender models.
New algorithm uses negative user preferences to improve recommendation quality.
problem Insufficient utilization of negative user preferences in recommender systems.
method Explicitly models negative user preferences to recommend more positive items.
result Improves recommendation quality by increasing accuracy and reducing negative items.
New cold-start recommendation method for recommender systems.
problem Making accurate recommendations for users and items with limited data.
method Proposes a faster cold-start prediction formula in collective matrix factorization models.
result Improved cold-start recommendations with reliable predictions for new users, better than non-personalized recommendations.
Survey on using knowledge graphs for better recommender systems.
problem Data sparsity and cold start issues in recommender systems.
method Utilizes knowledge graphs to improve recommendation accuracy and provide explanations.
result Advantages of knowledge graph-based recommender systems.
Advances citation and subject label recommendation using multi-modal adversarial autoencoders.
problem Improving recommendation systems for citations and subject labels.
method Multi-modal adversarial autoencoders with adversarial regularization, sparsity, and input modality analysis.
result Adversarial regularization consistently improves recommendation performance.
Data poisoning attacks can manipulate recommender systems to recommend target items.
problem Attacks on recommender systems to influence top-N item recommendations.
method Formulated as an optimization problem, solved using influence function to select influential users.
result Effective data poisoning attacks that outperform existing methods.
Proposes CF-SFL to improve sparse data recommendation.
problem Poor performance of CF in sparse data.
method Generative user feedback loop to simulate user feedback.
result Improves recommendation results on multiple datasets.
The paper improves recommendation models by considering user interactions with recommended items.
problem Improving next item prediction in recommendation systems.
method Extending RNN framework with a recommendation action module and state-action fusion module.
result Improved performance on next item prediction compared to baselines.
A new method for better recommendation by accounting for hidden factors.
problem Hidden factors affecting both watched movies and ratings.
method Two-stage probabilistic models to remove bias due to confounding.
result Improved recommendation and stable performance against interventions.
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.
Develops a real-time exercise recommendation system using deep learning.
problem Improving accuracy in exercise recommendation systems without user feedback.
method Deep recurrent neural network with attention mechanisms, real-time expert feedback.
result Improved accuracy in exercise recommendation system after real-time active learning.
Survey of IoT recommendation systems and their limitations.
problem Traditional recommender systems fail to handle IoT data.
method Comprehensive review of IoT recommender systems and techniques.
result Proposes a reference framework for future research.
Scalable hyperbolic recommender system outperforms Euclidean models on complex networks.
problem Complex network datasets require more efficient recommendation models.
method Used hyperbolic geometry, novel hyperbolic model, and Einstein midpoint for asymmetric recommendations.
result Hyperbolic recommender systems significantly outperform Euclidean models on complex network datasets.
ComiRec framework predicts user interests for personalized recommendations.
problem Predicting user interests from sequential behavior data.
method ComiRec framework captures multiple user interests and balances recommendation accuracy and diversity.
result ComiRec achieves significant improvements over state-of-the-art models in sequential recommendation.
In this paper, we investigate the common scenario where every candidate item for recommendation is characterized by a maximum capacity, i.e., number of seats in a Point-of-Interest (POI) or size of an item's inventory. Despite the prevalence of the task of recommending items under capacity constraints in a variety of s…
Recommender systems play a crucial role in mitigating the problem of information overload by suggesting users' personalized items or services. The vast majority of traditional recommender systems consider the recommendation procedure as a static process and make recommendations following a fixed strategy. In this paper…
Unified deep framework for personalized recommendations with uncertainty.
problem Uncertainty in user preferences in recommendation systems.
method Gaussian embeddings, Monte-Carlo sampling, convolutional neural networks.
result Superior performance in recommendation accuracy compared to state-of-the-art models.
A study compares local music recommendation algorithms, finding neighborhood-based methods perform best.
problem Cold-start problem for local artists with little user preference data.
method Comparison of three recommender system algorithms (IIN, ALS, BPR) on local music recommendation task.
result Neighborhood-based approach (IIN) performs best for local music recommendation.
Deep neural networks improve recommendation accuracy in marketplaces.
problem Measuring and optimizing recommender performance in marketplaces.
method Hybrid item representation models, sequence-based models, and multi-armed bandit models.
result Promising deep neural network recommenders are currently in production at FINN.no.