Honolulu, Hawaii, United States of America
Loading map...
{"minzoom":false,"maxzoom":false,"mappingservice":"leaflet","width":"auto","height":"350px","centre":false,"title":"","label":"","icon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"zoom":false,"defzoom":14,"layers":["OpenStreetMap"],"image layers":[],"overlays":[],"resizable":false,"fullscreen":false,"scrollwheelzoom":true,"cluster":false,"clustermaxzoom":20,"clusterzoomonclick":true,"clustermaxradius":80,"clusterspiderfy":true,"geojson":"","clicktarget":"","imageLayers":[],"locations":[{"text":"","title":"","link":"","lat":21.304547,"lon":-157.855676,"icon":""}],"imageoverlays":null}
Warning: Venue is missing. The map might not show the exact location.
===============================================================================
Special track on Relational Learning
(http://evolution.ibmc.up.pt/~nf/sac2009-learn/)
as part of the
24th Annual ACM Symposium on Applied Computing (SAC 2009)
(http://www.acm.org/conferences/sac/sac2009/)
Honolulu, Hawaii, USA
March 8 - 12, 2009
Relational Learning (RL) algorithms allow the use of more complex
representations for both data and models when compared with
traditional algorithms that use attribute-value representations. The
difference in the complexity of the representation makes RL algorithms
applicable to a wider range of applications but also rises new
problems. It is an important topic for data analysis in any field
that processes structured data an requires complex models. Problems
of scalability and efficient implementations are critical for RL
algorithms.
The track aims at providing a forum for researchers and practitioners
to exchange findings and review knowledge and understanding on topics
related to Relational Learning. It will be also an opportunity to present
novel applications and new RL systems.
List of topics
==============
A non-exclusive list of topics relevant to the track, sorted alphabetically,
include:
Applications of Relational Learning (bioinformatics, drug design,
text-mining, ...)
Distributed Computing for Relational Learning
Efficiency issues of Relational Learning
Graph Mining
Implementation issues of Relational Learning
Inductive Logic Programming
New Relational Learning algorithms
Propositionalization methods
Statistical Relational Learning
Important dates
===============
Deadline for paper submission & August 16th, 2008
Author notification & October 11th, 2008
Camera ready due & October 25th, 2008
Conference takes place & March 8 - 12, 2009
Submission
==========
Papers should respect the ACM SAC format as specified in:
http://www.acm.org/conferences/sac/sac2009/ Submission of papers
is made using the SAC submission web page. According to the
conference reviewing rules, all papers will be evaluated by three
reviewers following a blind review process (reviewers will be blind to
the identities of the authors and their institutions). The author(s)
name(s) and address(es) must NOT appear in the body of the paper, and
self-reference should be in the third person. This is to facilitate
blind review. Only the title should be shown at the first page without
the author's information.
Organization
============
Track chairs:
Rui Camacho
LIAAD & Faculdade de Engenharia, Universidade do Porto, Portugal
rcamacho@fe.up.pt
Vitor Santos Costa
CRACS & Faculdade de Ciencias, Universidade do Porto
vsc@dcc.fc.up.pt
Nuno Fonseca
Instituto de Biologia Molecular e Celular (IBMC) & CRACS,
Universidade do Porto
nf@ibmc.up.pt
Program Committee
=================
Hendrik Blockeel (Katholieke Universiteit Leuven, Belgium)
Rui Camacho (University of Porto, Portugal)
Jesse Davis (University of Washington, USA)
Ines Dutra (University of Porto, Portugal)
Nuno Fonseca (University of Porto, Portugal)
Paolo Frasconi (Universit degli Studi di Firenze, Italy)
Kristian Kersting (Fraunhofer IAIS, Germany)
Ross King (University of Aberystwyth, UK)
Stefan Kramer (Technische Universitaet Muenchen, Germany)
Siegfried Nijssen (Katholieke Universiteit Leuven, Belgium)
Irene Ong (University of Wisconsin, USA)
Vitor Santos Costa (University of Porto, Portugal)
Jude W. Shavlik (University of Wisconsin, USA)
Fernando Silva (University of Porto, Portugal)
Ashwin Srinivasan (IBM India Research Lab, India)
Jan Struyf (Katholieke Universiteit Leuven, Belgium)
Gerson Zavarucha (Federal University of Rio de Janeiro, Brasil)
Filip Zelezny (Czech Technical University in Prague, Czech Republic)
This CfP was obtained from WikiCFP
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
