The MGTS 2004 is the second edition of the workshop on Mining Graphs, Trees and Sequences, and will take place in conjunction with the ECML/PKDD 2004 in Pisa, Italy.
In recent years data mining research has expanded towards the analysis of more complexly structured data sets such as relational databases, XML databases, sequences and graphs. This workshop intends to gather researchers and practitioners interested in graph and tree mining, and hopes to attract the interest from a wide range of related research fields, including: inductive logic programming, multi-relational data mining, tree mining, symbolic sequence mining, semi-structured data mining, chemistry, bioinformatics, computer networking, structural pattern recognition, etc.
July 14: The list of accepted papers is online.
July 13: Although we hoped to send the reviews today, it takes a little bit longer to make the final decisions for some papers. We are sorry, but expect to send the announcements tomorrow morning.
July 12: Today we received the last reviews. The final decisions will be sent to the authors tomorrow.
June 14: The deadline is extended until June 21, 2004!
April 8: The call for papers is public!
Ever since the early days of machine learning, data mining and pattern recognition, it has been realized that the traditional attribute-value and item-set representations are too limited for many practically applications in domains such as chemistry, biology, network analysis, imaging and text mining. This has triggered research on mining and learning within more expressive representation formalisms such as computational logic, relational algebra, graphs, trees and sequences.
The state-of-the-art 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) and 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, machine learning and pattern recognition that are both theoretically well-founded and widely applicable.
We are looking for contributions related to graph, tree and sequence structure mining and learning. More specifically, the workshop will focus on the following topics:
Two types of basic submissions will be considered:
Basic and applied research papers are solicited. Papers should be formatted according to the LNCS format; more information about this style can be found on the Springer website. Papers that fail to comply to length limitations risk rejection. Electronic submission in PDF format is accepted. Hard copy and fax submissions will not be accepted. Papers should be sent by June 14, 2004, to the following address:
Subject: MGTS-2004 submission
Accepted papers will be published in the working notes provided by ECML/PKDD-2004 and will be available from the website. We plan a special issue of an international journal with a selection of the papers.
The full-day workshop consists of an introduction and paper presentations.