List of papers accepted by PAKDD 2009

This year, 111 papers among the 338 submissions have been accepted (with an acceptance rate of 32.84%).

Regular papers
1.
PAKDD09-0093
A Statistical Approach for Binary Vectors Modeling and Clustering
Nizar Bouguila
2.
PAKDD09-0105
Negative Encoding Length as a Subjective Interestingness Measure for Groups of Rules
Einoshin Suzuki
3.
PAKDD09-0125
A Data Driven Ensemble Classifier for Credit Scoring Analysis
Nan-Chen Hsieh
4.
PAKDD09-0129
A Nonparametric Bayesian Learning Model: Application to Text and Image Categorization
Nizar Bouguila
5.
PAKDD09-0303
Clustering with lower bound on Similarity
Mohammad Al Hasan
6.
PAKDD09-0319
Long-Term Relevance Feedback for Content-Based Image Suggestion
Sabri Boutemedjet
7.
PAKDD09-0322
Ranking Vector Machine: An Efficient Method for Learning Ranking SVM
Hwanjo Yu
8.
PAKDD09-0330
Sentence-Level Novelty Detection in English and Malay
Agus Trisnajaya Kwee
9.
PAKDD09-0361
A kernel framework for protein residue annotation
Huzefa Rangwala
10.
PAKDD09-0376
The Studies of Mining Frequent Patterns Based on Frequent Pattern Tree
Show-Jane Yen
11.
PAKDD09-0402
A Comparative Study of Bandwidth Choice in Kernel Density Estimation for Naive Bayesian Classification
Bin Liu
12.
PAKDD09-0403
Thai Word Segmentation with Hidden Markov Model and Decision Tree
Poramin Bheganan
13.
PAKDD09-0411
Approximate Spectral Clustering
Liang Wang
14.
PAKDD09-0422
Detecting Link Hijacking by Web Spammers
YOUNGJOO CHUNG
15.
PAKDD09-0423
Interval Data Classification under Partial Information: A Chance-Constraint Approach
Sahely Bhadra
16.
PAKDD09-0450
Robust Graph Hyperparameter Learning for Graph Based Semi-Supervised Classification
Krikamol Muandet
17.
PAKDD09-0456
Detecting abnormal events via Hierarchical Dirichlet Processes
Xian-Xing Zhang
18.
PAKDD09-0457
Quantifying Asymmetric Semantic Relations from Query Logs by Resource Allocation
Zhiyuan Liu
19.
PAKDD09-0483
A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences
Takashi Katoh
20.
PAKDD09-0503
Cool Blog Classification from Positive and Unlabeled Examples
Kritsada Sriphaew
21.
PAKDD09-0518
Regularized Local Reconstruction for Clustering
Jun Sun
22.
PAKDD09-0546
Efficient Privacy-Preserving Link Discovery
Jaideep Vaidya
23.
PAKDD09-0547
DTU: A Decision Tree for Uncertain Data
Biao Qin
24.
PAKDD09-0560
Dynamic Exponential Family Matrix Factorization
Kohei Hayashi
25.
PAKDD09-0575
An Integration of Fuzzy Association Rules and WordNetfor Document Clustering
Chun-Ling Chen
26.
PAKDD09-0588
An efficient method for generating, storing and matching features for text mining
CHAN SHING KIT
27.
PAKDD09-0621
Nonlinear Data Analysis Using A New Hybrid Data Clustering Algorithm
Ureerat Wattanachon
28.
PAKDD09-0648
Text Categorization using Fuzzy Proximal SVM and Distributional Clustering of words
Arunkumar Mani
29.
PAKDD09-0650
Analysis of Variational Bayesian Matrix Factorization
Shinichi Nakajima
30.
PAKDD09-0660
On Link Privacy in Randomizing Social Networks
Xintao Wu
31.
PAKDD09-0665
A Multi-Partition Multi-Chunk Ensemble Technique to Classify Concept-Drifting Data Streams
Mohammad Mehedy Masud
32.
PAKDD09-0669
Online Feature Selection Algorithm with Bayesian l1 Regularization
Yunpeng Cai
33.
PAKDD09-0683
Multi-Resolution Boosting for Classification and Regression
Chandan K Reddy
34.
PAKDD09-0686
Exploiting the Block Structure of Link Graph for Efficient Similarity Computation
Pei Li
35.
PAKDD09-0690
On Joint Feature Selection and Local Learning Based Clustering
Yiu-ming Cheung
36.
PAKDD09-0700
Discovering Periodic-Frequent Patterns in Transactional Databases
Syed Khairuzzaman Tanbeer
37.
PAKDD09-0710
Parameter Estimation in Semi-Random Decision Tree Ensembling on Streaming Data
PeiPei Li
38.
PAKDD09-0712
Active Learning for Causal Bayesian Network Structure with Non-symmetrical Entropy
Guoliang Li
39.
PAKDD09-0714
Acquiring Semantic Relations using the Web as Background Knowledge
Wilson Wong

