{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T01:06:34Z","timestamp":1770685594587,"version":"3.49.0"},"reference-count":46,"publisher":"Emerald","issue":"8","license":[{"start":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T00:00:00Z","timestamp":1567382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K"],"published-print":{"date-parts":[[2019,9,2]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>Online advertisement brings huge revenue to many websites. There are many types of online advertisement; this paper aims to focus on the online banner ads which are usually placed in a particular news website. The investigated news website adopts a pay-per-ad payment model, where the advertisers are charged when they rent a banner from the website during a particular period. In this payment model, the website needs to ensure that the ad pushed frequency of each ad on the banner is similar. Under such advertisement push rules, an ad-recommendation mechanism considering ad push fairness is required.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>The authors proposed a novel ad recommendation method that considers both ad-push fairness and personal interests. The authors take every ad\u2019s exposure time into consideration and investigate users\u2019 three different usage experiences in the website to identify the main factors affecting the interests of users. Online ad recommendation is conducted on the investigated news website.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The results of the experiments show that the proposed approach performs better than the traditional approach. This method can not only enhance the average click rate of all ads in the website but also ensure reasonable fairness of exposure frequency of each ad. The online experiment results demonstrate the effectiveness of this approach.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>Existing researches had not considered both the advertisement recommendation and ad-push fairness together. With the proposed novel ad recommendation model, the authors can improve the ad click-through rate of ads with reasonable push fairness. The website provider can thereby increase the commercial value of advertising and user satisfaction.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/k-05-2018-0216","type":"journal-article","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T13:27:04Z","timestamp":1540301224000},"page":"1586-1605","source":"Crossref","is-referenced-by-count":7,"title":["Advertisement recommendation based on personal interests and ad push fairness"],"prefix":"10.1108","volume":"48","author":[{"given":"Duen-Ren","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yu-Shan","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Ya-Han","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Kuan-Yu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"issue":"8","key":"key2019092314100164100_ref001","doi-asserted-by":"crossref","first-page":"2777","DOI":"10.1016\/j.eswa.2012.10.068","article-title":"Audience targeting by B-to-B advertisement classification: a neural network approach","volume":"40","year":"2013","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"key2019092314100164100_ref002","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1108\/K-06-2017-0196","article-title":"Recommender systems: a systematic review of the state of the art literature and suggestions for future research","volume":"47","year":"2018","journal-title":"Kybernetes"},{"key":"key2019092314100164100_ref003","doi-asserted-by":"crossref","unstructured":"Attenberg, J., Pandey, S. and Suel, T. (2009), \u201cModeling and predicting user behavior in sponsored search\u201d, Paper presented at the Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, Paris.","DOI":"10.1145\/1557019.1557135"},{"key":"key2019092314100164100_ref004","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.eswa.2017.06.020","article-title":"User trends modeling for a content-based recommender system","volume":"87","year":"2017","journal-title":"Expert Systems with Applications"},{"issue":"22","key":"key2019092314100164100_ref005","doi-asserted-by":"crossref","first-page":"8520","DOI":"10.1016\/j.eswa.2015.07.007","article-title":"Feature selection using joint mutual information maximisation","volume":"42","year":"2015","journal-title":"Expert Systems with Applications"},{"key":"key2019092314100164100_ref006","first-page":"993","article-title":"Latent dirichlet allocation","volume":"3","year":"2003","journal-title":"The Journal of Machine Learning Research"},{"key":"key2019092314100164100_ref007","unstructured":"Breese, J.S., Heckerman, D. and Kadie, C. (1998), \u201cEmpirical analysis of predictive algorithms for collaborative filtering\u201d, Paper presented at the Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence."},{"issue":"4","key":"key2019092314100164100_ref008","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1021240730564","article-title":"Hybrid recommender systems: survey and experiments","volume":"12","year":"2002","journal-title":"User Modeling and User-Adapted Interaction"},{"key":"key2019092314100164100_ref009","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Agarwal, D. and Josifovski, V. (2008), \u201cContextual advertising by combining relevance with click feedback\u201d, Paper presented at the Proceedings of the 17th international conference on World Wide Web, Beijing.","DOI":"10.1145\/1367497.1367554"},{"key":"key2019092314100164100_ref010","unstructured":"Chen, Y.-T. and Kao, H.-Y. (2013), \u201cConstructing social intentional corpora to predict click-through rate for search advertising\u201d, Paper presented at the 25th Conference on Computational Linguistics and Speech Processing (ROCLING 2013), Kaohsiung, Taiwan."},{"key":"key2019092314100164100_ref011","volume-title":"Elements of Information Theory","year":"2012"},{"key":"key2019092314100164100_ref012","unstructured":"Dembczynski, K., Kotlowski, W. and Weiss, D. (2008), \u201cPredicting ads click-through rate with decision rules\u201d, Paper presented at the Workshop on targeting and ranking in online advertising, Beijing."},{"key":"key2019092314100164100_ref013","unstructured":"Graepel, T., Candela, J.Q., Borchert, T. and Herbrich, R. (2010), \u201cWeb-scale bayesian click-through rate prediction for sponsored search advertising in microsoft\u2019s bing search engine\u201d, Paper presented at the Proceedings of the 27th International Conference on Machine Learning (ICML-10), Haifa."},{"issue":"Supplement 1","key":"key2019092314100164100_ref014","doi-asserted-by":"crossref","first-page":"5228","DOI":"10.1073\/pnas.0307752101","article-title":"Finding scientific topics","volume":"101","year":"2004","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"9","key":"key2019092314100164100_ref015","doi-asserted-by":"crossref","first-page":"1342","DOI":"10.1108\/K-08-2015-0221","article-title":"Colleague recommender system in the expert cloud using features matrix","volume":"45","year":"2016","journal-title":"Kybernetes"},{"key":"key2019092314100164100_ref016","doi-asserted-by":"crossref","unstructured":"Hill, W., Stead, L., Rosenstein, M. and Furnas, G. (1995), \u201cRecommending and evaluating choices in a virtual community of use\u201d, Paper presented at the Proceedings of the SIGCHI conference on Human factors in computing systems, Denver, CO.","DOI":"10.1145\/223904.223929"},{"issue":"14","key":"key2019092314100164100_ref017","doi-asserted-by":"crossref","first-page":"6371","DOI":"10.1016\/j.eswa.2014.04.019","article-title":"MIFS-ND: a mutual information-based feature selection method","volume":"41","year":"2014","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"key2019092314100164100_ref018","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/245108.245126","article-title":"GroupLens: applying collaborative filtering to usenet news","volume":"40","year":"1997","journal-title":"Communications of the ACM"},{"issue":"8","key":"key2019092314100164100_ref019","article-title":"Matrix factorization techniques for recommender systems","volume":"42","year":"2009","journal-title":"IEEE Computer"},{"issue":"3","key":"key2019092314100164100_ref020","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1108\/K-10-2014-0212","article-title":"A collaborative filtering similarity measure based on potential field","volume":"45","year":"2016","journal-title":"Kybernetes"},{"issue":"10","key":"key2019092314100164100_ref021","doi-asserted-by":"crossref","first-page":"1753","DOI":"10.1108\/K-03-2017-0096","article-title":"Product recommendation incorporating the consideration of product performance and customer service factors","volume":"46","year":"2017","journal-title":"Kybernetes"},{"issue":"3","key":"key2019092314100164100_ref022","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1108\/K-10-2014-0207","article-title":"An approach to task-oriented knowledge recommendation based on multi-granularity fuzzy linguistic method","volume":"44","year":"2015","journal-title":"Kybernetes"},{"issue":"1","key":"key2019092314100164100_ref023","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/MIC.2003.1167344","article-title":"Amazon.com recommendations: item-to-item collaborative filtering","volume":"7","year":"2003","journal-title":"IEEE Internet Computing"},{"issue":"10","key":"key2019092314100164100_ref024","doi-asserted-by":"crossref","first-page":"2100","DOI":"10.1002\/asi.22705","article-title":"Document recommendations based on knowledge flows: a hybrid of personalized and group-based approaches","volume":"63","year":"2012","journal-title":"Journal of the American Society for Information Science and Technology"},{"issue":"3","key":"key2019092314100164100_ref025","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1108\/K-08-2017-0319","article-title":"Recommender system based on social influence and the virtual house bandwagon effect in virtual worlds","volume":"47","year":"2018","journal-title":"Kybernetes"},{"issue":"2","key":"key2019092314100164100_ref026","first-page":"799","article-title":"Evaluating click-through-rates of recommended ads displaying in different page groups","volume":"10","year":"2014","journal-title":"Journal of Computational Information Systems"},{"key":"key2019092314100164100_ref027","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.ins.2016.12.047","article-title":"Combining tag correlation and user social relation for microblog recommendation","volume":"385-386","year":"2017","journal-title":"Information Sciences"},{"key":"key2019092314100164100_ref028","doi-asserted-by":"crossref","unstructured":"Mooney, R.J. and Roy, L. (2000), \u201cContent-based book recommending using learning for text categorization\u201d, Paper presented at the Proceedings of the fifth ACM conference on Digital libraries.","DOI":"10.1145\/336597.336662"},{"issue":"3","key":"key2019092314100164100_ref029","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s11280-010-0084-2","article-title":"A wikipedia matching approach to contextual advertising","volume":"13","year":"2010","journal-title":"World Wide Web"},{"key":"key2019092314100164100_ref030","doi-asserted-by":"crossref","unstructured":"Pazzani, M. and Billsus, D. (2007), Content-Based Recommendation Systems. Paper Presented at the in: The Adaptive Web, Springer, Berlin\/Heidelber LNCS 4321.","DOI":"10.1007\/978-3-540-72079-9_10"},{"key":"key2019092314100164100_ref031","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.eswa.2015.11.023","article-title":"A multi-level collaborative filtering method that improves recommendations","volume":"48","year":"2016","journal-title":"Expert Systems with Applications"},{"key":"key2019092314100164100_ref032","unstructured":"Regelson, M. and Fain, D. (2006), \u201cPredicting click-through rate using keyword clusters\u201d, Paper presented at the Proceedings of the Second Workshop on Sponsored Search Auctions, Ann Arbor, MI."},{"key":"key2019092314100164100_ref033","doi-asserted-by":"crossref","unstructured":"Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P. and Riedl, J. (1994), \u201cGroupLens: an open architecture for collaborative filtering of netnews\u201d, Paper presented at the Proceedings of the 1994 ACM conference on Computer supported cooperative work.","DOI":"10.1145\/192844.192905"},{"key":"key2019092314100164100_ref034","doi-asserted-by":"crossref","unstructured":"Richardson, M., Dominowska, E. and Ragno, R. (2007), \u201cPredicting clicks: estimating the click-through rate for new ads\u201d, Paper presented at the Proceedings of the 16th international conference on World Wide Web, Banff, Alberta.","DOI":"10.1145\/1242572.1242643"},{"key":"key2019092314100164100_ref035","volume-title":"Information Retrieval","year":"1979"},{"key":"key2019092314100164100_ref036","doi-asserted-by":"crossref","unstructured":"Sarwar, B., Karypis, G., Konstan, J. and Riedl, J. (2001), \u201cItem-based collaborative filtering recommendation algorithms\u201d, Paper presented at the Proceedings of the 10th international conference on World Wide Web.","DOI":"10.1145\/371920.372071"},{"key":"key2019092314100164100_ref037","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.eswa.2017.02.038","article-title":"Enriched LDA (ELDA): combination of latent dirichlet allocation with word co-occurrence analysis for aspect extraction","volume":"80","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"key2019092314100164100_ref038","doi-asserted-by":"crossref","unstructured":"Shaparenko, B., \u00c7etin, \u00d6. and Iyer, R. (2009), \u201cData-driven text features for sponsored search click prediction\u201d, Paper presented at the Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising, Paris.","DOI":"10.1145\/1592748.1592755"},{"key":"key2019092314100164100_ref039","doi-asserted-by":"crossref","unstructured":"Wang, C. and Blei, D.M. (2011), \u201cCollaborative topic modeling for recommending scientific articles\u201d, Paper presented at the Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, San Diego, CA.","DOI":"10.1145\/2020408.2020480"},{"key":"key2019092314100164100_ref040","unstructured":"Wang, C., Zhang, P., Choi, R. and D\u2019Eredita, M. (2002), \u201cUnderstanding consumers attitude toward advertising\u201d, Paper presented at the AMCIS 2002 Proceedings, Dallas."},{"key":"key2019092314100164100_ref041","doi-asserted-by":"crossref","unstructured":"Wang, T., Bian, J., Liu, S., Zhang, Y. and Liu, T.-Y. (2013), \u201cPsychological advertising: exploring user psychology for click prediction in sponsored search\u201d, Paper presented at the Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, Chicago, IL.","DOI":"10.1145\/2487575.2487699"},{"key":"key2019092314100164100_ref042","doi-asserted-by":"crossref","unstructured":"Wei, X. and Croft, W.B. (2006), \u201cLDA-based document models for ad-hoc retrieval\u201d, Paper presented at the Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, Seattle, Washington, DC.","DOI":"10.1145\/1148170.1148204"},{"key":"key2019092314100164100_ref043","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.neucom.2013.04.018","article-title":"Position-wise contextual advertising: Placing relevant ads at appropriate positions of a web page","volume":"120","year":"2013","journal-title":"Neurocomputing"},{"key":"key2019092314100164100_ref044","doi-asserted-by":"crossref","unstructured":"Wu, X., Yan, J., Liu, N., Yan, S., Chen, Y. and Chen, Z. (2009), \u201cProbabilistic latent semantic user segmentation for behavioral targeted advertising\u201d, Paper presented at the Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising, Paris.","DOI":"10.1145\/1592748.1592751"},{"issue":"2","key":"key2019092314100164100_ref045","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1108\/K-01-2016-0014","article-title":"Service recommender system based on emotional features and social interactions","volume":"46","year":"2017","journal-title":"Kybernetes"},{"issue":"10","key":"key2019092314100164100_ref046","doi-asserted-by":"crossref","first-page":"1504","DOI":"10.1108\/K-01-2015-0004","article-title":"A computing metaphor approach to customer experience based alliance partner recommendation","volume":"44","year":"2015","journal-title":"Kybernetes"}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-05-2018-0216\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-05-2018-0216\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:48:11Z","timestamp":1753393691000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/48\/8\/1586-1605\/259703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,2]]},"references-count":46,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,9,2]]}},"alternative-id":["10.1108\/K-05-2018-0216"],"URL":"https:\/\/doi.org\/10.1108\/k-05-2018-0216","relation":{},"ISSN":["0368-492X"],"issn-type":[{"value":"0368-492X","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9,2]]}}}