COPYRIGHT YEAR

2012

AUTHORS

Nader H. Bshouty, Nicolas Vayatis, Gilles Stoltz, Thomas Zeugmann

TITLE

Editors’ Introduction

ABSTRACT

The ALT-conference series is dedicated to studies on learning from an algorithmic and mathematical perspective. In the following, the five invited lectures and the regular contributions are introduced in some more detail. Invited Talks. It is now a tradition of the co-located conferences ALT and DS to have a joint invited speaker–namely this year, Luc De Raedt. Since 2006 he is a full research professor at the Department of Computer Science of the Katholieke Universiteit Leuven (Belgium). His research interests are in artificial intelligence, machine learning and data mining, as well as their applications. He is currently working on probabilistic logic learning (sometimes called statistical relational learning), which combines probabilistic reasoning methods with logical representations and machine learning, the integration of constraint programming with data mining and machine learning principles, the development of programming languages for machine learning, and analyzing graph and network data. In his talk Declarative Modeling for Machine Learning and Data Mining he notes that despite the popularity of machine learning and data mining today, it remains challenging to develop applications and software that incorporates machine learning or data mining techniques. This is because machine learning and data mining have focused on developing high-performance algorithms for solving particular tasks rather than on developing general principles and techniques. He thus proposes to alleviate these problems by applying the constraint programming methodology to machine learning and data mining and to specify machine learning and data mining problems as constraint satisfaction and optimization problems. The aim is that the user be provided with a way to declaratively specify what the machine learning or data mining problem is rather than having to outline how that solution needs to be computed.

Related objects

How to use: Click on a object to move its position. Double click to open its homepage. Right click to preview its contents.

Download the RDF metadata as:   json-ld nt turtle xml License info


27 TRIPLES      24 PREDICATES      24 URIs      13 LITERALS

Subject Predicate Object
1 book-chapters:bc4b4ff0d24b9e0bcfd9147204c05ded sg:abstract Abstract The ALT-conference series is dedicated to studies on learning from an algorithmic and mathematical perspective. In the following, the five invited lectures and the regular contributions are introduced in some more detail. Invited Talks. It is now a tradition of the co-located conferences ALT and DS to have a joint invited speaker–namely this year, Luc De Raedt. Since 2006 he is a full research professor at the Department of Computer Science of the Katholieke Universiteit Leuven (Belgium). His research interests are in artificial intelligence, machine learning and data mining, as well as their applications. He is currently working on probabilistic logic learning (sometimes called statistical relational learning), which combines probabilistic reasoning methods with logical representations and machine learning, the integration of constraint programming with data mining and machine learning principles, the development of programming languages for machine learning, and analyzing graph and network data. In his talk Declarative Modeling for Machine Learning and Data Mining he notes that despite the popularity of machine learning and data mining today, it remains challenging to develop applications and software that incorporates machine learning or data mining techniques. This is because machine learning and data mining have focused on developing high-performance algorithms for solving particular tasks rather than on developing general principles and techniques. He thus proposes to alleviate these problems by applying the constraint programming methodology to machine learning and data mining and to specify machine learning and data mining problems as constraint satisfaction and optimization problems. The aim is that the user be provided with a way to declaratively specify what the machine learning or data mining problem is rather than having to outline how that solution needs to be computed.
2 sg:abstractRights OpenAccess
3 sg:bibliographyRights Restricted
4 sg:bodyHtmlRights Restricted
5 sg:bodyPdfRights Restricted
6 sg:copyrightHolder Springer-Verlag Berlin Heidelberg
7 sg:copyrightYear 2012
8 sg:ddsId Chap1
9 sg:doi 10.1007/978-3-642-34106-9_1
10 sg:esmRights OpenAccess
11 sg:hasBook books:205f06b1694c5db0da6ae9330e5ff8de
12 sg:hasBookEdition book-editions:feb82beab87e058ee62200c797f72d40
13 sg:hasContribution contributions:5eb8f267288d290f9d6e5678a4219fb1
14 contributions:7a752fb494da781cd6ed464db9e4fcb0
15 contributions:9e877514bdda857fb07fdcfce7ca72ad
16 contributions:f4f4c86de809cab10442bbad7a6a6e8f
17 sg:language En
18 sg:license http://scigraph.springernature.com/explorer/license/
19 sg:metadataRights OpenAccess
20 sg:pageFirst 1
21 sg:pageLast 11
22 sg:scigraphId bc4b4ff0d24b9e0bcfd9147204c05ded
23 sg:title Editors’ Introduction
24 sg:webpage https://link.springer.com/10.1007/978-3-642-34106-9_1
25 rdf:type sg:BookChapter
26 rdfs:label BookChapter: Editors’ Introduction
27 owl:sameAs http://lod.springer.com/data/bookchapter/978-3-642-34106-9_1
HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular JSON format for linked data.

curl -H 'Accept: application/ld+json' 'http://scigraph.springernature.com/things/book-chapters/bc4b4ff0d24b9e0bcfd9147204c05ded'

N-Triples is a line-based linked data format ideal for batch operations .

curl -H 'Accept: application/n-triples' 'http://scigraph.springernature.com/things/book-chapters/bc4b4ff0d24b9e0bcfd9147204c05ded'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'http://scigraph.springernature.com/things/book-chapters/bc4b4ff0d24b9e0bcfd9147204c05ded'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'http://scigraph.springernature.com/things/book-chapters/bc4b4ff0d24b9e0bcfd9147204c05ded'






Preview window. Press ESC to close (or click here)


...