{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:57:39Z","timestamp":1760709459157,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724126"},{"type":"electronic","value":"9783319724133"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72413-3_18","type":"book-chapter","created":{"date-parts":[[2017,11,24]],"date-time":"2017-11-24T16:16:31Z","timestamp":1511540191000},"page":"257-277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Flexible and Efficient Indexing Scheme for Placement of Top-Utility Itemsets for Different Slot Sizes"],"prefix":"10.1007","author":[{"given":"Parul","family":"Chaudhary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Polepalli Krishna","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,25]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/0377-2217(79)90030-4","volume":"3","author":"P Hansen","year":"1979","unstructured":"Hansen, P., Heinsbroek, H.: Product selection and space allocation in supermarkets. Eur. J. Oper. Res. 3, 474\u2013484 (1979)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0925-5273(98)00134-0","volume":"60\u201361","author":"MH Yang","year":"1999","unstructured":"Yang, M.H., Chen, W.C.: A study on shelf space allocation and management. Int. J. Prod. Econ. 60\u201361, 309\u2013317 (1999)","journal-title":"Int. J. Prod. Econ."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0377-2217(99)00448-8","volume":"131","author":"MH Yang","year":"2001","unstructured":"Yang, M.H.: An efficient algorithm to allocate shelf space. Eur. J. Oper. Res. 131, 107\u2013118 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.eswa.2006.02.001","volume":"32","author":"MC Chen","year":"2007","unstructured":"Chen, M.C., Lin, C.P.: A data mining approach to product assortment and shelf space allocation. Expert Syst. Appl. 32, 976\u2013986 (2007)","journal-title":"Expert Syst. Appl."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1016\/j.dss.2005.12.004","volume":"42","author":"YL Chen","year":"2006","unstructured":"Chen, Y.L., Chen, J.M., Tung, C.W.: A data mining approach for retail knowledge discovery with consideration of the effect of shelf-space adjacency on sales. Decis. Support Syst. 42, 1503\u20131520 (2006)","journal-title":"Decis. Support Syst."},{"key":"18_CR6","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: 20th International Conference, VLDB, pp. 487\u2013499 (1994)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM Sigmod Record 29, 1\u201312 (2000)","journal-title":"ACM Sigmod Record"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory \u2014 ICDT\u201999","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49257-7_25"},{"key":"18_CR9","unstructured":"World\u2019s largest retail store. https:\/\/www.thebalance.com\/largest-retail-stores-2892923"},{"key":"18_CR10","unstructured":"US Retail Industry. https:\/\/www.thebalance.com\/us-retail-industry-overview-2892699"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-14717-8_3","volume-title":"Advanced Data Mining and Applications","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Tseng, V.S.: Novel concise representations of high utility itemsets using generator patterns. In: Luo, X., Yu, J.X., Li, Z. (eds.) ADMA 2014. LNCS (LNAI), vol. 8933, pp. 30\u201343. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14717-8_3"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-44403-1_6","volume-title":"Database and Expert Systems Applications","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger, P., Lin, J.C.-W., Wu, C.-W., Tseng, V.S., Faghihi, U.: Mining minimal high-utility itemsets. In: Hartmann, S., Ma, H. (eds.) DEXA 2016. LNCS, vol. 9827, pp. 88\u2013101. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44403-1_6"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-319-27060-9_44","volume-title":"Advances in Artificial Intelligence and Soft Computing","author":"S Zida","year":"2015","unstructured":"Zida, S., Fournier-Viger, P., Lin, J.C.-W., Wu, C.-W., Tseng, V.S.: EFIM: a highly efficient algorithm for high-utility itemset mining. In: Sidorov, G., Galicia-Haro, S.N. (eds.) MICAI 2015. LNCS (LNAI), vol. 9413, pp. 530\u2013546. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27060-9_44"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-41920-6_15","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger, P., Zida, S., Lin, J.C.-W., Wu, C.-W., Tseng, V.S.: EFIM-Closed: fast and memory efficient discovery of closed high-utility itemsets. In: Perner, P. (ed.) Machine Learning and Data Mining in Pattern Recognition. LNCS (LNAI), vol. 9729, pp. 199\u2013213. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41920-6_15"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 55\u201364. ACM (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liao, W.K., Choudhary, A.: A fast high utility itemsets mining algorithm. In: Proceedings of the 1st International Workshop on Utility-Based Data Mining, pp. 90\u201399 (2005)","DOI":"10.1145\/1089827.1089839"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Tseng, V.S., Wu, C.W., Shie, B.E., Yu, P.S.: UP-Growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 253\u2013262. ACM (2010)","DOI":"10.1145\/1835804.1835839"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"VS Tseng","year":"2015","unstructured":"Tseng, V.S., Wu, C.W., Fournier-Viger, P., Philip, S.Y.: Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans. Knowl. Data Eng. 27, 726\u2013739 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR19","unstructured":"Chan, R., Yang, Q., Shen, Y.D.: Mining high utility itemsets. In: 3rd IEEE International Conference on Data Mining, ICDM, pp. 19\u201326 (2003)"},{"key":"18_CR20","unstructured":"SPMF (Open-source data mining library). http:\/\/www.philippe-fournier-viger.com\/spmf\/dataset"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","volume-title":"Foundations of Intelligent Systems","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen, T., Christiansen, H., Cubero, J.-C., Ra\u015b, Z.W. (eds.) ISMIS 2014. LNCS (LNAI), vol. 8502, pp. 83\u201392. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08326-1_9"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72413-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:49:33Z","timestamp":1709826573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-72413-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724126","9783319724133"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72413-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"25 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bigda2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bda2017.iiit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}