To Örebro University

oru.seÖrebro University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Data Mining and Constraint Programming: Foundations of a Cross-Disciplinary Approach
Université Montpellier 2, Montpellier, France.
KU Leuven, Heverlee, Belgium.ORCID iD: 0000-0002-6860-6303
University of British Columbia, Vancouver, Canada.
Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
Show others and affiliations
2016 (English)Collection (editor) (Refereed)
Abstract [en]

A successful integration of constraint programming and data mining has the potential to lead to a new ICT paradigm with far reaching implications. It could change the face of data mining and machine learning, as well as constraint programming technology. It would not only allow one to use data mining techniques in constraint programming to identify and update constraints and optimization criteria, but also to employ constraints and criteria in data mining and machine learning in order to discover models compatible with prior knowledge.

This book reports on some key results obtained on this integrated and cross- disciplinary approach within the European FP7 FET Open project no. 284715 on “Inductive Constraint Programming” and a number of associated workshops and Dagstuhl seminars. The book is structured in five parts: background; learning to model; learning to solve; constraint programming for data mining; and showcases.

Place, publisher, year, edition, pages
Cham: Springer International Publishing , 2016. , p. 349
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10101
Keywords [en]
combinatorial optimization, constraint optimization, constraint solving, inductive logic programming, machine learning, algorithm selection, combinatorial search, constraint programming, constraint satisfaction, data mining, finite domain constraint models, hybrid domains, model acquisition, partition-based clustering, planning, quality of service, resource optimization, resource-allocation, scheduling, state-of-the-art solvers
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:oru:diva-87273DOI: 10.1007/978-3-319-50137-6ISI: 000408843500017ISBN: 978-3-319-50136-9 (print)ISBN: 978-3-319-50137-6 (electronic)OAI: oai:DiVA.org:oru-87273DiVA, id: diva2:1499307
Available from: 2020-11-09 Created: 2020-11-09 Last updated: 2025-01-20Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

De Raedt, Luc

Search in DiVA

By author/editor
De Raedt, Luc
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 69 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf