Program

NewPoster Presenters

Poster Session 1 presenters are requested to set up their poster material on the provided 4’ x 6’ poster boards in the Waterford room between the hours of 8:00 AM and 10:00 AM on Thursday the 20th.  Posters will remain on display through the end of the conference day at 8:30 PM.  Poster displays must be removed at this time.  Posters remaining after this time will be discarded.  SIAM is not responsible for discarded posters.

Poster Session 2 presenters are requested to set up their poster material on the provided 4’ x 6’ poster boards in the Waterford room between the hours of 8:00 AM and 10:00 AM on Friday the 21st.  Posters will remain on display through the end of the conference day at 6:30 PM.  Poster displays must be removed at this time.  Posters remaining after this time will be discarded.  SIAM is not responsible for discarded posters.

Time
Event
Location

Wednesday, April 19, 2006

 
5:00 PM - 7:00 PM
Registration Opens
Ballroom Foyer
 

Thursday, April 20, 2006

 
7:00 AM - 4:00 PM
Registration
Tiffany & Cartier
(Ballroom Level)
7:00 AM - 4:00 PM
Internet Cafe
Embassy Room
(Conference Level)
7:30 AM - 8:15 AM
Continental Breakfast
Chesapeake Suites
(Conference Level)
8:15 AM - 8:30 AM
Welcoming Remarks
Waterford/Lalique
(Ballroom Level)
8:30 AM - 9:45 AM
Keynote Speaker
Andreas Buja, Wharton School, University of Pennsylvania
Waterford/Lalique
(Ballroom Level)
9:45 AM - 10:00 AM
Coffee Break & Poster Session 1
Chesapeake Suites
(Conference Level)
10:00 AM - 12:00 PM

Theory

Area Under ROC Optimization Using a Ramp Function
Alan Herschtal Bhavani Raskutti Peter K. Campbell

On the Necessary and Sufficient Conditions of a Meaningful Distance Function for High Dimensional Data Space
Chih-Ming Hsu and Ming-Syan Chen

CPM: A Covariance-Preserving Projection Method
Jieping Ye, Tao Xiong, and Ravi Janardan

Transform Regression and the Kolmogorov Supposition Theorem
Edwin Pednault

Haverford
(Ballroom Level)
10:00 AM - 12:00PM

Tutorial 1

Randomized Algorithms for Matrices and Massive Data Sets
Petros Drineas and Michael W. Mahoney

Waterford
(Ballroom Level)
10:00 AM - 12:00PM

Enterprise Applications

A Latent Dirichelt Model for Unsupervised Entity Resolution
Indrajit Bhattacharya, Lise Getoor

Deriving Private Information from Randomly Perturbed Ratings
Sheng Zhang, James Ford, Fillia Makedon

Name Reference Resolution in Organizational Email Archives
Christopher P. Diehl, Lise Getoor and Galileo Namata  

Automated Knowledge Discovery From Simulators
M.C. Burl, D. DeCoste, B.L. Enke, D. Mazzoni, W.J. Merline, L. Scharenbroich

