2015 ACM SIGMOD Accepted Research Papers
- Skew-Aware Join Optimization for Array Databases
Jennie Duggan (Northwestern University); Olga Papaemmanouil (Brandeis University); Leilani Battle (MIT); Michael Stonebraker (MIT); - GetReal: Towards Realistic Selection of Influence Maximization Strategies in Competitive Networks
Hui Li (Xidian University); Sourav S Bhowmick (Nanyang Technological University); Jiangtao Cui (Xidian University); Yunjun Gao (Zhejiang University); - Lineage-driven Fault Injection
Peter Alvaro (UC Berkeley); Joshua Rosen (UC Berkeley); Joseph Hellerstein (UC Berkeley); - Exploiting Matrix Dependency for Efficient Distributed Matrix Computation
Lele Yu (Peking University); Yingxia Shao (Peking University); Bin Cui (Peking University); - Learning Generalized Linear Models Over Normalized Data
Arun Kumar (University of Wisconsin-Madison); Jeffrey Naughton (University of Wisconsin-Madison); Jignesh Patel (University of Wisconsin-Madison); - Graph-Aware, Workload-Adaptive SPARQL Query Caching
Nikolaos Papailiou (National Technical University of Athens); Dimitrios Tsoumakos (Ionian University); Panagiotis Karras (Skolkovo Institute of Science and Technology (Skoltech)); Nectarios Koziris (National Technical University of Athens); - Exploiting Correlations for Expensive Predicate Evaluation
Manas Joglekar (Stanford University); Hector Garcia-Molina (Stanford University); Aditya Parameswaran (University of Illinois at Urbana-Champaign); Christopher Re (Stanford University); - BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs
Kijung Shin (Seoul National University); Jinhong Jung (KAIST); Sael Lee (The State University of New York (SUNY) Korea); U Kang (KAIST); - Minimum Spanning Trees in Temporal Graphs
SILU HUANG (Chinese University of Hong Kong); Ada Wai-Chee Fu (Chinese University of Hong Kong); Ruifeng Liu (Chinese University of Hong Kong); - Locality-aware Partitioning in Parallel Database Systems
Erfan Zamanian (Brown University); Carsten Binnig (Baden-Wuerttemberg Cooperative State University); Abdallah Salama (Baden-Wuerttemberg Cooperative); - Holistic Indexing in Main-memory Column-stores
Eleni Petraki (CWI); Stratos Idreos (Harvard University); Stefan Manegold (CWI); - The Homeostasis Protocol: Avoiding Transaction Coordination Through Program Analysis
Sudip Roy (Google Research & Cornell University); Lucja Kot (Cornell University); Gabriel Bender (Cornell University); Bailu Ding (Cornell University); Hossein Hojjat (Cornell University); Christoph Koch (EPFL); Nate Foster (Cornell University); Johannes Gehrke (Microsoft Corp. & Cornell University); - Automatic Enforcement of Data Use Policies with DataLawyer
Prasang Upadhyaya (University of Washington); Magdalena Balazinska (University of Washington); Dan Suciu (University of Washington); - The Importance of Being Expert: Efficient Max-Finding in Crowdsourcing
Aris Anagnostopoulos (Sapienza University of Rome); Luca Becchetti (Sapienza University of Rome); Adriano Fazzone (Sapienza University of Rome); Ida Mele (Max Planck Institute for Informatics); Matteo Riondato (Stanford University); - Efficient Algorithms for Answering the m-Closest Keywords Query
Tao Guo (Nanyang Technological University); Xin Cao (Queen's University Belfast); Gao Cong (Nanyang Technological University); - LASH: Large-Scale Sequence Mining with Hierarchies
Kaustubh Beedkar (University of Mannheim); Rainer Gemulla (University of Mannheim); - TEGRA: Table Extraction by Global Record Alignment
Xu Chu (University of Waterloo); Yeye He (Microsoft Research); Kaushik Chakrabarti (Microsoft Research); Kris Ganjam (Microsoft Research); - Squall: Fine-Grained Live Reconfiguration for Partitioned Main Memory Databases
Aaron Elmore (University of Chicago); Vaibhav Arora (University of California, Santa Barbara); Rebecca Taft (MIT); Andrew Pavlo (Carnegie Mellon University); Divyakant Agrawal (University of California, Santa Barbara & Qatar Computing Research Institute); Amr El Abbadi (University of California, Santa Barbara ); - Madeus: Database Live Migration Middleware under Heavy Workloads for Cloud Environment
Takeshi Mishima (NTT); Yasuhiro Fujiwara (NTT); - Weighted Coverage based Reviewer Assignment
Ngai Meng Kou (University of Macau); Leong Hou U (University of Macau); Nikos Mamoulis (University of Hong Kong); Zhiguo Gong (University of Macau); - Indexing Metric Uncertain Data for Range Queries
Lu Chen (Zhejiang University); Yunjun Gao (Zhejiang University); Xinhan Li (Zhejiang University); Christian S. Jensen (Aalborg University); Gang Chen (Zhejiang University); Baihua Zheng (Singapore Management University); - Minimizing Commit Latency of Transactions in Geo-Replicated Data Stores
Faisal Nawab (UC Santa Barbara); Vaibhav Arora (UC Santa Barbara); Divyakant Agrawal (US Santa Barbara); Amr El Abbadi (UC Santa Barbara); - SCREEN: Stream Data Cleaning under Speed Constraints
Shaoxu Song (Tsinghua University); Aoqian Zhang (Tsinghua University); Jianmin Wang (Tsinghua University); Philip Yu (University of Illinois at Chicago); - Minimizing Efforts in Validating Crowd Answers
Quoc Viet Hung Nguyen (EPFL); Chi Thang Duong (EPFL); Matthias Weidlich (Imperial College London); Karl Aberer (EPFL); - SQLGraph: An Efficient Relational-Based Property Graph Store
Wen Sun (IBM Research - China); Achille Fokoue (IBM Watson Research Center); Kavitha Srinivas (IBM Watson Research Center); Anastasios Kementsietsidis (Google Inc.); Gang Hu (IBM Research - China); Guotong Xie (IBM Research - China); - Efficient Similarity Join and Search on Multi-Attribute Data
Guoliang Li (Tsinghua University); Jian He (Tsinghua University); Dong Deng (Tsinghua University); Jian Li (Tsinghua University); - Influence Maximization in Near-Linear Time: A Martingale Approach
Youze Tang (Nanyang Technological University); Yanchen Shi (Nanyang Technological University); Xiaokui Xiao (Nanyang Technological University); - k-Hit Query: Top-k Query with Probabilistic Utility Function
Peng Peng (Hong Kong University of Science and Technology); Raymong Chi-Wing Wong (Hong Kong University of Science and Technology); - Output-sensitive Evaluation of Prioritized Skyline Queries
Niccolo' Meneghetti (University at Buffalo State University of New York); Denis Mindolin (Bloomberg L.P.); Paolo Ciaccia (University of Bologna); Jan Chomicki (University at Buffalo State University of New York); - Community Level Diffusion Extraction
Zhiting Hu ( Peking University & Carnegie Mellon University); Junjie Yao (East China Normal University); Bin Cui (Key Lab of High Confidence Software Technologies (MOE), School of EECS, Peking University); Eric Xing (Language Technologies Institute, Carnegie Mellon University); - Supporting Data Uncertainty in Array Databases
Liping Peng (University of Massachusetts Amherst); Yanlei Diao (University of Massachusetts Amherst); - Crowd-Based Deduplication: An Adaptive Approach
Sibo Wang (Nanyang Technological University); Xiaokui Xiao (Nanyang Technological University); Chun-Hee Lee (Nanyang Technological University); - Divide & Conquer: I/O Efficient Depth-First Search
Zhiwei Zhang (The Chinese University of Hong Kong); Jeffrey Xu Yu ( The Chinese University of Hong Kong); Lu Qin ( University of Technology, Sydney); Zechao Shang ( The Chinese University of Hong Kong); - SEMROD: Secure and Efficient MapReduce Over HybriD Clouds
Kerim Yasin Oktay (University of Califormia, Irvine); Vaibhav Khadilkar (The University of Texas at Dallas); Murat Kantarcioglu (The University of Texas at Dallas); Sharad Mehrotra (University of California, Irvine); - ALEX: Automatic Link Exploration in Linked Data
Ahmed El-Roby (University of Waterloo); Ashraf Aboulnaga (Qatar Computing Research Institute); - SMiLer: A Semi-Lazy Time Series Prediction System for Sensors
Jingbo Zhou (National University of Singapore); Anthony Tung (National University of Singapore); - Distributed Outlier Detection using Compressive Sensing
Ying Yan (Microsoft Research); Jiaxing Zhang (Microsoft Research); Bojun Huang (Microsoft Research); Xuzhan Sun (Peking University); Jiaqi Mu (University of Illinois, Urbana-Champaign); Zheng Zhang (NYU Shanghai); Thomas Moscibroda (Microsoft Research); - QASCA: A Quality-Aware Task Assignment System for Crowdsourcing Applications
Yudian Zheng (The University of Hong Kong); Jiannan Wang (UC Berkeley); Guoliang Li (Tsinghua University); Reynold Cheng (The University of Hong Kong); Jianhua Feng (Tsinghua University); - ByteSlice: Pushing the Envelop of Main Memory Data Processing with a New Storage Layout
Ziqiang Feng (The Hong Kong Polytechnic University); Eric Lo (The Hong Kong Polytechnic University); Ben Kao (The University of Hong Kong); Wenjian Xu (The Hong Kong Polytechnic University); - KATARA: A Data Cleaning System Powered by Knowledge Bases and Crowdsourcing
Xu Chu (University of Waterloo); John Morcos (University of Waterloo); Ihab Ilyas (University of Waterloo); Mourad Ouzzani (Qatar Computing Research Institute); Paolo Papotti (Qatar Computing Research Institute); Nan Tang (Qatar Computing Research Institute); Yin Ye (Qatar Computing Research Institute); - Bayesian Differential Privacy on Correlated Data
Bin Yang (Rakuten Inc.); Issei Sato (The University of Tokyo); Hiroshi Nakagawa (The University of Tokyo); - Implicit Parallelism through Deep Language Embedding
Alexander Alexandrov (TU Berlin); Andreas Kunft (TU Berlin); Asterios Katsifodimos (TU Berlin); Felix Schüler (TU Berlin); Lauritz Thamsen (TU Berlin); Odej Kao (TU Berlin); Tobias Herb (TU Berlin); Volker Markl (TU Berlin); - Diverse and Proportional Size-l Object Summaries for Keyword Search
Georgios Fakas (HKUST); Zhi Cai (Beijing University of Technology); Nikos Mamoulis (The University of Hong Kong); - Efficient Enumeration of Maximal k-Plexes
Devora Berlowitz (The Hebrew University of Jerusalem); Sara Cohen (The Hebrew University of Jerusalem); Benny Kimelfeld (Technion, Israel Institute of Technology); - Resource Elasticity for Large-Scale Machine Learning
Botong Huang (Duke University); Matthias Boehm (IBM Research - Almaden); Yuanyuan Tian (IBM Research - Almaden); Berthold Reinwald (IBM Research - Almaden); Shirish Tatikonda (IBM Research - Almaden); Frederick Reiss (IBM Research - Almaden); - Collaborative Access Control in WebdamLog
Vera Zaychik Moffitt (Drexel University); Julia Stoyanovich (Drexel University); Serge Abiteboul (INRIA Saclay & ENS Cachan); Gerome Miklau (University of Massachusetts); - RBench: Application-Specific RDF Benchmarking
Shi Qiao (Case Western Reserve University); Z. Meral Özsoyo?lu (Case Western Reserve University); - THERMAL-JOIN: A Scalable Spatial Join for Dynamic Workloads
Farhan Tauheed (Oracle Labs); Thomas Heinis (Imperial College); Anastasia Ailamaki (Ecole Polytechnique Federale de Lausanne); - Identifying the Extent of Completeness of Query Answers over Partially Complete Databases
Simon Razniewski (Free University of Bozen-Bolzano); Flip Korn (Google Research); Werner Nutt (Free University of Bozen-Bolzano); Divesh Srivastava (AT&T Labs-Research); - Proactive Annotation Management in Relational Databases
Karim Ibrahim (Worcester Polytechnic Institute); Xiao Du (Worcester Polytechnic Institute); Mohamed Eltabakh (Worcester Polytechnic Institute); - Cache-Efficient Aggregation: Hashing Is Sorting
Ingo Müller (Karlsruhe Institute of Technology / SAP SE); Peter Sanders (Karlsruhe Institute of Technology); Arnaud Lacurie (SAP SE); Wolfgang Lehner (Dresden University of Technology); Franz Färber (SAP SE); - Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems
Thomas Neumann (Technische Universität München); Tobias Mühlbauer (Technische Universität München); Alfons Kemper (Technische Universität München); - Cost-based Fault=tolerance for Parallel Data Processing"
Abdallah Salama (Baden-Wuerttemberg Cooperative State University); Carsten Binnig (Baden-Wuerttemberg Cooperative State University); Tim Kraska (Brown University); Erfan Zamanian (Brown University); - FOEDUS: OLTP Engine for a Thousand Cores and NVRAM
Hideaki Kimura (HP Labs); - Feral Concurrency Control: An Empirical Investigation of Modern Application Integrity
Peter Bailis (UC Berkeley); Alan Fekete (University of Sydney); Michael Franklin (UC Berkeley); Ali Ghodsi (UC Berkeley); Joseph Hellerstein (UC Berkeley); Ion Stoica (UC Berkeley); - Self-Tuning, GPU-Accelerated Kernel Density Models for Multidimensional Selectivity Estimation
Max Heimel (Technische Universität Berlin); Martin Kiefer (Technische Universität Berlin); Volker Markl (Technische Universität Berlin); - Rethinking SIMD Vectorization for In-Memory Databases
Orestis Polychroniou (Columbia University); Arun Raghavan (Oracle Corporation); Kenneth Ross (Columbia University); - BigDansing: A System for Big Data Cleansing
Zuhair Khayyat (King Abdullah University of Science and Technology (KAUST)); Ihab Ilyas (University of Waterloo); Alekh Jindal (MIT); Samuel Madden (MIT); Mourad Ouzzani (Qatar Computing Research Institute); Paolo Papotti (Qatar Computing Research Institute); Jorge-Arnulfo Quiané-Ruiz (Qatar Computing Research Institute); Nan Tang (Qatar Computing Research Institute); Si Yin (Qatar Computing Research Institute); - ENKI: Access Control for Encrypted Query Processing
Isabelle Hang (University of Bremen); Florian Kerschbaum (SAP AG); Ernesto Damiani (University of Milan); - On the Design and Scalability of Distributed Shared-Data Databases
Simon Loesing (ETH Zurich); Markus Pilman (ETH Zurich); Thomas Etter (ETH Zurich); Donald Kossmann (Microsoft Research); - tDP: An Optimal-Latency Budget Allocation Strategy for Crowdsourced MAXIMUM Operations
Vasilis Verroios (Stanford University); Peter Lofgren (Stanford University); Hector Garcia-Molina (Stanford University); - Private Release of Graph Statistics using Ladder Functions
Jun Zhang (Nanyang Technological University); Graham Cormode (University of Warwick); Cecilia Procopiuc (Google Inc.); Divesh Srivastava (AT&T Labs - Research); Xiaokui Xiao (Nanyang Technological University); - Let's Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems
Joy Arulraj (Carnegie Mellon University); Andrew Pavlo (Carnegie Mellon University); Subramanya Dulloor (Intel Labs); - LEMP: Fast Retrieval of Large Entries in a Matrix Product
Christina Teflioudi (Max Planck Institute for Computer Science); Rainer Gemulla (University of Mannheim); Olga Mykytiuk (Sulzer GmbH); - Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates
Xiaoyang Wang (The University Of New South Wales); Ying Zhang (University of Technology, Sydney); Wenjie Zhang (The University Of New South Wales); Xuemin Lin (The University Of New South Wales); Muhammad Aamir Cheema (Monash University); - How to Build Templates for RDF Question/Answering
Weiguo Zheng (Peking University); Lei Zou (Peking University); Xiang Lian (University of Texas-Pan American); Jeffrey Xu Yu (The Chinese University of Hong Kong); Shaoxu Song (Tsinghua University); Dongyan Zhao (Peking University); - Persistent Data Sketching
Zhewei Wei (Renmin University of China); Ge Luo (The Hong Kong University of Science and Technology); Ke Yi (The Hong Kong University of Science and Technology); Xiaoyong Du (Renmin University of China); Ji-Rong Wen (Renmin University of China); - Location-Aware Pub/Sub System: When Continuous Moving Queries Meet Dynamic Event Streams
Long Guo (National University of Singapore); Dongxiang Zhang (National University of Singapore); Guoliang Li (Tsinghua University); Kian-Lee Tan (National University of Singapore); Zhifeng Bao (RMIT University); - From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System
Shumo Chu (University of Washington); Magdalena Balazinska (University of Washington); Dan Suciu (University of Washington); - Query-Oriented Data Cleaning with Oracles
Moria Bergman (Tel Aviv University); Tova Milo (Tel Aviv University); Slava Novgorodov (Tel Aviv University); Wang-Chiew Tan (UC Santa Cruz); - A Padded Encoding Scheme to Accelerate Scans by Leveraging Skew
Yinan Li (University of Wisconsin-Madison); Craig Chasseur (University of Wisconsin-Madison); Jignesh Patel (University of Wisconsin-Madison); - Optimizing Optimistic Concurrency Control for Tree-Structured, Log-Structured Databases
Philip Bernstein (Microsoft Research); Sudipto Das (Microsoft Research); Bailu Ding (Cornell University); Markus Pilman (ETH Zurich); - Linking Temporal Records for Profiling Entities
Furong Li (National University of Singapore); Mong Li Lee (National University of Singapore); Wynne Hsu (National University of Singapore); Wang-Chiew Tan (UC Santa Cruz); - Online Video Recommendation in Sharing Community
Xiangmin Zhou (RMIT University); Lei Chen (Hong Kong University of Science and Technology); Yanchun Zhang (Victoria University); Longbing Cao (University of Technology, Sydney); Guangyan Huang (Deakin University); Chen Wang (CSIRO); - Utilizing IDs to Accelerate Incremental View Maintenance
Yannis Katsis (UC San Diego); Kian Win Ong (UC San Diego); Yannis Papakonstantinou (UC San Diego); Kevin Keliang Zhao (UC San Diego); - Local Filtering: Improving the Performance of Approximate Queries on String Collections
Xiaochun Yang (Northeastern University); Yaoshu Wang (University of New South Wales); Bin Wang (Northeastern University); Wei Wang (University of New South Wales); - Authenticated Online Data Integration Services
Qian Chen (Hong Kong Baptist University); Haibo Hu (Hong Kong Baptist University); Jianliang Xu (Hong Kong Baptist University); - Utility-Aware Social Event-Participant Planning
Jieying She (The Hong Kong University of Science and Technology); Yongxin Tong (Beihang University); Lei Chen (The Hong Kong University of Science and Technology); - Exact Top-k Nearest Keyword Search in Large Networks
Minhao Jiang (The Hong Kong University of Science and Technology); Ada Fu (The Chinese University of Hong Kong); Raymond Wong (The Hong Kong University of Science and Technology); - Updating Graph Indices with a One-Pass Algorithm
Dayu Yuan (Google); Prasenjit Mitra (QCRI); Huiwen Yu (Google); C. Lee Giles (Penn State University); - From Group Recommendations to Group Formation
Senjuti Basu Roy (University of Washington Tacoma); Laks Lakshmanan (University of British Columbia); Rui Liu (University of Washington Tacoma); - Rack-Scale In-Memory Join Processing using RDMA
Claude Barthels (ETH Zurich); Simon Loesing (ETH Zurich); Gustavo Alonso (ETH Zurich); Donald Kossmann (ETH Zurich); - sPCA: Scalable Principal Component Analysis for Big Data on Distributed Platforms
Tarek Elgamal (Qatar Computing Research Institute); Maysam Yabandeh (Twitter); Ashraf Aboulnaga (Qatar Computing Research Institute); Walid Fathi (NTG Clarity); Mohamed Hefeeda (Qatar Computing Research Institutea); - The Minimum Wiener Connector Problem
Natali Ruchansky (Boston University); Francesco Bonchi (Yahoo Labs); David García-Soriano (Yahoo Labs); Francesco Gullo (Yahoo Labs); Nicolas Kourtellis (Yahoo Labs); - Real-Time Multi-Criteria Social Graph Partitioning: A Game Theoretic Approach
Nikos Armenatzoglou (Hong Kong University of Science and Technology); Huy Pham (University of Southern California); Vasilis Ntranos (University of Southern California); Dimitris Papadias (Hong Kong University of Science and Technology); Cyrus Shahabi (University of Southern California); - Distributed Online Tracking
Mingwang Tang (University of Utah); Feifei Li (University of Utah); Yufei Tao (Chinese University of Hong Kong); - Diversity-Aware Top-k Publish/Subscribe for Text Stream
Lisi Chen (Nanyang Technological University); Gao Cong (Nanyang Technological University); - COMMIT : A Scalable Approach to Mining Communication Motifs from Dynamic Networks
Saket Gurukar (IIT Madras); Sayan Ranu (IIT Madras); Balaraman Ravindran (IIT Madras); - Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins)
Medha Atre (Unaffiliated); - An Incremental Anytime Algorithm for Multi-Objective Query Optimization
Immanuel Trummer (EPFL); Christoph Koch (EPFL); - DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation
Junhao Gan (Chinese University of Hong Kong ); Yufei Tao (Chinese University of Hong Kong ); - Scalable Distributed Stream Join Processing
Qian Lin (National University of Singapore); Beng Chin Ooi (National University of Singapore); Zhengkui Wang (National University of Singapore); Cui Yu (Monmouth University); - Mining Subjective Properties on the Web
Immanuel Trummer (EPFL); Alon Halevy (Google, Inc.); Hongrae Lee (Google, Inc.); Sunita Sarawagi (Google, Inc.); Rahul Gupta (Google, Inc.); - S4: Top-k Spreadsheet-Style Search for Query Discovery
Fotis Psallidas (Columbia University); Bolin Ding (Microsoft); Kaushik Chakrabarti (Microsoft); Surajit Chaudhuri (Microsoft); - Chiaroscuro: Transparency and Privacy for Massive Personal Time-Series Clustering
Tristan Allard (IRISA & Univ. Rennes 1); Georges Hébrail (EDF R&D); Florent Masseglia (Inria & Lirmm, Univ. Montpellier); Esther Pacitti (Inria & Lirmm, Univ. Montpellier); - Data X-Ray: A Diagnostic Tool for Data Errors
Xiaolan Wang (University of Massachusetts, Amherst); Xin Dong (Google Inc.); Alexandra Meliou (University of Massachusetts, Amherst); - Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time
Michael Cochez (University of Jyvaskyla); Hao Mou (University of Jyvaskyla); - CliffGuard: A Principled Framework for Finding Robust Database Designs
Barzan Mozafari (University of Michigan, Ann Arbor); Eugene Goh (University of Michigan, Ann Arbor); Dong Yoon (University of Michigan, Ann Arbor); - k-Shape: Efficient and Accurate Clustering of Time Series
John Paparrizos (Columbia University); Luis Gravano (Columbia University); - Modular Order-Preserving Encryption, Revisited
Charalampos Mavroforakis (Boston University); Nathan Chenette (Rose-Hulman Institute of Technology); Adam O'Neill (Georgetown University and NIST); George Kollios (Boston University); Ran Canetti (Boston University); - Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity
Lijun Chang (University of New South Wales); Xuemin Lin (University of New South Wales); Lu Qin (University of Technology, Sydney); Jeffrey Xu Yu (The Chinese University of Hong Kong); Wenjie Zhang (University of New South Wales); - Microblog Entity Linking with Social Temporal Context
Wen Hua (The University of Queensland); Kai Zheng (The University of Queensland); Xiaofang Zhou (The University of Queensland); - Efficient Route Planning on Public Transportation Networks: A Labelling Approach
Sibo Wang (Nanyang Technological University); Wenqing Lin (A*STAR); Yi Yang (Fudan University); Xiaokui Xiao (Nanyang Technological University); Shuigeng Zhou (Fudan University); - iCrowd: An Adaptive Crowdsourcing Framework
Ju Fan (School of Computing, National University of Singapore); Guoliang Li (Department of Computer Science, Tsinghua University); Beng Chin Ooi (School of Computing, National University of Singapore); Kian-lee Tan (School of Computing, National University of Singapore); Jianhua Feng (Department of Computer Science, Tsinghua University); - Mining Quality Phrases from Massive Text Corpora
Jialu Liu (University of Illinois at Urbana-Champaign); Jingbo Shang (University of Illinois at Urbana-Champaign); Chi Wang (Microsoft Research); Xiang Ren (University of Illinois at Urbana-Champaign); Jiawei Han (University of Illinois at Urbana-Champaign); - The TagAdvisor: Luring the Lurkers to Review Web Items
Azade Nazi (University of Texas at Arlington); Mahashweta Das (HP Labs); Gautam Das (University of Texas at Arlington);
