Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Machine learning

How to Do Things With Words

/pdf/an-introduction-to-reinforcement-learning-e60mjj3y0p.pdf

An Introduction to Reinforcement Learning

Authorship attribution supported by statistical or computational methods has a long history starting from the 19th century and is marked by the seminal study of Mosteller and Wallace (1964) on the authorship of the disputed “Federalist Papers.” During the last decade, this scientific field has been developed substantially, taking advantage of research advances in areas such as machine learning, information retrieval, and natural language processing. The plethora of available electronic texts (e.g., e-mail messages, online forum messages, blogs, source code, etc.) indicates a wide variety of applications of this technology, provided it is able to handle short and noisy text from multiple candidate authors. In this article, a survey of recent advances of the automated approaches to attributing authorship is presented, examining their characteristics for both text representation and text classification. The focus of this survey is on computational requirements and settings rather than on linguistic or literary issues. We also discuss evaluation methodologies and criteria for authorship attribution studies and list open questions that will attract future work in this area. © 2009 Wiley Periodicals, Inc.

/pdf/a-survey-of-modern-authorship-attribution-methods-2lb4q2gu7n.pdf

A survey of modern authorship attribution methods

The Web, teeming as it is with language data, of all manner of varieties and languages, in vast quantity and freely available, is a fabulous linguists' playground. This special issue of Computational Linguistics explores ways in which this dream is being explored.

/pdf/introduction-to-the-special-issue-on-the-web-as-corpus-11p9enx6oc.pdf

Introduction to the special issue on the web as corpus

Authorship attribution is the task of identifying the author of a given text. The main concern of this task is to define an appropriate characterization of documents that captures the writing style of authors. This paper proposes a new method for authorship attribution supported on the idea that a proper identification of authors must consider both stylistic and topic features of texts. This method characterizes documents by a set of word sequences that combine functional and content words. The experimental results on poem classification demonstrated that this method outperforms most current state-of-the-art approaches, and that it is appropriate to handle the attribution of short documents.

/pdf/authorship-attribution-using-word-sequences-xpgp15j2sq.pdf

Authorship attribution using word sequences

Reinforcement Learning is commonly used for learning tasks in robotics, however, traditional algorithms can take very long training times. Reward shaping has been recently used to provide domain knowledge with extra rewards to converge faster. The reward shaping functions are normally defined in advance by the user and are static. This paper introduces a dynamic reward shaping approach, in which these extra rewards are not consistently given, can vary with time and may sometimes be contrary to what is needed for achieving a goal. In the experiments, a user provides verbal feedback while a robot is performing a task which is translated into additional rewards. It is shown that we can still guarantee convergence as long as most of the shaping rewards given per state are consistent with the goals and that even with fairly noisy interaction the system can still produce faster convergence times than traditional reinforcement learning techniques.

/pdf/dynamic-reward-shaping-training-a-robot-by-voice-3j79bdh4fj.pdf

Dynamic reward shaping: training a robot by voice

It was searched the minimal subset of channels for imagined speech.Channel selection was approached as multi-objective to obtain a Pareto front.A fuzzy system inference was applied to find a promising solution from Pareto front.Channel selection had a statistically similar performance to the use of all channels.It was observed a dependence between features and classes of imagined speech. One of the main purposes of brain-computer interfaces (BCI) is to provide persons of an alternative communication channel. This objective was firstly focused on handicapped subjects but nowadays its scope has increased to healthy persons. Usually, BCIs record brain activity using electroencephalograms (EEG), according to four main neuro-paradigms (slow cortical potentials, motor imagery, P300 component and visual evoked potentials). These analytical paradigms are not intuitive and are difficult to implement. Accordingly, this work researches an alternative neuro-paradigm called imagined speech, which refers to the internal pronunciation of words without emitting sounds or doing facial movements. Specifically, the present research is focused on the recognition of five Spanish words corresponding to the English words "up," "down," "left," "right" and "select", with which a computer cursor could be controlled. We perform an offline computer automatic classification procedure of a dataset of EEG signals from 27 subjects. The method implements a channel selection composed of two stages; the first one obtains a Pareto front and is approached as a multi-objective optimization problem dealing with the error rate and the number of channels; the second stage selects a single solution (channel combination) from the front, applying a fuzzy inference system (FIS). We assess the method's performance through a channel combination and a test set not used to generate the front. Several FIS configurations were explored to evaluate if a FIS is able to select channel combinations that improve or, at least, keep the obtained accuracies using all channels for each subject's data. We found that a FIS configuration, FIS3×3 (three membership functions for both input variables: error rate and the number of channels), obtained the best trade-off between the number of fuzzy rules and its accuracy (68.18% using around 7 channels). Also, the FIS3×3 obtained a similar statistically accuracy compared to the use of all channels (70.33%). Results of our method demonstrate the feasibility of using a FIS to automatically select a solution from the Pareto front to select channels applied to a problem of imagined speech classification. The presented method outperforms previous works in accuracy and showed a dependence relationship between EEG data and imagined words.

Implementing a fuzzy inference system in a multi-objective EEG channel selection model for imagined speech classification

The Author Profiling (AP) task aims to reveal as much as possible information from a given author's document (e.g., age, gender, etc.). AP is crucial for several applications, ranging from customized advertising to computer forensics, psychology, and entertainment. Nonetheless, the AP task is far from being solved, particularly in social media domains, where the nature of documents hinder the applicability of state-of-the-art text mining tools (e.g., because of spelling-grammar errors, huge vocabularies, and the presence of many out-of-vocabulary terms). Currently, most of the work in AP for social media has been devoted to the development of descriptive features, which are used under standard representations, such as the Bag-of-Words (BoW). Nevertheless, BoW-like representations have some well known shortcomings, namely: (i) the sparsity and high dimensionality of the representation, and (ii) the failure to capture relationships, other than mere occurrence, among terms. This paper focuses on the study of alternative document representations that can deal with such issues. We propose a representation for documents that capture discriminative and subprofile-specific information of terms. Under the proposed representation, terms are represented in a vector space that captures discriminative information. Then, term representations are aggregated to represent the content of a document. In this manner, documents are represented in a low-dimensional (and discriminative) space which is non-sparse. We evaluate the effectiveness of the proposed representation on several corpora from the social media domain. The proposed representation is compared to the standard BoW representation and a wide variety of state-of-the-art AP approaches. Experimental results reveal that the proposed representation outperforms most of the reference methodologies. Furthermore, we show that the proposed representation is in agreement with previous studies on handcrafted attributes for AP.

Luis Villaseñor-Pineda

Papers

Authorship attribution using word sequences

Dynamic reward shaping: training a robot by voice

Implementing a fuzzy inference system in a multi-objective EEG channel selection model for imagined speech classification

Discriminative subprofile-specific representations for author profiling in social media

Transfer learning in imagined speech EEG-based BCIs