In Search for Best Meta-Actions to Boost Businesses Revenue
Jieyan Kuang , Zbigniew W. Raś
AbstractThe ultimate goal of our research is to build recommender system driven by action rules and meta-actions for providing proper suggestions to improve revenue of a group of clients (companies) involved with similar businesses. Collected data present answers from 25,000 customers concerning their personal information, general information about the service and customers’ feedback to the service. This paper proposes a strategy to classify and organize meta-actions in such a way that they can be applied most efficiently to achieve desired goal. Meta-actions are the triggers that need to be executed for activating action rules. In previous work, the method of mining meta-actions from customers’ reviews in text format has been proposed and implemented. Performed experiments have proven its high effectiveness. However, it turns out that the discovered action rules need more than one meta-action to be triggered. The way and the order of executing triggers causes new problems due to the commonness, differential benefit and applicability among sets of meta-actions. Since the applicability of meta-actions should be judged by professionals in the field, our concentration is put on designing a strategy to hierarchically sort and arrange so called meta-nodes (used to represent action rules and their triggers in a tree structure) as well as to compute the effect of each meta-node. Furthermore, users will have more concrete options to consider by following the path in trees built from these meta-nodes.
|Publication size in sheets||0.6|
|Book||Andreasen Troels, Christiansen Henning, Kacprzyk Janusz, Larsen Henrik , Pasi Gabriella, Pivert Olivier, Tré Guy De, Vila Maria Amparo, Yazici Adnan, Zadrożny Sławomir (eds.): Flexible Query Answering Systems 2015. Proceedings of the 11th International Conference FQAS 2015, Advances in Intelligent Systems and Computing, vol. 400, no. 1, 2016, Springer International Publishing, ISBN 978-3-319-26153-9, [978-3-319-26154-6], 494 p., DOI:10.1007/978-3-319-26154-6|
|Score|| = 0.0, 29-01-2020, BookChapterSeriesAndMatConfByIndicator|
= 0.0, 29-01-2020, BookChapterSeriesAndMatConfByIndicator
|Publication indicators||= 2; = 1|
|Citation count*||7 (2020-07-09)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.