Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kotler, P., Keller, K.: Marketing Management. Prentice Hall (2008)
Wu, T., Xin, D., Mei, Q., Han, J.: Promotion analysis in multi-dimensional space. In: International Conference on Very Large Databases, Lyon, France, VLDB Endowment (2009)
Symeonidis, P., Nanopoulos, A., Manolopoulos, Y.: Tag recommendations based on tensor dimensionality erduction. In: ACM Conference on Recommender Systems, Lausanne, Switzerland. ACM (2008)
Kamishima, T., Akaho, S.: Dimension reduction for supervised ordering. In: International Conference on Data Mining, Hongkong. IEEE Press (2006)
Ahn, H.J., Kim, J.W.: Feature reduction for product recommendation in internet shopping malls. International Journal of Electronic Business 4(5), 432–444 (2006)
Fodor, I.: A survey of dimension reduction techniques. Technical report, Center for Applied Scientific Computing, Lawrence Livermore National Research Laboratory (2002)
Ailon, N., Chazelle, B.: Faster dimension deduction. Commun. ACM 53(2), 97–104 (2010)
Golub, G., van Loan, C.: Matrix Computations. Johnm Hopkins University Press (1996)
DatabaseSports.com, http://www.basketballreference.com
Drexel University. http://mathforum.org/workshops/sum96/data.collections/datalibrary/data.set6.html
StataCorp LP, http://www.stata.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kavilkrue, M., Boonma, P. (2014). Improving Efficiency of PromoRank Algorithm Using Dimensionality Reduction. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds) Intelligent Information and Database Systems. ACIIDS 2014. Lecture Notes in Computer Science(), vol 8397. Springer, Cham. https://doi.org/10.1007/978-3-319-05476-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-05476-6_27
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05475-9
Online ISBN: 978-3-319-05476-6
eBook Packages: Computer ScienceComputer Science (R0)