DEADLINE EXTENSION: AMAI Spec. issue on graph mining

DEADLINE EXTENSION for the AMAI Special Issue on
Local Pattern Mining in Graph-Structured Data

New Submission Deadline: JUNE 15, 2011

Special Issue Guest Editors:
Tanya Y. Berger-Wolf (University of Illinois at Chicago, USA) Tamas Horvath
(University of Bonn; Fraunhofer IAIS, Sankt Augustin, Germany)

Mining graph-structured data has developed, over the last decade, into a separate
research field of Data Mining and Knowledge Discovery. Examples of real-world
graph-structured data include the Web graph, social, biological, telecommunication,
utility, road and transportation networks, as well as relational data. These and many
other occurrences of graph-structured data are arising and growing with enormous
dynamics in the digital universe. Accordingly, there is an increasing demand for
effective automated processing of massive graph-structured data. In this field of
research, there is a distinguished interest in mining local patterns, i.e., patterns that are
characteristic only for a subset of the input data, but still “interesting” according to some
user specified criteria. Such local patterns have been utilized in various ways in diverse
data processing tasks. For example, frequent patterns, the most common type of local
patterns, proved to be useful ingredients for predictive and descriptive data analysis or
for information retrieval.

The goal of this special issue is to present recent results on formal aspects of local
pattern mining in graph-structured data. The topics of interest include but are not limited
to:

– computational complexity of local pattern mining in the single- and multi-transactional
problem settings,
– efficient algorithms and heuristics for well-motivated problems,
– predicates and criteria for pattern interestingness,
– local vs. global pattern mining,
– local pattern mining with constraints,
– general approximation and randomized algorithms,
– sampling techniques for local pattern mining,
– non-standard pattern languages and pattern matching operators,
– local patterns in link mining and network analysis,
– local pattern mining in dynamic and evolving graphs,
– temporal local patterns

Submission Details:

Submissions to this special issue should follow the submission
guidelines of AMAI

http://www.springer.com/computer/ai/journal/10472.

Papers submitted for this special issue must contain formal results as
well as be original and not submitted simultaneously for publication
elsewhere. Extended versions of workshop and conference papers can also
be submitted; in this case the major changes with respect to the
original version must be listed in an accompanying letter.

Important Dates:

Submission Deadline: July 15, 2011
Author Notification: September 15, 2011
Final Paper Deadline: November 15, 2011
Special Issue: Early 2012 (tentative)

For further questions, please contact the guest editors at
tanyabw(at)uic.edu (T.Y. Berger-Wolf) and tamas.horvath(at)iais.fraunhofer.de
(T. Horvath)