Argument based machine learning

AbstractWe present a novel approach to machine learning, called ABML (argumentation based ML). This approach combines machine learning from examples with concepts from the field of argumentation. The idea is to provide expert's arguments, or reasons, for some of the learning examples. We require that the theory induced from the examples explains the examples in terms of the given reasons. Thus arguments constrain the combinatorial search among possible hypotheses, and also direct the search towards hypotheses that are more comprehensible in the light of expert's background knowledge. In this paper we realize the idea of ABML as rule learning. We implement ABCN2, an argument-based extension of the CN2 rule learning algorithm, conduct experiments and analyze its performance in comparison with the original CN2 algorithm

Linguistic and metalinguistic categories in second language learning

This paper discusses proposed characteristics of implicit linguistic and explicit metalinguistic knowledge representations as well as the properties of implicit and explicit processes believed to operate on these representations. In accordance with assumptions made in the usage-based approach to language and language acquisition, it is assumed that implicit linguistic knowledge is represented in terms of flexible and context-dependent categories which are subject to similarity-based processing. It is suggested that, by contrast, explicit metalinguistic knowledge is characterized by stable and discrete Aristotelian categories which subserve conscious, rule-based processing. The consequences of these differences in category structure and processing mechanisms for the usefulness or otherwise of metalinguistic knowledge in second language learning and performance are explored. Reference is made to existing empirical and theoretical research about the role of metalinguistic knowledge in second language acquisition, and specific empirical predictions arising out of the line of argument adopted in the current paper are put forward. © Walter de Gruyter 2008

Judging Machines. Philosophical Aspects of Deep Learning

Although machine learning has been successful in recent years and is increasingly being deployed in the sciences, enterprises or administrations, it has rarely been discussed in philosophy beyond the philosophy of mathematics and machine learning. The present contribution addresses the resulting lack of conceptual tools for an epistemological discussion of machine learning by conceiving of deep learning networks as 'judging machines' and using the Kantian analysis of judgments for specifying the type of judgment they are capable of. At the center of the argument is the fact that the functionality of deep learning networks is established by training and cannot be explained and justified by reference to a predefined rule-based procedure. Instead, the computational process of a deep learning network is barely explainable and needs further justification, as is shown in reference to the current research literature. Thus, it requires a new form of justification, that is to be specified with the help of Kant's epistemology

Semi-automatic conversion of BioProp semantic annotation to PASBio annotation

<p>Abstract</p> <p>Background</p> <p>Semantic role labeling (SRL) is an important text analysis technique. In SRL, sentences are represented by one or more predicate-argument structures (PAS). Each PAS is composed of a predicate (verb) and several arguments (noun phrases, adverbial phrases, etc.) with different semantic roles, including main arguments (agent or patient) as well as adjunct arguments (time, manner, or location). PropBank is the most widely used PAS corpus and annotation format in the newswire domain. In the biomedical field, however, more detailed and restrictive PAS annotation formats such as PASBio are popular. Unfortunately, due to the lack of an annotated PASBio corpus, no publicly available machine-learning (ML) based SRL systems based on PASBio have been developed. In previous work, we constructed a biomedical corpus based on the PropBank standard called BioProp, on which we developed an ML-based SRL system, BIOSMILE. In this paper, we aim to build a system to convert BIOSMILE's BioProp annotation output to PASBio annotation. Our system consists of BIOSMILE in combination with a BioProp-PASBio rule-based converter, and an additional semi-automatic rule generator.</p> <p>Results</p> <p>Our first experiment evaluated our rule-based converter's performance independently from BIOSMILE performance. The converter achieved an F-score of 85.29%. The second experiment evaluated combined system (BIOSMILE + rule-based converter). The system achieved an F-score of 69.08% for PASBio's 29 verbs.</p> <p>Conclusion</p> <p>Our approach allows PAS conversion between BioProp and PASBio annotation using BIOSMILE alongside our newly developed semi-automatic rule generator and rule-based converter. Our system can match the performance of other state-of-the-art domain-specific ML-based SRL systems and can be easily customized for PASBio application development.</p

Towards Multilingual Coreference Resolution

