Big Graph Data Science
Recorded 03 November 2014 in Lausanne, Vaud, Switzerland
Event: IC Colloquia - EPFL IC School Colloquia
One of the challenges in big data analytics lies in being able to reason collectively about extremely large, heterogeneous, incomplete, noisy interlinked data. We need data science techniques which an represent and reason effectively with this form of rich and multi-relational graph data. In this talk, I will describe some common collective inference patterns needed for graph data including: collective classification (predicting missing labels for nodes in a network), link prediction (predicting potential edges), and entity resolution (determining which nodes refer to the same underlying entity). I will describe three key capabilities required: relational feature construction, collective inference, and lifted reasoning. Finally, I will describe some of the cutting edge analytic tools being developed within the machine learning, AI, and database communities to address these challenges. In particular, I will describe work by my group on Probabilistic Soft Logic (http://psl.umiacs.umd.edu/), a highly scalable declarative language for collective inference problems.
Watched 5625 times.Watch