A Method of Recommending Buying Points for Internet Shopping Malls
When a customer wants to buy an item in an Internet shopping mall, one of his/her difficulties would be to decide when to buy the item, because its price changes over time. If the shopping mall can recommend appropriate buying points, this would greatly help the customer. Therefore, in this paper, a method of recommending buying points based on time series analysis is proposed using a database of past item prices. The procedure for providing buying points for an item is as follows. First, the past time series patterns are searched for from the database using normalized similarities, which are similar to the current time series pattern of the item. Second, the retrieved past patterns are analyzed and the item’s future price pattern is predicted. Third, using the future price pattern, a recommendation on when to buy the item is made.
Unable to display preview. Download preview PDF.
- 1.Agrawal, R., Lin, K., Sawhney, H.S., Shim, K.: Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases. In: Proc. of the 21st Int’l Conf. on Very Large Databases, Zurich, Switzerland, pp. 490–501 (1995)Google Scholar
- 2.Chatfield, C.: The Analysis of Time Series: An Introduction, 6th edn. CRC Press, Boca Raton (2003)Google Scholar
- 3.Jang, E.S., Lee, Y.K.: Buying Point Recommendation for E-Commerce Systems. In: Proc. of the 8th Int’l e-Biz Conf. on Society for e-Business Studies, Seoul, Korea, pp. 108–113 (2005)Google Scholar
- 5.Lee, S.J., Lee, S.H.: Similarity Search in Time Series Databases Based on the Normalized Distance. Journal of Korea Information Science Society 31(1), 23–29 (2004)Google Scholar
- 7.Murphy, J.J.: Technical Analysis of the Financial Markets: A Comprehensive Guide to Trading Methods and Applications. Prentice Hall Press, Englewood Cliffs (1999)Google Scholar
- 8.Noh, W.K., Kim, S.W., Whang, K.Y., Shim, K.S.: A Subsequence Matching Algorithm Supporting Moving Average Transform of Arbitrary Order in Time-Series Databases. Journal of Korea Information Science Society 27(3), 469–485 (2000)Google Scholar
- 9.Perng, C.S., Wang, H., Zhang, S.R., Parker, D.S.: Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases. In: Proc. of the IEEE 16th Int’l Conf. on Data Engineering, California, USA, pp. 33–42 (2000)Google Scholar
- 10.Rafiei, D., Mendelzon, A.: Similarity-Based Queries for Time-Series Data. In: Proc. of the 1997 Int’l Conf. on Management of Data, Arizona, USA, pp. 13–25 (1997)Google Scholar
- 12.Won, J.I., Yoon, J.H., Kim, S.W., Park, S.H.: Shape-Based Subsequence Retrieval Supporting Multiple Models in Time-Series Databases. Journal of Korea Information Processing Society 10-D(4), 577–590 (2003)Google Scholar
- 13.Yoo, S.K., Lee, S.H.: Effectiveness Evaluations of Subsequence Matching Methods Using KOSPI Data. Journal of Korea Information Processing Society 12-D(3), 355–364 (2005)Google Scholar
- 14.New Internet Trade (2005), http://search.mk.co.kr/