JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for SUPPORT-VECTOR-MACHINES Archives


SUPPORT-VECTOR-MACHINES Archives

SUPPORT-VECTOR-MACHINES Archives


SUPPORT-VECTOR-MACHINES@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

SUPPORT-VECTOR-MACHINES Home

SUPPORT-VECTOR-MACHINES Home

SUPPORT-VECTOR-MACHINES  October 2009

SUPPORT-VECTOR-MACHINES October 2009

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

FINAL CFP: NIPS 2009 Workshop - Advances in Ranking

From:

Shivani Agarwal <[log in to unmask]>

Reply-To:

The Support Vector Machine discussion list <[log in to unmask]>

Date:

Tue, 20 Oct 2009 15:43:15 -0400

Content-Type:

TEXT/PLAIN

Parts/Attachments:

Parts/Attachments

TEXT/PLAIN (159 lines)

************************************************************************

                          FINAL CALL FOR PAPERS

                      ---- Advances in Ranking ----

                             Workshop at the
     23rd Annual Conference on Neural Information Processing Systems
                               (NIPS 2009)

             http://web.mit.edu/shivani/www/Ranking-NIPS-09/

               -- Submission Deadline: October 23, 2009 --

************************************************************************
                   [ Apologies for multiple postings ]

OVERVIEW
--------

Ranking problems are increasingly recognized as a new class of
statistical learning problems that are distinct from the classical
learning problems of classification and regression. Such problems arise
in a wide variety of domains: in information retrieval, one wants to
rank documents according to relevance to a query; in natural language
processing, one wants to rank alternative parses or translations of a
sentence; in collaborative filtering, one wants to rank items according
to a user's likes and dislikes; in computational biology, one wants to
rank genes according to relevance to a disease. Consequently, there has
been much interest in ranking in recent years, with a variety of methods
being developed and a whole host of new applications being discovered.

This workshop aims to bring together researchers interested in the area
to share their perspectives, identify persisting challenges as well as
opportunities for meaningful dialogue and collaboration, and to discuss
possible directions for further advances and applications in the future.

One of the primary goals of the workshop will be to reach out to a broad
audience. To this end, we will have talks on topics ranging from more
statistically/mathematically oriented approaches to ranking, to newer
application areas. A second goal will be to bring to the fore a range of
questions that are currently being debated within the community, for
example via a panel discussion between experts in the field.

Overall, the workshop will aim to provide a forum that showcases recent
advances in ranking to the broader community, facilitates open debate on
some of the questions in this area, and helps catalyze further interest
among those new to the topic.

FORMAT
------

This is a one-day workshop that will follow the 23rd Annual Conference
on Neural Information Processing Systems (NIPS 2009). The workshop will
consist of two 3-hour sessions. There will be 2-4 invited talks by
experts in the area, and 5-8 short talks. Depending on interest and
submissions, we may also have a short poster/demo session. There will be
time at the end of each talk/session for questions and discussion. We
also intend to have a panel discussion that will be moderated by the
organizers and that will bring together leading figures from both
academia and industry for discussion and debate.

Keynote Lecture
---------------

   * Persi Diaconis, Stanford University

Invited Talks
-------------

   * Ralf Herbrich, Microsoft Research Cambridge
   * Lek-Heng Lim, University of California, Berkeley

Contributed Talks
-----------------

These will be based on submissions of short papers. See below for
details.

CALL FOR PAPERS
---------------

We invite submissions of short papers addressing all aspects of ranking
in machine learning, data mining, and statistics, as well as related 
application areas. These include for example:

   * algorithms for ranking
   * mathematical/statistical analyses of ranking
   * relationships between ranking and other problems
   * applications of ranking in information retrieval, natural language
     processing, collaborative filtering, computational biology, computer
     vision, and other areas
   * benchmark data sets for ranking
   * challenges in applying or analyzing ranking methods

We also welcome papers on ranking that do not fit into one of the above
categories, as well as papers that describe work in progress.

Please note that papers that have previously appeared (or have been
accepted for publication) in a journal or at a conference or workshop,
or that are being submitted to another workshop, are not appropriate for
this workshop.

All papers presented at the workshop will be made available as
electronic proceedings. A print version will be distributed at the
workshop.

Submission Instructions
-----------------------

Submissions should be upto 4 pages in length using NIPS style files
(available at
http://web.mit.edu/shivani/www/Ranking-NIPS-09/StyleFiles/), and should
include the title, authors' names, postal and email addresses, and a
brief abstract. Email submissions (in pdf or ps format only) to
[log in to unmask] with subject line "Workshop Paper Submission".

The deadline for submissions is Friday October 23, 5:00 pm EDT.
Submissions will be reviewed by the program committee and authors will
be notified of acceptance/rejection decisions by Wednesday November 11.
Final versions of accepted papers will be due on Wednesday November 18.

Please note that one author of each accepted paper must be available to
present the paper at the workshop.

RELATED WORKSHOP
----------------

There is a related workshop at NIPS this year titled Learning with
Orderings, with a somewhat different focus than ours; see the webpage
above for details. We encourage all participants of our workshop to
attend this workshop as well. Submissions should be directed to only one 
workshop; if a submission cannot be accommodated by one workshop, it may be 
forwarded to the other workshop for consideration. Please indicate if
you would like us to consider this.

IMPORTANT DATES
---------------

    First call for papers       --  September 15, 2009
    Paper submission deadline   --  October   23, 2009 (5:00 pm EDT)
    Notification of decisions   --  November  11, 2009
    Final papers due            --  November  18, 2009
    Workshop                    --  December  11, 2009

ORGANIZERS
----------

   * Shivani Agarwal, MIT
   * Chris J.C. Burges, Microsoft Research
   * Koby Crammer, The Technion

CONTACT
-------

Please direct any questions to [log in to unmask]

************************************************************************

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

May 2024
April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager