Extremist groups are using Twitter as a major resonance loud speaker to relay their propaganda. This talk will describe the state of the art in large graph data mining. It will in particular discuss about the practical application of community detection and graph clustering techniques, the deep relations that exist between these problems and convex-optimization, and extension to cases where we have more than a single graph to do the analysis. In particular we will describe multi-graph clustering and present new methods for cushioning information coming from different graphs.
Kavé Salamatian is a full professor of computer science at University of Savoie. His main areas of researches has been Internet measurement and modeling, and networking information theory. He was previously reader at Lancaster University, UK and associate professor at University Pierre et Marie Curie. Kavé has graduated in 1998 from Paris SUD-Orsay university where he worked on joint source channel coding applied to multimedia transmission over Internet for his Phd. In a former life, he graduated with a MBA, and worked on market floor as a risk analyst and enjoyed being an urban traffic modeler for some years. He is currently distinguished visiting professor at the Chinese Academy of Science and also working closely with the Castex CyberStrategy Chair at the French National Defense Institute. He is working these day on figuring out if networking is a science or just a hobby and if it is a science what are its fundamentals. In particular, he has been working on cyber-strategy and cyber-geography.