Matrix representations, linear transformations, and kernels for disambiguation in natural languageMachine Learning - Tập 74 Số 2 - Trang 133-158 - 2009
Pahikkala, Tapio, Pyysalo, Sampo, Boberg, Jorma, Järvinen, Jouni, Salakoski, Tapio
In the application of machine learning methods with natural language inputs, the words and their positions in the input text are some of the most important features. In this article, we introduce a framework based on a word-position matrix representation of text, linear feature transformations of the word-position matrices, and kernel functions constructed from the transformations. We consider two...... hiện toàn bộ
Learning boolean functions in an infinite attribute spaceMachine Learning - Tập 9 - Trang 373-386 - 1992
Avrim Blum
This paper presents a theoretical model for learning Boolean functions in domains having a large, potentially infinite number of attributes. The model allows an algorithm to employ a rich vocabulary to describe the objects it encounters in the world without necessarily incurring time and space penalties so long as eachindividual object is relatively simple. We show that many of the basic Boolean f...... hiện toàn bộ
Inverse reinforcement learning in contextual MDPsMachine Learning - Tập 110 - Trang 2295-2334 - 2021
Stav Belogolovsky, Philip Korsunsky, Shie Mannor, Chen Tessler, Tom Zahavy
We consider the task of Inverse Reinforcement Learning in Contextual Markov Decision Processes (MDPs). In this setting, contexts, which define the reward and transition kernel, are sampled from a distribution. In addition, although the reward is a function of the context, it is not provided to the agent. Instead, the agent observes demonstrations from an optimal policy. The goal is to learn the re...... hiện toàn bộ
Not So Naive Bayes: Aggregating One-Dependence EstimatorsMachine Learning - Tập 58 - Trang 5-24 - 2005
Geoffrey I. Webb, Janice R. Boughton, Zhihai Wang
Of numerous proposals to improve the accuracy of naive Bayes by weakening its attribute independence assumption, both LBR and Super-Parent TAN have demonstrated remarkable error performance. However, both techniques obtain this outcome at a considerable computational cost. We present a new approach to weakening the attribute independence assumption by averaging all of a constrained class of classi...... hiện toàn bộ
Learning sparse gradients for variable selection and dimension reductionMachine Learning - Tập 87 - Trang 303-355 - 2012
Gui-Bo Ye, Xiaohui Xie
Variable selection and dimension reduction are two commonly adopted approaches for high-dimensional data analysis, but have traditionally been treated separately. Here we propose an integrated approach, called sparse gradient learning (SGL), for variable selection and dimension reduction via learning the gradients of the prediction function directly from samples. By imposing a sparsity constraint ...... hiện toàn bộ
On the Complexity of Function LearningMachine Learning - Tập 18 - Trang 187-230 - 1995
Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger
The majority of results in computational learning theory are concerned with concept learning, i.e. with the special case of function learning for classes of functions with range {0, 1}. Much less is known about the theory of learning functions with a larger range such as
$$\mathbb{N}$$
or
...... hiện toàn bộ
A process for predicting manhole events in ManhattanMachine Learning - Tập 80 - Trang 1-31 - 2010
Cynthia Rudin, Rebecca J. Passonneau, Axinia Radeva, Haimonti Dutta, Steve Ierome, Delfina Isaac
We present a knowledge discovery and data mining process developed as part of the Columbia/Con Edison project on manhole event prediction. This process can assist with real-world prioritization problems that involve raw data in the form of noisy documents requiring significant amounts of pre-processing. The documents are linked to a set of instances to be ranked according to prediction criteria. I...... hiện toàn bộ