BibSLEIGH — Xifeng

Travelled to:

1 × Australia
1 × Austria
1 × Canada
1 × France
1 × Greece
1 × Norway
1 × Portugal
1 × South Korea
16 × USA
2 × China

Collaborated with:

J.Han P.S.Yu H.Cheng H.Sun A.Khan S.Yang S.Tao Y.Wu Y.Sun Z.Guan D.Xin N.Anerousis T.Cheng K.C.Chang C.Chen Y.Chen F.Zhu M.Srivatsa Y.Li L.M.Kaplan N.Li C.X.Lin Q.Shao B.Zong D.Lo A.K.Singh T.Wu J.Wu F.Han A.Morales K.Wu X.J.Zhou W.Fan G.Miao L.E.Moser A.Zand G.Vigna C.Krügel C.C.Aggarwal Z.Wen A.Iyengar W.Dong L.Shi C.Zhou Q.Zhang Y.Zhou X.Wang C.Liu L.Fei S.P.Midkiff C.Wang D.Roth A.J.Elmore S.Das A.Pucher D.Agrawal A.E.Abbadi P.Kamousi S.Suri B.Norick X.Yu S.Chakraborty Q.Qu M.Fredrikson M.Christodorescu D.Zhang X.Gu Y.Su S.Kase M.Vanni S.Tan J.Song H.Çam Y.Xie J.Sun W.Wang C.Wang Y.Zhu B.Shi J.Pei K.Zhang J.Gao O.Verscheure

Talks about:

graph (23) mine (18) pattern (13) search (12) network (9) larg (8) base (7) structur (6) approach (5) inform (5)

Person: Xifeng Yan

DBLP: Yan:Xifeng

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

Wrote 47 papers:

