8 research outputs found
Personalized Video Recommendation Using Rich Contents from Videos
Video recommendation has become an essential way of helping people explore
the massive videos and discover the ones that may be of interest to them. In
the existing video recommender systems, the models make the recommendations
based on the user-video interactions and single specific content features. When
the specific content features are unavailable, the performance of the existing
models will seriously deteriorate. Inspired by the fact that rich contents
(e.g., text, audio, motion, and so on) exist in videos, in this paper, we
explore how to use these rich contents to overcome the limitations caused by
the unavailability of the specific ones. Specifically, we propose a novel
general framework that incorporates arbitrary single content feature with
user-video interactions, named as collaborative embedding regression (CER)
model, to make effective video recommendation in both in-matrix and
out-of-matrix scenarios. Our extensive experiments on two real-world
large-scale datasets show that CER beats the existing recommender models with
any single content feature and is more time efficient. In addition, we propose
a priority-based late fusion (PRI) method to gain the benefit brought by the
integrating the multiple content features. The corresponding experiment shows
that PRI brings real performance improvement to the baseline and outperforms
the existing fusion methods
Multi-Feature Discrete Collaborative Filtering for Fast Cold-start Recommendation
Hashing is an effective technique to address the large-scale recommendation
problem, due to its high computation and storage efficiency on calculating the
user preferences on items. However, existing hashing-based recommendation
methods still suffer from two important problems: 1) Their recommendation
process mainly relies on the user-item interactions and single specific content
feature. When the interaction history or the content feature is unavailable
(the cold-start problem), their performance will be seriously deteriorated. 2)
Existing methods learn the hash codes with relaxed optimization or adopt
discrete coordinate descent to directly solve binary hash codes, which results
in significant quantization loss or consumes considerable computation time. In
this paper, we propose a fast cold-start recommendation method, called
Multi-Feature Discrete Collaborative Filtering (MFDCF), to solve these
problems. Specifically, a low-rank self-weighted multi-feature fusion module is
designed to adaptively project the multiple content features into binary yet
informative hash codes by fully exploiting their complementarity. Additionally,
we develop a fast discrete optimization algorithm to directly compute the
binary hash codes with simple operations. Experiments on two public
recommendation datasets demonstrate that MFDCF outperforms the
state-of-the-arts on various aspects
์ฝ๋ ์คํํธ ๋น๋์ค ์ถ์ฒ์์คํ ์ ์ํ ์ปจํ ์ธ ํํ ํ์ต
ํ์๋
ผ๋ฌธ(์์ฌ) -- ์์ธ๋ํ๊ต๋ํ์ : ๋ฐ์ดํฐ์ฌ์ด์ธ์ค๋ํ์ ๋ฐ์ดํฐ์ฌ์ด์ธ์คํ๊ณผ, 2023. 2. ์ด์ค์.Cold-start item recommendation is a long-standing challenge in recommendation systems. A common approach to tackle cold-start problem is using content-based approach, but in movie recommendations, rich information available in raw video contents or textual descriptions has not been fully utilized. In this paper, we propose a general cold-start recommendation framework that learns multimodal content representations from the rich information in raw videos and text, directly optimized over user-item interactions, instead of using embeddings pretrained on proxy pretext task. In addition, we further exploit multimodal alignment of the item contents in a self-supervised manner, revealing great potential in content representation learning. From extensive experiments on public benchmarks, we verify the effectiveness of our method, achieving state-of-the-art performance on cold-start movie recommendation.์ฝ๋ ์คํํธ ์์ดํ
์ถ์ฒ์ ์ถ์ฒ์์คํ
์ฐ๊ตฌ์์ ์ค๋๋ ๋ฌธ์ ์ค ํ๋์ด๋ค. ์ฝ๋ ์คํํธ ๋ฌธ์ ๋ฅผ ํด๊ฒฐํ๊ธฐ ์ํด ํํ ์ฌ์ฉํด์จ ๋ฐฉ๋ฒ์ ์ปจํ
์ธ ๊ธฐ๋ฐ ์ ๊ทผ ๋ฐฉ์์ ์ฌ์ฉํ๋ ๊ฒ์ด์ง๋ง, ์ํ ์ถ์ฒ ์์คํ
๋ถ์ผ์์๋ ์๋ณธ ๋น๋์ค ๋ฐ ์๋ฌธ ์ค๋ช
๋ฑ์ ๋ด์ฌ๋ ํ๋ถํ ์ ๋ณด๋ฅผ ์ถฉ๋ถํ ํ์ฉํด์ค์ง ๋ชปํ๋ค. ๋ณธ ๋
ผ๋ฌธ์์ ์ ์ํ๋ ์ฝ๋ ์คํํธ ์ถ์ฒ ํ๋ ์์ํฌ์์๋ ์๋ณธ ๋น๋์ค์ ํ
์คํธ์ ํ๋ถํ ์ปจํ
์ธ ์ ๋ณด๋ฅผ ๊ธฐ๋ฐ์ผ๋ก ๋ฉํฐ๋ชจ๋ฌ ์ปจํ
์ธ ํํ์ ํ์ตํ๋ ๊ณผ์ ์์, ๋ค๋ฅธ ํ์คํฌ์ ์ฌ์ ํ์ต๋ ์๋ฒ ๋ฉ์ ํ์ฉํ๋ ๋์ ์ ์ -์์ดํ
์ํธ์์ฉ ์ ๋ณด๋ฅผ ์ด์ฉํ์ฌ ์ง์ ์๋ฒ ๋ฉ์ ์ต์ ํํ๋ ๋ฐฉ๋ฒ์ ์ ์ํ๋ค. ๋ ๋์๊ฐ, ๋ณธ ์ฐ๊ตฌ๋ ์๊ธฐ ์ง๋ ํ์ต ๋ฐฉ๋ฒ์ ํตํด ์ฌ๋ฌ ๋ชจ๋ฌ๋ฆฌํฐ๋ก ํํ๋์ด ์๋ ์์ดํ
์ปจํ
์ธ ๋ฅผ ๊ณ ๋ คํจ์ผ๋ก์จ ์ปจํ
์ธ ํํ ํ์ต์ ๋ฐ์ ๊ฐ๋ฅ์ฑ์ ์ฌ์กฐ๋ช
ํ๋ค. ์ต์ข
์ ์ผ๋ก ์ฃผ์ ๋ฒค์น๋งํฌ ๋ฐ์ดํฐ์
์ ๋ํ ๋ค์ํ ์คํ์ ํตํด ๋ณธ ์ฐ๊ตฌ์์ ์ ์ํ๋ ๋ฐฉ๋ฒ๋ก ์ ํจ๊ณผ๋ฅผ ์
์ฆํจ๊ณผ ๋์์ ์ฝ๋ ์คํํธ ์ํ ์ถ์ฒ ๋ถ์ผ์์ ํด๋น ๋ถ์ผ ์ต๊ณ ์ฑ๋ฅ์ ๋ณด์ด๋ ์ฌ์ค์ ํ์ธํ์๋ค.Chapter 1. Introduction 1
Chapter 2. Related Work 7
Chapter 3. Problem Formulation and Notations 10
Chapter 4. Preliminary 12
Chapter 5. The Proposed Method 16
Chapter 6. Experimental Settings 24
Chapter 7. Results and Discussion 28
Chapter 8. Summary and Future Work 36
Bibliography 37
Abstract in Korean 45์
DeepStore: an interaction-aware Wide&Deep model for store site recommendation with attentional spatial embeddings
International audienceStore site recommendation is one of the essential business services in smart cities for brick-and-mortar enterprises. In recent years, the proliferation of multisource data in cities has fostered unprecedented opportunities to the data-driven store site recommendation, which aims at leveraging large-scale user-generated data to analyze and mine users' preferences for identifying the optimal location for a new store. However, most works in store site recommendation pay more attention to a single data source which lacks some significant data (e.g., consumption data and user profile data). In this paper, we aim to study the store site recommendation in a fine-grained manner. Specifically, we predict the consumption level of different users at the store based on multisource data, which can not only help the store placement but also benefit analyzing customer behavior in the store at different time periods. To solve this problem, we design a novel model based on the deep neural network, named DeepStore, which learns low-and high-order feature interactions explicitly and implicitly from dense and sparse features simultaneously. In particular, DeepStore incorporates three modules: 1) the cross network; 2) the deep network; and 3) the linear component. In addition, to learn the latent feature representation from multisource data, we propose two embedding methods for different types of data: 1) the filed embedding and 2) attention-based spatial embedding. Extensive experiments are conducted on a real-world dataset including store data, user data, and point-of-interest data, the results demonstrate that DeepStore outperforms the state-of-the-art models
Personalized Video Recommendation Using Rich Contents from Videos
ยฉ 1989-2012 IEEE. Video recommendation has become an essential way of helping people explore the massive videos and discover the ones that may be of interest to them. In the existing video recommender systems, the models make the recommendations based on the user-video interactions and single specific content features. When the specific content features are unavailable, the performance of the existing models will seriously deteriorate. Inspired by the fact that rich contents (e.g., text, audio, motion, and so on) exist in videos, in this paper, we explore how to use these rich contents to overcome the limitations caused by the unavailability of the specific ones. Specifically, we propose a novel general framework that incorporates arbitrary single content feature with user-video interactions, named as collaborative embedding regression (CER) model, to make effective video recommendation in both in-matrix and out-of-matrix scenarios. Our extensive experiments on two real-world large-scale datasets show that CER beats the existing recommender models with any single content feature and is more time efficient. In addition, we propose a priority-based late fusion (PRI) method to gain the benefit brought by the integrating the multiple content features. The corresponding experiment shows that PRI brings real performance improvement to the baseline and outperforms the existing fusion methods