Journal Article10.1007/S00500-014-1397-3
Differential evolution-based feature selection technique for anaphora resolution
Utpal Kumar Sikdar,Asif Ekbal,Sriparna Saha,Olga Uryupina,Massimo Poesio +4 more
- 01 Aug 2015
- Vol. 19, Iss: 8, pp 2149-2161
31
TL;DR: A differential evolution (DE)-based feature selection technique is developed for anaphora resolution in a resource-poor language, namely Bengali and a number of models for mention detection based on machine learning and heuristics are developed.
read more
Abstract: In this paper a differential evolution (DE)-based feature selection technique is developed for anaphora resolution in a resource-poor language, namely Bengali. We discuss the issues of adapting a state-of-the-art English anaphora resolution system for a resource-poor language like Bengali. Performance of any anaphoric resolver greatly depends on the quality of a high accurate mention detector and the use of appropriate features for anaphora resolution. We develop a number of models for mention detection based on machine learning and heuristics. In anaphora resolution there is no globally accepted metric for measuring the performance, and each of them such as MUC, $$\hbox {B}^{3}$$B3, CEAF, Blanc exhibit significantly different behaviors. Our proposed feature selection technique determines the near-optimal feature set by optimizing each of these evaluation metrics. Experiments show how a language-dependent system (designed primarily for English) can attain reasonably good performance level when re-trained and tested on a new language with a proper subset of features. Evaluation results yield the F-measure values of 66.70, 59.47, 51.56, 33.08 and 72.75 % for MUC, B 3, CEAFM, CEAFE and BLANC, respectively.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Binary differential evolution with self-learning for multi-objective feature selection
TL;DR: Experimental results on a series of public datasets show that the effective combination of the binary mutation and OPS makes the MOFS-BDE achieve a trade-off between local exploitation and global exploration.
406
Multi-Objective Particle Swarm Optimization Approach for Cost-Based Feature Selection in Classification
TL;DR: Experimental results show that the proposed PSO-based multi-objective feature selection algorithm can automatically evolve a set of nondominated solutions, and it is a highly competitive feature selection method for solving cost-based feature selection problems.
379
Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution
TL;DR: An alternative method for cloud task scheduling problem which aims to minimize makespan that required to schedule a number of tasks on different Virtual Machines (VMs) is presented and the proposed MSDE algorithm outperformed other algorithms according to the performance measures.
210
Multilabel feature selection: A comprehensive review and guiding experiments
TL;DR: A comprehensive review of the existing multilabel feature selection (ML‐FS) methods, and categorize these methods based on different perspectives as well as a review on ML learning algorithms as well.
138
References
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces
Rainer Storn,Kenneth Price +1 more
TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
•Book
Data Mining: Practical Machine Learning Tools and Techniques
Ian H. Witten,Eibe Frank,Mark Hall +2 more
- 25 Oct 1999
TL;DR: This highly anticipated third edition of the most acclaimed work on data mining and machine learning will teach you everything you need to know about preparing inputs, interpreting outputs, evaluating results, and the algorithmic methods at the heart of successful data mining.
25.4K
•Proceedings Article
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
John Lafferty,Andrew McCallum,Fernando Pereira +2 more
- 28 Jun 2001
TL;DR: This work presents iterative parameter estimation algorithms for conditional random fields and compares the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data.