File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/3450353
- Scopus: eid_2-s2.0-85119096804
- WOS: WOS:000717303100014
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Inductive Contextual Relation Learning for Personalization
Title | Inductive Contextual Relation Learning for Personalization |
---|---|
Authors | |
Keywords | content-based recommendation node embedding Personalization relation learning |
Issue Date | 2021 |
Citation | ACM Transactions on Information Systems, 2021, v. 39, n. 3, article no. 35 How to Cite? |
Abstract | Web personalization, e.g., recommendation or relevance search, tailoring a service/product to accommodate specific online users, is becoming increasingly important. Inductive personalization aims to infer the relations between existing entities and unseen new ones, e.g., searching relevant authors for new papers or recommending new items to users. This problem, however, is challenging since most of recent studies focus on transductive problem for existing entities. In addition, despite some inductive learning approaches have been introduced recently, their performance is sub-optimal due to relatively simple and inflexible architectures for aggregating entity's content. To this end, we propose the inductive contextual personalization (ICP) framework through contextual relation learning. Specifically, we first formulate the pairwise relations between entities with a ranking optimization scheme that employs neural aggregator to fuse entity's heterogeneous contents. Next, we introduce a node embedding term to capture entity's contextual relations, as a smoothness constraint over the prior ranking objective. Finally, the gradient descent procedure with adaptive negative sampling is employed to learn the model parameters. The learned model is capable of inferring the relations between existing entities and inductive ones. Thorough experiments demonstrate that ICP outperforms numerous baseline methods for two different applications, i.e., relevant author search and new item recommendation. |
Persistent Identifier | http://hdl.handle.net/10722/308685 |
ISSN | 2023 Impact Factor: 5.4 2023 SCImago Journal Rankings: 2.262 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Chuxu | - |
dc.contributor.author | Yao, Huaxiu | - |
dc.contributor.author | Yu, Lu | - |
dc.contributor.author | Huang, Chao | - |
dc.contributor.author | Song, Dongjin | - |
dc.contributor.author | Chen, Haifeng | - |
dc.contributor.author | Jiang, Meng | - |
dc.contributor.author | Chawla, Nitesh V. | - |
dc.date.accessioned | 2021-12-08T07:49:55Z | - |
dc.date.available | 2021-12-08T07:49:55Z | - |
dc.date.issued | 2021 | - |
dc.identifier.citation | ACM Transactions on Information Systems, 2021, v. 39, n. 3, article no. 35 | - |
dc.identifier.issn | 1046-8188 | - |
dc.identifier.uri | http://hdl.handle.net/10722/308685 | - |
dc.description.abstract | Web personalization, e.g., recommendation or relevance search, tailoring a service/product to accommodate specific online users, is becoming increasingly important. Inductive personalization aims to infer the relations between existing entities and unseen new ones, e.g., searching relevant authors for new papers or recommending new items to users. This problem, however, is challenging since most of recent studies focus on transductive problem for existing entities. In addition, despite some inductive learning approaches have been introduced recently, their performance is sub-optimal due to relatively simple and inflexible architectures for aggregating entity's content. To this end, we propose the inductive contextual personalization (ICP) framework through contextual relation learning. Specifically, we first formulate the pairwise relations between entities with a ranking optimization scheme that employs neural aggregator to fuse entity's heterogeneous contents. Next, we introduce a node embedding term to capture entity's contextual relations, as a smoothness constraint over the prior ranking objective. Finally, the gradient descent procedure with adaptive negative sampling is employed to learn the model parameters. The learned model is capable of inferring the relations between existing entities and inductive ones. Thorough experiments demonstrate that ICP outperforms numerous baseline methods for two different applications, i.e., relevant author search and new item recommendation. | - |
dc.language | eng | - |
dc.relation.ispartof | ACM Transactions on Information Systems | - |
dc.subject | content-based recommendation | - |
dc.subject | node embedding | - |
dc.subject | Personalization | - |
dc.subject | relation learning | - |
dc.title | Inductive Contextual Relation Learning for Personalization | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1145/3450353 | - |
dc.identifier.scopus | eid_2-s2.0-85119096804 | - |
dc.identifier.volume | 39 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | article no. 35 | - |
dc.identifier.epage | article no. 35 | - |
dc.identifier.eissn | 1558-2868 | - |
dc.identifier.isi | WOS:000717303100014 | - |