Microsoft Research India
Reports of the Workshops Held at the 2018 International AAAI Conference on Web and Social Media
Editor, Managing (AAAI) | An, Jisun (Qatar Computing Research Institute) | Chunara, Rumi (New York University) | Crandall, David J. (Indiana University) | Frajberg, Darian (Politecnico di Milano) | French, Megan (Stanford University) | Jansen, Bernard J. (Qatar Computing Research Institute) | Kulshrestha, Juhi (GESIS - Leibniz Institute for the Social Sciences) | Mejova, Yelena (Qatar Computing Research Institute) | Romero, Daniel M. (University of Michigan) | Salminen, Joni (Qatar Computing Research Institute) | Sharma, Amit (Microsoft Research India) | Sheth, Amit (Wright State University) | Tan, Chenhao (University of Colorado Boulder) | Taylor, Samuel Hardman (Cornell University) | Wijeratne, Sanjaya (Wright State University)
The Workshop Program of the Association for the Advancement of Artificial Intelligence’s 12th International Conference on Web and Social Media (AAAI-18) was held at Stanford University, Stanford, California USA, on Monday, June 25, 2018. There were fourteen workshops in the program: Algorithmic Personalization and News: Risks and Opportunities; Beyond Online Data: Tackling Challenging Social Science Questions; Bridging the Gaps: Social Media, Use and Well-Being; Chatbot; Data-Driven Personas and Human-Driven Analytics: Automating Customer Insights in the Era of Social Media; Designed Data for Bridging the Lab and the Field: Tools, Methods, and Challenges in Social Media Experiments; Emoji Understanding and Applications in Social Media; Event Analytics Using Social Media Data; Exploring Ethical Trade-Offs in Social Media Research; Making Sense of Online Data for Population Research; News and Public Opinion; Social Media and Health: A Focus on Methods for Linking Online and Offline Data; Social Web for Environmental and Ecological Monitoring and The ICWSM Science Slam. Workshops were held on the first day of the conference. Workshop participants met and discussed issues with a selected focus — providing an informal setting for active exchange among researchers, developers, and users on topics of current interest. Organizers from nine of the workshops submitted reports, which are reproduced in this report. Brief summaries of the other five workshops have been reproduced from their website descriptions.
Learning Hash Functions for Cross-View Similarity Search
Kumar, Shaishav (Microsoft Research India) | Udupa, Raghavendra (Microsoft Research India)
Many applications in Multilingual and Multimodal Information Access involve searching large databases of high dimensional data objects with multiple (conditionally independent) views. In this work we consider the problem of learning hash functions for similarity search across the views for such applications. We propose a principled method for learning a hash function for each view given a set of multiview training data objects. The hash functions map similar objects to similar codes across the views thus enabling cross-view similarity search. We present results from an extensive empirical study of the proposed approach which demonstrate its effectiveness on Japanese language People Search and Multilingual People Search problems.
PR + RQ ≈ PQ: Transliteration Mining Using Bridge Language
Khapra, Mitesh M. (Indian Institute of Technology Bombay) | Udupa, Raghavendra (Microsoft Research India) | Kumaran, A. (Microsoft Research India) | Bhattacharyya, Pushpak (Indian Institute of Technology Bombay)
We address the problem of mining name transliterations from comparable corpora in languages P and Q in the following resource-poor scenario: Parallel names in PQ are not available for training. Parallel names in PR and RQ are available for training. We propose a novel solution for the problem by computing a common geometric feature space for P,Q and R where name transliterations are mapped to similar vectors. We employ Canonical Correlation Analysis (CCA) to compute the common geometric feature space using only parallel names in PR and RQ and without requiring parallel names in PQ. We test our algorithm on data sets in several languages and show that it gives results comparable to the state-of-the-art transliteration mining algorithms that use parallel names in PQ for training.