An Automatic Summarization of Call-For-Paper Documents Using a 2-Phase hidden Markov Model |
Kim, Jeong-Hyun
(삼성전자 무선사업부)
Park, Seong-Bae (경북대학교 컴퓨터공학과) Lee, Sang-Jo (경북대학교 컴퓨터공학과) Park, Se-Young (경북대학교 컴퓨터공학과) |
1 | P. Maes, "Agents that Reduce Work and Information Overloading," Communications of the ACM, Vol. 37, No. 7. pp. 31-40, 1994 |
2 | C. Manning and H. Schuetze, Foundations of Statistical Natural Language Processing, The MIT Press, 1999 |
3 | C. Giuliano, A. Gliozzo, A. Lavelli, and L. Romano, "Filtering Uninformative Words to Speed up IE: ITC-irst Participation in the PASCAL Challenge," PASCAL Challenge, 2005 |
4 | N. Chinchor, "Overview of MUC-7/MET-2," In Proceedings of the 7th Message Understanding Conference, 1998 |
5 | K. Seymore, A. McCallum, and R. Rosenfeld, "Learning Hidden Markov Model Structure for Information Extraction," In Proceedings of AAAI '99 Workshop on Machine Learning for Information Extraction, pp. 37-42, 1999 |
6 | E. Riloff, "Information Extraction as a Stepping Stone Toward Story Understanding," Understanding Language Understanding: Computational Models of Reading, The MIT Press, 1999 |
7 | D. Miller, T. Leek, and R. Schwartz, "A Hidden Markov Model Information Retrieval System," In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 214-221, 1999 |
8 | A. Viterbi, "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm," IEEE Transactions on Information Theory, Vol. 13, No. 2, pp. 260-267, 1967 DOI ScienceOn |
9 | A. Stolcke, Bayesian Learning of Probabilistic Language Models, Ph.D Thesis, University of California, Berkeley, 1994 |
10 | N. Ireson, F. Ciravegna, M. Claiff, D. Freitag, N. Kushmerick, and A. Lavelli, "Evaluating Machine Learning for Information Extraction," In Proceedings of the 22nd International Conference on Machine Learning, pp. 345-352, 2005 |