[Elsnet-list] CFP - CDKD2012 in Conjunction with KDD 2012 || Aug. 12 2012 - Beijing, China

bo Long blong1 at binghamton.edu
Sat Mar 31 02:21:16 CEST 2012

The First International Workshop on Cross Domain Knowledge Discovery
          in Web and Social Network Mining
         (In conjunction with ACM KDD 2012)


Beijing, China
August 12, 2012,

Call for Papers

The accepted papers  will be invited to IEEE Intelligent
System  Special Issue,
http://www.computer.org/portal/web/computingnow/iscfp3 .

In the field of Web and social network mining, more and more learning
tasks can easily acquire multiple data sets from various domains.  At
the same time, the need for knowledge transfer is increasingly evident
as many new datasets, or parts of data, are only very sparsely annotated.
cross domain learning (transfer learning) problems are built on multiple
domain data that may have different degrees of relatedness to target tasks,
offering an opportunity to help one another. To better leverage multiple
domain data, mining and transferring of shared knowledge across multiple
domains is likely to become a crucial step in Web and social network
mining in the future.

Topics of Interest

Representative issues to be addressed include but are not limited to:
* Cross domain ranking
* Cross domain recommendation
* Cross domain social network analysis
* Cross domain natural language processing
* Cross domain learning on structure data
* Cross domain learning on stream data
* Cross domain learning on heterogeneous data

Workshop Chairs

Bo Long (Yahoo! Labs)
Yi Chang (Yahoo! Labs)
Hang Li  (Microsoft Research Asia)

Important Dates

May  12,   2012: Due date for full papers
June 5,    2012: Notification of acceptance
June 12,   2012: Camera-ready of accepted papers
August 12, 2012: Workshop date

Paper Submission

Paper submission: https://www.easychair.org/account/signin.cgi?conf=cdkd2012
Paper length: maximum 8 pages in ACM double-column  Proceedings Style
Templates: http://www.acm.org/sigs/publications/proceedings-templates

More information about the Elsnet-list mailing list