BibSLEIGH — Hanghang

Travelled to:

1 × Australia
1 × France
1 × Ireland
1 × Korea
1 × South Korea
3 × China
8 × USA

Collaborated with:

C.Faloutsos T.Eliassi-Rad L.Akoglu B.Gallagher L.Li W.Fan J.Sun X.Zhang P.Ji J.Ni J.Vreeken C.Lin Y.Yao F.Xu J.Lü K.Henderson L.Li X.Su K.Onuma Y.Koren B.A.Prakash N.Cao Y.Lin P.Sondhi C.Zhai H.Qu H.Jamjoom Y.Sakurai Y.Cai Q.He K.Zhang Y.Xiao H.Wang W.Wang M.Faloutsos D.H.Chau U.Kang J.He Z.Wen R.Konuru S.Papadimitriou P.S.Yu J.F.R.Jr. A.J.M.Traina J.Leskovec J.Zhang J.Tang C.Ma Y.Jing J.Li D.Surian N.Liu D.Lo E.Lim G.Yan B.K.Szymanski K.Maruhashi S.Basu D.Koutra

Talks about:

graph (15) mine (11) fast (9) larg (7) network (6) interact (4) visual (3) comprehens (2) viewpoint (2) recommend (2)

Person: Hanghang Tong

DBLP: Tong:Hanghang

Contributed to:

2015

2014

2012

2011

2010

2009

2008

2007

2006

Wrote 29 papers:

CHI-2015-CaoLLT #graph #interactive #mining #multi #named #visual notation: g-Miner: Interactive Visual Group Mining on Multivariate Graphs (NC, YRL, LL, HT), pp. 279–288.
KDD-2015-CaiTFJH #higher-order #mining #named #performance: Facets: Fast Comprehensive Mining of Coevolving High-order Time Series (YC, HT, WF, PJ, QH), pp. 79–88.
KDD-2015-LiT: The Child is Father of the Man: Foresee the Success at the Early Stage (LL, HT), pp. 655–664.
KDD-2015-NiTFZ #clustering #flexibility #multi #robust: Flexible and Robust Multi-Network Clustering (JN, HT, WF, XZ), pp. 835–844.
KDD-2015-ZhangTMTJL #named #network #performance #scalability #similarity: Panther: Fast Top-k Similarity Search on Large Networks (JZ, JT, CM, HT, YJ, JL), pp. 1445–1454.
CIKM-2014-SuTJ #process #recognition #smarttech: Accelerometer-based Activity Recognition on Smartphone (XS, HT, PJ), pp. 2021–2023.
CIKM-2014-YaoTYXZSL #collaboration: Dual-Regularized One-Class Collaborative Filtering (YY, HT, GY, FX, XZ, BKS, JL), pp. 759–768.
CIKM-2014-ZhangXTW0 #clustering #framework #generative #named #platform #wiki: WiiCluster: a Platform for Wikipedia Infobox Generation (KZ, YX, HT, HW, WW), pp. 2033–2035.
KDD-2014-NiTFZ #network #ranking: Inside the atoms: ranking on a network of networks (JN, HT, WF, XZ), pp. 1356–1365.
KDD-2014-YaoTXL #predict: Predicting long-term impact of CQA posts: a comprehensive viewpoint (YY, HT, FX, JL), pp. 1496–1505.
CIKM-2012-AkogluTVF #category theory #detection #performance #reliability: Fast and reliable anomaly detection in categorical data (LA, HT, JV, CF), pp. 415–424.
CIKM-2012-TongPEFF #graph #scalability: Gelling, and melting, large graphs by edge manipulation (HT, BAP, TER, MF, CF), pp. 245–254.
KDD-2012-ChauAVTF #graph #interactive #named #scalability #visualisation: TourViz: interactive visualization of connection pathways in large graphs (DHC, LA, JV, HT, CF), pp. 1516–1519.
KDD-2012-HendersonGETBAKFL #graph #mining #named #scalability: RolX: structural role extraction & mining in large graphs (KH, BG, TER, HT, SB, LA, DK, CF, LL), pp. 1231–1239.
KDD-2012-SondhiSTZ #framework #graph #mining #named: SympGraph: a framework for mining clinical notes through symptom relation graphs (PS, JS, HT, CZ), pp. 1167–1175.
KDD-2011-HendersonGLAETF #graph #mining #recursion #using: It’s who you know: graph mining using recursive structural features (KH, BG, LL, LA, TER, HT, CF), pp. 663–671.
KDD-2011-KangTSLF #graph #named #scalability: GBASE: a scalable and general graph management system (UK, HT, JS, CYL, CF), pp. 1091–1099.
KDD-2011-TongHWKL #graph #optimisation #ranking #scalability: Diversified ranking on large graphs: an optimization viewpoint (HT, JH, ZW, RK, CYL), pp. 1028–1036.
WCRE-2011-SurianLLTLF #collaboration #developer #network #people #recommendation: Recommending People in Developers’ Collaboration Network (DS, NL, DL, HT, EPL, CF), pp. 379–388.
KDD-2010-HendersonEFALMPT #approach #forensics #graph #metric #mining #multi: Metric forensics: a multi-level approach for mining volatile graphs (KH, TER, CF, LA, LL, KM, BAP, HT), pp. 163–172.
CIKM-2009-TongQJF #graph #interactive #named #performance #proximity #query: iPoG: fast interactive proximity querying on graphs (HT, HQ, HJ, CF), pp. 1673–1676.
KDD-2009-OnumaTF #algorithm #named #novel #recommendation: TANGENT: a novel, “Surprise me”, recommendation algorithm (KO, HT, CF), pp. 657–666.
CIKM-2008-TongSEF #mining #performance: Fast mining of complex time-stamped events (HT, YS, TER, CF), pp. 759–768.
KDD-2008-GallagherTEF #classification #network #using: Using ghost edges for classification in sparsely labeled networks (BG, HT, TER, CF), pp. 256–264.
KDD-2008-TongPSYF #graph #mining #named #performance #scalability: Colibri: fast mining of large static and dynamic graphs (HT, SP, JS, PSY, CF), pp. 686–694.
KDD-2007-TongFGE #graph #pattern matching #performance #scalability: Fast best-effort pattern matching in large attributed graphs (HT, CF, BG, TER), pp. 737–746.
KDD-2007-TongFK #graph #mining #performance #proximity: Fast direction-aware proximity for graph mining (HT, CF, YK), pp. 747–756.
KDD-2006-TongF #performance #problem: Center-piece subgraphs: problem definition and fast solutions (HT, CF), pp. 404–413.
VLDB-2006-RodriguesTTFL #graph #interactive #mining #named #scalability #visualisation: GMine: A System for Scalable, Interactive Graph Visualization and Mining (JFRJ, HT, AJMT, CF, JL), pp. 1195–1198.