KDD-2015-SuYSSKVY #feedback #graph: Exploiting Relevance Feedback in Knowledge Graph Search (YS, SY, HS, MS, SK, MV, XY), pp. 1135–1144.
KDD-2014-SunSTLKTY #behaviour #collaboration #network: Analyzing expert behaviors in collaborative networks (HS, MS, ST, YL, LMK, ST, XY), pp. 1486–1495.
KDD-2014-ZhuSY #analysis #mining #network #social: Network mining and analysis for social applications (FZ, HS, XY), p. 1974.
KDD-2014-ZongWSSCHY #mining #scalability #towards: Towards scalable critical alert mining (BZ, YW, JS, AKS, HÇ, JH, XY), pp. 1057–1066.
SAC-2014-ZandVYK #detection: Extracting probable command and control signatures for detecting botnets (AZ, GV, XY, CK), pp. 1657–1662.
SIGMOD-2014-YangXWWSWY #graph #named #query: SLQ: a user-friendly graph querying system (SY, YX, YW, TW, HS, JW, XY), pp. 893–896.
VLDB-2014-YangWSY #graph #query: Schemaless and Structureless Graph Querying (SY, YW, HS, XY), pp. 565–576.
KDD-2013-LiWHHRY #ambiguity #mining: Mining evidences for named entity disambiguation (YL, CW, FH, JH, DR, XY), pp. 1070–1078.
KDD-2013-SunMY #overview: Synthetic review spamming and defense (HS, AM, XY), pp. 1088–1096.
SIGMOD-2013-ElmoreDPAAY #behaviour #multitenancy: Characterizing tenant behavior for placement and crisis mitigation in multitenant DBMSs (AJE, SD, AP, DA, AEA, XY), pp. 517–528.
VLDB-2013-KhanWAY #graph #named #performance #similarity: NeMa: Fast Graph Search with Label Similarity (AK, YW, CCA, XY), pp. 181–192.
VLDB-2013-LiKHYYS #clustering #memory management #performance #string: Memory Efficient Minimum Substring Partitioning (YL, PK, FH, SY, XY, SS), pp. 169–180.
VLDB-2013-WuYSIY #graph #keyword #query: Summarizing Answer Graphs Induced by Keyword Queries (YW, SY, MS, AI, XY), pp. 1774–1785.
CIKM-2012-DongFSZY #framework #mining: A general framework to encode heterogeneous information sources for contextual pattern mining (WD, WF, LS, CZ, XY), pp. 65–74.
CIKM-2012-LiYWK #graph #proximity #scalability: Density index and proximity search in large graphs (NL, XY, ZW, AK), pp. 235–244.
KDD-2012-MiaoGMYTAS #analysis #documentation: Latent association analysis of document pairs (GM, ZG, LEM, XY, ST, NA, JS), pp. 1415–1423.
KDD-2012-SunNHYYY #clustering #network: Integrating meta-path selection with user-guided object clustering in heterogeneous information networks (YS, BN, JH, XY, PSY, XY), pp. 1348–1356.
SIGMOD-2012-YangYZK #effectiveness #graph #scalability #towards: Towards effective partition management for large graphs (SY, XY, BZ, AK), pp. 517–528.
VLDB-2012-GuanYK #correlation #graph: Measuring Two-Event Structural Correlations on Graphs (ZG, XY, LMK), pp. 1400–1411.
VLDB-2012-SunHYY #analysis #approach #mining #network: Mining Knowledge from Interconnected Data: A Heterogeneous Information Network Analysis Approach (YS, JH, XY, PSY), pp. 2022–2023.
SIGMOD-2011-GuanWZSY #correlation #graph #ranking: Assessing and ranking structural correlations in graphs (ZG, JW, QZ, AKS, XY), pp. 937–948.
SIGMOD-2011-KhanLYGCT #graph #network #performance #scalability: Neighborhood based fast graph search in large networks (AK, NL, XY, ZG, SC, ST), pp. 901–912.
VLDB-2011-SunHYYW #named #network #similarity: PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks (YS, JH, XY, PSY, TW), pp. 992–1003.
VLDB-2011-ZhuQLYHY #mining #network #scalability: Mining Top-K Large Structural Patterns in a Massive Network (FZ, QQ, DL, XY, JH, PSY), pp. 807–818.
KDD-2010-MiaoMYTCA #generative #modelling #network: Generative models for ticket resolution in expert networks (GM, LEM, XY, ST, YC, NA), pp. 733–742.
SIGMOD-2010-HanSYY #analysis #approach #database #mining #network: Mining knowledge from databases: an information network analysis approach (JH, YS, XY, PSY), pp. 1251–1252.
SIGMOD-2010-KhanYW #graph #mining #proximity #scalability #towards: Towards proximity pattern mining in large graphs (AK, XY, KLW), pp. 867–878.
ISSTA-2009-ChengLZWY #debugging #graph #identification #mining #using: Identifying bug signatures using discriminative graph mining (HC, DL, YZ, XW, XY), pp. 141–152.
VLDB-2009-ChenLFCYH #graph #mining #random #summary: Mining Graph Patterns Efficiently via Randomized Summaries (CC, CXL, MF, MC, XY, JH), pp. 742–753.
CIKM-2008-ChenLYH #approach #effectiveness #graph #on the: On effective presentation of graph patterns: a structural representative approach (CC, CXL, XY, JH), pp. 299–308.
KDD-2008-FanZCGYHYV #mining #modelling: Direct mining of discriminative and essential frequent patterns via model-based search tree (WF, KZ, HC, JG, XY, JH, PSY, OV), pp. 230–238.
KDD-2008-ShaoCTYA #mining #performance #sequence: Efficient ticket routing by resolution sequence mining (QS, YC, ST, XY, NA), pp. 605–613.
SIGMOD-2008-YanCHY #graph #mining: Mining significant graph patterns by leap search (XY, HC, JH, PSY), pp. 433–444.
VLDB-2008-ShaoCTYA #enterprise #named #problem #recommendation: EasyTicket: a ticket routing recommendation engine for enterprise problem resolution (QS, YC, ST, XY, NA), pp. 1436–1439.
SIGMOD-2007-ChengYC #prototype #scalability: Supporting entity search: a large-scale prototype search engine (TC, XY, KCCC), pp. 1144–1146.
VLDB-2007-ChenYYHZG #graph #towards: Towards Graph Containment Search and Indexing (CC, XY, PSY, JH, DQZ, XG), pp. 926–937.
VLDB-2007-ChengYC #named: EntityRank: Searching Entities Directly and Holistically (TC, XY, KCCC), pp. 387–398.
KDD-2006-XinCYH: Extracting redundancy-aware top-k patterns (DX, HC, XY, JH), pp. 444–453.
ESEC-FSE-2005-LiuYFHM #debugging #locality #modelling #named #statistics: SOBER: statistical model-based bug localization (CL, XY, LF, JH, SPM), pp. 286–295.
KDD-2005-YanCHX #approach: Summarizing itemset patterns: a profile-based approach (XY, HC, JH, DX), pp. 314–323.
KDD-2005-YanZH #constraints #graph #mining #relational: Mining closed relational graphs with connectivity constraints (XY, XJZ, JH), pp. 324–333.
SIGMOD-2005-WangWZSPYH #database #graph #named #scalability: GraphMiner: a structural pattern-mining system for large disk-based graph databases and its applications (WW, CW, YZ, BS, JP, XY, JH), pp. 879–881.
SIGMOD-2005-YanYH #database #graph #similarity: Substructure Similarity Search in Graph Databases (XY, PSY, JH), pp. 766–777.
VLDB-2005-XinHYC #mining #set: Mining Compressed Frequent-Pattern Sets (DX, JH, XY, HC), pp. 709–720.
KDD-2004-ChengYH #database #incremental #mining #named #scalability: IncSpan: incremental mining of sequential patterns in large database (HC, XY, JH), pp. 527–532.
SIGMOD-2004-YanYH #approach #graph: Graph Indexing: A Frequent Structure-based Approach (XY, PSY, JH), pp. 335–346.
KDD-2003-YanH #graph #mining #named: CloseGraph: mining closed frequent graph patterns (XY, JH), pp. 286–295.