[dbjapan] CIKM 2008 CFP

["Atsuyuki Morishima" <amorishima [at] acm.org>]

日本データベース学会の皆様

筑波大の森嶋と申します．CIKMはDB系の会議としてはトップカンファレンスに
次ぐ位置づけにあり，DBだけでなくIRやKMのエリアの研究者も集うことが特徴です．
幅広いトピックの論文を受け付けておりますが，今年はデータガバナンスの重要な
要素技術であるData Quality, Adaptability, Maintainability and Reusabilityの
トラックがある予定です．
是非ご投稿をご検討いただければ幸いです．どうぞよろしくお願い申し上げます．

Important Dates
# Research and Industry Track
# Abstracts due: May 27, 2008
# Papers due: June 3, 2008
# Notification of Acceptance: July 15, 2008
# Camera ready August 15, 2008

--
森嶋厚行
筑波大学 知的コミュニティ基盤研究センター 知の共有基盤研究部門
筑波大学大学院 図書館情報メディア研究科
〒305-8550 つくば市春日1-2
Atsuyuki Morishima <amorishima [at] acm.org>
Research Center for Knowledge Communities, University of Tsukuba
1-2 Kasuga, Tsukuba, Ibaraki 305-8550, Japan
Phone: +81 29 859 1306 or 1556

===============================
First Call for Papers

ACM Seventeenth Conference on Information and Knowledge Management (CIKM 2008)
October 26-30, 2008, Napa Valley Marriott Hotel & Spa, California
http://www.cikm2008.org/

CIKM 2008 will take place at the Napa Valley Marriott Hotel & Spa, 3425 Solano Avenue, Napa, 
CA 94558. This is right in the center of beautiful wine country - north of San Francisco and
 about 50 minutes by car/bus/limo.

Since 1992, the ACM Conference on Information and Knowledge Management (CIKM) has 
successfully brought together leading researchers and developers from the database,
 information retrieval, and knowledge management communities. The purpose of the 
conference is to identify challenging problems facing the development of future knowledge 
and information systems, and to shape future research directions through the publication 
of high quality, applied and theoretical research findings. In CIKM 2008, we will continue 
the tradition of promoting collaboration among multiple areas. 

As CIKM 2008 will be held in Napa Valley, just one hour to the north of San Francisco, 
one of the goals of the conference is to embrace the innovative spirit of the Bay Area/Silicon 
Valley in bridging further the academic-commercial gap in the database, information retrieval, 
and knowledge management communities. To help achieve this goal, we will have a series of 
invited speakers and an industry day (separate from the industry research track) where 
luminaries, primarily from industry and from the VC (Venture Capital) community, will 
provide insights on how DB/IR/KM technologies are/can be leveraged to make a billion-dollar 
success.

We encourage submissions of high quality papers on all topics in the general areas of databases, 
information retrieval, and knowledge management. Papers that bridge across these areas are 
of special interest and will be considered for a "Best Interdisciplinary Paper" award. Topics of
 interest in the three areas include, but are not limited to:

Databases:
# Access methods and indexing
# Authorization, data privacy and security
# Concurrency control and recovery
# Data adaptability, reusability and quality
# Database languages and models
# Information integration, data provenance, probabilistic databases
# Mobile databases and distributed data management
# Peer-to-peer, parallel and distributed databases
# Query processing, optimization and performance
# Real-time and active databases
# Scientific and biological databases
# Semantic Web
# Semi-structured data processing, XML filtering and routing
# Stream-based processing and network databases
# String Databases, Blogs and Social Search
# Systems, middleware, applications and experiences
# Temporal, spatial and multimedia databases
# User experience: languages, models, interfaces

Information Retrieval:
# Citation Analysis, Social Networks for IR
# Domain-specific IR (e.g., Legal IR, Genome, Mobile IR, IR for chemical structures)
# Filtering (e.g., Routing, Collaborative filtering, Topic tracking, Recommender systems)
# Foundation of Information Retrieval (e.g., theory, ranking)
# IR Architectures, Scalability and Efficiency
# IR Evaluation
# Language Specific IR (Multi-lingual, Cross-lingual, NLP)
# Machine Learning for IR
# Multimedia IR (Audio, Speech, Video, Image)
# Semi-Structured Information Retrieval
# User Modeling for IR, Search Personalization
# Web Search, Advertising, Adversarial

Knowledge Management:
# Advertising and Optimization
# Classification and Clustering
# Data pre- and post-Processing
# Information Extraction
# Information Filtering and Recommender Systems
# Knowledge Synthesis and Visualization
# Large-scale statistical techniques
# Link and Graph Mining
# Semantic Techniques
# Temporal and Spatial data Mining
# Text Mining

Industry track:
# Industrial Practice and Experience
# Technology for Developing Regions


Paper Submissions
Authors are invited to submit original, unpublished research papers that are not being 
considered for publication in any other forum. Manuscripts should be submitted electronically, 
in PDF format and formatted using the ACM camera-ready templates.

Papers cannot exceed 10 pages in length. While there is no separate short paper/poster 
submission category, the programm committee will accept some full papers submissions as 
poster papers.

Uploading instructions and more detailed submission instructions for papers, workshop 
and tutorial proposals, will be made available at the conference website (www.cikm2008.org) 
shortly.

One author per paper is required to register and attend the conference to present the paper 
if accepted for publication.

A "Best Interdisciplinary Paper" award will be given to the best paper that bridges at least two 
of the general areas of interest to the conference, namely databases, information retrieval, 
and knowledge management.

Industrial Papers
Industry authors are also invited to submit papers describing solutions in the domains addressed 
by this conference, focusing on the technical aspects of their work. The submission procedure 
for industrial papers is the same as for research papers.

Important Dates
# Research and Industry Track
# Abstracts due: May 27, 2008
# Papers due: June 3, 2008
# Notification of Acceptance: July 15, 2008
# Camera ready August 15, 2008
========================