Построение пространств свойств на основе вероятностных моделей для задач предсказания структур
Диссертация
Разработанные методы могут применяться для улучшения результатов широкого спектра методов предсказания структур, как при использовании т функции потерь точного совпадения, так и в случае более сложных, но более мотивированных функций потерь. Вычисления отображений на базе ^ вероятностных моделей, как правило, не приводят к существенному увеличению вычислительной сложности и не требуют привлечения… Читать ещё >
Список литературы
- Collins M. Head-Driven Statistical Models for Natural Language Parsing. // PhD thesis. University of Pennsylvania. Philadelphia, PA, U.S.A., 1999.
- Duda R. O., Hart P. E., Stork D. G. Pattern Classification. New York: John Wiley and Sons, 2001.
- Bishop C. M. Neural Networks for Pattern Recognition. Oxford, UK: Oxford University Press, 1995.- P. 482.
- Ripley B. D. Pattern Recognition and Neural Networks. Cambridge, UK: Cambridge University Press, 1996. a
- Schapire R. E. The strength of weak learnability. // Machine Learning, 1990. Vol. 5, N2. — p. 197−227.
- Vapnik, V. Statistical Learning Theory. New York: Wiley-Interscience, 1998.
- Freund Y., Schapire R. Large Margin Classsification Using the Perceptron Algorithm. // Machine Learning, 1999. Vol. 37, N3. — p. 277−296.
- Gentile C. A new approximate maximal margin classication algorithm. // Journal of Machine Learning Research, 2001. Vol. 2. — p. 213−242.
- Kowalczyk, A. Maximal margin perceptron. // Advances in Large Margin Classifiers, Cambridge, USA: MIT Press, 2000. p. 75−115.
- Cristianini, N., Shawe-Taylor, J. An Introduction to Support Vector Machines. Cambridge, UK: Cambridge University Press, 2000. P. 189.
- Williams C.K.I, Barber D. Bayesian Classification With Gaussian Processes // IEEE Transactions on Pattern Analysis and Machine Intelligence, 1998. Vol. 20, N12.- p. 1342−1351.
- Li Y. and Long P. M. The relaxed online maximum margin algorithm. //Machine Learning, 2002. Vol. 46, N1−3. — p. 361−387.
- Shawe-Taylor J., Cristianini N. Kernel Methods for Pattern Analysis. Cambridge, UK: Cambridge University Press, 2004. P. 461.
- Jaakkola T. S. and Haussler D. Exploiting generative models in discriminative classifiers. // Advances in Neural Information Processing 11,1998.
- Amari S.-I. Differential Geometrical Models in Statistics. New York: Springer, 1985.
- Tsuda K., Kawanabe M, Ratsch G., Sonnenburg S., Muller K. A new discriminative kernel from probabilistic models // Neural Computation, 2002. -Vol. 14, N10-p. 2397−2414.
- Taskar B., Klein D., Collins M., Koller D., Manning C. Max-margin parsing. // In Proc. Conf. on Empirical Methods for Natural Language Processing. Barcelona, Spain, 2004.
- Tsochantaridis I., Hofmann T., Joachims T., Altun Y. Support vector machine learning for independent and structured output Spaces // In proc. 21st International Conference on Machine Learning. Banff, Canada. 823−830,2004.
- Vorhees E., Harman D. Overview of the eighth text retrieval Conference // 8th Text Retrieval Conference (TREC). Gaithersburg, USA, 1999. p. 1−24.
- Haussler D. Convolution kernels on discrete structures. // Technical report, Univertsity of Santa Cruz. Santa Cruz, USA, 1999.
- Collins M., Duffy N. New reranking algorithms for parsing and tagging: kernels over discrete structures and the voted perceptring. // 40th Meeting of Association for Computational Linguistics. Philadelphia, USA, 2002. — p. 263−270.
- Leslie C., Eskin E., Cohen A., Weston J., Noble W.S. Mismatch string kernels for discriminative protein classification // Bioinformatics, 2004. Vol 20, N4. p.467−476.
- Henderson J., Titov I. Data-defined kernels for parse reranking derived from probabilistic models // 43rd Meeting Meeting of Association for Computational Linguistics. Ann Arbor, USA, 2005. -p. 181−188.
- David McAllester. Relating Training Algorithms to Generalization Bounds in Structured Classification //Advances in Neural Information Processing, Workshop on Structured Processing, 2004.
- Markus M.P., Santorini B. And Marcinkiewicz M.A. Building a large annotated corpus of English: The Penn Treebank. // Computational Linguistics, 1993. Vol.19, N2. — p.313−330.
- Koo T., Collins M. Hidden variable models for discriminative reranking. // Conference on Empirical Methods in Natural Language Processing. Vancouver, Canada, 2005.
- Bartlett P. For valid generalization, the size of the weights is more important than the size of the network. // Advances in Neural Information Processing 9,1997.-p.134−140.
- Bartlett P., Shawe-Taylor J. Generalization performance bound for support vector machines and other pattern classifiers. // Advances in Kernel Methods -Support Vector Learning. Cambridge, US: MIT Press, 1999. p. 43−54.
- Cheng J., Baldi P. Three-Stage Prediction of Protein Beta-Sheets by Neural Networks, Alignments, and Graph Algorithms. // Proceedings of the 2005 Conference on Intelligent Systems for Molecular Biology. Michigan, MI, U.S.A., 2005.
- Henderson J. Inducing history representations for broad coverage parsing. // Proc. of joint meeting of North American Chapter of the Association for Computational Linguistics. Edmonton, Canada, 2003. -p.103−110.
- Charniak E. A maximum entropy inspired parser. // Proc. of joint meeting of North American Chapter of Association for Computational Linguistics. Seattle, USA, 2000.-p. 132−139.
- Rosenkranz D.J., Lewis P.M. Deterministic Left Corner Parsing // Proc. 11th Symposium on Switching and Automata Theory. Santa Monica, USA, 1970.
- Manning C. D., Schutze H. Foundations of statistical natural language processing. New York: MIT Press, 2002. P. 680.
- Neal, R. M. Connectionist learning of belief networks // Artificial Intelligence, 1992. Vol. 56, p. 71−113.
- Saul L.K., Jaakkola T., Jordan M.I. Mean field theory for sigmoid belief networks. // Journal of Artificial Intelligence Research, 1996.- Vol 4.
- L. K. Saul and M. I. Jordan. A mean field learning algorithm for unsupervised neural networks. // Learning in Graphical Models. Cambridge, USA: MIT Press, 1999 p. 541−554.
- Jaakkola, T. Variational Methods for Inference and Estimation in Graphical Models. PhD thesis, Massachusetts Institute of Technology. Cambridge, USA, 1999.
- Barber D., Wiegerinck W. Tractable variational structure for approximation graphical models. // Advances in Neural Information Processing Systems 11. Cambridge, USA: MIT Press, 1999.
- Jaakkola, T. and Jordan, M. Improving the mean field approximation via the use of mixture distributions. // Learning in Graphical Models, NATO ASI, Behavioural and Social Sciences,. Boston/Dordrecht/London: Kluwer, 1998. -p. 163−174.
- Rosenblatt F. The perceptron: a probabilistic model for information storage and organization in brain. // Psychological review, 1959. vol. 63. — p. 386−408.
- Collins M. Discriminative reranking for natural language parsing. // 17th International Conference on Machine Learning. Stanford, USA, 2000. p. 175 182.
- Ratnaparkhi A. A maximum entropy model for part-of-speech tagging. // Empirical Methods in Natural Language Processing. Philadelphia, USA, 1996. -133−142.
- Yeh. A. More accurate test for the statistical significance of the result differences. // International Conference on Computational Linguistics. Saarbrucken, Germany, 2000.-p. 947−953.
- Collins M., Roark B. Incremental parsing with the perception algorithm. //Proc. 42nd Meeting of Association for Computational Linguistics. Barcelona, Spain, 2004.
- Shen L., Sarkar A., Joshi A. K. Using LTAG based features in parse reranking. // Proc. Conference on Empirical Methods in Natural Language Processing. Sapporo, Japan, 2003.
- Henderson J. Discriminative training of a neural network statistical parser. //Proc 42nd Meeting of Association for Computational Linguistics. Barcelona, Spain, 2004.
- Bod R. An efficient implementation of a new DOP mode. // Proc 10th Conf. of European Chapter of the Association for Computational Linguistics. Budapest, Hungary, 2003.
- Charniak E., Johnson M. Coarse-to-fine n-best parsing and MaxEnt discriminative reranking. //43rd Meeting Meeting of the Association for Computational Linguistics. Ann Arbor, USA, 2005. -p. 181−188.
- Goodman J. Parsing algorithms and methods. // In Proc. 34th Meeting of the Association for Computational Linguistics. Santa-Cruz, USA, 1996. -p.177−183.
- Och F. J. Minimum error rate training in statistical machine translation. //Proc. 41st Meeting of the Association for Computational Linguistics. Sapporo, Japan, 2003-p. 160−167.
- Paciorek C., Rosenfeld R. Minimum classification error training in exponential language models. // NIST/DARPA Speech Transcription Workshop. University of Maryland, College Park, USA, 2000.
- Juang B. H., Chou W. and Lee C. H. Statistical and discriminative methods for speech recognition. // Speech Recognition and Coding New Advances and Trends. Berlin, Germany: Springer-Verlag, 1995.
- Schluter R., Herman N. Model-based MCE bound to the true Bayes’error. // IEEE Signal Processing Letters.-Vol.8, N5.-p 131−133.
- Collins M., Koo T. Discriminative reranking for natural language processing. // Computational Linguitics. Vol.31, N1. — p. 25−69.
- Shen L., Joshi A.K. An SVM based voting algorithm with application to parse reranking. // Proc of the 7th Conference on Computational Natural Language Learning. Edmonton, Canada, 2003. -p.9−16.
- Platt J.C. Probabilistic outputs for support vector machines and comparision to regularized likelihood methods.//Advances in Large Margin Classifiers. Cambridge, USA: MIT Press, 1999.-p. 61−74.
- Joachims. T. Making large-Scale SVM Learning Practical. // Technical report of Universitat Dortmund, LS VIU-24,1998. Dortmund, Germany.
- Ng A., Jordan M. I. On Discriminative vs. Generative Classifiers: A comparision of logistic regression and naive Bayes. // Advances in Neural Information Processing Systems. Cambridge, USA: MIT Press, 2002.
- Rubenstein Y.D., Hastie T. Discriminative vs. informative learning. // Proc. 3rd International Conference on Knowledge Discovery and Data Mining. New Port Beach, USA, 1997. p.49−53.
- Generative vs. Discriminative Approaches to Entity Recognition from Label-Deficient Data. Goutte C., Gaussier E., Cancedda C. and Dejean H. // 7es Jouraees internationales d’Analyse statistique des Donnees Textuelles. Besancon, France, 2004.
- Bouchard G., Triggs B. The trade-off betwen generative and discriminative classifiers. // Iternational Conference on Computational Statistics. Prague, Czech Republic, 2004.
- Moschitti A. A study on convolutional kernels for shallow semantic parsing.//In Proc. 42nd Meeting of Association for Computational Linguistic. Barcelona, Spain, 2004.
- Roark B. and Bacchiani M. Supervised and unsupervised PCFG adaptation to novel domains. // In Proc. of Meeting of the Association for Computational Linguistics. Edmonton, Canada, 2003.
- Gildea D. Corpus variation and parser performance. // Proc. Conference on Empirical Methods in Natural Language Processing. Pittsburg, USA, 2001.
- Ratnaparkhi A. Learning to parse natural language with maximum entropy models. // Machine learning, 1999.- Vol.34- pl51−175.
- Francis W. N., Kucera H. A standard corpus of present day edited American English. Brown University, 1979.
- Henderson J. A neural network parser that handles sparse data // New developments in parsing technology. BostonrKluwer, 2004.
- Sekine S. The domain dependency of parsing. // Proc. of the 5th Conference on Applied Natural Language Processing. Washington, USA, 1997. p.96−102.
- Slocum J. How one might automatically identify and adapt to a sublanguage: an initial exploration. // Analyzing language in restricted domains, 1986. p. 195 210.
- Black E. A procedure for quantatively comparing the syntactic coverage of English grammars.//Proc. of 4th DARPA Speech and Natural Language Workshop, 1991.
- Kittredge R., Hirschman L. Sublanguage: studies of language in restricted semantic domains. // Series of Foundations of Communications. Germany, Berlin, 1983.
- Grishman R., Kittridge R. Analyzing language in restricted domains: Sublanguage description and processing. Hillsdale, N.J.: Erlbaum, 1986.
- Biber D. Using register-diversified corpora for general language studies. // Journal of Computer Linguistics, 1993. Vol. 19, N2. — p. 219−241.
- Karlgren J., Cutting D. Recognizing text genres with simple metrics using discriminant analysis. // The 15th Conference on Computational Linguistics, 1994. -p.1071−1075.
- Booth T. L, Thompson R.A. Applying probability measures to abstract languages. // IEEE Transactions on Computers. Vol.22. — p.442−450.
- Charniak E. Statistical Language Learning. Cambridge, MA: MIT Press, 1993
- Jelinek F., Lafferty J.D., Mercer R. L. Basic methods of probabilistic context free grammars. Technical report 72 684. IBM TJ Watson Research Center, 1990.
- Jelinek F., Lafferty J.D., Mercer R. L. Basic methods of probabilistic context free grammars. // Speech Recognition and Understanding: Recent Advances, Trends and Applications, 1992. Vol. 75 °F.
- Kupiec J. An algorithm for estimating the parameters of unrestricted hidden stochastic context-free grammars. // Proc of Conference on Computational Linguistics. Nantes, France, 1992. -p.387−393.
- K. Fukunaga and T.E. Flick, Classification error for a very large number of classes. // IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984 -Vol. 6, N6.-p. 779−788.
- Even-Zahar Y., Roth D. A. Sequential Model for Multi-Class Classification. // Conference on Empirical Methods on Natural Language Processing. Ithaca, USA, 2001.
- Foresti G.L. Outdoor scene classification by a neural tree-based approach.//Pattern Analysis and Applications, 1999- Vol.2.- p. 129−142.
- Crammer К., Singer Y. A New Family of Online Algorithms for Category Ranking. //Proceedings of the 25rd Conference on Research and Development in Information Retrieval. Tampere, Finland, 2002.
- Aiolli F., Sperduti A. Multiclass Classification with Multi-Prototype Support Vector Machines. // Journal of Machine Learning Research, 2005. Vol.6. -p.817−850.
- Hsu C.-W., Lin C.-J. A Comparison of Methods for Multi-class Support Vector Machines. // IEEE Transactions on Neural Networks Journal, 2002.-p.415−425.
- Scholkopf В., Burges C., Vapnik V. Extracting support data for a given task. // First International Conference on Knowledge Discovery and Data Mining. Menlo, USA, 1995.
- Вапник В. H. Воостановление зависимостей по эмпирическим данным. М.: «Наука», 1979.-449с.
- Scholkopf, S., Burges, С. J. С., Smola, A. J. Advances in Kernel Methods: Support Vector Learning. Cambridge, USA: MIT Press, 1999.
- Leibe В., Schiele B. Analyzing appearance and contour based methods for object categorization. // In International Conference on Computer Vision and Patter Recognition. Madison, USA, 2003. p.409−415.
- Squire D.M., Muller W., Muller H., Pun T. Content-Based quiery of image databases: inspiration from text retrieval. //Pattern Recognition Letters 21, 1999. -Vol. 13−14.-p.l 193−1198.