Lalique
(Ballroom Level
12:00 PM - 1:30 PM
Lunch
Attendees on their own
1:30 PM - 2:45 PM
Keynote Speaker
Latanya Sweeney, Carnegie Mellon University
Waterford/Lalique
(Ballroom Level)
2:45 PM - 3:15 PM
Coffee Break & Poster Session 1
Chesapeake Suites
(Conference Level)
3:15 PM - 4:45 PM

Anomalies and Outliers

Mining for Outliers in Sequential Databases
Pei Sun, Sanjay Chawla and Bavani Arunasalam

Mining Control Flow Abnormality for Logic Error Isolation
Chao Liu, Xifeng Yan, Jiawei Han

Scan Detection: A Data Mining Approach
Gyorgy Simon, Hui Xiong, Eric Eilertson, Vipin Kumar

Haverford
(Ballroom Level)
3:15 PM - 4:45 PM

Network Relations

Learning Bayesian Networks from Incomplete Data: An Efficient Method for Generating Approximate Predictive Distributions
Carsten Riggelsen

Efficient Markov Network Structure Discovery from Independence Tests
Facundo Bromberg, Dimitris Margaritis, Vasant Honavar

k-Means Clustering Over a Large Dynamic Network
Souptik Datta, Chris Giannella, Hillol Kargupta

Lalique
4:45 PM - 5:00 PM
Intermission
Attendees on their own
5:00 PM - 6:30 PM

Prototype Generation

Adapting K-Medians to Generate Normalized Cluster Centers
Benjamin J. Anderson, Deborah S. Gross, David R. Musicant, Anna M. Ritz, Thomas G. Smith, Leah E.        Steinberg

Advanced Prototype Machines: Exploring Prototypes for Classification
Hans-Peter Kriegel and Matthias Schubert

Towards Semantic XML Clustering
Andrea Tagarelli, Sergio Greco

Haverford
5:00 PM - 6:30 PM

Applications in Biology

A Semantic Approach for Mining Hidden Links from Complementary and Non-interactive Biomedical Literature
Xiaohua Hu, Xiaodan Zhang, Illhoi Yoo, Yanqing Zhang

Representation is Everything: Towards Efficient and Adaptable Similarity Measures for Biological Data
Charu Aggarwal

Mining Frequent Agreement Subtrees in Phylogenetic Databases
Sen Zhang, Jason T.L. Wang

Lalique
6:30 PM - 8:30 PM
Welcome Reception & Poster Display
Chesapeake Suites
8:30 PM
(All Poster Session 1 posters DOWN)

Friday, April 21, 2006

7:30 AM
(Poster Session 2 posters UP)
7:00 AM - 4:00 PM
Registration
Tiffany & Cartier
(Ballroom Level)
7:00 AM - 4:00 PM
Internet Cafe
Embassy Room
(Conference Level)
7:30 AM - 8:15 AM
Continental Breakfast
Chesapeake Suites
(Conference Level)
8:15 AM - 8:30 AM
Remarks
Waterford/Lalique
8:30 AM - 9:45 AM
Keynote Speaker
Stanley Wasserman, Indiana University
Waterford/Lalique
9:45 AM - 10:00 AM
Coffee Break & Poster Session 2
Chesapeake Suites
10:00 AM - 12:00 PM

Clustering

Trend Relational Analysis and Grey-Fuzzy Clustering Method
Zhijie Chen, Weizhen Chen, Qile Chen,and Mian-Yun Chen

Joint Cluster Analysis of Attribute Data and Relationship Data: The Connected k-Center Problem
Martin Ester, Rong Ge, Byron J. Gao, Zengjian Hu, Boaz Ben-Moshe

Weighted Clustering Ensembles
Muna Al-Razgan and Carlotta Domeniconi

Clustering in the Presence of Bridge Nodes
Jerry Scripps, Pang-Ning Tan

Haverford
10:00 AM - 12:00 PM

Tutorial 2

From Unsupervised to Semi-supervised Learning: Algorithms and evaluation approaches
Dimitrios Gunopulos, Michalis Vazirgiannis, and Maria Halkidi

Waterford
10:00 AM - 12:00 PM

Pattern Mining

Mining Interesting Patterns from Very High Dimensional Data: A Top-Down Row Enumeration Approach
Hongyan Liu, Jiawei Han, Dong Xin, Zheng Shao

Mining Frequent Patterns by Differential Refinement of Clustered Bitmaps
Jianwei Li, Alok Choudhary, Nan Jiang, and Wei-keng Liao

Discovery of Co-evoluting Spatial Co-located Event Sets
Jin Soung Yoo and Shashi Shekhar

Efficient Algorithms for Sequence Segmentation
Evimaria Terzi and Panayiotis Tsaparas

Lalique
12:00 PM - 1:30 PM
Lunch
Attendees on their own
1:30 PM - 2:45 PM
Keynote Speaker
Steven Salzberg, University of Maryland
Waterford/Lalique
2:45 PM - 3:15 PM
Coffee Break & Poster Session 2
Chesepeake Suites
3:15 PM - 4:45 PM

Temporal Data and Random Walks

Density-Based Clustering Over an Evolving Data Stream with Noise
Feng Cao, Martin Ester, Weining Qian, Aoying Zhou

A Random Walk Method for Text Classification
Yunpeng Xu, Xing Yi, Changshui Zhang

Efficient Mining of Temporally Annotated Sequences
F. Giannotti, M. Nanni, D. Pedreschi

Haverford
3:15 PM - 4:45 PM

Special Session

Mining On the Run: Self-Organizing Dynamic Data for Enhanced Search
Dr. H. Van Dyke Parunak, Altarum Org

Picking a Pooling
Richard Rohwer*, Ken Kreutz-Delgado** & Brandon Burge** *HNC Software, LLC / Fair Isaac Corp., **University of California at San Diego

Waterford
3:15 PM - 4:45 PM

Dimension Reduction and Coupling

A Framework for Local Supervised Dimensionality Reduction of High Dimensional Data
Charu Aggarwal

Segmentation and Dimensionality Reduction
Ella Bingham, Aristides Gionis, Niina Haiminen, Heli Hiisilä, Heikki Mannila, Evimaria Terzi

Probabilistic Multi-State Split-Merge Algorithm for Coupling Parameter Estimates
Juan K. Lin

Lalique
4:45 PM - 5:00 PM
Intermission
Attendees on their own
5:00 PM - 6:30 PM

Item Sets

Item Sets that Compress
Arno Siebes and Jilles Vreeken and Matthijs van Leeuwen

Mining Approximate Frequent Item sets in the Presence of Noise: Algorithms and Analysis
Jinze Liu, Susan Paulsen, Xing Xu, Wei Wang, Andrew Nobel, Jan Prins

Mining Frequent Closed Item sets Out of Core
Claudio Lucchese, Salvatore Orlando, Raffaele Perego

Haverford
5:00 PM - 6:30 PM

Special Session 2: Cont.

SurveyAnalyst: a Text Mining Tool for Survey Analysis
Dan Moldovan, Christine Clark, Daniel Hodges, John Prange Language Computer Corporation

ARGUS: Novelty Detection and Profile Tracking from Massive Data
Eugene Fink, and Jaime Carbonell, Carnegie Mellon University

Waterford
5:00 PM - 6:30 PM

Collaborative Mining

Local L-2 Thresholding Based Data Mining in Peer-to-Peer Networks
Ran Wolff, Kanishka Bhaduri, Hillol Kargupta

Collaborative Information Extraction and Mining from Multiple Web Documents
Tak-Lam Wong, Wai Lam, Shing-Kit Chan

Collaborative Document Clustering
Khaled Hammouda and Mohamed Kamel

Lalique
(All posters DOWN)

Saturday, April 22, 2006

 
7:00 AM - 3:00 PM
Registration
Tiffany & Cartier
(Ballroom Level)
7:00 AM - 3:00 PM
Internet Cafe
Embassy Room
(Conference Level)
7:30 AM - 8:00 AM
Continental Breakfast
Chesapeake Suites
(Conference Level)
8:00 AM - 10:00 AM

Workshops

See below for locations
10:00 AM - 10:30 AM
Coffee Break
Chesapeake Suites
10:30 AM - 12:00 PM
Workshops Continue
See below for locations
12:00 PM - 1:30 PM
Lunch
Attendees on their own
1:30 PM - 3:00 PM
Workshops Continue
See below for locations
3:00 PM - 3:30 PM
Coffee Break
Chesapeake Suites
3:30 PM - 5:00 PM
Workshops Continue
See below for locations

Workshop Locations

High Performance Data Mining (8 AM - 12 PM)
Bart Goethals and Hoony Park
Room: Old Georgetown

Spatial Data Mining: Consolidation and Renewed Bearing (1:30 PM - 5 PM)
Chris Bailey-Kellog and Naren Ramakrishnan
Room: Old Georgetown

Feature Selection for Data Mining (8 AM - 5 PM)
Huan Liu Robert Stine and Leonardo Auslender
Room: Judiciary Suite

Text Mining 2006 (8 AM - 5 PM)
Michael Berry, UTK/CS and Malu Castellanos, HP Laboratories
Room: Lalique

Link Analysis, Counterterrorism and Security (8 AM - 5 PM)
Ankur Teredesai and Kathleen Carley
Room: Ambassador/Diplomate

Scientific Data Mining (8 AM - 12 PM)
Chandrika Kamath and Michael Burl
Room: Cabinet Suite

Poster Track 1

Models and Algorithms

Summarizing Data Clusters: Description Formats, Problems and Algorithms

Positive Borders or Negative Bordes: What to Make Lossless Generator-based Representations Concise

Bayesian K-Means as a Maximization-Expectation Algorithm

A framework for clustering Massive Text and Categorical Data Streams

Cone Cluster Labeling for Support Vector Clustering

Semi-supervised Clustering with Partial Background Information

A New Privacy Preserving Distributed k-Clustering Algorithm

ODAC: Hierarchical Clustering of Time-Series Data Streams

Detecting the Change of Clustering Structure in Categorical Data Streams

Dissimilarity Measures for Detecting Hepatoxicity in Clinical Trial Data

Transducive De-noising, Dimensionality Reduction and Clustering Using Bregman Regression

Robust Estimation for Mixture of Probability Tables Based on Beta-Likelihoods

Fast Optimal Bandwidth Selection for Kernel Density Estimation

Risk Sensitive Learning via Expected Shortfall Minimization

On Approximate Solutions to Support Vector Machines

Confidence Estimation Methods for Partially Supervised
Information Extraction

Inference of Node Replacement Recursive Graph Grammars

Learning from Incomplete Ratings Using Non-negative Matrix
Factorization

Poster Track 2

Applications

Health Monitoring of a shaft transmission system via hybrid models of PCR and PLS

Modeling Evolutionary and Relational Behaviors for Community-Based Dynamic Recommendation

A Systematic Cross-Comparison of Sequence Classifiers

Data Enhanced Predictive Modeling for Sales Targeting

Graph Based Methods for Orbit Classification

Mining and Validation of WEb Transaction Data

Profiling Protein Families from Partially Aligned Sequences

Personalized Knowledge Discovery: Mining Novvel Association Rules from Text

A Novel Framework for Incorporating Labeled Examples into Anomaly Detection

Towards the Prediction of Protein Abundance from Tandem Mass Spectrometry Data

Using Compression to Identify Classes of Inauthentic Text

Fast Mining of Distance-Based Outliers in High Dimensional Data Sets

Spatial Weighted Outlier Detection

Fast Adaptive Summarization of Heterogeneous Data Sets

WIP: Mining Weighted Interesting Patterns with a Strong Weight and/or Support Affinity

Discovering Frequent Tree Patterns over Data Streams

Finding Sequential Pattern from a Massive Number of Spatio-Temporal Events

Mining Minimal Contrast Subgraph Patterns

 

 

 


DHTML Menus by http://www.milonic.com/