IEEE ICDM Workshop on Mining Graphs and Complex Structures (MGCS2007)

Updated Program

Sunday, October 28 2007 (Room F - Big Blue B)
9:00-9:10 Introduction
9:10-10:00 Keynote Talk: Learning causal dependencies in networks
              David Jensen, University of Massachusetts Amherst

Talk Abstract:

Over the past decade, machine learning researchers have developed
techniques to estimate the joint distribution of a set of variables
that span multiple related entities. These methods, often grouped
under the rubric "relational learning", include probabilistic
relational models, relational Markov networks, and relational
dependency networks. These techniques build on work in artificial
intelligence, statistics, databases, graph theory, and social network
analysis, and they are profoundly expanding the phenomena that we can
understand and predict. However, new frontiers await.

In this talk, I will briefly survey some recent work in learning
probabilistic models of relational data, and discuss several
applications of these techniques, including fraud detection in the
U.S. securities industry. I will argue that current techniques are
capable of learning only a subset of the knowledge needed by
practitioners in these domains, and that informing effective action
often requires a causal model. I will examine the open question of
whether relational representations make the problem of learning
causal models easier or harder, and present some reasons for optimism
that relational representations may be able to greatly improve our
ability to learn such models.

Bio:

David Jensen is Associate Professor of Computer Science and Director
of the Knowledge Discovery Laboratory at the University of
Massachusetts Amherst. He received his doctorate from Washington
University in 1992. From 1991 to 1995, he served as an analyst with
the Office of Technology Assessment, an agency of the United States
Congress. His research focuses on machine learning and knowledge
discovery in relational data, with applications to social network
analysis, web mining, and fraud detection. He serves on the program
committees of the International Conference on Machine Learning and
the International Conference on Knowledge Discovery and Data Mining,
and he serves on the ACM SIGKDD Executive Committee.

10:00-10:20 Coffee Break
10:20-12:00 Session I (Clustering in Networks)
10:20-10:45  M. Shahriar Hossain and Rafal A. Angryk,
             "GDClust: A Graph-Based Document Clustering Technique"
10:45-11:10  Nurcan Yuruk, Mutlu Mete, Xiaowei Xu, and Thomas Schweiger,
             "A Divisive Hierarchical Structural Clustering Algorithm for Networks"
(cancelled)  Bin Wu, Xin Pei, and JianBin Tan,
              "Resume Mining of Communities in Social Network" (USA-visa issue)
11:10-11:35  Shouchun Chen, Fei Wang, and Changshui Zhang,
              "Simultaneous Heterogeneous Data Clustering Based on Higher Order Relationships"
12:00-13:30 Lunch
13:30-15:10 Session II (Link Analysis and Classification)
13:30-13:55  Brian Gallagher and Tina Eliassi-Rad,
              "An Examination of Experimental Methodology for Classifiers of Relational Data"
13:55-14:20  Masoud Makrehchi and Mohamed Kamel,
              "Learning Term Dependency Links Using Information Theoretic Inclusion Measure"
14:20-14:45  Matthew Rattigan, Marc Maier, and David Jensen,
              "Exploiting network structure for active inference in collective classification"
14:45-15:10  Mustafa Bilgic, Galileo Mark Namata, and Lise Getoor,
              "Combining Collective Classification and Link Prediction"
15:10-15:40 Coffee Break
15:40-16:55 Session III (Graph Pattern and Language)
15:40-16:05  Christophe Costa Florencio,
              "Tree Planar Languages"
16:05-16:30  William Eberle and Larry Holder,
              "Discovering Structural Anomalies in Graph-Based Data"
16:30-16:55  Mathias Fiedler and Christian Borgelt,
              "Subgraph Support in a Single Large Graph"