Short papers

1.
PAKDD09-0102
Similarity-based Feature Selection for Learning From Examples with Continuous Values
Yun Li
2.
PAKDD09-0106
Incremental nu-Support Vector Machine Learning
Bin Gu
3.
PAKDD09-0122
Accurate Synthetic Generation of Realistic Personal Information
Peter Christen
4.
PAKDD09-0124
Cross-Channel Query Recommendation on Commercial Mobile Search Engine: Why, How and Empirical Evaluation
Shunkai Fu
5.
PAKDD09-0128
Arif Index for Predicting the Classification Accuracy of Features and its Application in Heart Beat Classification Problem
Muhammad Arif
6.
PAKDD09-0156
Budget Semi-supervised Learning
Zhi-Hua Zhou
7.
PAKDD09-0300
On Pairwise Kernels: An Efficient Alternative and Generalization Analysis
Hisashi Kashima
8.
PAKDD09-0302
A New Local Distance-based Outlier Detection Approach for Scattered Real-World Data
Ke Zhang
9.
PAKDD09-0307
A Parallel Algorithm for Finding Related Pages in the Web by using Segmented Link Structures
Shen Xiaoyan
10.
PAKDD09-0320
Mining Both Positive and Negative Impact-Oriented Sequential Rules From Transactional Data: a Case Study in Social Security
Yanchang Zhao
11.
PAKDD09-0321
Mining Outliers with Faster Cutoff Update and Space Utilization
Chi Cheong Szeto
12.
PAKDD09-0327
X-tracking the Changes of Web Navigation Patterns
Long Wang
13.
PAKDD09-0336
Building a Text Classifier by a Keyword and Unlabeled Documents
Qiu Qiang
14.
PAKDD09-0349
Simultaneously Finding Fundamental Articles and New Topics Using a Community Tracking Method
Tieyun Qian
15.
PAKDD09-0350
A Discriminative Approach to Topic-based Citation Suggestion
Jie Tang
16.
PAKDD09-0355
Spatial Weighting for Bag-of-Visual-Words Representation and Its Application in Content-Based Image Retrieval
Xin Chen
17.
PAKDD09-0359
UCI++: Improved Support for Algorithm Selection Using Datasetoids
Carlos Soares
18.
PAKDD09-0362
Addressing the Variability of Natural Language Expression in Sentence Similarity with Semantic Structure of the Sentences
Palakorn Achananuparp
19.
PAKDD09-0367
Change Analysis in Spatial Data by Combining Contouring Algorithms with Supervised Density Functions
Vadeerat Rinsurongkawong
20.
PAKDD09-0372
Growth Analysis of Neighbor Network for Evaluation of Damage Progress
Ken-ichi Fukui
21.
PAKDD09-0374
When does Co-Training Work in Real Data?
Charles X. Ling
22.
PAKDD09-0377
Item Preference Parameters from Grouped Ranking Observations
Hideitsu Hino
23.
PAKDD09-0380
Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces
Su Yan
24.
PAKDD09-0387
Application-independent feature construction from noisy samples
Dominique Gay
25.
PAKDD09-0388
Boosting Biomedical Information Retrieval Performance through Citation Graph: An Empirical Study
Jimmy Huang
26.
PAKDD09-0400
Centroid Neural Network with Spatial Constraints
Dong-Chul Park
27.
PAKDD09-0401
Classification of Audio Signals Using a Bhattacharyya Kernel-based Centroid Neural Network
Dong-Chul Park
28.
PAKDD09-0415
CBDT: A Concept Based Approach to Data Stream Mining
Stefan Hoeglinger
29.
PAKDD09-0416
Clustering Documents using a Wikipedia-based Concept Representation
Anna Huang
30.
PAKDD09-0418
Let's Tango - Finding the Right Couple for Feature-Opinion Association in Sentiment Analysis
Kam Tong Chan
31.
PAKDD09-0424
A Corpus-based Approach for Automatic Thai Unknown Word Recognition using Ensemble Learning Techniques
Jakkrit TeCho
32.
PAKDD09-0431
Extracting Fuzzy Rules for Detecting Ventricular Arrhythmias Based on NEWFM
Sang-Hong Lee
33.
PAKDD09-0433
Meaningful Subsequence Matching under Time Warping Distance for Data Stream
Vit Niennattrakul
34.
PAKDD09-0436
Speeding up Similarity Search on Large Time Series Dataset Under Time Warping Distance
Pongsakorn Ruengronghirunya
35.
PAKDD09-0437
A Family-based Evolutional Approach for Kernel Tree Selectionin SVMs
Ithipan Methasate
36.
PAKDD09-0442
Data Mining for Intrusion Detection: from Outliers to True Intrusions
Florent MASSEGLIA
37.
PAKDD09-0445
A Hybrid Approach to Improve Bilingual Multiword Expression Extraction
Jianyong Duan
38.
PAKDD09-0459
Safe-Level-SMOTE: Safe-Level-Synthetic Minority Over-sampling TEchnique for handling the class imbalanced problem
Chumphol Bunkhumpornpat
39.
PAKDD09-0463
An Effective Boosting Mehod for Naïve Bayesian Classifiers by Local Accuracy Estimation
Zhipeng Xie
40.
PAKDD09-0468
A Novel Fractal Representation for Dimensionality Reduction of Large Time Series Data
Poat Sajjipanon
41.
PAKDD09-0472
Spanning Tree Based Attribute Clustering
Yifeng Zeng
42.
PAKDD09-0474
An Efficient Candidate Pruning Technique for High Utility Pattern Mining
Chowdhury Farhan Ahmed
43.
PAKDD09-0489
Clustering Data Streams in Optimization and Geography Domains
Wen-Chih Peng
44.
PAKDD09-0490
k-Dominant Skyline Computation by using Sort-Filtering Method
Md. Anisuzzaman Siddique
45.
PAKDD09-0495
Trace Mining from Distributed Assembly Databases for Causal Analysis
Shohei Hido
46.
PAKDD09-0505
Emotion Recognition of Pop Music Based on Maximum Entropy with Priors
Hui He
47.
PAKDD09-0511
The effect of parameter tuning and focusing on bus travel time prediction
Carlos Soares
48.
PAKDD09-0528
Diversity in Combinations of Heterogeneous Classifiers
Kuo-Wei Hsu
49.
PAKDD09-0529
Music Ontology for Mood and Situation Reasoning to Support Music Retrieval and Recommendation
Seung Ro
50.
PAKDD09-0534
Learning to Extract Relations for Relational Classification
Steffen Rendle
51.
PAKDD09-0535
An Efficient Approximate Protocol for Privacy-Preserving Association Rule Mining
Jaideep Vaidya
52.
PAKDD09-0537
On optimal rules discovery: a framework and a necessary and sufficient condition for optimality
Yannick Le Bras
53.
PAKDD09-0552
Discovering Action Rules that are Highly Achievable from Massive Data
Einoshin Suzuki
54.
PAKDD09-0569
Using Highly Expressive Contrast Patterns for Classification - Is It Worthwhile?
Elsa Loekito
55.
PAKDD09-0583
Hot Item Detection in Uncertain Data
Matthias Renz
56.
PAKDD09-0585
Outlier Detection in Axis-Parallel Subspaces of High Dimensional Data
Peer Kröger
57.
PAKDD09-0592
An Online Incremental Learning Vector Quantization
Ye Xu
58.
PAKDD09-0594
Newistic: a distributed news gathering and analysis platform
Horatiu Mocian
59.
PAKDD09-0608
Sparse Kernel Learning and the Relevance Units Machine
Junbin Gao
60.
PAKDD09-0617
Link Structure Ranking Algorithm for Trading Networks
Andri Mirzal
61.
PAKDD09-0626
Estimating Optimal Feature Subsets Using Mutual Information Feature Selector and Rough Sets
Sombut Foitong
62.
PAKDD09-0628
A Multi-Resolution Approach for Atypical Behaviour Mining
Florent MASSEGLIA
63.
PAKDD09-0634
An Instantiation of Hierarchical Distance-based Conceptual Clustering for Propositional Learning
Maria Jose Ramirez-Quintana
64.
PAKDD09-0637
Website Classification using Extended Hidden Markov Models
Majid Yazdani
65.
PAKDD09-0649
Aggregated Subset Mining
Albrecht Zimmermann
66.
PAKDD09-0661
Transfer Learning Action Models by Measuring the Similarity of Different Domains
Hankui Zhuo
67.
PAKDD09-0670
On Mining Rating Dependencies in Online Collaborative Rating Networks
Hady W. Lauw
68.
PAKDD09-0682
Towards a Novel Association Measure via Web Search Results Mining
Xiaojun Wan
69.
PAKDD09-0687
An Aggregate Ensemble for Mining Data Streams with both Concept Drifting and Noise
peng zhang
70.
PAKDD09-0691
CLHQS: Hierarchical Query Suggestion by Mining Clickthrough Log
Depin Chen
71.
PAKDD09-0695
Romanization of Thai Proper Names Based On Popularity Of Usages
Akegapon Tangverapong
72.
PAKDD09-0704
Computing Substitution Matrices for Genomic Comparative Analysis
Minh Duc Cao

