XIFENG YAN

home | research | publications | tutorials | software


2006 - present

  1. Neighborhood Based Fast Graph Search in Large Networks,
    by A. Khan, N. Li, Z. Guan, X. Yan, S. Chakraborty, and S. Tao,
    SIGMOD'11 (Proc. 2011 Int. Conf. on Management of Data), June 2011 [pdf]
  2. Assessing and Ranking Structural Correlations in Graphs,
    by Z. Guan, J. Wu, Q. Zhang, A. Singh, and X. Yan,
    SIGMOD'11 (Proc. 2011 Int. Conf. on Management of Data), June 2011 [pdf]
  3. Generative Models for Ticket Resolution in Expert Networks
    G. Miao, L. Moser, X. Yan, S. Tao, Y. Chen, and N. Anerousis
    SIGKDD'10 (Proc. of 2010 Int. Conf. on Knowledge Discovery and Data Mining), Jul. 2010 [pdf]
  4. Towards Proximity Pattern Mining in Large Graphs,
    A. Khan, X. Yan and K.-L. Wu,
    SIGMOD'10 (Proc. 2010 Int. Conf. on Management of Data), June 2010 [pdf]
  5. Synthesizing Near-Optimal Malware Specifications from Suspicious Behaviors,
    M. Fredrikson, M. Christodorescu, S. Jha, R. Sailer, and X. Yan,
    Oakland'10 (31st IEEE Symp. on Security & Privacy), May 2010 [pdf]
  6. EntityRank: Searching Entities Directly and Holistically,
    by T. Cheng, X. Yan and K. Chang.
    VLDB'07b (Proc. of 2007 Int. Conf. on Very Large Data Bases), Sep. 2007. [pdf]

2002-2006

  1. Mining, Indexing and Similarity Search in Large Graph Data Sets,
    by X. Yan
    Ph.D Dissertation, 2006 SIGMOD Dissertation Award Runner-Up. Advisor Prof. Jiawei Han.
  2. gPrune: A Constraint Pushing Framework for Graph Pattern Mining,
    by F. Zhu, X. Yan, J. Han, and P. S. Yu.
    PAKDD'07 (Proc. of 2007 Pacific-Asia Conference on Knowledge Discovery and Data Mining), May 2007. Best Student Paper. [pdf]
  3. Mining Colossal Frequent Patterns by Core Pattern Fusion,
    by F. Zhu, X. Yan, J. Han, P. S. Yu, and H. Cheng.
    ICDE'07a (Proc. of 2007 Int. Conf. on Data Engineering), Apr. 2007. Best Student Paper. [pdf]
  4. Summarizing Itemset Patterns: A Profile-Based Approach, 
    by X. Yan, H. Cheng, J. Han, and D. Xin,
    SIGKDD'05 (Proc. of 2005 Int. Conf. on Knowledge Discovery and Data Mining), 2005. Best Student Paper RunnerUp. [pdf]
  5. Substructure Similarity Search in Graph Databases, 
    by X. Yan, P. S. Yu, and J. Han,
    SIGMOD'05 (Proc. of 2005 Int. Conf. on Management of Data), 2005. [pdf]
    Among top-ranked papers in SIGMOD'05, Invited to  ACM Transactions on Database Systems (ACM-TODS).
  6. Graph Indexing: A Frequent Structure-based Approach, 
    by X. Yan, P. S. Yu, and J. Han,
    SIGMOD'04 (Proc. of 2004 Int. Conf. on Management of Data), 2004. [pdf][dataset]
    Among top-ranked papers in SIGMOD'04, Invited to  ACM Transactions on Database Systems (ACM-TODS).
    Google Scholar ranks gIndex as #1 for "graph indexing", with 241 citations. (as of Jun 05, 2009)
  7. CloseGraph: Mining Closed Frequent Graph Patterns, 
    by X. Yan and J. Han,
    SIGKDD'03 (Proc. of 2003 Int. Conf. Knowledge Discovery and Data Mining), 2003. [pdf]
    Google Scholar ranks CloseGraph as #3 for "graph pattern mining", with 389 citations. (as of Jun 21, 2011)
  8. gSpan: Graph-Based Substructure Pattern Mining,
    by X. Yan and J. Han,
    ICDM'02 (Proc. of 2002 Int. Conf. on Data Mining) (short paper), 2002.  [pdf][demo][download]
    Expanded Version, UIUC Technical Report, UIUCDCS-R-2002-2296 [pdf]
    Google Scholar ranks gSpan as #1 for "graph pattern mining", with 842 citations. (as of Jun 21, 2011)