Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2009.16-D.2.169

Efficient Storage Structures for a Stock Investment Recommendation System  

Ha, You-Min (연세대학교 컴퓨터과학)
Kim, Sang-Wook (한양대학교 정보통신학부)
Park, Sang-Hyun (연세대학교 컴퓨터과학과)
Lim, Seung-Hwan (한양대학교 전자통신컴퓨터공학과)
Abstract
Rule discovery is an operation that discovers patterns frequently occurring in a given database. Rule discovery makes it possible to find useful rules from a stock database, thereby recommending buying or selling times to stock investors. In this paper, we discuss storage structures for efficient processing of queries in a system that recommends stock investments. First, we propose five storage structures for efficient recommending of stock investments. Next, we discuss their characteristics, advantages, and disadvantages. Then, we verify their performances by extensive experiments with real-life stock data. The results show that the histogram-based structure improves the query performance of the previous one up to about 170 times.
Keywords
Time-Series Data; Rule Discovery; Recommending Stock Investments;
Citations & Related Records
연도 인용수 순위
  • Reference
1 You-min Ha, Sanhyun Park, Sang-Wook Kim, Jung-Im Won, and Jee-Hee Yoon, 'Rule Discovery and Matching in Stock Databases,' 32nd Annual IEEE International Computer Software and Applications Conference(COMPSAC 2008), pp.192-198, 2008   DOI
2 Koscom Data Mall, http://datamall.koscom.co.kr, 2005
3 R. Agrawal and R. Srikant, 'Mining Sequential Patterns,' In Proc. Int'l. Conf. on Data Engineering, IEEE ICDE, pp.3-14, 1995   DOI
4 S. H. Park et al., 'Efficient Searches for Similar Subsequences of Difference Lengths in Sequence Databases,' In Proc. Int'l. Conf. on Data Engineering, IEEE ICDE, pp.23-32, 2000   DOI
5 R. Agrawal, C. Faloutsos, and A. Swami, 'Efficient Similarity Search in Sequence Databases,' In Proc. Int'l. Conf. on Foundations of Data Organization and Algorithms, FODO, pp. 69-84, Oct., 1993   DOI   ScienceOn
6 S. W. Kim, S. H. Park, and W. W. Chu, 'An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases,' In Proc. Int'l. Conf. on Data Engineering, IEEE, pp.607-614, 2001   DOI
7 W. K. Loh, S. W. Kim, and K. Y. Whang, 'A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases,' Data Mining and Knowledge Discovery Journal, Vol.9, No.1, pp.5-28, July, 2004   DOI
8 P. Bloomfield, Fourier Analysis of Time Series, Wiley, 2000
9 T. Anderson, 'The Statistical Analysis of Time Series,' Wiley, 1971
10 C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, 'Fast Subsequence Matching in Time-series Databases,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp.419-429, May, 1994   DOI   ScienceOn
11 G. Das, K.-I. Lin, H. Mannila, Gopal Renganathan, and Padhraic Smyth, 'Rule Discovery from Time Series,' In Proc. Int'l. Conf. on Knowledge Discovery and Datamining, pp.16-22, 1998
12 S. Park and W. W. Chu, 'Discovering and Matching Elastic Rules From Sequence Databases,' in Fundamenta Informaticae, Vol.47, No.1-2, pp.75-90, Aug-Sept, 2001
13 R. Agrawal and R. Srikant, 'Fast Algorithms for Mining Association Rules,' In Proc. Int'l. Conf. on Very Large Data Bases, VLDB, pp.487-499, 1994