8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery

You can download the entire collection of papers in a single file from here: http://www.cs.rpi.edu/tr/03-05.tar.gz or by clicking on the individual papers below.

8:00-8:30 Continental Breakfast

8:30-8:35 Opening Remarks

8:35-9:10 Invited Talk Analyzing Massive Data Streams: Past, Present, and Future: Minos Garofalakis, Bells Labs

Abstract: Continuous data streams arise naturally, for example, in the installations of large telecom and Internet service providers where detailed usage information (Call-Detail-Records, SNMP/RMON packet-flow data, etc.) from different parts of the underlying network needs to be continuously collected and analyzed for interesting trends. Such environments raise a critical need for effective stream-processing algorithms that can provide (typically, approximate) answers to data-analysis queries while utilizing only small space (to maintain concise stream synopses) and small processing time per stream item. In this talk, I will discuss the basic pseudo-random sketching mechanism for building stream synopses and our ongoing work that exploits sketch synopses to build an approximate SQL (multi) query processor. I will also describe our recent results on extending sketching to handle more complex forms of queries and streaming data (e.g., similarity joins over streams of XML trees), and try to identify some challenging open problems in the data-streaming area.

• 9:10-9:35 A Symbolic Representation of Time Series, with Implications for Streaming Algorithms, Jessica Lin, Eamonn Keogh, Stefano Lonardi, Bill Chiu (University of California, Riverside)

• 9:35-9:50 Clustering Binary Data Streams with K-means, Carlos Ordonez (Teradata, NCR)

• 10:15-10:40 Processing Frequent Itemset Discovery Queries by Division and Set Containment Join Operators, Ralf Rantzau (University of Stuttgart)

• 10:40-10:55 Efficient OLAP Operations for Spatial Data Using Peano Trees, Baoying Wang, Fei Pan, Dongmei Ren, Yue Cui, Qiang Ding, William Perrizo (North Dakota State University)

• 10:55-11:20 Clustering Gene Expression Data in SQL Using Locally Adaptive Metrics, Dimitris Papadopoulos (University of California, Riverside), Carlotta Domeniconi (George Mason  University), Dimitrios Gunopulos (University of California, Riverside), Sheng Ma (IBM T.J. Watson Research Center)
  

• 1:45-2:10 Graph-Based Ranking Algorithms for E-mail Expertise Analysis, Byron Dom, Iris Eiron, Alex Cozzi (IBM Almaden Research Center), Yi Zhang (CMU)
  

• 2:10-2:25 Deriving Link-context from HTML Tag Tree, Gautam Pant (The University of Iowa)

• 2:25-2:50 Clustering of Streaming Time Series is Meaningless , Jessica Lin, Eamonn Keogh, Wagner Truppel (University of California, Riverside)

• 2:50-3:05 A Learning-Based Approach to Estimate Statistics of Operators in Continuous Queries: a Case Study, Like Gao (GMU), X. Sean Wang (GMU), Min Wang (IBM T.J. Watson Research Center), Sriram Padmanabhan (IBM T.J. Watson Research Center)

• 3:05-3:30 Using transposition for pattern discovery from microarray data, Francois Rioult (GREYC CNRS 6072 - University of Caen), Jean-Francois Boulicaut (INSA Lyon LIRIS), Bruno Cremileux (GREYC CNRS 6072 - University of Caen), Jeremy Besson (INSA Lyon LIRIS)

• 3:30-3:45 Weave Amino Acid Sequences for Protein Secondary  Structure Prediction, Bin Wang (Northeastern University, China), Xiaochun Yang (Brigham Young University)

• 4:00-4:25 Assuring privacy when big brother is watching, Murat Kantarcioglu, Chris Clifton (Purdue University)

• 4:25-4:50 Dynamic Inference Control, Jessica Staddon (Palo Alto Research Center)