Discovery Science 2007

Home
Call for Papers
Committees and Chairs
Awards
Venue and Travel
Paper Submission
Registration
Program
Invited Talks
Links
Sponsors

Time Schedule

The conference starts on Monday, October 1st, with two tutorials, scheduled as follows:

13:00-16:00: Tutorial I
Marcus Hutter: On the Philosophical, Statistical, and Computational Foundations of Inductive Inference and Intelligent Agents
16:00-16:30: Coffee Break
16:30-18:30: Tutorial II
Kazuyuki Tanaka: Introduction to Probabilistic Image Processing and Bayesian Networks
from 17:00: Registration Desk Open
from 18:30: Reception

The table below presents the schedule for the other three days of the conference. Note that further info on tutorials can be found on the Tutorial page.

Details of the poster session are described below the time table.

Time	Tuesday, 2 October	Time	Wednesday, 3 October	Time	Thursday, 4 October
9:20-9:30	Opening Session
9:30-10:30	Invited Talk	9:00-10:00	Invited Talk	9:00-10:00	Invited Talk
	Jürgen Schmidhuber Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity		Thomas G. Dietterich Machine Learning in Ecosystem Informatics		Masaru Kitsuregawa Challenge for Info-plosion
10:30-10:45	Coffee Break	10:00-10:15	Coffee Break	10:00-10:15	Coffee Break
10:45-12:25	Classification	10:15-11:30	Text Mining	10:15-11:05	Foundations of Discovery
	Arkadiusz Tomczyk, Piotr S. Szczepaniak, and Michal Pryczek Active Contours as Knowledge Discovery Methods Paulo J. Azevedo and Alípio M. Jorge Iterative Reordering of Rules for Building Ensembles Without Relearning Liangxiao Jiang, Harry Zhang, Dianhong Wang, and Zhihua Cai Learning Locally Weighted C4.4 for Class Probability Estimation Tommi Mononen and Petri Myllymäki Fast NML Computation for Naive Bayes Models		Heung-Nam Kim, Inay Ha, Jin-Guk Jung, and Geun-Sik Jo User Preference Modeling from Positive Contents for Personalized Recommendation Kazuhiro Seki and Javed Mostafa Literature-Based Discovery by an Enhanced Information Retrieval Model Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, and Masayuki Takeda Unsupervised Spam Detection Based on String Alienness Measures		Hélène Hagège, Christopher Dartnell, and Jean Sallantin Positivism Against Constructivism: A Network Game to Learn Epistemology Oliver Ray and Katsumi Inoue A Consequence Finding Approach for Full Clausal Abduction
		11:30-11:45	Short Break	11:05-11:30	Short Break
		11:45-12:35	Regular Paper Spotlight Presentations	11:30-12:20	Discovery from Web and Networks
			Satoshi Fujishima, Yoshimasa Takahashi and Takashi Okada Pharmacophore Knowledge Refinement Method in the Chemical Structure Space Jean-Gabriel Ganascia and Bassel Habib An Attempt to Rebuild C. Bernard's Scientific Steps Gaëlle Hignette, Patrice Buche, Juliette Dibie-Barthélemy and Ollivier Haemmerlé Semantic Annotation of Data Tables Using a Domain Ontology Jaakko Hollmén Model Selection and Estimation Via Subjective User Preferences Kyosuke Nishida and Koichiro Yamauchi Detecting Concept Drift Using Statistical Testing Risa Nishiyama, Hironori Takeuchi, and Hideo Watanabe Towards Future Technology Projection: A Method for Extracting Capability Phrases from Documents Andrea Pietracaprina and Fabio Vandin Efficient Incremental Mining of Top-K Frequent Closed Itemsets Hiroshi Sankoh, Koichiro Doi and Akihiro Yamamoto An Intentional Kernel Funcition for RNA Classification Hisashi Tosaka, Atsuyoshi Nakamura, and Mineichi Kudo Mining Subtrees with Frequent Occurrence of Similar Subtrees Ruey-Ling Yeh, Ching Liu, Ben-Chang Shia, I-Jen Chiang, Wen-Wen Yang, and Hsiang-Chun Tsai Semantic Based Real-Time Clustering for PubMed Literatures		Ashok Veilumuthu and Parthasarathy Ramachandran Discovering Implicit Feedbacks from Search Engine Log Files V. Suresh, Narayanan Raghupathy, B. Shekar, and C.E. Veni Madhavan Discovering Mentorship Information from Author Collaboration Networks
12:25-13:30	Lunch Break	12:35-14:00	Lunch Break and Business Meeting		Adjourn
13:30-14:30	Invited Talk	14:00-15:00	Invited Talk
	Avrim Blum A Theory of Similarity Functions for Learning and Clustering		Alexander J. Smola A Hilbert Space Embedding for Distributions
14:30-14:45	Coffee Break	15:00-15:15	Coffee Break
14:45-16:00	Itemset Mining	15:15-16:30	Poster Session
	Shin-ichi Minato A Theoretical Study on Variable Ordering of Zero-Suppressed BDDs for Representing Frequent Itemsets Takeaki Uno and Hiroki Arimura An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining Mario Boley On Approximating Minimum Infrequent and Maximum Frequent Sets
16:00-16:25	Coffee Break
16:25-17:40	Algorithms for Discovery	16:30-18:30	Short Walk
	Haytham Elghazel, Hamamache Kheddouci, Véronique Deslandres, and Alain Dussauchoy A Partially Dynamic Clustering Algorithm for Data Insertion and Removal Hiroki Arimura, Takeaki Uno, and Shinichi Shimozono Time and Space Efficient Discovery of Maximal Geometric Graphs Hayato Kobayashi, Kohei Hatano, Akira Ishino, and Ayumi Shinohara Reducing Trials by Thinning-Out in Skill Discovery		Move to the site of Sendai Castle, 20 minutes walk or 5 minutes by Bus. Walking around the site and museum.
19:00-	Joint Steering Committee Meeting	18:30-	Banquet

Details of The Poster Session

The poster session will be held at Meeting Room 6 on the 3rd floor of Sendai International Center (floor map). Each poster presenter is assigned to a poster board which is 120cm wide and 180cm high, where the presenter can pin up his or her own poster. Push pins will be provided.