Abstract
It is often desirable to find markets or sale channels where an object, e.g., a product, person or service, can be recommended 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 studies the impact of dimensionality reduction algorithms, such as PCA or FA, in order to reduce the dimension size and, as a consequence, improve the performance of PromoRank. This paper evaluate multiple dimensionality reduction algorithms to obtains the understanding about the relationship between properties of data sets and algorithms such that an appropriate algorithm can be selected for a particular data set. The evaluation results show that dimensionality reduction algorithms can improve the performance of PromoRank while maintain an acceptable ranking accuracy.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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)
Ailon, N., Chazelle, B.: Faster dimension deduction. Commun. ACM 53(2), 97–104 (2010)
Fodor, I.: A survey of dimension reduction techniques. Tech. rep., Center for Applied Scientific Computing, Lawrence Livermore National Research Laboratory (2002)
Forsythe, G.E., Henrici, P.: The cyclic jacobi method for computing the principal values of a complex matrix. In: Transactions of the American Mathematical Society, pp. 1–23 (1960)
Kamishima, T., Akaho, S.: Dimension reduction for supervised ordering. In: Proceedings of the International Conference on Data Mining, pp. 330–339. IEEE Press, Hongkong (2006)
Kavilkrue, M., Boonma, P.: Improving efficiency of PromoRank algorithm using dimensionality reduction. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds.) ACIIDS 2014, Part I. LNCS, vol. 8397, pp. 261–270. Springer, Heidelberg (2014)
Kotler, P., Keller, K.: Marketing Management. Prentice Hall (2008)
Symeonidis, P., Nanopoulos, A., Manolopoulos, Y.: Tag recommendations based on tensor dimensionality reduction. In: Proceedings of the ACM Conference on Recommender Systems, pp. 43–50. ACM, Lausanne (2008)
Wang, J., Zhang, Y.: Opportunity model for e-commerce recommendation: Right product; right time. In: Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 303–312. ACM, New York (2013)
Wu, T., Xin, D., Mei, Q., Han, J.: Promotion analysis in multi-dimensional space. In: Proceedings of the International Conference on Very Large Databases, pp. 109–120. VLDB Endowment, Lyon (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kavilkrue, M., Boonma, P. (2015). Dimensionality Reduction Algorithms for Improving Efficiency of PromoRank: A Comparison Study. In: Unger, H., Meesad, P., Boonkrong, S. (eds) Recent Advances in Information and Communication Technology 2015. Advances in Intelligent Systems and Computing, vol 361. Springer, Cham. https://doi.org/10.1007/978-3-319-19024-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-19024-2_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19023-5
Online ISBN: 978-3-319-19024-2
eBook Packages: EngineeringEngineering (R0)