High-performance computational data-mining techniques for feature detection in complex time series from large-scale, networked plasma experiments. Terabytes of data are gathered from large experimental facilities as complex time-series. Analysis of these data is daunting, especially when they involve high-dimensional spectral or image arrays. We will develop high-performance computational techniques for dimension reduction, efficient data-mining, and experimental control, using as an initial ta ....High-performance computational data-mining techniques for feature detection in complex time series from large-scale, networked plasma experiments. Terabytes of data are gathered from large experimental facilities as complex time-series. Analysis of these data is daunting, especially when they involve high-dimensional spectral or image arrays. We will develop high-performance computational techniques for dimension reduction, efficient data-mining, and experimental control, using as an initial target the H-1NF plasma fusion MNRF at the ANU and its >100 GB/year data stream. The techniques will immediately provide Australian researchers with unique tools for collaboration in international research to develop fusion as a low-emissions source of electricity, and will be applicable to complex time-series analysis in other areas of science, medicine, and defence.Read moreRead less
Asymptotic Geometric Analysis and Learning Theory. Learning Theory is used in various real-world applications in diverse research areas, ranging from Biology (e.g. DNA sequencing) to Information Sciences. Therefore, having a deep understanding of fundamental questions in Learning Theory, and in particular, pin-pointing the parameters that make a learning problem hard would have a significant practical impact. This projects aims to achieve this goal, and in addition, we expect it would have a hig ....Asymptotic Geometric Analysis and Learning Theory. Learning Theory is used in various real-world applications in diverse research areas, ranging from Biology (e.g. DNA sequencing) to Information Sciences. Therefore, having a deep understanding of fundamental questions in Learning Theory, and in particular, pin-pointing the parameters that make a learning problem hard would have a significant practical impact. This projects aims to achieve this goal, and in addition, we expect it would have a high theoretical value, as the questions we shall address are of independent interest to pure mathematicians.Read moreRead less
Asymptotic Geometric Analysis and Learning Theory. Learning Theory is used in various real-world applications in diverse research areas, ranging from Biology (e.g. DNA sequencing) to Information Sciences. Therefore, having a deep understanding of fundamental questions in Learning Theory, and in particular, pin-pointing the parameters that make a learning problem hard would have a significant practical impact. This projects aims to achieve this goal, and in addition, we expect it would have a hig ....Asymptotic Geometric Analysis and Learning Theory. Learning Theory is used in various real-world applications in diverse research areas, ranging from Biology (e.g. DNA sequencing) to Information Sciences. Therefore, having a deep understanding of fundamental questions in Learning Theory, and in particular, pin-pointing the parameters that make a learning problem hard would have a significant practical impact. This projects aims to achieve this goal, and in addition, we expect it would have a high theoretical value, as the questions we shall address are of independent interest to pure mathematicians.
Read moreRead less
Unsupervised learning of finite mixture models in data mining applications. The extraction of useful information from massively large databases is known as data mining. Its broad but vague goal is to find "interesting structure" in the data, which typically leads to breaking the data into clusters. To this end, we consider the fast, efficient, and automatic learning of finite mixture models in hugh data sets without any prior knowledge of the structure. This probabilistic approach to the discove ....Unsupervised learning of finite mixture models in data mining applications. The extraction of useful information from massively large databases is known as data mining. Its broad but vague goal is to find "interesting structure" in the data, which typically leads to breaking the data into clusters. To this end, we consider the fast, efficient, and automatic learning of finite mixture models in hugh data sets without any prior knowledge of the structure. This probabilistic approach to the discovery and validation of group structure in data mining applications will considerably enhance knowledge management and decision support in science, industry, and government.
Read moreRead less