The current work investigates the problems that occur when coreference resolution is considered as a multilingual task. We assess the issues that arise when a framework using the mention-pair coreference resolution model and memory-based learning for the resolution process are used. Along the way, we revise three essential subtasks of coreference resolution: mention detection, mention head detection and feature selection. For each of these aspects we propose various multilingual solutions including both heuristic, rule-based and machine learning methods. We carry out a detailed analysis that includes eight different languages (Arabic, Catalan, Chinese, Dutch, English, German, Italian and Spanish) for which datasets were provided by the only two multilingual shared tasks on coreference resolution held so far: SemEval-2 and CoNLL-2012. Our investigation shows that, although complex, the coreference resolution task can be targeted in a multilingual and even language independent way. We proposed machine learning methods for each of the subtasks that are affected by the transition, evaluated and compared them to the performance of rule-based and heuristic approaches. Our results confirmed that machine learning provides the needed flexibility for the multilingual task and that the minimal requirement for a language independent system is a part-of-speech annotation layer provided for each of the approached languages. We also showed that the performance of the system can be improved by introducing other layers of linguistic annotations, such as syntactic parses (in the form of either constituency or dependency parses), named entity information, predicate argument structure, etc. Additionally, we discuss the problems occurring in the proposed approaches and suggest possibilities for their improvement

Linguistic Metalinguistic Categories in Second Language Learning

This paper discusses proposed characteristics of implicit linguistic and explicit metalinguistic knowledge representations as well as the properties of implicit and explicit processes believed to operate on these representations. In accordance with assumptions made in the usage-based approach to language and language acquisition, it is assumed that implicit linguistic knowledge is represented in terms of flexible and context-dependent categories which are subject to similarity-based processing. It is suggested that, by contrast, explicit metalinguistic knowledge is characterized by stable and discrete Aristotelian categories which subserve conscious, rule-based processing. The consequences of these differences in category structure and processing mechanisms for the usefulness or otherwise of metalinguistic knowledge in second language learning and performance are explored. Reference is made to existing empirical and theoretical research about the role of metalinguistic knowledge in second language acquisition, and specific empirical predictions arising out of the line of argument adopted in the current paper are put forward. © Walter de Gruyter 2008

Argumentation for machine learning: a survey

Existing approaches using argumentation to aid or improve machine learning differ in the type of machine learning technique they consider, in their use of argumentation and in their choice of argumentation framework and semantics. This paper presents a survey of this relatively young field highlighting, in particular, its achievements to date, the applications it has been used for as well as the benefits brought about by the use of argumentation, with an eye towards its future

From Grimm to Glory: Simulated Oral Argument as a Component of Legal Education\u27s Signature Pedagogy

The past two years have been a period of landmark transformation in legal education. With the issuance of the Carnegie and Best Practices for Legal Education Reports, law schools and law professors have revisited the essential process of analyzing and transforming legal pedagogy. This widespread reexamination of the law school curriculum has yielded two important changes in legal education; first, law schools-including those in the top tier-have begun radically to amend their curricular goals and structures; and, second, legal scholars have begun to turn their attention to the theory and implementation of better legal education. As Carnegie and Best Practices note, this nascent metamorphosis in scholarly thought about legal education has the potential to transform both the law school and the law practice experience, as well-grounded pedagogy will remove the barriers to learning that some law students have historically experienced while better preparing them to practice law. This Article represents one of the first concrete responses to Carnegie and Best Practices. In proposing that law professors regularly use simulated oral argument exercises to supplement traditional Socratic dialogue, it meets head on the concerns expressed by Best Practices and Carnegie that over-reliance on the Langdell method neither mimics law practice nor nurtures student learning. It also responds directly to the suggestion in both Reports that simulation exercises may yield better legal analysis and knowledge. Finally, this Article advances a novel theory directly related to the objectives and conclusions of the Reports: namely, thatfor experienced advocates and law students alike, practice oral argument may be a starting point, rather than a mere end point, for teaching, learning, and executing the fundamentals of legal analysis. In the style of the transcribed classroom conversations of the Carnegie Report, it discusses and demonstrates by example a simulation exercise designedfor professors to use in introducing this teaching methodology. The exercise, based on seven fairy tales used as precedent cases, provides a familiar, non-threatening technique for students to learn about rule synthesis, weight of authority, analogy and distinction, and theme through oral argument

First-order logic learning in artificial neural networks

Artificial Neural Networks have previously been applied in neuro-symbolic learning to learn ground logic program rules. However, there are few results of learning relations using neuro-symbolic learning. This paper presents the system PAN, which can learn relations. The inputs to PAN are one or more atoms, representing the conditions of a logic rule, and the output is the conclusion of the rule. The symbolic inputs may include functional terms of arbitrary depth and arity, and the output may include terms constructed from the input functors. Symbolic inputs are encoded as an integer using an invertible encoding function, which is used in reverse to extract the output terms. The main advance of this system is a convention to allow construction of Artificial Neural Networks able to learn rules with the same power of expression as first order definite clauses. The system is tested on three examples and the results are discussed