• No results found

Developments in computational intelligence and machine learning

N/A
N/A
Protected

Academic year: 2021

Share "Developments in computational intelligence and machine learning"

Copied!
7
0
0

Loading.... (view fulltext now)

Full text

(1)

Developments in computational intelligence and

machine learning

Biehl, Michael; Ghio, Alessandre; Schleif, Frank-Michael DOI:

10.1016/j.neucom.2015.03.062 License:

Other (please specify with Rights Statement)

Document Version

Peer reviewed version

Citation for published version (Harvard):

Biehl, M, Ghio, A & Schleif, F 2015, 'Developments in computational intelligence and machine learning', Neurocomputing. https://doi.org/10.1016/j.neucom.2015.03.062

Link to publication on Research at Birmingham portal

Publisher Rights Statement:

NOTICE: this is the author’s version of a work that was accepted for publication in Neurocomputing. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Neurocomputing, DOI: 10.1016/j.neucom.2015.03.062.

Eligibility for repository checked April 2015

General rights

Unless a licence is specified above, all rights (including copyright and moral rights) in this document are retained by the authors and/or the copyright holders. The express permission of the copyright holder must be obtained for any use of this material other than for purposes permitted by law.

•Users may freely distribute the URL that is used to identify this publication.

•Users may download and/or print one copy of the publication from the University of Birmingham research portal for the purpose of private study or non-commercial research.

•User may use extracts from the document in line with the concept of ‘fair dealing’ under the Copyright, Designs and Patents Act 1988 (?) •Users may not further distribute the material nor use it for the purposes of commercial gain.

Where a licence is displayed above, please note the terms and conditions of the licence govern your use of this document. When citing, please reference the published version.

Take down policy

While the University of Birmingham exercises care and attention in making items available there are rare occasions when an item has been uploaded in error or has been deemed to be commercially or otherwise sensitive.

If you believe that this is the case for this document, please contact [email protected] providing details and we will remove access to the work immediately and investigate.

(2)

Author's Accepted Manuscript

Developments in computational intelligence and machine learning

Michael Biehl, Alessandre Ghio, Frank-Michael Schleif

PII: S0925-2312(15)00383-5

DOI: http://dx.doi.org/10.1016/j.neucom.2015.03.062 Reference: NEUCOM15309

To appear in: Neurocomputing

Cite this article as: Michael Biehl, Alessandre Ghio, Frank-Michael Schleif, Developments in computational intelligence and machine learning, Neuro-computing,http://dx.doi.org/10.1016/j.neucom.2015.03.062

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting galley proof before it is published in its final citable form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.

(3)

Editorial

Developments in computational intelligence and

machine learning

This special issue of Neurocomputing comprises 17 original articles, which are extended versions of selected pa-pers from the 22nd European Sympo-sium on Artificial Neural Networks, Computational Intelligence and Ma-chine Learning, ESANN 2014. ESANN is a single-track conference held annually in the medieval town Bruges in Belgium. The fascinating location and inspiring atmosphere fa-cilitates efficient scientific exchange and offers a most enjoyable environ-ment in which to discuss recent de-velopments. The conference is orga-nized by Prof. Michel Verleysen from Universite Catholique de Louvain, Belgium. In addition to regular con-tributions, the conference welcomes special sessions relating to specific topics of current interest. At ESANN 2014, for instance, special sessions addressed topics like spiking neural networks, learning in real world com-puting architectures, structured and non-standard data, big data, weight-less neural networks, and classifica-tion in the presence of label noise. The 22nd ESANN was attended by 145 researchers who presented 114 oral and poster contributions, cor-responding to an acceptance rate of 60%. Based on the reviews of the conference papers, taking also into

account the quality of the conference presentation and individual recom-mendations made by special session organizers, a number of authors were invited to submit an extended ver-sion of their contribution for this spe-cial issue of Neurocomputing. The selected articles were, once more, reviewed independently by at least two expert referees. In the following, we provide a brief overview of the 17 articles that were accepted for publication.

A number of contributions deal with kernel methods, suggesting exten-sions and modifications of the basic concepts or addressing specific ap-plications:

The paper Kernel methods for

het-erogeneous feature selection by Paul et al. introduces two feature selection

