Proceedings of the twenty-first international conference on Machine learning最新文献_第8页

Boosting grammatical inference with confidence oracles 用自信的神谕促进语法推理

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015336

J. Janodet, R. Nock, M. Sebban, Henri-Maxime Suchier

引用次数: 7

Entropy-based criterion in categorical clustering 分类聚类中基于熵的准则

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015404

Tao Li, Sheng Ma, M. Ogihara

引用次数: 188

Towards tight bounds for rule learning 对规则学习的严格限制

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015387

U. Rückert, Stefan Kramer

引用次数: 14

A multiplicative up-propagation algorithm 一种乘法向上传播算法

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015379

Jong-Hoon Ahn, Seungjin Choi, Jong-Hoon Oh

引用次数: 21

A graphical model for protein secondary structure prediction 蛋白质二级结构预测的图形模型

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015354

Wei Chu, Zoubin Ghahramani, D. Wild

引用次数: 44

Feature extraction via generalized uncorrelated linear discriminant analysis 基于广义非相关线性判别分析的特征提取

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015348

Jieping Ye, Ravi Janardan, Qi Li, Haesun Park

引用次数: 46

Training conditional random fields via gradient tree boosting 通过梯度树增强训练条件随机场

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015428

Thomas G. Dietterich, A. Ashenfelter, Yaroslav Bulatov

{"title":"Training conditional random fields via gradient tree boosting","authors":"Thomas G. Dietterich, A. Ashenfelter, Yaroslav Bulatov","doi":"10.1145/1015330.1015428","DOIUrl":"https://doi.org/10.1145/1015330.1015428","url":null,"abstract":"Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such applications as part-of-speech tagging, text-to-speech mapping, protein and DNA sequence analysis, and information extraction from web pages. However, existing learning algorithms are slow, particularly in problems with large numbers of potential input features. This paper describes a new method for training CRFs by applying Friedman's (1999) gradient tree boosting method. In tree boosting, the CRF potential functions are represented as weighted sums of regression trees. Regression trees are learned by stage-wise optimizations similar to Adaboost, but with the objective of maximizing the conditional likelihood P(Y|X) of the CRF model. By growing regression trees, interactions among features are introduced only as needed, so although the parameter space is potentially immense, the search algorithm does not explicitly consider the large space. As a result, gradient tree boosting scales linearly in the order of the Markov model and in the order of the feature interactions, rather than exponentially like previous algorithms based on iterative scaling and gradient descent.","PeriodicalId":159792,"journal":{"name":"Proceedings of the twenty-first international conference on Machine learning","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126928656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 158

Variational methods for the Dirichlet process 狄利克雷过程的变分方法

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015439

D. Blei, Michael I. Jordan

引用次数: 188

Bellman goes relational Bellman是关系型的

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015401

K. Kersting, M. V. Otterlo, L. D. Raedt

引用次数: 121

Solving cluster ensemble problems by bipartite graph partitioning 用二部图划分方法求解聚类集成问题

Proceedings of the twenty-first international conference on Machine learning Pub Date : 2004-07-04 DOI: 10.1145/1015330.1015414

Xiaoli Z. Fern, C. Brodley

引用次数: 571