An efficient system for detecting outliers from financial time series

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4042 LNCS, Issue , 2006, Pages 190-198

  Leung, Carson Kai Sang ^a   Thulasiram, Ruppa K ^a   Bondarenko, Dmitri A ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Computational finance; Data mining; Databases

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; MATHEMATICAL MODELS; STATISTICAL METHODS; TIME SERIES ANALYSIS;

FINANCIAL TIME SERIES; OUTLIER DETECTION; SECURITY PRICES; STATISTICAL ALGORITHMS;

DATA MINING;

EID: 33746698322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11788911_16     Document Type: Conference Paper

References (16)

1. Agrawal, R., Ghosh, S., Imielinski, T., Iyer, B., Swami, A.: An interval classifier for database mining applications. In: Proc. VLDB 1992. 560-573
2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining (1996) ch. 12
3. Back, A.D., Weigend, A.S.: A first application of independent component analysis to extracting structure from stock returns. World Scientific - IJNS 8 (1997) 473-484
4. Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. KDD 1996. 226-231
5. Jolliffe, I.: Principal Component Analysis, Springer-Verlag (1986)
6. Keogh, E., Lonardi, S., Chiu, B.Y.: Finding surprising patterns in a time series database in linear time and space. In: Proc. KDD 2002. 550-556
7. Knorr, E.M., Ng, R.T.: Algorithms for mining distance-based outliers in large datasets. In: Proc. VLDB 1998. 392-403
8. Lakshmanan, L.V.S., Leung, C.K.-S., Ng, R.T.: Dynamic mining of constrained frequent sets. ACM TODS 28 (2003) 337-389
9. Leung, C.K.-S.: Evaluation of data mining opportunities at Workers' Compensation Board. Research report, Workers' Compensation Board of BC, Canada (1998)
10. Leung, C.K.-S., Khan, Q.I., Hoque, T.: CanTree: a tree structure for efficient incremental mining of frequent patterns. In: Proc. ICDM 2005. 274-281
11. Omiecinski, E., Savasere, A.: Efficient mining of association rules in large dynamic databases. In: Proc. BNCOD 1998. 49-63
12. Park, J.: Modern portfolio theory and its application to hedge funds: Part II. MFA Reporter (Aug. 2001) 1-2, 4, 12-13
13. Schwertman, N.C., Owens, M.A., Adnan, R.: A simple more general boxplot method for identifying outliers. Elsevier - CSDA 47 (2004) 165-174
14. Srikumar, K., Bhasker, B., Tripathi, S.K.: MaxDomino: efficiently mining maximal sets. In: Proc. BNCOD 2003. 131-139
15. Utans, J.W., Holt, T., Refenes, A.N.: Principal components for modelling multi-currency portfolios. In: Proc. NNCM 1996. 359-368
16. Victoria-Feser, M.-P.: Robust portfolio selection. Working paper 2000.14, University of Geneva, Switzerland (2000)