Mining Posets from Linear Orders and Chains
Dr. Proceso Fernandez, Jr.
28 November 2009, 8:30 to 3:30
Room CTC 313
Department of Information Systems and Computer Science
Ateneo de Manila University, Loyola Heights, Quezon City
With the growing popularity of knowledge discovery in databases (KDD) and its applications in numerous scientific domains, algorithms for data mining have become a fertile ground for theoretical developments. Modern data mining algorithms process massive amounts of data, typically more than what can fit into main memory, and yield significant and sometimes surprising patterns. These patterns can be viewed either as compressed representations or as generative models of the data, and are then used (instead of the entire data) as inputs for decision-making activities.
In this workshop, we will focus on the task of poset mining, i.e., finding order constraints (expressed as posets) from a collection of total orders and/or chains. We will start with basic concepts and definitions, walk through some related applications, present some research results, and discuss future directions. We will mix these with a couple of hands-on activities as well.
Hopefully, by the end of the workshop, all participants will not only have an idea of the problem space, but will also be moved to ponder some possible related areas for collaboration.
8:30 Start of registration
9:00-10:15 Session 1 (Introduction)
The Poset Cover Problem and its Applications
Hands-on Activity: Network Reconstruction
Survey of Related Literature
10:45-12:15 Session 2 (Results)
Algorithms for Generating Single Posets
Classes of Posets
NP-Completeness of the Poset Cover Problem
Other Polynomial-time Algorithms
13:30-15:00 Session 3 (Current and Future Work)
Hands-on Activity: Movie Ranking
Poset Cover Problem for Chains
Results & Open Questions
About Dr. Fernandez
Dr. Proceso Fernandez Jr. has been a faculty of the Ateneo de Manila University since 1997. He obtained his PhD in Computer Science from the same university, and did his sandwich program in Virginia Tech, USA. He has been a recepient of DOST-PCASTRD grants for his MS and PhD studies, and a CHED-FAPE grant for his sandwich program.
His main research areas include Computer Theory, Data Mining, Graph Theory, Image Processing and Multi-Agent Simulation. This year, he has coauthored a conference paper on Background Image Generation and submitted to a journal the paper entitled “Mining Posets from Linear Orders,” which is pending review. He is currently working on a paper about the Block Sorting Problem, another paper on Traffic Simulation, and is also collaborating with Trend Micro Phils. on Malware Detection.
Workshop costs and registration
The cost of the workshop is P350.00 and includes lunch, two snacks, and handouts. Payment procedures will be announced at a later date.
To register, please email the following details to Melinda Nicdao (firstname.lastname@example.org):
Subject line: 0911 Mining Posets Workshop
Designation: (e.g. faculty member, student, etc.)
Contact Phone Number:
For more information
Please email your inquiries to Melinda Nicdao (email@example.com)
Copyright © 2008 Ateneo de Manila University. All rights reserved.