methods to deal with heterogeneous data that include continuous and cat-egorical variables. A dedicated kernel is suggested that handles both kind of variables within a recursive feature elimination procedure.

In the article by Chrysanthos et

al. entitled Theoretical properties and implementation of the one-sided mean kernel for time series, a novel

kernel for time series modeling is in-troduced. The authors show that it

(4)

is positive definite and reduces to a product kernel when comparing two sequences of the same length. The implementation is realized using dynamic programming techniques providing a fast algorithm with low complexity.

In their paper Scalable, accurate

image annotation with joint SVMs and output kernels, Xiong et al.

discuss the problem of efficient im-age annotation by joint training of multiple support vector machines. The authors exploit the dependen-cies between tags and show how the joint training strategy of SVMs can yield to substantial improvements, in terms of accuracy and efficiency, over training them independently. Multiple kernel learning (MKL) is the central topic of the contribu-tion by Donini and Aiolli, entitled

Easy MKL: a scalable multiple kernel learning algorithm. The authors

pro-pose a new time and space effective algorithm, that can deal with large amounts of kernels by scaling more efficiently than other state-of-the-art approaches.

Resource aware and energy efficient methods are addressed in two contri-butions, explicitly:

In Learning resource-aware models

for mobile devices: from regulariza-tion to energy efficiency, Ghio et al. consider how modern machine

learning approaches can be used in environments with limited ressource by means of regularization and self-adaptation. The authors propose to design a Human Activity

Recog-nition algorithm, which takes into account that only limited resources are available for its execution. They show how the hypothesis space can be restricted by applying advanced concepts from Statistical Learning Theory.

Energy efficiency is also the key topic of the paper Optimal resource usage

in ultra-low-power sensor interfaces through context- and resource-cost-aware machine learning.

Lauwere-ins et al. propose a novel approach to combine the C4.5 decision tree algorithm with adaptive hardware approaches. Only the most relevant features are activated in learning, exploiting adaptive feature extrac-tion circuits and hardware embedded learning.

The analysis of very high-dimensional data requires special measures in practice. A number of articles address the processing of high-dimensional data and their low-dimensional representation:

Lee et al. contributed the paper entitled Multi-scale similarities in

stochastic neighbourhood embedding: reducing dimensionality while pre-serving both local and global struc-ture. In comparison with standard,

single-scale dissimilarities, the sug-gested approach aims at good em-bedding quality on all scales. Exper-imental results illustrate the method and demonstrate its usefulness. A framework for performing PCA over a network of computing nodes is studied in the contribution by Fellus et al., which is entitled Asyn-2

(5)

chronous gossip principal component analysis. A decentralized algorithm

is proposed, analysed mathemati-cally, and studied experimentally. It can be applied to large scale prob-lems and incorporates a dimension reduction step into the so-called

gos-sip protocol.

The work of Kerdels et al. is focused on the Analysis of high-dimensional

data using local input space tograms. Local input space

his-tograms were introduced as a means to augment prototype-based vec-tor quantization methods in order to gather more information about the structure of the respective input space. The authors investigate this approach in the context of clustering and visualization of high-dimensional data.

The hubness phenomenon is dis-cussed by Flexer et al. in their paper Choosing lp norms in

high-dimensional spaces based on hub analysis. Hub objects have a small

distance to an exceptionally large number of data points. To avoid the negative effects of distance concen-tration, the previously suggested use of fractional norms is studied by the authors in an empirical analy-sis. They propose an unsupervised approach for choosing an lp norm

minimizing hubs while simultane-ously maximizing the classification performance.

Frequently, data is not embedded in a conventional vector space, as for instance in the cases of graphs, sequences or other data structures. Specific approaches for the

analy-sis of dissimilarities or proximities are discussed in the following three contributions:

Silvestre et al. investigate the use of

Dataset structure as prior informa-tion for parameter-free regularizainforma-tion of extreme learning machines. The

suggested regularization approach employs a parameter-free affinity matrix and is evaluated in terms of example classification problems. The paper Median variants of

Learn-ing Vector Quantization for learnLearn-ing of dissimilarity data by Nebel et al.

