<?xml version="1.0" encoding="UTF-8"?><ns2:project xmlns:ns1="http://gtr.rcuk.ac.uk/gtr/api" xmlns:ns2="http://gtr.rcuk.ac.uk/gtr/api/project" xmlns:ns3="http://gtr.rcuk.ac.uk/gtr/api/fund" xmlns:ns4="http://gtr.rcuk.ac.uk/gtr/api/person" xmlns:ns5="http://gtr.rcuk.ac.uk/gtr/api/project/outcome" xmlns:ns6="http://gtr.rcuk.ac.uk/gtr/api/organisation" ns1:created="2026-06-03T15:52:43Z" ns1:href="http://gtr.ukri.org/gtr/api/projects/9C4CF524-965F-40ED-8F0C-5CC3D29110ED" ns1:id="9C4CF524-965F-40ED-8F0C-5CC3D29110ED"><ns1:links><ns1:link ns1:href="http://gtr.ukri.org/gtr/api/persons/915193B3-BDAD-484E-80F2-6EC5AFEF08F1" ns1:rel="PM_PER"/><ns1:link ns1:href="http://gtr.ukri.org/gtr/api/organisations/9F2B4154-8326-41A9-8036-A954A9C7138E" ns1:rel="LEAD_ORG"/><ns1:link ns1:href="http://gtr.ukri.org/gtr/api/organisations/9F2B4154-8326-41A9-8036-A954A9C7138E" ns1:rel="PARTICIPANT_ORG"/><ns1:link ns1:end="2015-08-30T23:00:00Z" ns1:href="http://gtr.ukri.org/gtr/api/funds/07C91B1D-BFFF-41E5-B7FA-BB3AB8579C85" ns1:rel="FUND" ns1:start="2015-04-30T23:00:00Z"/></ns1:links><ns2:identifiers><ns2:identifier ns2:type="RCUK">131984</ns2:identifier></ns2:identifiers><ns2:title>Cluster Inference of Big Multimedia Databases</ns2:title><ns2:status>Closed</ns2:status><ns2:grantCategory>Feasibility Studies</ns2:grantCategory><ns2:leadFunder>Innovate UK</ns2:leadFunder><ns2:abstractText>Clustering data into groups so that each group is characterised by a set of unique features is of great significance in many applications. Although this is a well-studied area, a fundamental problem remains unsolved: clustering databases with the Number of Clusters far greater than the average Size of Clusters (or “NC &amp;gt;&amp;gt; SC” problem for short). The technical challenge of this problem arises from the fact that the intra-cluster similarity of some clusters is likely to be greater than the inter-cluster similarity of some other clusters. As a result, in the feature space, the clusters significantly overlap, making the clustering unreliable. A typical example is INTERPOL ‘s International Child Sexual Exploitation Database (ICSE DB) with millions of photos. Because often the metadata (e.g., camera model) of the photos is manipulated, the police expect that there may be hundreds of thousands of cameras responsible for the creation of those photos, each responsible for only a small number of photos. The objective of this project is to develop a heuristic clustering method to cluster those photos so that each cluster corresponds to one camera.</ns2:abstractText></ns2:project>