Skip to content
GCC AI Research

Search

Results for "graph-based algorithms"

Scalable Community Detection in Massive Networks Using Aggregated Relational Data

MBZUAI ·

A new mini-batch strategy using aggregated relational data is proposed to fit the mixed membership stochastic blockmodel (MMSB) to large networks. The method uses nodal information and stochastic gradients of bipartite graphs for scalable inference. The approach was applied to a citation network with over two million nodes and 25 million edges, capturing explainable structure. Why it matters: This research enables more efficient community detection in massive networks, which is crucial for analyzing complex relationships in various domains, but this article has no clear connection to the Middle East.

Breaking the limits of learning

KAUST ·

KAUST Associate Professor Xiangliang Zhang leads the Machine Intelligence and Knowledge Engineering (MINE) group, focusing on machine learning and data mining algorithms for AI applications. The MINE group researches complex graph data to profile nodes, predict links, detect computing communities, and understand their connections. Zhang's team also works on graph alignment and recommender systems. Why it matters: This research contributes to advancing machine learning techniques at a leading GCC institution, potentially impacting various AI applications in the region.

Power-Watershed: a graph-based optimization framework for image and data processing

MBZUAI ·

Laurent Najman presented the Power Watershed (PW) optimization framework for image and data processing. The PW framework enhances graph-based data processing algorithms like random walker and ratio-cut clustering, leading to faster solutions. It can be adapted for graph-based cost minimization methods and integrated with deep learning networks. Why it matters: This framework could enable more efficient and scalable image and data processing algorithms relevant to computer vision and related fields in the Middle East.

Understanding Machine Learning on Graphs: From Node Classification to Algorithmic Reasoning.

MBZUAI ·

Kimon Fountoulakis from the University of Waterloo presented a talk on machine learning on graphs, covering node classification and algorithmic reasoning. The talk discussed the limitations and strengths of graph neural networks (GNNs). It also covered novel optimal architectures for node classification and the ability of looped GNNs to execute classical algorithms. Why it matters: Understanding GNN capabilities is crucial for advancing AI applications in areas like recommendation systems and drug discovery that rely on relational data.

Graph neural network approach for decentralized multi-robot coordination

MBZUAI ·

Qingbiao Li from the Oxford Robotics Institute is researching decentralized multi-robot coordination using Graph Neural Networks (GNNs). The approach builds an information-sharing mechanism within a decentralized multi-robot system through GNNs and imitation learning. It also uses visual machine learning-assisted navigation with panoramic cameras to guide robots in unseen environments. Why it matters: This research could improve the effectiveness of automated mobile robot systems in urban rail transit and warehousing logistics in the GCC region, where smart city initiatives are growing.

Problems in network archaeology: root finding and broadcasting

MBZUAI ·

This article discusses a talk by Gábor Lugosi on "network archaeology," specifically the problems of root finding and broadcasting in large networks. The talk addresses discovering the past of dynamically growing networks when only a present-day snapshot is observed. Lugosi's research interests include machine learning theory, nonparametric statistics, and random structures. Why it matters: Understanding the evolution and origins of networks is crucial for various applications, including analyzing social networks, biological systems, and the spread of information.

Ph.D. student wins PACE Challenge

KAUST ·

KAUST Ph.D. student Lukas Larisch won the Parameterized Algorithms and Computational Experiments (PACE) 2017 Challenge in the Optimal Tree Decomposition Challenge, solving more instances than competitors. He received the award at the International Symposium on Parameterized and Exact Computation (IPEC 2017) in Vienna, Austria. Larisch is pursuing his Ph.D. at KAUST and working in the University's Extreme Computing Research Center, focusing on acoustics and graph structure theory. Why it matters: This recognition highlights KAUST's contribution to advanced computer science research and its ability to attract and foster talented researchers in niche areas like parameterized complexity.

Biweekly research update

KAUST ·

KAUST Discovery Professor Jesper Tegnér collaborated with UK researchers to develop algorithms explaining decision-making in insects and rats. Assoc. Prof. Robert Hoehndorf's lab introduced a tool for identifying genetic variants linked to rare diseases based on patient symptoms. KAUST scientists also studied monkeypox infection of human skin using stem cells and marine microbiome adaptation to thermal changes. Why it matters: These diverse research projects highlight KAUST's contributions to computational biology, virology, and marine science, advancing knowledge with implications for healthcare and environmental challenges.