Fast effective clustering technologies for highly dynamic massive networks. Clustering is a fundamental data mining and analysis task. In an interconnected evolving world, friendships and information flows are modelled as large dynamic networks. Structural clustering and correlation clustering are important and well-studied approaches for static networks; for evolving networks, where links appear and disappear over time, we lack efficient techniques. Anticipated outcomes are new practical cluste ....Fast effective clustering technologies for highly dynamic massive networks. Clustering is a fundamental data mining and analysis task. In an interconnected evolving world, friendships and information flows are modelled as large dynamic networks. Structural clustering and correlation clustering are important and well-studied approaches for static networks; for evolving networks, where links appear and disappear over time, we lack efficient techniques. Anticipated outcomes are new practical clustering algorithms for dynamic networks – with performance guarantees of efficiency and clustering quality – and prototype software, guiding us to pick a good clustering. Expected benefits include better understanding of spread in evolving social networks, accelerating the software testing cycle, and improved topic detection.Read moreRead less
Algorithms for Future-Proof Networks. This project will design algorithms to construct, augment and route on geometric graphs in the presence of obstacles. Such graphs have many real-world applications, including transport networks. This project aims to give solutions with hard guarantees on the timeliness of the delivery of the people, goods, or information being transported in these networks. Expected outcomes of this project include efficient and innovative algorithms for realistic geometric ....Algorithms for Future-Proof Networks. This project will design algorithms to construct, augment and route on geometric graphs in the presence of obstacles. Such graphs have many real-world applications, including transport networks. This project aims to give solutions with hard guarantees on the timeliness of the delivery of the people, goods, or information being transported in these networks. Expected outcomes of this project include efficient and innovative algorithms for realistic geometric graphs, which both advances the knowledge in this field of computer science and make our existing networks more reliable. This should provide significant benefits in the maintenance and utilisation of the communication and transport networks we use every day.Read moreRead less