English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/130281
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Speeding up operations on feature terms using constraint programming and variable symmetry

AuthorsOntañón, Santiago; Meseguer, Pedro
KeywordsNatural language processing systems
Learning systems
Constraint programing
Variable symmetries
Inductive logic programming
Constraint theory
Learning algorithms
Issue Date2015
CitationArtificial Intelligence 220: 104- 120 (2015)
AbstractFeature terms are a generalization of first-order terms which have recently received increased attention for their usefulness in structured machine learning, natural language processing and other artificial intelligence applications. One of the main obstacles for their wide usage is that, when set-valued features are allowed, their basic operations (subsumption, unification, and antiunification) have a very high computational cost. We present a Constraint Programming formulation of these operations, which in some cases provides orders of magnitude speed-ups with respect to the standard approaches. In addition, exploiting several symmetries - that often appear in feature terms databases - causes substantial additional savings. We provide experimental results of the benefits of this approach. © 2014 Elsevier B.V. All rights reserved.
Identifiersdoi: 10.1016/j.artint.2014.11.010
issn: 0004-3702
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.