We hold seminar regularly.



  • T-Crowd: Effective Crowdsourcing for Tabular Data
  • From Community Detection to Community Profiling
  • A Survey for Out-of-Town POI Recommendation
  • A Density-based Nonparametric Model for Online Event Discovery from the Social Media Data
  • Efficient and Effective SimRank Computation Algorithms
  • Link-predict in time-aware graph
  • A Survey of Point-of-Interest Recommendation in Location-Based Social Network
  • Conflict of Interest Detection on Paper Assignment


  • Meta Structure: Computing Relevance on Large Heterogeneous Information Networks
  • Dirichlet-Hawkes Processes with Applications to Clustering Continuous-Time Document Streams
  • Overlapping Community Search
  • Introduction to Randomized Algorithms
  • Finding Flexible Maximal Frequency Interval in An Item Stream
  • A Geographical Sparse Additive Generative Model for Spatial Item Recommendation
  • A Journey in Canonical Hub Labelings
  • Community Level Diffusion Extraction


  • Finding Diverse Shortest Path
  • A Fast And Accurate Algorithm For SimRank Computation
  • Local Search of Community in Large Graphs
  • PRESS: A Novel Framework of Trajectory Compression in Road Networks
  • Join algorithm using MapReduce: A Survey
  • Introduction of Dirichlet Process and its application
  • An introduction to web crawler
  • Preference Learning with Gaussian Processes
  • A brief introduction to the minimum cost flow problem
  • Assignment problem and coverage base group assignment problem, and their basic algorithms
  • Quick-Motif: An Efficient and Scalable Framework for Exact Motif Discovery


  • Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
  • Upper and Lower Bounds on the Cost of a Map-Reduce Computation
  • Crawling and sampling the hidden databases through restricted interfaces
  • Measuring structural context similarity
  • The History and Current Developments of Finding k Simple Shortest Paths
  • Spatial and temporal topics