A classification approach for prediction of target events in temporal sequences

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

Volumn 2431 LNAI, Issue , 2002, Pages 125-137

  Domeniconi, Carlotta ^a   Perng, Chang Shing ^b   Vilalta, Ricardo ^b   Ma, Sheng ^b  

^a University of California Riverside   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; FORECASTING; SINGULAR VALUE DECOMPOSITION; SUPPORT VECTOR MACHINES;

ACCURATE PREDICTION; CATEGORICAL FEATURES; CLASSIFICATION APPROACH; CO-OCCURRENCE ANALYSIS; STATISTICAL PROPERTIES; SVM CLASSIFICATION; SYSTEM MANAGEMENT; TEMPORAL SEQUENCES; EMPIRICAL STUDIES;

CLASSIFICATION (OF INFORMATION);

EID: 80053915467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45681-3_11     Document Type: Conference Paper

References (17)

1. Bi, Z., Faloutsos, C., Korn, F. (2001). The "DGX" Distribution for Mining Massive, Skewed Data. International Conference on Knowledge Discovery and Data Mining. 131
2. Brockwell, P. J., Davis, R. (1996). Introduction to Time-Series and Forecasting, Springer-Verlag. 126
3. Cauwenberghs, G., Poggio, T. (2000). Incremental and Decremental Support Vector Machine Learning. NIPS. 130
4. Chandrasekharan, S., Manjunath, B. S., Wang, Y. F., Winkeler, J., Zhang, H.(1997). An eigenspace update algorithm for image analysis. Journal of graphical models and image processing, 321-332, 59(5). 129
5. Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., Harshman, R. A. (1990). Indexing by latent semantic analysis, Journal of the American Society for Information Science, 391-407, 41(6). 125
6. Degroat, R., Roberts, R.(1990). Efficient numerically stabilized rank-one eigenstructure updating. IEEE transactions on acoustic and signal processing, 38(2). 129
7. Joachims, T.(1999). Making large-scale SVM learning practical. Advances in Kernel Methods - Support Vector Learning, MIT-Press. 132
8. Joachims, T.(2000). The maximum margin approach to learning text classifiers: Methods, theory, and algorithms. Doctoral dissertation, Universität Dortmund, Informatik, LS VIII. 126, 130, 131
9. Kanth, K. V. R., Agrawal, D., Singh, A.(1998). Dimensionality Reduction for Similarity Searching in Dynamic Databases. ACM SIGMOD. 129
10. Mannila, H., Toivonen, H., Verkamo, A. I.(1995). Discovering frequent episodes in sequences. International Conference on Knowledge Discovery and Data Mining. 127
11. Mitra, P., Murthy, C. A., Pal, S. K. (2000). Data Condensation in Large Databases by Incremental Learning with Support Vector Machines. International Conference on Pattern Recognition. 130
12. Platt, J. C.(1999). Fast Training of Support Vector Machines using Sequential Minimal Optimization. Advances in Kernel Methods, MITPress, 185-208. 130
13. Syed, N. A., Liu, H., Sung, K. K.(1999). Incremental Learning with Support Vector Machines. International Joint Conference on Artificial Intelligence. 130
14. Vilalta, R., Ma, S., Hellerstein, J.(2001). Rule induction of computer events. IEEE International Workshop on Distributed Systems: Operations & Management, Springer Verlag, Lecture Notes in Computer Science. 127
15. Weiss, G., Hirsh, H.(1998). Learning to predict rare events in event sequences. International Conference on Knowledge Discovery and Data Mining. 127
16. Zaki, M. J.(2001). Sequence mining in categorical domains. Sequence Learning: Paradigms, Algorithms, and Applications, pp. 162-187, Springer Verlag, Lecture Notes in Computer Science. 127
17. Zipf, G. K.(1949). Human behavior and the principle of least effort: An introduction to human ecology. Addison-Wesley Press. 130