Travelled to:1 × France
2 × Australia
2 × China
2 × USA
Collaborated with:C.Faloutsos Y.Lim K.Shin L.Sael J.Choi J.Jung H.Park F.Silvestri R.Pagh E.E.Papalexakis A.Harpale C.E.Tsourakakis G.L.Miller D.Kang W.Lim L.Akoglu D.H.Chau D.Koutra H.Tong J.Sun C.Lin R.L.F.Cordeiro C.T.Jr. A.J.M.Traina J.López
Talks about:graph (6) larg (4) triangl (3) algorithm (2) tensor (2) stream (2) effici (2) reduc (2) manag (2) count (2)
Person: U. Kang
DBLP: Kang:U=
Contributed to:
2015
2015
20142012201220112009Wrote 11 papers:
- KDD-2015-LimK #graph #named
- MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams (YL, UK), pp. 685–694.
- SIGMOD-2015-ShinJSK #approach #graph #named #random #scalability
- BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs (KS, JJ, LS, UK), pp. 1571–1585.
- CIKM-2014-KangLSSK #coordination #distributed #probability
- Data/Feature Distributed Stochastic Coordinate Descent for Logistic Regression (DK, WL, KS, LS, UK), pp. 1269–1278.
- CIKM-2014-LimCK #data type #performance
- Fast, Accurate, and Space-efficient Tracking of Time-weighted Frequent Items from Data Streams (YL, JC, UK), pp. 1109–1118.
- CIKM-2014-ParkSKP #pipes and filters
- MapReduce Triangle Enumeration With Guarantees (HMP, FS, UK, RP), pp. 1739–1748.
- KDD-2012-KangPHF #algorithm #analysis #named #scalability
- GigaTensor: scaling tensor analysis up by 100 times — algorithms and discoveries (UK, EEP, AH, CF), pp. 316–324.
- SIGMOD-2012-AkogluCKKF #graph #mining #named #scalability #visualisation
- OPAvion: mining and visualization in large graphs (LA, DHC, UK, DK, CF), pp. 717–720.
- SIGMOD-2012-FaloutsosK #algorithm #graph #mining #scalability
- Managing and mining large graphs: patterns and algorithms (CF, UK), pp. 585–588.
- KDD-2011-CordeiroTTLKF #clustering #dataset #multi #pipes and filters #scalability
- Clustering very large multi-dimensional datasets with MapReduce (RLFC, CTJ, AJMT, JL, UK, CF), pp. 690–698.
- KDD-2011-KangTSLF #graph #named #scalability
- GBASE: a scalable and general graph management system (UK, HT, JS, CYL, CF), pp. 1091–1099.
- KDD-2009-TsourakakisKMF #graph #named
- DOULION: counting triangles in massive graphs with a coin (CET, UK, GLM, CF), pp. 837–846.