LISTSERV mailing list manager LISTSERV 16.0

Help for SOCNET Archives


SOCNET Archives

SOCNET Archives


SOCNET@LISTS.UFL.EDU


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

SOCNET Home

SOCNET Home

SOCNET  October 2009

SOCNET October 2009

Subject:

Final CFP :: NIPS 09 workshop on Graphs & Networks (new deadline)

From:

Edoardo Airoldi <[log in to unmask]>

Reply-To:

Edoardo Airoldi <[log in to unmask]>

Date:

Wed, 28 Oct 2009 19:45:46 -0400

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (107 lines)

*****  To join INSNA, visit http://www.insna.org  *****

-- Apologies if you receive multiple copies of this announcement --
       -- Please forward to anyone who might be interested --

#####################################################################

                          CALL FOR PAPERS

             Analyzing Networks and Learning with Graphs

                   a workshop in conjunction with

   23nd Annual Conference on Neural Information Processing Systems
                            (NIPS 2009)

             December 11, 2009, Whistler, BC, Canada

             http://snap.stanford.edu/nipsgraphs2009/

         Deadline for Submissions: Friday, November 4, 2009  **updated**
         Notification of Decision: Monday, November 9, 2009

#####################################################################


Overview:

Recent research in machine learning and statistics has seen the  
proliferation of computational methods for analyzing networks and  
learning with graphs. These methods support progress in many  
application areas, including the social sciences, biology, medicine,  
neuroscience, physics, finance, and economics.

The primary goal of the workshop is to actively promote a concerted  
effort to address statistical, methodological and computational issues  
that arise when modeling and analyzing large collection of data that  
are largely represented as static and/or dynamic graphs. To this end,  
we aim at bringing together researchers from applied disciplines such  
as sociology, economics, medicine and biology, together with  
researchers from more theoretical disciplines such as mathematics and  
physics, within our community of statisticians and computer  
scientists. Different communities use diverse ideas and mathematical  
tools; our goal is to to foster cross-disciplinary collaborations and  
intellectual exchange.

Presentations will include novel graph models, the application of  
established models to new domains, theoretical and computational  
issues, limitations of current graph methods and directions for future  
research.


Online Submissions:
-------------------
We welcome the following types of papers:

1. Research papers that introduce new models or apply established  
models to novel domains,

2. Research papers that explore theoretical and computational issues, or

3. Position papers that discuss shortcomings and desiderata of current  
approaches, or propose new directions for future research.

All submissions will be peer-reviewed; exceptional work will be  
considered for oral presentation. We encourage authors to emphasize  
the role of learning and its relevance to the application domains at  
hand. In addition, we hope to identify current successes in the area,  
and will therefore consider papers that apply previously proposed  
models to novel domains and data sets.

Submissions should be 4-to-8 pages long, and adhere to NIPS format
(http://nips.cc/PaperInformation/StyleFiles). Please email your
submissions to: [log in to unmask]

Deadline for Submissions: Friday, November 4, 2009, 11:59 pm (EST)
Notification of Decision: Friday, November 6 2009


Workshop Format:
----------------
This is a one-day workshop.  The program will feature invited talks,  
poster sessions, poster spotlights, and a panel discussion.  All  
submissions will be peer-reviewed; exceptional work will be considered  
for oral presentation.  Details about the program will be announced in  
late November.  Invited speakers include: Jennifer Chayes (Microsoft),  
Matthew Jackson (Stanford), Ravi Kumar (Yahoo), Martina Morris (UW),  
Cosma Shalizi (CMU).


Organizers:
-----------
Edo Airoldi, Harvard University
Jure Leskovec, Stanford University
Jon Kleinberg, Cornell University
Josh Tenenbaum, MIT


Thank you, we look forward to receiving your submissions!

Edo, Jure, Jon & Josh

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

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
November 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, Week 62
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
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001

ATOM RSS1 RSS2



LISTS.UFL.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager