Improving efficiency of PromoRank algorithm using dimensionality reduction

• Main Authors: Metawat Kavilkrue, Pruet Boonma
• Format: Book Series
• Published: 2018
• Online Access: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84899925325&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/45410
• Institution: Chiang Mai University

Promotion plays a crucial role in online marketing, which can be used in post-sale recommendation, developing brand, customer support, etc. It is often desirable to find markets or sale channels where an object, e.g., a product, person or service, can be promoted efficiently. Since the object may not be highly ranked in the global property space, PromoRank algorithm promotes a given object by discovering promotive subspace in which the target is top rank. However, the computation complexity of PromoRank is exponential to the dimension of the space. This paper proposes to use dimensionality reduction algorithms, such as PCA, in order to reduce the dimension size and, as a consequence, improve the performance of PromoRank. Evaluation results show that the dimensionality reduction algorithm can reduce the execution time of PromoRank up to 25% in large data sets while the ranking result is mostly maintained. © 2014 Springer International Publishing Switzerland.