Institute of Information Science, Academia Sinica

Previous research on theoretical graph queries mostly focused on single-layer graphs, e.g., extracting k-core dense subgraphs. In contrast, for real applications with multiple dimensions (not only social graph but also temporal, spatial, preference, and content diversity), the problems become more interesting but challenging. In this talk, we introduce social and spatial queries for various new applications in VR, live streaming, and IoT.  We formulate new optimization problems and prove the hardness result. We design new approximation algorithms and implement them in real platforms (e.g., Twitch, Facebook, HTC VIVE). In addition to the above positive sides on social networks, we will then address the negative side (i.e., social networks mental disorders), by tenuous group recommendation for group therapy in Psychology, and newsfeeds replacement with randomized graph search to alleviate addictions.

De-Nian Yang's research interests include network optimization and analysis for social networks and communications networks. He received Best Paper Nominate of IEEE GLOBECOM, PAKDD Best Paper Running-Up Award, Best In-Session Presentation Award in IEEE INFOCOM, ACM CHI Best Paper Honorable Mention Award, Best Student Paper Award of IEEE ICME, Emerging Technologies Prize in ACM SIGGRAPH Asia, Junior Research Investigators Award and Career Development Award in Academia Sinica, Young Scholar Creativity Award in Foundation for Advancement of Outstanding Scholarship, Outstanding Youth Electrical Engineer Award in Chinese Institute of Electrical Engineering, K. T. Li Distinguished Young Scholar Award in ACM Taipei/Taiwan Chapter, and Research Exploration Award in Pan Wen Yuan Foundation. He has served various chairs in IEEE GLOBECOM, WWW (The Web Conf), INFORMS and IEEE MDM, and elected as the secretary in IEEE Social Networks Technical Committee. He is a Senior Member of IEEE.