presents a prototype-based learning algorithm for situations in which la-beled data are given in form of a dissimilarity matrix only, without an explicit vector space representation. This is particularly interesting for the analysis of structured data like sequence data or graphs.

The paper entitled Metric learning

for sequences in relational LVQ by

Mokbel et al. deals with the integra-tion of low-rank metric adaptaintegra-tion into modern variants of Learning Vector Quantization. The proposed approach scales with both data di-mensionality and the cardinality of the considered set, and is sound from a theoretical point of view as well. Sequential data are also in the center of the contribution Neural Networks

for sequential data: a pre-training approach based on Hidden Markov Models by Pasa et al. The suggested

pre-training scheme is applicable in the presence of non-static data. The authors demonstrate the flexibility of the approach by applying it to two 3

(6)

different recurrent network architec-tures used for example prediction tasks in the context of polyphonic music.

The last three articles further ex-emplify the wide range of problems and methodological frameworks ad-dressed at the 2014 ESANN confer-ence:

When on-line learning and model in-terpretability are key issues to cope with, prototype-based models play a central role. In this context, Fis-cher et al. propose Efficient rejection

strategies for prototype-based classi-fication, allowing to decide whether

a reliable decision is possible or, al-ternatively, a reject is a preferable. In their contribution Selective Neural

Network ensembles in reinforcement learning: taking the advantage of many agents, Faußer and Schwenker

present an extensive empirical eval-uation of a method for selecting sub-sets of agents from large ensembles. Experimental results with respect to benchmark problems confirm that the method bears the promise to im-prove performance significantly in comparison with single agents or full ensembles.

Exploiting similarity in system iden-tification tasks with recurrent neural networks is the topic of a

contribu-tion by Spieckermann et al. The au-thors introduce a dual-task learning approach based on recurrent net-works with factored tensor compo-nents. In comparison with competing models, the method displays supe-rior performance with respect to

ef-ficiency and accuracy in benchmark problems.

As guest editors we would like to thank all authors for their submis-sions and the reviewers for their ex-cellent work. The compilation of the special issue imposes a very tight schedule and we thank reviewers and authors for making its publica-tion possible less than a year after ESANN 2014 took place. We also thank the Neurocomputing Editorial Board for giving us the opportunity to compile this issue. The support by Elsevier as a publisher is greatly ac-knowledged, in particular we would like to express thanks to Chandini Emmanuel and Vera Kamphuis from the Elsevier editorial office.

We thank Prof. M. Verleysen for his support with respect to this spe-cial issue and, most importantly, for organizing the outstanding se-ries of ESANN conferences, which enjoys an ever-increasing recogni-tion under his leadership. It is a pleasure for us to invite all inter-ested readers of this special issue to attend future ESANN conferences, which are regularly announced at http://www.elen.ucl.ac.be/esann.

Michael Biehl University of Groningen Johann Bernoulli Institute for Mathematics and Computer Science P.O. Box 407, 9700 AK Groningen, The Netherlands E-mail address: [email protected] Alessandre Ghio University of Genoa Department of Computer Science, 4

(7)

Bioengineering, Robotics and Systems Engineering (DIBRIS) Via Opera Pia 13, I-16145 Genoa, Italy E-mail address: [email protected] Frank-Michael Schleif The University of Birmingham School of Computer Science Edgbaston, Birmingham B15 2TT, United Kingdom E-mail address: [email protected]

References

Related documents

If the Athlete Representative reads and does not agree with the Selection Procedures being submitted by the NGB/HPMO, he/she may submit those reasons in writing to his/her

To estimate the e¤ect of strategic sale on banks’costs, in a regression of the logarithm of banks’ costs on a translog function of banks’ outputs and prices of inputs

It has been found that the forward stepwise approach performs greedy optimisation in the sense that each time the best model term is greedily (where the least-squares estimation

Keywords: Modularity, innovation, product and process development, organization design, design structure, organizational structure, organizational ties... The

according to are given to Alice and the other ones to Bob. The random variable ordering can b e pro duced as follows. Then we continue in the same way with the n.. data

Case survey findings suggest that, while characteristics of the combination situation only marginally affect trust, integration process variables such as the speed of integration,

free essays online learning professional good write a Where Nature which free essays online learning Lins car.. Many thanks need to