Call For Papers (CFP)
Call for Papers of Journal Special
Issue and Book
in Mining Graphs, Trees and Sequences (MGTS)
- Special Issue in Fundamenta Informaticae -
Fundamenta Informaticae: http://fi.mimuw.edu.pl/index.html
- Book Edition of Special Issue from
IOS Press -
IOS Press: http://www.iospress.nl/
Guest Editors
Luc De Raedt, Professor, University of Freiburg, Germany
Takashi Washio, Associate Professor, Osaka University, Japan
Joost N. Kok, Professor, Leiden University, The Netherlands
Outline
of Journal Special Issue and IOS Press Book Edition
Ever since the early days of machine learning and data mining, it has been realized that the traditional attribute-value and item-set representations are too limited for many practical applications in domains such as chemistry, biology, network analysis and text mining. This has triggered a lot of research on mining and learning within alternative and more expressive representation formalisms such as computational logic, relational algebra, graphs, trees and sequences. Whereas there have been a large number of workshops devoted to multi-relational data mining and inductive logic programming as well as applications of intermediate representations in e.g. ontologies, bioinformatics, XML-data, text-mining, there has, to the best of our knowledge, not been any workshops specifically devoted to foundational issues in intermediate representations. Under this consideration, the following workdshop has been organized to bring together researchers interested in mining and learning within graphs, trees and sequences. The workshop was extremely successfull, and more than 40 researchers participated.
First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003)
(In conjunction with ECML/PKDD-2003)
http://www.ar.sanken.osaka-u.ac.jp/MGTS-2003CFP.html
On the success of MGTS-2003 workshop, we are pleased to announce Call For Papers of Journal Special Issue in Fundamenta Informaticae on the topic of Mining Graphs, Trees and Sequences (MGTS). We are also planning a book edition of the special issue which will be published from IOS Press.
The authors who presented their work in MGTS-2003 workshop are welcome to submit their full paper versions. The call for paper is not limited to the authors in MGTS-2003. We strongly encourage other researchers to submit their papers following the scope described bellow. All submitted papers will be equivalently reviewed in terms of relevance, originality, significance and presentation.
Scope
and Motivation
The state-of-the-art of data mining is that attribute-value and item-set representations lie at one extreme end of the spectrum, and multi-relational data mining and inductive logic programming at the other end. The middle is occupied by traditional data structures employed throughout the field of computer science. These include graphs, trees and sequences (or strings). The motivation for using such representations is that they are 1) more expressive (and therefore more widely applicable) than flat representations, and 2) potentially more efficient than multi-relational learning and mining techniques. At the same time, the data structures of graphs, trees and sequences are among the best understood and most widely applied representations within computer science. Thus these representations offer ideal opportunities for developing interesting contributions in data mining and machine learning that are both theoretically well-founded and widely applicable.
It is precisely the goal of this special issue to bring together researchers interested in mining and learning within graphs, trees and sequences. We believe it is the right time to have such a journal special issue and a book because of the increasing interest in the role of such data structures, which is in turn motivated by the many interesting application domains. Indeed, the total number of papers related to graph and tree mining in SIGMOD, SIGKDD, IJCAI/AAAI, ICML, ECML/PKDD and IEEE ICDM was 10 in 2001 and their number inceased to 18 in 2002. Along this line, the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003) was held in conjunction with ECML/PKDD-2003 in September, 2003. More than 20 papers have been submited,and 9 papers were selected for the presentation. The research activity in MGTS field is significantly increasing.
Topics
and goals
We are looking for contributions related to graph, tree and sequence structure mining and learning. More specifically, the special issue will focus on the following topics:
* Efficiency issues in graph, tree and sequence mining and learning
* Identifying interesting subclasses that can efficiently be mined or learned
* Basic princinciples of graph, tree and sequence mining
* Analysis of the complexity of graph, tree and sequence mining
* Applications to real world problems in e.g., biology, chemistry, XML, etc.
* Relationship of graph, tree and sequence mining to other techniques
* Any other result relevant to graph, tree and sequence mining.
Research works presenting theoretical results, basic research, perspective solutions and practical developments are welcomed, provided that they address the topic of the special issue.
Submission
guidelines
Please follow the standard guideline on paper format of Fundamenta Informaticae described in the following URL.
http://fi.mimuw.edu.pl/submissions.html
Authors are requested to email a title and a five line abstract in plain text as early as possible to facilitate organization.
Important Dates:
A five line abstract submissions : as early as possible but at least before 1/March/2004
Deadline for paper submissions : 19/March/2004
Notification to authors : 19/April/2004
Tentative
(Deadline for Reviced Paper Submission : 17/May/2004)
(Second Notification to authors : 7/June/2004)
(Deadline for Camera Ready Papers : 01/July/2004)
(Publication of the special issue : End of August/2004)
All submissions of the abstract and papers in latex and ps formats should be sent to the guest editors via email.
Takashi Washio Email: washio@ar.sanken.osaka-u.ac.jp
For further information about the special issue, please do not hesitate to contact the guest editors via
Takashi Washio Email: washio@ar.sanken.osaka-u.ac.jp
Address:
Institute for Scientific and Industrial Reseach, Osaka University
1-8, Mihogaoka, Ibarakishi, Osaka, 567-0047, Japan
For details about the policy of the FUNDAMENTA INFORMATICAE journal and the requirements for prospective authors, see a recent issue of the journal or check the journal's web site:
http://fi.mimuw.edu.pl/