Classification of Relational Data

A simplification by classification.   Would this work in any context?   Application to social networks is of interest.

Training Agents to Walk with Purpose   By KAUST Discovery

The new classification algorithm that can dramatically simplify relational data.
Researchers at King Abdullah University of Science and Technology (KAUST) in Saudi Arabia and NortoLifeLock Research Group in France have developed a new classification algorithm for relational data.

Researchers at King Abdullah University of Science and Technology (KAUST) in Saudi Arabia and NortoLifeLock Research Group in France have developed a classification algorithm for relational data that is more accurate and orders of magnitude more efficient than previous methods.

The new algorithm represents a more robust approach to classifying relational data by introducing machine learning techniques.

Classifying relational data involves a search agent taking an exploratory "walk" following the connections among nodes.

The algorithm is a graph-based classification model that trains the agent using a reinforcement learning method, which achieves a better classification result.

The new method "is also generally applicable to any kind of graph-structured data, such as social-network recommendation systems and classification of biomolecules, as well as cybersecurity," says NortonLifeLock researcher Han Yufei.

From KAUST Discovery
View Full Article

Paper:

https://discovery.kaust.edu.sa/en/article/959/training-agents-to-walk-with-purpose%E2%80%8B
Akujuobi, U., Zhang, Q., Yufei, H. & Zhang, X. (2020). Recurrent attention walk for semi-supervised classification. Proceedings of the 13th International Conference on Web Search and Data Mining Houston TX USA, January 2020, 16-24.| article