ACML 2009 Call for Paper

The 1st Asian Conference on Machine Learning (ACML'09) will be held in November 2-4, 2009, Nanjing, China. The conference aims at providing a leading international forum for researchers in Machine Learning and related fields to share their new ideas and achievements. Submissions from other than the Asia-Pacific regions are also highly encouraged.

Important dates:
- Full paper submission: 15 June 2009
- Author notification: 31 July 2009
- Camera-ready: 5 August 2009
- Conference: 2 -4 Novemeber 200

WISE 2009 Call for Paper

The aim of this conference is to provide an international forum for researchers, professionals, and industrial practitioners to share their knowledge and experience in the rapidly growing area of Web technologies, methodologies and applications. Previous WISE conferences were held in Hong Kong, China (2000), Kyoto, Japan (2001), Singapore (2002), Roma, Italy (2003), Brisbane, Australia (2004), New York, USA (2005), Wuhan, China (2006), Nancy, France (2007), and Auckland, New Zealand (2008).

Topics of Interest

WISE 2009 invites submissions on all topics related to Web information systems engineering, including but not limited to those listed below:

• Complex Event Processing and Event-driven Systems

• Deep/Hidden Web

• e-Commerce and e-Government

• Grid Computing and P2P Systems

• Innovative Web-based Applications

• Location-based Services

• Mobile Web Information Systems

• Rich Web UI

• Semantic Web

• Web Agents and Web Intelligence

• Web Data Integration

• Web Data Mashup

• Web Data Models

• Web Information Retrieval

• Web Metrics

• Web Mining and Web Warehousing

• Web Monitoring and Management

• Web Performance

• Web Security and Trust Management

• Web Services

• Web Tools and Languages

• Web Transactions

• Web Visualization

• Web-based Auction and Negotiation

• Web-based Business Processes

• Web-based Enterprise Systems

• Web-based Learning

• XML and Semi-structured Data

Research and Industry Tracks

There will be two independent tracks for Research and Industrial papers with a different set of evaluation criteria. The authors must clearly indicate the track to which the paper is being submitted.


Research Papers: The conference is soliciting original research papers on all aspects of Web information systems engineering. Submitted papers will be judged according to their scientific merits and evaluated on significance, originality, technical quality, and exposition.

Industrial and Application Papers: WISE 2009 encourages submissions covering the application of Web information systems engineering in practice, including papers describing innovative implementations, novel applications, and major improvements to the state-of-practice. The papers submitted to this track can range from a few page extended abstract to a full paper. The track will also include a small number of invited visionary papers.

Publication

The proceedings of WISE 2009 will be published in two separate volumes by Springer in its Lecture Notes in Computer Science series, one volume for all papers accepted by the main conference, and one volume for all papers accepted by all WISE workshops. A special issue of the World Wide Web Journal is scheduled in 2010 for publishing extended versions of selected WISE 2009 papers.

Important Dates:

Workshop proposals	February 28, 2009
Paper Submission	May 1, 2009
Tutorial/Panel Proposals	May 31, 2009
Author Notification	June 15, 2009
Camera-ready submission	June 28, 2009
Author registration	June 28, 2009
Conference and Workshops	October 5-7, 2009

RecSys'09: Third ACM Conference on Recommender Systems Call for Paper

CALL FOR PAPERS

We are pleased to invite you once again to participate in the premier annual event on research and applications of recommendation technologies, the Third ACM Conference on Recommender Systems. The previous conferences in Minneapolis and Lausanne have been distinguished by a strong level of interaction between practitioners and researchers in the sharing of ideas, problems and solutions, and the 2009 conference will continue in this tradition. The fully-refereed proceedings will be published by the ACM and, like past RecSys proceedings, are expected to be widely read and cited.

TECHNICAL PROGRAM

The technical program will celebrate the diversity of research in and applications of recommender systems with refereed and invited presentations, keynote talks and posters.

Tutorials

The first day of the conference will be devoted to tutorials in which top practitioners and researchers share their expertise and latest results. The tutorials at the 2008 conference were highly-attended. Look for the Call for Tutorials announcement on the website, or send email to tutorial2009@recsys.acm.org if you are interested in presenting a tutorial.

Workshops

To reflect the diversity of research in recommender systems and to give additional venues for the presentation of research, the conference will feature workshops for the first time. Look for the Call for Workshops announcement on the website, or send email to workshop2009@recsys.acm.org if you are interested in organizing a workshop.

Doctoral Symposium

The Doctoral Symposium provides an opportunity for doctoral students to explore and develop their research interests in an interdisciplinary workshop, under the guidance of a panel of distinguished research faculty. Look for the Call for Participation announcement on the website, or send email to doctoral2009@recsys.acm.org if you are interested in participating.

Additional information on all aspects of the program can be found here.

IMPORTANT DATES

1. Tutorial Proposals: April 10, 2009
2. Paper Submission: May 8, 2009
3. Workshop Proposals: May 15, 2009
4. Doctoral Symposium Applications: June 8, 2009
5. Paper Acceptance Notifications: June 19, 2009
6. Conference: October 22-25, 2009
1. Doctoral Symposium: October 22
2. Tutorials: October 22
3. Technical Program: October 23-24
4. Workshops: October 25

TOPICS OF INTEREST

We construe recommender systems broadly, including applications ranging from e-commerce to social networking, platforms from web to mobile and beyond, and a wide variety of technologies ranging from collaborative filtering to case-based reasoning. Therefore, topics of interest for RecSys’09 include (but are not limited to):

Case studies of recommender system implementations

Conversational recommender systems

Context-aware and multidimensional recommender systems

Evaluation of recommender systems

Group recommenders

The impact of recommenders in practice

Innovative recommender applications

Novel paradigms of recommender systems

Personalization

Recommendation algorithms

Recommendation in social networks

Recommender system interfaces

Scalability issues

Security and privacy

Semantic web technologies for recommender systems

Theoretical aspects of recommender systems

User modeling and recommender systems

User studies

Two papers accepted by APWeb/WAIM 2009

Just be informed that, two papers co-authored by guys from Roboo.com and Ecole Polytechnique de Montreal are accepted by the 11th APWeb/WAIM, 2009. Cheer for ourselves.

Looking forward to have more contribute to IR community, and providing more exciting products for the users.

Note:
Roboo.com is one leading mobile search service provider in China.
Ecole Polytechnique de Montreal is an engineering school affiliated to the University of Montreal, Canada.

AIRS 2009 CFP

The Asia Information Retrieval Symposium (AIRS) aims to bring together researchers and developers to exchange new ideas and latest achievements in the field of information retrieval (IR). The scope of the symposium covers applications, systems, technologies and theory aspects of information retrieval in text, audio, image, video and multimedia data. The Fifth AIRS (AIRS 2009) welcomes submissions of original papers in the broad field of information retrieval. Technical issues covered include, but are not limited to:

1. IR theories, models and techniques
2. Evaluation methodologies, test collections, evaluation metrics, etc.
3. IR interface and user studies: exploratory search, collaborative search, etc.
4. Multilingual information access: cross-language IR, cross-language question answering, etc.
5. Multimedia information access: image, video, audio, metadata
6. Natural language processing and IR: opinion extraction, summarization, text mining, categorization, etc.
7. Web related issues: Web search,Web mining, Semantic Web, etc.
8. Systems and implementation issues: indexing, compression, efficiency, integration, etc.
9. IR applications: e-commerce, e-learning, digital libraries, ubiquitous computing, bioinformatics, medical informatics, telematics, etc.
   

IMPORTANT DATES
- April 19, 2009 Submissions due
- June 1, 2009 Notification of acceptance
- June 16, 2009 Camera-ready due
- September 1, 2009 Registration deadline
- October 21-23 2009 AIRS 2009

DMIN 2009 CFP

The 2009 International Conference on Data Mining will be held in Las Vegas like before.

Important dates
Proposals for organizing sessions/workshops - Jan 16, 2009
Submission of papers - Feb 25, 2009
Notification of acceptance - Mar 25, 2009
Camera-ready papers and registration due - April 25, 2009
Conference date - July 13 - 16, 2009

OSDM 2009 CFP

As the first Open Source in Data Mining workshop, it will held with 13th PAKDD, 2009.
Open source software is becoming increasingly accepted in public and private sector organisations in many countries. There is a variety of open source data mining tools available to both researchers and practitioners, some being simple research prototypes while others are fully developed software tools.

This workshop aims to bring together data mining practitioners, researchers and educator, with the objectives to present open source data mining tools, discuss experiences and lessons learned using such tools, and exchange ideas on how to promote the use of open source tools in the field of data mining.

Important Dates
Submission of full papers: 22 December 2008
Notification of authors: 23 January 2009
Camera-ready version: 9 February 2009
OSMD Workshop date: 27 April 2009

SIGIR 2009 CFP

The 32nd ACM SIGIR will be held in Boston.

Important dates:


Nov 17, 2008 Requests for mentoring must be submitted
Jan 19, 2009 Abstracts for full research papers due
Jan 26, 2009 Full research paper submissions due
Feb 2, 2009 Workshop proposals due
Feb 23, 2009 Posters, demonstration, and tutorial proposals due
Mar 2, 2009 Doctoral consortium proposals due
Mar 9, 2009 Notification of workshop acceptances
Apr 11, 2009 All other acceptance notification

Canadian AI 2009 Call for Paper

The 22nd Canadian AI will be held at Kelowna,British Columbia, Canada. Here are some important dates:

- Paper submission due: January 23rd, 2009
- Notification of acceptance: March 3rd, 2009
- Final paper due: March 16th, 2009
- Conference date: May 25-27, 2009

“神舟7号向全国人民，全世界人民问好”

那真是令人兴奋和自豪的时刻啊！

希望神舟系列走得更远，更好，更多地为全人类谋福利

WWW 2009 Second Call for Paper

Re-publish the important dates:

Workshops:	October 10th, 2008
Refereed Papers:	November 3rd , 2008
Tutorials:	November 30th, 2008
Panels:	December 21st, 2008
Posters:	January 20th , 2009
Developers track:	February 2nd, 2009

Acceptance Notifications:
Refereed Papers: January 20th , 2009

FLAIRS 2009 CFP

22nd International FLAIRS Conference Call for Paper

Due date: 2008-11-23
Conference date: 2009-05-19 to 2009-05-21

APWeb 2009 CFP

APWeb and WAIM are leading international conferences on research, development and applications of Web technologies,database systems, information management and software engineering, with a focus on the Asia-Pacific region.

Previous APWeb conferences were held in Beijing(1998), Hong Kong(1999), Xian(2000), Changsha(2001), Xi’an(2003), Hangzhou(2004), Shanghai(2005), Harbin (2006),Huangshan (2007) and Shenyang(2008) and previous WAIM conferences were held in Shanghai(2000), Xian(2001), Beijing(2002), Chengdu(2003), Dalian(2004), Hangzhou(2005), Hong Kong(2006), Huangshan(2007) and Zhangjiajie(2008).

Important Dates

Abstract due:	October 8, 2008
Full paper due:	October 15, 2008
Acceptance notification:	December 10, 2008
Camera-ready copy:	January 5, 2009
Workshop Proposals:	September 1, 2008
Panel/Tutorial Proposals:	November 15, 2008

Brand new News Channel shipped online now!

On Roboo mobile search eninge (wap.roboo.com, http://www.roboo.com/), recently we make the news channel upgrading done successfully. With the new system, we only only crawl and index newly appearing news in real time, but do the recommendation instantly. More advanced applications are in process as well to make it a friendly and popular product.

Roboo: A promising mobile search engine in China

Welcome to visit us at www.roboo.com and wap.roboo.com (using Opera browser)

WSDM 2009 CFP

2nd International Web Search and Data Mining (WSDM) Conference calls for paper:
- Abstract due date: Aug 04, 2008
- Full paper due date: Aug 11, 2008

WWW'09 1st CFP

Workshops: 10th October 2008
Papers: 31st October 2008
Tutorials: 30th November 2008
Panels: 21st December 2008
Posters: 11th January 2009
Developers track: 2nd February 2009

Conference date: 20th-24th April 2009

HCIR 2008 CFP

Workhop on Human-Computer Interaction and Information Retrieval

Papers/abstracts due: August 22, 2008
Decisions to authors: September 12, 2008
Camera-ready copy due: October 3, 2008

Location: Redmond, WA, USA

Recent paper work

One is accepted by International Conference on Data Mining 2008;
Another is accepted by ACM SIGIR Workshop on Mobile Search 2008;
Submit one to IEEE ICDM 2008.

Looking for a new one!!