Call for papers -- ICDM MGCS Workshop 2007 IEEE ICDM Workshop on Mining Graphs and Complex Structures (MGCS2007) www.xifengyan.net/MGCS2007 In conjunction with the Seventh IEEE Int. Conf. of Data Mining (ICDM 2007) October 28, 2007, Omaha, NE, USA Submission site: http://wi-lab.com/cyberchair/icdm07/scripts/ws_submit.php (choose Workshop #7: Workshop on Mining Graphs and Complex Structures) Papers Due: Wednesday July 4th, 2007 ------------------------------------- ABSTRACT ------------------------------------- MGCS2007 calls for contributions related to mining of graphs and other complex data, such as sequences, trees, and high dimensional structures. Scalable methods for mining, clustering, classification and search in graphs and other complex structures have become increasingly important in data mining and database management with broad applications in bioinformatics, chemical informatics, computer vision, search, security, semantic web, and social science. The workshop intends to gather researchers and developers with an interest in developing algorithms and systems for novel knowledge discovery in graph and complex data. ------------------------------------- TOPICS OF INTEREST ------------------------------------- * Applications of graph mining (business, software, systems, e-commerce, security) * Biological network mining * Constrained graph mining * Dynamic graph mining * Foundations of graph mining * Graph classification * Graph clustering * Graph grammar inference and ILP * Graph visualization * High performance graph mining * Link analysis * Kernel methods for graphs * Scalable data mining algorithms for graph and complex data * Social network analysis * Spatial graph mining and 2D/3D structure mining * Scientific graph mining * Tree mining ------------------------------------- PAPER SUBMISSION ------------------------------------- Paper submissions should be limited to a maximum of 6 pages in the IEEE 2-column format; the same as the camera-ready format (see the IEEE Computer Society Press Proceedings Author Guidelines at http://www.computer.org/portal/pages/cscps/cps/final/icdm06.xml). All papers will be reviewed by the Program Committee on the basis of technical quality, relevance to graph/network mining, originality, significance, and clarity. Submission site: http://wi-lab.com/cyberchair/icdm07/scripts/ws_submit.php (choose Workshop #7: Workshop on Mining Graphs and Complex Structures) ------------------------------------- IMPORTANT DATES ------------------------------------- July 4, 2007, Submission of papers August 1, 2007, Notification August 17, 2007, Camera Ready Papers ------------------------------------- PROGRAM CO-CHAIRS ------------------------------------- Xifeng Yan, IBM T. J. Watson Research Center, USA xifengyan@us.ibm.com Lawrence B. Holder, Washington State University, USA holder@wsu.edu ------------------------------------- PROGRAM COMMITTEE ------------------------------------- * Jiawei Han, University of Illinois, USA * Yan Liu, IBM, T. J. Watson Research Center, USA * Thomas Gaertner, Fraunhofer Inst. for Autonomous Intelligent Systems, Germany * Michael R. Berthold, University of Konstanz, Germany * Takashi Washio, Osaka University, Japan * Frank Olken, LLNL and National Science Foundation, USA, * Istvan Jonyer, Oklahoma State University, USA * Ehud Gudes, Ben-Gurion University of the Negev, Israel * Lise Getoor, University of Maryland, USA * Tina Eliassi-Rad, Lawrence Livermore National Laboratory, USA * Karsten M. Borgwardt, University of Munich * Joost N. Kok, Leiden University, Netherlands * Siegfried Nijssen, Katholieke Universiteit Leuven, Belgium * Thorsten Meinl, University of Konstanz, Germany * Yun Chi, NEC Research Labs, USA * Jason T-L Wang, New Jersey's Science & Technology University, USA * Mohammed J. Zaki, Rensselaer Polytechnic Institute, USA * Christos Faloutsos, Carnegie Mellon University, USA -------------------------------------------------------------------------------- For any questions, please email to: xifengyan@us.ibm.com --------------------------------------------------------------------------------