{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:53:49Z","timestamp":1754157229659,"version":"3.41.2"},"reference-count":27,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2013,1,25]],"date-time":"2013-01-25T00:00:00Z","timestamp":1359072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1,25]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>Revenue maximization through improving click\u2010throughs is of great importance for price comparison shopping services (PCSSs) whose revenues directly depend on the number of click\u2010throughs of items in their itemsets. The purpose of this paper is to present an approach aiming to maximize the revenue of a PCSS by proposing effective itemset construction methods that can maximize the click\u2010throughs.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The authors suggest three itemset construction methods, namely na\u00efve method (NM), exhaustive method (EM), and local update method (LM). Specifically, NM searches for the best itemset for an item in terms of textual similarity between an item and an itemset, while EM produces the best itemset for each item for maximizing click\u2010throughs by considering all the possible memberships of the item. Finally, through combining NM and EM, the authors propose an LM that attempts to improve click\u2010throughs by locally updating the memberships of items according to their ranks in each itemset.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Through evaluation of the proposed methods based on a real\u2010world dataset, it has been found that improvement of click\u2010throughs is small when itemsets are constructed by using the textual similarity alone. However, significant improvement in the number of click\u2010throughs was achieved when considering items' membership updates dynamically.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>Unlike the previous studies that mainly focus on the textual similarity, the authors attempt to maximize the revenue through constructing itemsets that can result in more click\u2010throughs. By using the proposed methods, it is expected that PCSSs will be able to automatically construct itemsets that can maximize their revenues without the need for manual task.<\/jats:p><\/jats:sec>","DOI":"10.1108\/02635571311289683","type":"journal-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T10:46:15Z","timestamp":1364208375000},"page":"96-116","source":"Crossref","is-referenced-by-count":7,"title":["Revenue maximizing itemset construction for online shopping services"],"prefix":"10.1108","volume":"113","author":[{"given":"Kwanho","family":"Kim","sequence":"first","affiliation":[]},{"given":"Beom\u2010Suk","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Jae\u2010Yoon","family":"Jung","sequence":"additional","affiliation":[]},{"given":"Jonghun","family":"Park","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022021220090110000_b1","doi-asserted-by":"crossref","unstructured":"Albadvi, A. and Shahbazi, M. (2009), \u201cA hybrid recommendation technique based on product category attributes\u201d, Expert Systems with Applications, Vol. 36, pp. 11480\u20108.","DOI":"10.1016\/j.eswa.2009.03.046"},{"key":"key2022021220090110000_b2","doi-asserted-by":"crossref","unstructured":"Ali, K. and Scarr, M. (2007), \u201cRobust methodologies for modeling web click distributions\u201d, Proceedings of the 16th International Conference on World Wide Web in Alberta, Canada, pp. 511\u201020.","DOI":"10.1145\/1242572.1242642"},{"key":"key2022021220090110000_b4","doi-asserted-by":"crossref","unstructured":"Bilenko, M. and Mooney, R.J. (2003), \u201cAdaptive duplicate detection using learnable string similarity measures\u201d, Proceedings of the 11th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD) in Washington, DC, USA, pp. 39\u201048.","DOI":"10.1145\/956750.956759"},{"key":"key2022021220090110000_b3","unstructured":"Bilenko, M., Basil, S. and Sahami, M. (2005), \u201cAdaptive product normalization: using online learning for record linkage in comparison shopping\u201d, Proceedings of the 5th International Conference on Data Mining in Huston, TX, USA, pp. 58\u201065."},{"key":"key2022021220090110000_b5","doi-asserted-by":"crossref","unstructured":"Chang, Y.S. and Lee, K.J. (2010), \u201cA comparison shopping optimization model based on supplier's pricing contexts\u201d, Expert Systems with Applications, Vol. 37, pp. 5736\u201044.","DOI":"10.1016\/j.eswa.2010.02.036"},{"key":"key2022021220090110000_b6","doi-asserted-by":"crossref","unstructured":"Chen, Y.C., Shang, R.A. and Kao, C.Y. (2008), \u201cThe effects of information overload on customers' subjective state towards buying decision in the internet shopping environment\u201d, Electronic Commerce Research and Applications, Vol. 8, pp. 48\u201058.","DOI":"10.1016\/j.elerap.2008.09.001"},{"key":"key2022021220090110000_b7","doi-asserted-by":"crossref","unstructured":"Colas, F. and Brazdil, P. (2006), \u201cComparison of SVM and some older classification algorithms in text classification tasks\u201d, Artificial Intelligence in Theory and Practice, Vol. 217, pp. 169\u201078.","DOI":"10.1007\/978-0-387-34747-9_18"},{"key":"key2022021220090110000_b8","doi-asserted-by":"crossref","unstructured":"Elmagarmid, A.K., Ipeirotis, P.G. and Verykios, V.S. (2007), \u201cDuplicate record detection: a survey\u201d, IEEE Transactions on Knowledge and Data Engineering, Vol. 19, pp. 1\u201016.","DOI":"10.1109\/TKDE.2007.250581"},{"key":"key2022021220090110000_b9","doi-asserted-by":"crossref","unstructured":"Garfinkel, R., Gopal, R., Pathak, B. and Yin, F. (2008), \u201cShopbot 2.0: integrating recommendations and promotions with comparison shopping\u201d, Decision Support Systems, Vol. 46, pp. 61\u20109.","DOI":"10.1016\/j.dss.2008.05.006"},{"key":"key2022021220090110000_b10","doi-asserted-by":"crossref","unstructured":"Greene, W. (2008), \u201cFunctional forms for the negative binomial model for count data\u201d, Economics Letters, Vol. 99, pp. 585\u201090.","DOI":"10.1016\/j.econlet.2007.10.015"},{"key":"key2022021220090110000_b11","doi-asserted-by":"crossref","unstructured":"Hajishirzi, H., Yih, W.T. and Kolcz, A. (2010), \u201cAdaptive near\u2010duplicate detection via similarity learning\u201d, Proceedings of the 33rd International Conference on Research and Development in Information Retrieval in Geneva, Switzerland, pp. 419\u201026.","DOI":"10.1145\/1835449.1835520"},{"key":"key2022021220090110000_b12","doi-asserted-by":"crossref","unstructured":"K\u00f6pcke, H., Thor, A. and Rahm, E. (2009), \u201cComparative evaluation of entity resolution approaches with FEVER\u201d, Proceedings of the International Conference on Very Large Data Bases in Lyon, France, Vol. 2, pp. 1574\u20107.","DOI":"10.14778\/1687553.1687595"},{"key":"key2022021220090110000_b13","doi-asserted-by":"crossref","unstructured":"K\u00f6pcke, H., Thor, A. and Rahm, E. (2010), \u201cLearning\u2010based approaches for matching web data entities\u201d, IEEE Internet Computing, Vol. 14, pp. 23\u201031.","DOI":"10.1109\/MIC.2010.58"},{"key":"key2022021220090110000_b14","doi-asserted-by":"crossref","unstructured":"Li, M., Wang, H., Li, J. and Gao, H. (2010), \u201cEfficient duplicate record detection based on similarity estimation\u201d, Lecture Notes in Computer Science, Vol. 6184, pp. 595\u2010607.","DOI":"10.1007\/978-3-642-14246-8_58"},{"key":"key2022021220090110000_b15","unstructured":"Meng, X.F., Lu, H.R. and Guo, L. (2010), \u201cApproximately duplicate record detection method based on neural network and genetic algorithm\u201d, Computer Engineering and Design, Vol. 31 No. 7, pp. 1550\u20103."},{"key":"key2022021220090110000_b16","doi-asserted-by":"crossref","unstructured":"Ong, B.S. (2011), \u201cOnline shoppers' perceptions and use of comparison shopping sites: an exploratory study\u201d, Journal of Promotion Management, Vol. 17, pp. 207\u201027.","DOI":"10.1080\/10496491.2011.553789"},{"key":"key2022021220090110000_b17","unstructured":"Pathak, B. (2010), \u201cA survey of the comparison shopping agent\u2010based decision support systems\u201d, Journal of Electronic Commerce Review, Vol. 11 No. 3, pp. 585\u201090."},{"key":"key2022021220090110000_b18","doi-asserted-by":"crossref","unstructured":"Ramachandran, K.K., Karthick, K.K. and Kumar, M.S. (2011), \u201cOnline shopping in the UK\u201d, International Business & Economics Research Journal, Vol. 10 No. 12, pp. 23\u201035.","DOI":"10.19030\/iber.v10i12.6647"},{"key":"key2022021220090110000_b19","doi-asserted-by":"crossref","unstructured":"Redden, J.P. (2008), \u201cReducing satiation: the role of categorization level\u201d, Journal of Consumer Research, Vol. 34 No. 5, pp. 624\u201034.","DOI":"10.1086\/521898"},{"key":"key2022021220090110000_b20","doi-asserted-by":"crossref","unstructured":"Telang, R. and Mukhopadhyay, T. (2004), \u201cDrives of web portal use\u201d, Electronic Commerce Research and Application, Vol. 4, pp. 49\u201065.","DOI":"10.1016\/j.elerap.2004.10.004"},{"key":"key2022021220090110000_b21","unstructured":"Tsang, S.S. and Hsu, W.C. (2009), \u201cTransforming experience good into search good: how virtual experience may change the internet advertising market?\u201d, Proceedings of the 9th International Conference on Electronic Business in Minneapolis, MN, USA, pp. 437\u201045."},{"key":"key2022021220090110000_b22","doi-asserted-by":"crossref","unstructured":"Wu, L., Cai, Y. and Liu, D. (2011), \u201cOnline shopping among Chinese customers: an exploratory investigation of demographics and value orientation\u201d, International Journal of Customer Studies, Vol. 35, pp. 458\u201069.","DOI":"10.1111\/j.1470-6431.2010.00982.x"},{"key":"key2022021220090110000_b23","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X. and Wang, G. (2011), \u201cEfficient similarity joins for near\u2010duplicate detection\u201d, ACM Transactions on Database Systems, Vol. 36, pp. 15:1\u201015:41.","DOI":"10.1145\/2000824.2000825"},{"key":"key2022021220090110000_b24","doi-asserted-by":"crossref","unstructured":"Xie, F.C., Lin, J.G. and Wei, B.C. (2010), \u201cTesting for varying zero\u2010inflation and dispersion in generalized Poisson regression models\u201d, Journal of Applied Statistics, Vol. 37 No. 9, pp. 1509\u201022.","DOI":"10.1080\/02664760903055442"},{"key":"key2022021220090110000_b25","doi-asserted-by":"crossref","unstructured":"Yuan, S.T. (2002), \u201cA personalized and integrative comparison\u2010shopping engine and its applications\u201d, Decision Support Systems, Vol. 34, pp. 139\u201056.","DOI":"10.1016\/S0167-9236(02)00077-5"},{"key":"key2022021220090110000_b26","doi-asserted-by":"crossref","unstructured":"Zaghloul, W., Lee, S.M. and Trimi, S. (2009), \u201cText classification: neural networks vs support vector machines\u201d, Industrial Management & Data Systems, Vol. 109 No. 5, pp. 708\u201017.","DOI":"10.1108\/02635570910957669"},{"key":"key2022021220090110000_b27","doi-asserted-by":"crossref","unstructured":"Zhou, X., Gandhi, S., Suri, S. and Zheng, H. (2008), \u201ceBay in the sky: strategy\u2010proof wireless spectrum auctions\u201d, Proceedings of the 14th ACM International Conference on Mobile Computing and Networking in San Francisco, CA, USA, pp. 2\u201013.","DOI":"10.1145\/1409944.1409947"}],"container-title":["Industrial Management &amp; Data Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/02635571311289683","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/02635571311289683\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/02635571311289683\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:38:48Z","timestamp":1753400328000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/imds\/article\/113\/1\/96-116\/180620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,25]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1,25]]}},"alternative-id":["10.1108\/02635571311289683"],"URL":"https:\/\/doi.org\/10.1108\/02635571311289683","relation":{},"ISSN":["0263-5577"],"issn-type":[{"type":"print","value":"0263-5577"}],"subject":[],"published":{"date-parts":[[2013,1,25]]}}}