Abstraction augmented Markov models

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 68-77

  Caragea, Cornelia ^a   Silvescu, Adrian ^a   Caragea, Doina ^b   Honavar, Vasant ^a  

^a Iowa State University   (United States)

^b KANSAS STATE UNIVERSITY   (United States)

Author keywords

Abstraction; Markov models; Sequence classification

Indexed keywords

ABSTRACTION; ABSTRACTION HIERARCHY; CONTEXT TREE WEIGHTING; DATA SETS; HIGHER ORDER; MARKOV MODEL; MARKOV MODELS; OVERFITTING; PREDICTION BY PARTIAL MATCHES; PREDICTIVE MODELS; PROBABILISTIC SUFFIX TREES; PROTEIN SUBCELLULAR LOCALIZATION PREDICTION; SEQUENCE CLASSIFICATION; THREE ORDERS OF MAGNITUDE; VARIABLE ORDER MARKOV MODELS;

ABSTRACTING; DATA MINING;

MARKOV PROCESSES;

EID: 79951757020     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.158     Document Type: Conference Paper

References (26)

1. P. Baldi and S. Brunak, Bioinformatics: the Machine Learning Approach. MIT Press, 2001.
2. R. Durbin, S. R. Eddy, A. Krogh, and G. Mitchison, Biological sequence analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge Univ., 2004.
3. E. Charniak, Statistical Language Learning, Cambridge: 1993. MIT Press, 1993.
4. R. Begleiter, R. El-Yaniv, and G. Yona, "On prediction using variable order markov models," Journal of Artificial Intelligence Res., vol. 22, pp. 385-421, 2004. (Pubitemid 41525891)
5. J. Lin, "Divergence measures based on the Shannon entropy," IEEE Trans. on Inf. Thr., vol. 37, pp. 145-151, 1991.
6. G. Casella and R. L. Berger, Statistical Inference. Duxbury, 2002.
7. N. Slonim and N. Tishby, "Agglomerative information bottleneck," in Proc. of NIPS-12, 1999, pp. 617-623.
8. J. Gardy, "Psort-b: improving protein subcellular localization prediction for gram-negative bacteria," Nucleic Ac. Res., vol. 31, no. 13, pp. 3613-17, 2003. (Pubitemid 37442208)
9. O. Emanuelsson, H. Nielsen, S. Brunak, and G. von Heijne, "Predicting subcellular localization of proteins based on their n-terminal amino acid sequence." J. Mol. Biol., vol. 300, pp. 1005-1016, 2000.
10. T. G. Dietterich, "Approximate statistical tests for comparing supervised classification learning algorithms," Neural Computation, vol. 10, pp. 1895-1923, 1998. (Pubitemid 128463689)
11. E. Segal, D. Koller, and D. Ormoneit, "Probabilistic abstraction hierarchies," in Proc. of NIPS, Vancouver, Canada, 2002, pp. 913-920.
12. A. K. McCallum, R. Rosenfeld, T. M. Mitchell, and A. Y. Ng, "Improving text classification by shrinkage in a hierarchy of classes," in Proceedings of ICML, Madison, US, 1998, pp. 359-367.
13. J. Zhang, D.-K. Kang, A. Silvescu, and V. Honavar, "Learning accurate and concise naive bayes classifiers from attribute value taxonomies and data," Knowledge and Information Systems, vol. 9, pp. 157-179, 2006. (Pubitemid 43299762)
14. M. desJardins, L. Getoor, and D. Koller, "Using feature hierarchies in bayesian network learning." in Proc. of SARA, Springer-Verlag, 2000, pp. 260-270.
15. L. D. Baker and A. K. McCallum, "Distributional clustering of words for text classification," in Proc. of ACM SIGIR. ACM Press, 1998, pp. 96-103.
16. A. Silvescu, C. Caragea, and V. Honavar, "Combining super-structuring and abstraction on sequence classification," in ICDM, 2009, pp. 986-991.
17. G. Bejerano and G. Yona, "Modeling protein families using probabilistic suffix trees," in RECOMB '99. New York, NY, USA: ACM, 1999, pp. 15-24.
18. F. Jelinek and R. L. Mercer, "Interpolated estimation of markov source parameters from sparse data." Pattern Recognition in Practice, pp. 381-397, 1980.
19. T. M. Mitchell, Machine Learning. New York: McGraw-Hill, 1997.
20. D. M. Blei, T. Griffiths, M. I. Jordan, and J. Tenenbaum, "Hierarchical topic models and the nested chinese restaurant process." in Proc. of NIPS, 2004.
21. G. G. Langdon, "A note on the zivlempel model for compressing individual sequences," IEEE Transactions on Information Theory, vol. 29, pp. 284-287, 1983.
22. J. Rissanen, "A universal data compression system," IEEE Trans. on Inf. Thr., vol. 29, pp. 656-664, 1983.
23. M. Nisenson, I. Yariv, R. El-Yaniv, and R. Meir, "Towards behaviometric security systems: Learning to identify a typist," in ECML/PKDD, 2003, pp. 363-374. (Pubitemid 37231110)
24. F. M. J. Willems, Y. M. Shtarkov, and T. J. Tjalkens, "The context tree weighting method: Basic properties," IEEE Trans. on Inf. Thr., vol. 41, pp. 653-664, 1995.
25. J. G. Cleary and I. H. Witten, "Data compression using adaptive coding and partial string matching," IEEE Trans. on Communications, vol. 32, pp. 396-402, 1984.
26. D. Ron, Y. Singer, and N. Tishby, "The power of amnesia: Learning probabilistic automata with variable memory length," in Machine Learning, 1996, pp. 117-149. (Pubitemid 126724391)