Computation of similarity measures for sequential data using generalized suffix trees

Advances in Neural Information Processing Systems

Volumn , Issue , 2007, Pages 1177-1184

  Rieck, Konrad ^a   Laskov, Pavel ^a   Sonnenburg, Sören ^a  

^a FRAUNHOFER FIRST   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DNA ANALYSIS; GENERIC ALGORITHM; KERNEL FUNCTION; NETWORK INTRUSION DETECTION; PROCESSING APPLICATIONS; RUNTIMES; SEQUENTIAL DATA; SIMILARITY COEFFICIENTS; SIMILARITY FUNCTIONS; SIMILARITY MEASURE; SUFFIX-TREES;

COMPUTER PROGRAMMING; DNA SEQUENCES; INTRUSION DETECTION; SELF ORGANIZING MAPS; TEXT PROCESSING;

FORESTRY;

EID: 38949213119     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. V.N. Vapnik. Statistical Learning Theory. Wiley, New York, 1998.
2. B. Schölkopf and A.J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
3. J. Shawe-Taylor and N. Cristianini. Kernel methods for pattern analysis. Cambridge University Press, 2004.
4. C. Watkins. Dynamic alignment kernels. In A.J. Smola, P.L. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 39-50, Cambridge, MA, 2000. MIT Press.
5. D. Haussler. Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, UC Santa Cruz, July 1999.
6. T. Joachims. Text categorization with support vector machines: Learning with many relevant features. Technical Report 23, LS VIII, University of Dortmund, 1997.
7. E. Leopold and J. Kindermann. Text categorization with Support Vector Machines. how to represent texts in input space? Machine Learning, 46:423-444, 2002.
8. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C. Watkins. Text classification using string kernels. Journal of Machine Learning Research, 2:419-444, 2002.
9. A. Zien, G. Rätsch, S. Mika, B. Schölkopf, T. Lengauer, and K.-R. Müller. Engineering Support Vector Machine Kernels That Recognize Translation Initiation Sites. BioInformatics, 16(9):799-807, September 2000.
10. C. Leslie, E. Eskin, and W.S. Noble. The spectrum kernel: A string kernel for SVMprotein classification. In Proc. Pacific Symp. Biocomputing, pages 564-575, 2002.
11. C. Leslie, E. Eskin, A. Cohen, J. Weston, and W.S. Noble. Mismatch string kernel for discriminative protein classification. Bioinformatics, 1(1):1-10, 2003.
12. J. Rousu and J. Shawe-Taylor. Efficient computation of gapped substring kernels for large alphabets. Journal of Machine Leaning Research, 6:1323-1344, 2005.
13. G. Rätsch, S. Sonnenburg, and B. Schölkopf. RASE: recognition of alternatively spliced exons in c. elegans. Bioinformatics, 21:i369-i377, June 2005.
14. S. Sonnenburg, A. Zien, and G. Rätsch. ARTS: Accurate Recognition of Transcription Starts in Human. Bioinformatics, 22(14):e472-e480, 2006.
15. H. Drucker, D. Wu, and V.N. Vapnik. Support vector machines for spam categorization. IEEE Transactions on Neural Networks, 10(5):1048-1054, 1999.
16. E. Eskin, A. Arnold, M. Prerau, L. Portnoy, and S. Stolfo. Applications of Data Mining in Computer Security, chapter A geometric framework for unsupervised anomaly detection: detecting intrusions in unlabeled data. Kluwer, 2002.
17. K. Rieck and P. Laskov. Detecting unknown network attacks using language models. In Proc. DIMVA, pages 74-90, July 2006.
18. T. Graepel, R. Herbrich, P. Bollmann-Sdorra, and K. Obermayer. Classification on pairwise proximity data. In M.S. Kearns, S.A. Solla, and D.A. Cohn, editors, Advances in Neural Information Processing Systems, volume 11, pages 438-444. MIT Press, 1999.
19. V. Roth, J Laub, M. Kawanabe, and J.M. Buhmann. Optimal cluster preserving embedding of non-metric proximity data. IEEE Trans. PAMI, 25:1540-1551, December 2003.
20. J. Laub and K.-R. Müller. Feature discovery in non-metric pairwise data. Journal of Machine Learning, 5(Jul):801-818, July 2004.
21. C. Ong, X. Mary, S. Canu, and A.J. Smola. Learning with non-positive kernels. In Proc. ICML, pages 639-646, 2004.
22. G. Salton. Mathematics and information retrieval. Journal of Documentation, 35(1):1-29, 1979.
23. M. Damashek. Gauging similarity with n-grams: Language-independent categorization of text. Science, 267(5199):843-848, 1995.
24. S.V.N. Vishwanathan and A.J. Smola. Kernels and Bioinformatics, chapter Fast Kernels for String and Tree Matching, pages 113-130. MIT Press, 2004.
25. K. Rieck, P. Laskov, and K.-R. Müller. Efficient algorithms for similarity measures over sequential data: A look beyond kernels. In Proc. DAGM, pages 374-383, September 2006.
26. R.R. Sokal and P.H. Sneath. Principles of numerical taxonomy. Freeman, San Francisco, CA, USA, 1963.
27. M.R. Anderberg. Cluster Analysis for Applications. Academic Press, Inc., New York, NY, USA, 1973.
28. E. Fredkin. Trie memory. Communications of ACM, 3(9):490-499, 1960.
29. D. Knuth. The art of computer programming, volume 3. Addison-Wesley, 1973.
30. P. Weiner. Linear pattern matching algorithms. In Proc. 14th Annual Symposium on Switching and Automata Theory, pages 1-11, 1973.
31. D. Gusfield. Algorithms on strings, trees, and sequences. Cambridge University Press, 1997.
32. E. Ukkonen. Online construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
33. C.H. Teo and S.V.N. Vishwanathan. Fast and space efficient string kernels using suffix arrays. In Proceedings, 23rd ICMP, pages 939-936. ACM Press, 2006.
34. M.I. Abouelhoda, S. Kurtz, and E. Ohlebusch. Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms, 2(1):53-86, 2002.
35. R. Lippmann, J.W. Haines, D.J. Fried, J. Korba, and K. Das. The 1999 DARPA off-line intrusion detection evaluation. Computer Networks, 34(4):579-595, 2000.
36. D.D. Lewis. Reuters-21578 text categorization test collection. AT&T Labs Research, 1997.