Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Jaewon Yang Education 2007–2014 Ph.D. in Electrical Engineering, Stanford University, Stanford, CA. Advisor: Prof. Jure Leskovec 2011–2012 M.S. in Statistics, Stanford University, Stanford, CA. 2000–2007 B.S. in Electrical Engineering, Seoul National University, South Korea. Research Interests Network community detection, Recommender systems, Social media, Temporal pattern mining Honors and Awards 2012 2010 2007–2012 1999 Selected for best papers, ICDM ’12 Best application paper award, ICDM ’10 Samsung Scholarship for doctoral students Gold prize (ranked 2nd in nation) in the Korean science olympiad Professional Experience 06–09/2012 Summer intern, LinkedIn, Mountain View. Worked with Bee-Chung Chen and Deepak Agarwal on estimating the reputation of LinkedIn users. Our work has been published in KDD ’12. Publications J. Yang, J. J. McAuley, J. Leskovec, P. LePendu, and N. Shah. Finding progression stages in time-evolving event sequences. In ACM International Conference on World Wide Web (WWW), 2014. J. Yang, J. J. McAuley, and J. Leskovec. Detecting cohesive and 2-mode communities in directed and undirected networks. In ACM International Conference on Web Search and Data Mining (WSDM), 2014. J. Yang, J. J. McAuley, and J. Leskovec. Community detection in networks with node attributes. In International Conference on Data Mining (ICDM), 2013. D. Shahaf, J. Yang, C.Suen, J.Jacobs, H.Wang, and J. Leskovec. Information cartography: Creating zoomable, large-scale maps of information. In SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2013. J. Yang, B-C. Chen, and D. Agarwal. B [email protected] • Estimating sharer reputation via social Í i.stanford.edu/~crucis data calibration. In SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2013. J. Yang and J. Leskovec. Overlapping community detection at scale: A nonnegative matrix factorization approach. In ACM International Conference on Web Search and Data Mining (WSDM), 2013. J. Yang and J. Leskovec. Structure and overlaps of communities in networks. In ACM Transactions on Intelligent Systems and Technology (ACM TIST), 2013. J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In International Conference on Data Mining (ICDM), 2012. J. Yang and J. Leskovec. Community-affiliation graph model for overlapping community detection. In International Conference on Data Mining (ICDM), 2012. J. Yang and J. Leskovec. Patterns of temporal variation in online media. In ACM International Conference on Web Search and Data Mining (WSDM), 2011. J. Yang and J. Leskovec. Modeling information diffusion in implicit networks. In International Conference on Data Mining (ICDM), 2010. Best Application Paper Award. J. Yang and J. Leskovec. Network deconvolution reveals core-periphery organization of communities. Submitted. Press Coverage The Wall Street Journal on Decoding Our Chatter The New York Times on Why Some Twitter Posts Catch On, and Some Don’t MIT Tech. Review on Will You Tweet This? Computer Skills C++, JAVA, Pig, Python, R, MATLAB Scientific Community Activities Program CIKM ’13 Committee Reviewer Social Networks, ACM TWeb, IEEE TKDE, IEEE MM, Software: Practice and Experience, NEUCOM B [email protected] • Í i.stanford.edu/~crucis