<?xml version="1.0" encoding="UTF-8"?>
<CourseUnit xmlns="http://www.manchester.ac.uk/CUICourseUnitDetails" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.manchester.ac.uk/CUICourseUnitDetails.xsd">
  <UnitCode Applicant="Y" Label="Unit code" Student="Y">
    <Code>DATA70132</Code>
  </UnitCode>
  <UnitTitle Applicant="Y" Label="Unit title" Student="Y">
    <Title>Statistics &amp; Machine Learning 2:  AI, Complex Data, Computationally Intensive Statistics</Title>
  </UnitTitle>
  <MaxUnits Applicant="Y" Label="Credit rating" Student="Y">
    <Units>15</Units>
  </MaxUnits>
  <TeachingPeriods Applicant="Y" Label="Teaching period(s)" Student="Y">
    <Period>Semester 2</Period>
  </TeachingPeriods>
  <AcademicCareer Applicant="Y" Label="Academic career" Student="Y">
    <Value>Postgraduate Taught</Value>
  </AcademicCareer>
  <UnitLevel Applicant="Y" Label="Unit level" Student="Y">
    <Level>Level 7</Level>
  </UnitLevel>
  <StaffList Applicant="Y" Label="Teaching staff" RoleLabel="Course Unit Role" Student="Y">
    <StaffMember>
      <Name>Lorenzo Pellis</Name>
      <Role>Unit coordinator</Role>
    </StaffMember>
  </StaffList>
  <OfferedBy Applicant="Y" Label="Offered by" Student="Y">
    <OrganisationList>
      <Organisation>
        <OrgName>Social Statistics</OrgName>
      </Organisation>
      <Organisation>
        <OrgName>Department of Computer Science</OrgName>
      </Organisation>
      <Organisation>
        <OrgName>Department of Mathematics</OrgName>
      </Organisation>
    </OrganisationList>
    <GroupList>
      <Group>
        <GroupName></GroupName>
      </Group>
    </GroupList>
    <FheqLevels>
      <FheqLevel>
        <LevelNumber>1</LevelNumber>
        <LevelName>FHEQ level (Framework for Higher Education Qualifications) ' Masters/Integrated Masters P4 ' </LevelName>
      </FheqLevel>
    </FheqLevels>
    <Ects>
      <MaxUnits>European Credit Transfer &amp; Accumulation System Rating :   7.5</MaxUnits>
    </Ects>
  </OfferedBy>
  <MarketingOverview Applicant="Y" Label="Marketing Course unit overview" Student="">
    <Content>&lt;p&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;The module is delivered as a mixture of lectures and practical sessions and has five main sections: &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;ol&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Dimension reduction and feature extraction: principal components analysis, feature selection, information theory. &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Classifiers and clustering: supervised and unsupervised learning, k-means and k-nearest neighbours, agglomerative clustering and dendrograms, support vector machines, linear and quadratic discriminants, Gaussian process classification, model-based clustering, mixture models and the EM algorithm. &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Neural Networks and Deep Learning: perceptrons, back-propagation and multi-layer networks.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Markov-chain Monte Carlo (MCMC) methods:&amp;nbsp; Markov chains and their stationary distributions, likelihood-based inference using the Metropolis-Hastings algorithm, likelihood-free inference using Approximate Bayesian Computation, tests for convergence, applications to Bayesian inference.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Special Topic: Depending on the teaching staff, one special topic will be chosen to go into near-research depth, e.g. Random Forests; Social Networks; Time Series Analysis; Advanced Monte Carlo methods.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ol&gt;</Content>
  </MarketingOverview>
  <UnitOverview Applicant="" Label="Course unit overview" Student="Y">
    <Content>&lt;p&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;The module is delivered as a mixture of lectures and practical sessions and has five main sections: &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;ol&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Dimension reduction and feature extraction: principal components analysis, feature selection, information theory. &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Classifiers and clustering: supervised and unsupervised learning, k-means and k-nearest neighbours, agglomerative clustering and dendrograms, support vector machines, linear and quadratic discriminants, Gaussian process classification, model-based clustering, mixture models and the EM algorithm. &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Neural Networks and Deep Learning: perceptrons, back-propagation and multi-layer networks.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Markov-chain Monte Carlo (MCMC) methods:&amp;nbsp; Markov chains and their stationary distributions, likelihood-based inference using the Metropolis-Hastings algorithm, likelihood-free inference using Approximate Bayesian Computation, tests for convergence, applications to Bayesian inference.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Special Topic: Depending on the teaching staff, one special topic will be chosen to go into near-research depth, e.g. Random Forests; Social Networks; Time Series Analysis; Advanced Monte Carlo methods.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ol&gt;</Content>
  </UnitOverview>
  <Aims Applicant="Y" Label="Aims" Student="Y">
    <Content>&lt;p align="left" style="text-align:left"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;The unit aims to introduce students to a selection of modern methods widely used in Data Science that can go beyond standard statistical frameworks. It builds on the foundation laid in Statistics and Machine Learning 1 and is strongly focussed on applications, aiming to train students to be informed users of existing algorithms.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;</Content>
  </Aims>
  <LearningOutcomes Applicant="Y" Label="Learning outcomes" Student="Y">
    <Content>&lt;p&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Students should be able to: &lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;&lt;ul&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Define the key terms from each of the module&amp;rsquo;s five sections&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Understand when to apply a given learning algorithm and how to judge its success, including questions of convergence and computational performance.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Construct classifiers that capture features of already-understood data and exploit them to classify new data (supervised learning)&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Use classification algorithms to discover and exploit previously-unknown structure in data (unsupervised learning).&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Construct and train neural networks.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Use MCMC methods to estimate parameters and quantify uncertainty.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li style="margin-left:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Present results, justifying choices of algorithm and communicating effectively with both technical and non-technical audiences.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;</Content>
  </LearningOutcomes>
  <Knowledge Applicant="Y" Label="Knowledge and understanding" Student="Y">
    <Content></Content>
  </Knowledge>
  <IntellectualSkills Applicant="Y" Label="Intellectual skills" Student="Y">
    <Content></Content>
  </IntellectualSkills>
  <PracticalSkills Applicant="Y" Label="Practical skills" Student="Y">
    <Content></Content>
  </PracticalSkills>
  <TransferableSkills Applicant="Y" Label="Transferable skills and personal qualities" Student="Y">
    <Content></Content>
  </TransferableSkills>
  <EmployabilitySkillsList Applicant="Y" Label="Employability skills" Student="Y">
    <Skill>
      <SkillId></SkillId>
      <SkillDescription></SkillDescription>
    </Skill>
  </EmployabilitySkillsList>
  <Syllabus Applicant="Y" Label="Syllabus" Student="Y">
    <Content></Content>
  </Syllabus>
  <TeachingMethods Applicant="Y" Label="Teaching and learning methods" Student="Y">
    <Content>&lt;p style="text-align:justify; margin-bottom:8px"&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;The five sections of this module are essentially self-contained subunits. Each consists of a series of lectures that introduce key concepts and serve as support for practical sessions in which the students apply python-based software tools to data analysis problems.&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;</Content>
  </TeachingMethods>
  <AssessmentMethods Applicant="Y" Label="Assessment methods" Student="Y">
    <IntroText> </IntroText>
    <Method>
      <MethodId>1</MethodId>
      <MethodName>Written exam</MethodName>
      <MethodWeight>80%</MethodWeight>
    </Method>
    <Method>
      <MethodId>2</MethodId>
      <MethodName>Written assignment (inc essay)</MethodName>
      <MethodWeight>20%</MethodWeight>
    </Method>
  </AssessmentMethods>
  <FeedbackMethods Applicant="Y" Label="Feedback methods" Student="Y">
    <Content>&lt;p&gt;Feedback will be made available through Turnitin&lt;/p&gt;</Content>
  </FeedbackMethods>
  <RequirementsList Applicant="Y" Label="Pre/co-requisites" Student="Y">
    <Requirement>
      <UnitCode>DATA70121</UnitCode>
      <UnitTitle>Statistics and Machine Learning 1: Statistical Foundations</UnitTitle>
      <RequirementType>Pre-Requisite</RequirementType>
      <Description>Compulsory</Description>
    </Requirement>
    <AdditionalRequirement>DATA70121 is a pre-requisite for DATA70132</AdditionalRequirement>
  </RequirementsList>
  <AcademicPrograms Applicant="Y" Label="Academic programmes" Student="Y">
    <AcademicProgram>
      <Program>MSc Data Science</Program>
      <Plan>MSc Data Science (Soc Analyt)</Plan>
      <Level>PGDT Taught Component</Level>
      <Requirement>Mandatory</Requirement>
    </AcademicProgram>
    <AcademicProgram>
      <Program>MSc Data Science</Program>
      <Plan>MSc Data Science (AUA)</Plan>
      <Level>PGDT Taught Component</Level>
      <Requirement>Mandatory</Requirement>
    </AcademicProgram>
    <AcademicProgram>
      <Program>MSc Data Science</Program>
      <Plan>MSc Data Science (Bus &amp; Man)</Plan>
      <Level>PGDT Taught Component</Level>
      <Requirement>Mandatory</Requirement>
    </AcademicProgram>
    <AcademicProgram>
      <Program>MSc Data Science</Program>
      <Plan>MSc Data Science (Mathematics)</Plan>
      <Level>PGDT Taught Component</Level>
      <Requirement>Mandatory</Requirement>
    </AcademicProgram>
    <AcademicProgram>
      <Program>MSc Data Science</Program>
      <Plan>MSc Data Science (CSDI)</Plan>
      <Level>PGDT Taught Component</Level>
      <Requirement>Mandatory</Requirement>
    </AcademicProgram>
    <AcademicProgram>
      <Program>MSc Data Science</Program>
      <Plan>MSc Data Science (EA)</Plan>
      <Level>PGDT Taught Component</Level>
      <Requirement>Mandatory</Requirement>
    </AcademicProgram>
  </AcademicPrograms>
  <FreeChoice Applicant="Y" Label="Available as a free choice unit?" Student="Y">
    <Content>N</Content>
  </FreeChoice>
  <Accreditation Applicant="Y" Label="Accreditation" Student="Y">
    <Content></Content>
  </Accreditation>
  <RecommendedReading Applicant="Y" Label="Recommended reading" Student="Y">
    <Content>&lt;p style="margin-left: 48px; text-align: left; text-indent: -36pt;"&gt;&amp;nbsp;&lt;/p&gt;&lt;ul&gt;	&lt;li&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Simon Rogers &amp;amp; Mark Girolami (2017), A First Course in Machine Learning, 2nd edition, Chapman &amp;amp; Hall/CRC. ISBN 9781498738484&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Christopher Bishop (2006), Pattern Recognition and Machine Learning, Springer-Verlag, New York. ISBN: 9780387310732&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;S. Brooks, A. Gelman, G. Jones, and X.-L. Meng, eds. (2011), Handbook of Markov Chain Monte Carlo, Chapman and Hall/CRC. ISBN: 9781420079418&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;G. James, D. Witten, T. Hastie, and R. Tibshirani (2013), An Introduction to Statistic Learning with Applications in R. Springer-Verlag, New York. ISBN 9781461471370&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;	&lt;li&gt;&lt;span style="font-size:11pt"&gt;&lt;span style="line-height:normal"&gt;&lt;span style="font-family:Calibri,sans-serif"&gt;&lt;span style="color:black"&gt;Trevor Hastie, Robert Tibshirani and Jerome Friedman (2009), The Elements of Statistical Learning: Data Mining, Inference, and Prediction. 2nd edition, Springer-Verlag. ISBN: 9780387848587&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;&lt;/ul&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</Content>
  </RecommendedReading>
  <StudyHours Applicant="Y" Label="Study hours" Student="Y">
    <IntroText> </IntroText>
    <ScheduledHours Applicant="Y" Label="Scheduled activity hours" Student="Y">
      <ActivityHours>
        <ActivityType></ActivityType>
        <Hours>0</Hours>
      </ActivityHours>
    </ScheduledHours>
    <PlacementHours Applicant="Y" Label="Placement hours" Student="Y">
      <ActivityHours>
        <ActivityType></ActivityType>
        <Hours>0</Hours>
      </ActivityHours>
    </PlacementHours>
    <TotalHours Applicant="Y" Label="Independent study hours" Student="Y">
      <Hours>0</Hours>
    </TotalHours>
  </StudyHours>
  <Notes Applicant="Y" Label="Additional notes" Student="Y">
    <Content></Content>
  </Notes>
</CourseUnit>
