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
Discovery Early Career Researcher Award - Grant ID: DE230101329
Funder
Australian Research Council
Funding Amount
$432,355.00
Summary
Trading Privacy, Bandwidth and Accuracy in Algorithmic Machine Learning. This project aims to investigate the trade-offs between privacy, communication costs and accuracy of results when learning from users' sensitive data. The project intends to design faster and more accurate algorithms for a wide range of machine learning tasks by developing a novel and widely-applicable algorithmic framework. Expected outcomes of this project include new theoretical tools to guide the design of data-driven d ....Trading Privacy, Bandwidth and Accuracy in Algorithmic Machine Learning. This project aims to investigate the trade-offs between privacy, communication costs and accuracy of results when learning from users' sensitive data. The project intends to design faster and more accurate algorithms for a wide range of machine learning tasks by developing a novel and widely-applicable algorithmic framework. Expected outcomes of this project include new theoretical tools to guide the design of data-driven decision systems and rigorously analyse their performance and privacy guarantees. Privacy of individuals' information in data analytics pipelines is a key societal concern. This project should lead to significant benefits by strengthening privacy in these pipelines while also improving accuracy and cost-efficiency.Read moreRead less
Approximate structures for efficient processing of data streams. This project aims to increase the volume of streamed data that can be handled on a low-powered device with limited memory. In finance, health, and transport, data arrives at enormous rates, and data-driven decisions must be made quickly. Likewise, to keep Australia secure, national agencies monitor and gather vast data sets. Increasingly, devices and monitors that have limited resources are making these decisions and they require c ....Approximate structures for efficient processing of data streams. This project aims to increase the volume of streamed data that can be handled on a low-powered device with limited memory. In finance, health, and transport, data arrives at enormous rates, and data-driven decisions must be made quickly. Likewise, to keep Australia secure, national agencies monitor and gather vast data sets. Increasingly, devices and monitors that have limited resources are making these decisions and they require computational techniques that run extremely efficiently. The project expects to develop and improve approximate data structures that operate in tight resource bounds. Anticipated outcomes are improved event recognition and dramatic speedup in analysis of streams in areas such as finance, health, transport, and urban data.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
Attribution of Machine-generated Code for Accountability. Machine-generated (or neural) code is usually produced by AI tools to speed up software development. However, such codes have recently raised serious security and privacy concerns. This project aims to attribute these codes to their generative models for accountability purposes. In the process, a series of new techniques are developed to differentiate between the codes generated by different models. The outcomes include analysis of neural ....Attribution of Machine-generated Code for Accountability. Machine-generated (or neural) code is usually produced by AI tools to speed up software development. However, such codes have recently raised serious security and privacy concerns. This project aims to attribute these codes to their generative models for accountability purposes. In the process, a series of new techniques are developed to differentiate between the codes generated by different models. The outcomes include analysis of neural code fingerprints, classification of neural codes, and theories to verify the correctness of code attribution. These will provide significant benefits, ranging from copyright protection to privacy preservation. This project is timely since currently the software community is pervasively using neural codes.Read moreRead less
Searching Cohesive Subgraphs in Big Attributed Graph Data. The availability of big attributed graph data brings great opportunities for realizing big values of data. Making sense of such big attributed graph data finds many applications, including health, science, engineering, business, environment, etc. A cohesive subgraph, one of key components that captures the latent properties in a graph, is essential to graph analysis. This project aims to invent effective models of cohesive subgraphs and ....Searching Cohesive Subgraphs in Big Attributed Graph Data. The availability of big attributed graph data brings great opportunities for realizing big values of data. Making sense of such big attributed graph data finds many applications, including health, science, engineering, business, environment, etc. A cohesive subgraph, one of key components that captures the latent properties in a graph, is essential to graph analysis. This project aims to invent effective models of cohesive subgraphs and efficient algorithms for searching and monitoring cohesive subgraphs in big and dynamic attributed graphs from both structure and attribute perspectives. The methods, techniques, and prototype systems developed in this project can be deployed to facilitate the smart use of big graph data across the nation. Read moreRead less
Modelling and Searching Cohesive Groups over Heterogeneous Graphs . Heterogeneous information networks (HINs) contain richer structural and semantic information represented as different types of objects and links. Searching cohesive groups from HINs finds many applications and also brings challenges at both conceptual and technical levels. This project aims to investigate the effective modelling of cohesive groups that take both homogeneous and heterogeneous information into account for differen ....Modelling and Searching Cohesive Groups over Heterogeneous Graphs . Heterogeneous information networks (HINs) contain richer structural and semantic information represented as different types of objects and links. Searching cohesive groups from HINs finds many applications and also brings challenges at both conceptual and technical levels. This project aims to investigate the effective modelling of cohesive groups that take both homogeneous and heterogeneous information into account for different applications and devise efficient algorithms for searching and monitoring those cohesive groups based on different models. The methods, techniques, and evaluation systems developed in this project can be deployed to facilitate the smart use of heterogeneous information networks across the nation.Read moreRead less
Topological insulators and free fermions: from Hermitian to non-Hermitian. This project aims to develop and fully understand a class of mathematical models describing fundamental interacting systems of particles of central importance in the physics of topological insulators. This will include the extension of exact solutions to more complicated models and the development and application of topological data analysis for detecting topological phase transitions in these and more general materials. ....Topological insulators and free fermions: from Hermitian to non-Hermitian. This project aims to develop and fully understand a class of mathematical models describing fundamental interacting systems of particles of central importance in the physics of topological insulators. This will include the extension of exact solutions to more complicated models and the development and application of topological data analysis for detecting topological phase transitions in these and more general materials. The project will also apply diagrammatic methods to address a long-standing challenge in solving a particular model. The project aims to contribute to training researchers in an area of the mathematical sciences of benefit to the future development of new concepts for next-generation electronic devices and smart materials.Read moreRead less
Approximate algorithms and architectures for area efficient system design. This project aims to develop simpler but reliable image recognition systems that can run on low-cost, small-scale platforms, for use in driver monitoring system (DMS) applications. Cheaper reliable DMS will lead to wider availability of this technology to end users and improve safety of motor vehicles. This project will develop approximate algorithmic and circuit techniques, provide training for research students and buil ....Approximate algorithms and architectures for area efficient system design. This project aims to develop simpler but reliable image recognition systems that can run on low-cost, small-scale platforms, for use in driver monitoring system (DMS) applications. Cheaper reliable DMS will lead to wider availability of this technology to end users and improve safety of motor vehicles. This project will develop approximate algorithmic and circuit techniques, provide training for research students and build capability in the area of approximate computing. It is also expected to lead to commercial products, licences and revenue, which will enable new job creation.
Read moreRead less
Adaptive Key-value Store for Future Extreme Heterogeneous Systems. Safe, lasting storage of data, and efficient access to it, is vital for all aspects of computing, ranging from e-commerce applications, and data-management in governments. For the storage of data, persistent key-value stores are central in modern computing platforms. However, contemporary key-value stores have not been designed for emerging extreme heterogeneous computational systems with future hardware accelerators and storage ....Adaptive Key-value Store for Future Extreme Heterogeneous Systems. Safe, lasting storage of data, and efficient access to it, is vital for all aspects of computing, ranging from e-commerce applications, and data-management in governments. For the storage of data, persistent key-value stores are central in modern computing platforms. However, contemporary key-value stores have not been designed for emerging extreme heterogeneous computational systems with future hardware accelerators and storage capabilities, including graphics processor and flash-based memory. This project will devise an adaptive key-value store framework for heterogeneous systems. Our new framework will adaptively harvest the performance potential of future hardware such that applications can cope with fast-growing data sets.Read moreRead less