{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:00:33Z","timestamp":1742932833080,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030954079"},{"type":"electronic","value":"9783030954086"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95408-6_5","type":"book-chapter","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:04:07Z","timestamp":1643587447000},"page":"54-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extracting High Profit Sequential Feature Groups of Products Using High Utility Sequential Pattern Mining"],"prefix":"10.1007","author":[{"given":"Priyanka","family":"Motwani","sequence":"first","affiliation":[]},{"given":"C. I.","family":"Ezeife","sequence":"additional","affiliation":[]},{"given":"Mahreen","family":"Nasir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3223-4","volume-title":"Mining Text Data","author":"C Aggarwal","year":"2012","unstructured":"Aggarwal, C., Zhai, C.: Mining Text Data, 1st edn. Springer Science & Business Media, New York (2012)","edition":"1"},{"key":"5_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: 20th International Conference Very Large Data Bases, VLDB 1215, pp. 487\u2013499 (1994)"},{"key":"5_CR3","series-title":"Studies in Big Data","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-030-04921-8_9","volume-title":"High-Utility Pattern Mining","author":"S Demir","year":"2019","unstructured":"Demir, S., Alkan, O., Cekinel, F., Karagoz, P.: Extracting potentially high profit product feature groups by using high utility pattern mining and aspect based sentiment analysis. In: Fournier-Viger, P., Lin, J.C.-W., Nkambou, R., Vo, B., Tseng, V.S. (eds.) High-Utility Pattern Mining. SBD, vol. 51, pp. 233\u2013260. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-04921-8_9"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Ejieh, C., Ezeife, C.I., Chaturvedi, R.: Mining product opinions with most frequent clusters of aspect terms. In: 34th ACM\/SIGAPP Symposium on Applied Computing, pp. 546\u2013549. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3297280.3297550"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.knosys.2016.08.022","volume":"111","author":"C-W Lin","year":"2016","unstructured":"Lin, C.-W., Fournier-Viger, P., Gan, W.: FHN: an efficient algorithm for mining high-utility itemsets with negative unit profits. Knowl. Based Syst. 111, 283\u2013298 (2016)","journal-title":"Knowl. Based Syst."},{"key":"5_CR6","unstructured":"McAuley, J.: Amazon Data (2016). https:\/\/jmcauley.ucsd.edu\/data\/amazon\/"},{"key":"5_CR7","unstructured":"Pei, J., et al.: PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings 2001 International Conference Data Engineering (ICDE 2001), pp. 215\u2013224. Heidelberg (2001). Accessed 11 June 2021"},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1177\/0165551518808195","volume":"45","author":"T Rana","year":"2019","unstructured":"Rana, T., Cheah, Y.: Sequential patterns rule-based approach for opinion target extraction from customer reviews. J. Inf. Sci. 45(5), 643\u2013655 (2019)","journal-title":"J. Inf. Sci."},{"issue":"10","key":"5_CR9","first-page":"31","volume":"81","author":"A Rashid","year":"2013","unstructured":"Rashid, A., Asif, S., Butt, N.A., Ashraf, I.: Feature level opinion mining of educational student feedback data using sequential pattern mining and association rule mining. Int. J. Comput. Appl. 81(10), 31\u201338 (2013)","journal-title":"Int. J. Comput. Appl."},{"key":"5_CR10","unstructured":"Sentistrength. http:\/\/sentistrength.wlv.ac.uk\/. Accessed 12 Apr 2021"},{"key":"5_CR11","unstructured":"SPMF. https:\/\/www.philippe-fournier-viger.com\/spmf\/. Accessed 13 June 2021"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach for mining itemset utilities from databases. In: SIAM International Conference on Data Mining, pp. 482\u2013486. Orlando, FL (2004)","DOI":"10.1137\/1.9781611972740.51"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Yin, J., Zheng, Z., Cao, L.: USpan: an efficient algorithm for mining high utility sequential patterns. In: 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 660\u2013668 (2012)","DOI":"10.1145\/2339530.2339636"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95408-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:07:17Z","timestamp":1643587637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95408-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030954079","9783030954086"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95408-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"31 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2021.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT3","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"116","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}