Cited 0 time in
Ranking Items by the Current-Preferences and Profits: A List-wise Learning-to-Rank Approach to Profit Maximization
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Bae, Hong-Kyun | - |
| dc.contributor.author | Jang, Hae-Ri | - |
| dc.contributor.author | Shin, Won-Yong | - |
| dc.contributor.author | Kim, Sang-Wook | - |
| dc.date.accessioned | 2025-06-12T06:01:53Z | - |
| dc.date.available | 2025-06-12T06:01:53Z | - |
| dc.date.issued | 2025-04 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/207516 | - |
| dc.description.abstract | In e-commerce platforms, profit-aware recommender systems aim to improve the platform’s profits while maintaining high overall accuracy by recommending items with high profits as top-ranked items. We explore two issues faced by existing model-based profit-aware approaches (i.e., MBAs) when training recommendation models for profit enhancement. First, existing MBAs tend to inaccurately infer the item ranking without considering the user’s current preference for each item through their profit-based weighting scheme. Second, through the point-wise learning-to-rank (LTR), the model is optimized solely for the preference score of each item independently rather than being directly optimized for the overall ranking of items. To tackle these issues, we propose a novel MBA that involves three key steps: (S1) defining the Current Preference incorporated with Profit (i.e., CPP) for items; (S2) classifying items through CPP; and (S3) training the model by list-wise LTR based on CPP. Extensive experimental results using real-world platform datasets demonstrate that our approach improves accuracy by approximately 4% and profits by about 24% compared to the best-competing method. | - |
| dc.format.extent | 12 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Association for Computing Machinery, Inc | - |
| dc.title | Ranking Items by the Current-Preferences and Profits: A List-wise Learning-to-Rank Approach to Profit Maximization | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1145/3696410.3714731 | - |
| dc.identifier.scopusid | 2-s2.0-105005142761 | - |
| dc.identifier.wosid | 001505285200413 | - |
| dc.identifier.bibliographicCitation | WWW 2025 - Proceedings of the ACM Web Conference, pp 5010 - 5021 | - |
| dc.citation.title | WWW 2025 - Proceedings of the ACM Web Conference | - |
| dc.citation.startPage | 5010 | - |
| dc.citation.endPage | 5021 | - |
| dc.type.docType | Proceedings Paper | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
| dc.subject.keywordPlus | 'current | - |
| dc.subject.keywordPlus | Commerce platforms | - |
| dc.subject.keywordPlus | E- commerces | - |
| dc.subject.keywordPlus | Item rankings | - |
| dc.subject.keywordPlus | List-wise learning-to-rank | - |
| dc.subject.keywordPlus | Model-based OPC | - |
| dc.subject.keywordPlus | Overall accuracies | - |
| dc.subject.keywordPlus | Point wise | - |
| dc.subject.keywordPlus | Profit maximization | - |
| dc.subject.keywordPlus | Weighting scheme | - |
| dc.subject.keywordAuthor | Collaborative filtering | - |
| dc.subject.keywordAuthor | list-wise learning-to-rank | - |
| dc.subject.keywordAuthor | profit maximization | - |
| dc.subject.keywordAuthor | recommender systems | - |
| dc.identifier.url | https://dl.acm.org/doi/10.1145/3696410.3714731 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
