Mining for outliers in sequential databases

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 94-105

  Sun, Pei ^a   Chawla, Sanjay ^a   Arunasalam, Bavani ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; MATHEMATICAL MODELS; PROBABILITY; PROTEINS; SEQUENTIAL MACHINES; TREES (MATHEMATICS);

INFORMATION THEORETIC ARGUMENT; OUTLIERS; PROBABILISTIC SUFFIX TREES (PST); PROTEIN SEQUENCES;

DATABASE SYSTEMS;

EID: 33745447341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.9     Document Type: Conference Paper

References (15)

1. R. Ash, Information Theory, Dover Publications (1990).
2. S. D. Bay, and M. Schwabacher, Mining distance-based outliers in near linear time with randomization and a simple pruning rule, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003), pp. 29-38.
3. G. Bejerano, Automata Learning and Stochastic Modeling for Biosequence Analysis, PhD thesis, Hebrew University (2003).
4. G. Bejerano, and G. Yona, Variations on probabilistic suffix trees: statistical modeling and prediction of protein families, Bioinformatics, 17(1) (2001), pp. 23-43.
5. G. Bejerano, and G. Yona, Modeling protein families using probabilistic suffix trees, Proceedings of the third annual international conference on Computational molecular biology, (1999), pp. 15-24.
6. M. M. Breunig, H. P. Kriegel, R. T. Ng, and J. Sander, LOF: Identifying Density-Based Local Outliers, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (2000), pp. 93-104.
7. V. Guralnik, and G. Karypis, A Scalable Algorithm for Clustering Sequential Data, Proceedings of the 2001 IEEE International Conference on Data Mining, (2001), pp. 179-186.
8. T. Kahveci, and A. K. Singh, Efficient Index Structures for String Databases, Proceedings of the 27th International Conference on Very Large Data Bases (2001), pp. 351-360.
9. E. M. Knorr, and R. T. Ng, Algorithms for Mining Distance-Based Outliers in Large Datasets, Proceedings of the 24rd International Conference on Very Large Data Bases (1998), pp. 392-403.
10. A. Lazarevic, L. Ertöz, V. Kumar, A. Ozgur, and J. Srivastava, A Comparative Study of Anomaly Detection Schemes in Network Intrusion Detection, Proceed ings of SIAM International Conference on Data Mining (2003).
11. S. Ramaswamy, R. Rastogi, and K. Shim, Efficient Algorithms for Mining Outliers from Large Data Sets, Proceedings of the 2000 ACM SIGMOD international conference on Management of data (2000), pp. 427-438.
12. D. Ron, Y. Singer, and N. Tishby, The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length, Machine Learning, 25(2-3) (1996), pp. 117-149.
13. Z. Sun, and J. S. Deogun, Local Prediction Approach for Protein Classification using Probabilistic Suffix Trees, Proceedings of the second conference on Asia-Pacific bioinformatics (2004), pp. 357-362.
14. J. Yang, and W. Wang, CLUSEQ: Efficient and Effective Sequence Clustering, Proceedings of the 19th International Conference on Data Engineering (2003), pp. 101-112.
15. J. Yang, and W. Wang, Towards Automatic Clustering of Protein Sequences, Proceedings of the IEEE Computer Society Conference on Bioinformatics (2002), pp. 175-186.