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  April 2010

SOCNET April 2010

Subject:

Funded PhD position in Dynamic Network Analysis, Mining and Modelling

From:

Marcel Karnstedt <[log in to unmask]>

Reply-To:

Marcel Karnstedt <[log in to unmask]>

Date:

Mon, 26 Apr 2010 15:35:05 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (84 lines)

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

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

The Digital Enterprise Research Institute (www.deri.ie) at the National
University of Ireland Galway is seeking applications for a funded PhD
studentship in Dynamic Network Analysis, Mining and Modelling.

The successful candidate will join the Clique Strategic Research Cluster
(www.cliquecluster.org) in DERI, Galway. Clique is a Science Foundation
Ireland-funded research cluster addressing the development of
analytical, modelling and visualisation techniques for large scale,
dynamic graphs and networks. The cluster is distributed between DERI and
University College Dublin, and has industry partners such as IBM.

The DERI group conducts fundamental algorithmic work as well as
investigating and modelling the principles underlying the evolution and
interactions in large social, communication and collaborative networks.
Areas of interest include but are not limited to:
	* Analysing user roles in social networks and designing efficient
algorithms to find these [1];
	* Analysing and modelling the interactions between online communities [2];
	* Formulating predictive models for information diffusion in social and
collaborative networks;
	* Designing efficient graph algorithms to find evolving communities
with correlated change behaviour [3];
	* Designing scalable, distributed, real-time algorithms to tackle
problems in massive dynamic graph datasets.

The successful candidate should have at least a bachelor's degree in
computer science, maths, science or engineering, and have the
pre-requisites for PhD studies at NUI Galway (www.nuigalway.ie). The PhD
studentship covers academic fees, a generous monthly stipend and a
research travel allowance for a three year period.

In addition, the following criteria are desirable but not necessary:
	* Familiarity with graph algorithms and theory (e.g., finding connected
components efficiently);
	* Familiarity with modelling and simulation;
	* Familiarity with social network analysis;
	* Familiarity with large-scale, distributed, dynamic data analysis
(e.g., data streaming algorithms);
	* Familiarity with data mining, feature selection and machine learning,
especially graph mining and graph grammars;
	* Masters or equivalent degree in a relevant discipline or topic;

The successful candidate will work with the DERI Principle Investigator,
Dr. Conor Hayes, Dr. Jeffrey Chan and Dr. Marcel Karnstedt in the Clique
Research Cluster at DERI, Galway (see uimr.deri.ie). There will be
extensive opportunities for collaboration with other Clique researchers
(see www.cliquecluster.org/content/people) and with other research
groups and projects in DERI.

Interested applicants should send an application with the subject header
CLIQUE_PhD_10 to [log in to unmask]
The application must contain the following: a CV, a one page statement
explaining the candidate's interest in the position as well as their
suitability, and a list of referees. Applications that do not follow
this format will not be considered. Closing date: May 31th, 2010.

References:
[1] Jeffrey Chan and Conor Hayes, 'Decomposing Discussion Forums using
User Roles', in Proceedings of 2nd Web Science Conference 2010, USA, 2010.
[2] Marcel Karnstedt and Conor Hayes, 'Towards Cross-Community Effects
in Scientific Communities', in Knowledge Discovery, Data Mining and
Machine Learning, 2009.
[3] Jeffrey Chan, James Bailey and Christopher Leckie, '€œDiscovering
correlated spatio-temporal changes in evolving graphs', in Knowledge and
Information Systems, 16(1), 2008.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG/MacGPG2 v2.0.11 (Darwin)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/

iEYEARECAAYFAkvVpJkACgkQRdMWrRxITRAp5QCfQSX8nCWP6TsbvDuG4fgfMxdn
amoAn3mQvA4ZPRTMGCf7xVrBKgrXHW2f
=+uzZ
-----END PGP SIGNATURE-----

_____________________________________________________________________
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

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
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