BibSLEIGH — Ruoming

Travelled to:

1 × China
1 × France
1 × Greece
1 × United Kingdom
2 × Canada
9 × USA

Collaborated with:

Y.Xiang N.Ruan G.Agrawal L.Liu H.Wang J.X.Yu V.E.Lee Y.Wu X.Zhang C.C.Aggarwal H.Hong G.Wang Y.Shen D.Fuhry Y.Huang F.Bastani B.Ding J.Gao J.Zhou T.Wang K.Sinha J.Li X.S.Wang H.Wei C.Lu S.Dey Y.Li P.S.Yu M.Abu-Ata F.F.Dragan C.Tian Z.Liu J.Han Z.Wang X.Du L.Ding J.H.T.Jr. C.Wang D.Polshakov S.Parthasarathy X.Jiang D.Yang Q.Zhao Y.Tian Q.He N.Oliver W.Lee J.Cui H.Liu J.Yan L.Ji J.He Y.Gu Z.Chen X.Du

Talks about:

graph (10) reachabl (7) larg (6) approach (5) queri (5) comput (4) pattern (3) distanc (3) social (3) search (3)

Person: Ruoming Jin

DBLP: Jin:Ruoming

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2005

2003

Wrote 28 papers:

VLDB-2015-WuJLZ #community #detection #robust: Robust Local Community Detection: On Free Rider Effect and Its Elimination (YW, RJ, JL, XZ), pp. 798–809.
SIGMOD-2014-WuJZ #graph #nearest neighbour #performance #query #random #scalability: Fast and unified local search for random walk based k-nearest-neighbor query in large graphs (YW, RJ, XZ), pp. 1139–1150.
VLDB-2014-HuangBJW #network #realtime #scalability: Large Scale Real-time Ridesharing with Service Guarantee on Road Networks (YH, FB, RJ, XSW), pp. 2017–2028.
VLDB-2014-WeiYLJ #approach #independence #permutation #query #reachability: Reachability Querying: An Independent Permutation Labeling Approach (HW, JXY, CL, RJ), pp. 1191–1202.
SIGMOD-2013-TianHLBJ #named: Noah: a dynamic ridesharing system (CT, YH, ZL, FB, RJ), pp. 985–988.
VLDB-2013-JinW #performance #reachability #scalability: Simple, Fast, and Scalable Reachability Oracle (RJ, GW), pp. 1978–1989.
KDD-2012-ShenJ #learning #recommendation #social: Learning personal + social latent factor model for social recommendation (YS, RJ), pp. 1303–1311.
SIGMOD-2012-DingWJHW #keyword #optimisation #taxonomy: Optimizing index for taxonomy keyword search (BD, HW, RJ, JH, ZW), pp. 493–504.
SIGMOD-2012-JinRDY #graph #named #reachability #scalability: SCARAB: scaling reachability computation on large graphs (RJ, NR, SD, JXY), pp. 169–180.
SIGMOD-2012-JinRXL #approach #distance #graph #query #scalability: A highway-centric labeling approach for answering distance queries on large sparse graphs (RJ, NR, YX, VEL), pp. 445–456.
VLDB-2012-GaoJZYJW11 #approach #graph #relational #scalability: Relational Approach for Shortest Path Discovery over Large Graphs (JG, RJ, JZ, JXY, XJ, TW), pp. 358–369.
CIKM-2011-CuiLYJJHGCD #framework #multi #random: Multi-view random walk framework for search task discovery from click-through log (JC, HL, JY, LJ, RJ, JH, YG, ZC, XD), pp. 135–140.
KDD-2011-JinLA #graph #nondeterminism #reliability: Discovering highly reliable subgraphs in uncertain graphs (RJ, LL, CCA), pp. 992–1000.
KDD-2011-JinLH #axiom #network #ranking #similarity: Axiomatic ranking of network role similarity (RJ, VEL, HH), pp. 922–930.
SIGMOD-2011-GaoYJZWY #distance #privacy: Neighborhood-privacy protected shortest distance computing in cloud (JG, JXY, RJ, JZ, TW, DY), pp. 409–420.
VLDB-2011-JinLDW #constraints #graph #nondeterminism #reachability: Distance-Constraint Reachability Computation in Uncertain Graphs (RJ, LL, BD, HW), pp. 551–562.
CIKM-2010-ZhaoTHOJL #communication #social: Communication motifs: a tool to characterize social communications (QZ, YT, QH, NO, RJ, WCL), pp. 1645–1648.
SIGMOD-2010-JinHWRX #constraints #database #graph #reachability: Computing label-constraint reachability in graph databases (RJ, HH, HW, NR, YX), pp. 123–134.
VLDB-2010-AggarwalLYJ #graph #mining #on the: On Dense Pattern Mining in Graph Streams (CCA, YL, PSY, RJ), pp. 975–984.
KDD-2009-DuJDLT #approach #migration #mining: Migration motif: a spatial — temporal pattern mining approach for financial markets (XD, RJ, LD, VEL, JHTJ), pp. 1135–1144.
KDD-2009-JinXL #representation #set: Cartesian contour: a concise representation for a collection of frequent sets (RJ, YX, LL), pp. 417–426.
SIGMOD-2009-JinXRF #named #query #reachability: 3-HOP: a high-compression indexing scheme for reachability query (RJ, YX, NR, DF), pp. 813–826.
KDD-2008-JinAXR #effectiveness #performance #summary: Effective and efficient itemset pattern summarization: regression-based approaches (RJ, MAA, YX, NR), pp. 399–407.
KDD-2008-XiangJFD #database #summary #transaction: Succinct summarization of transactional databases: an overlapped hyperrectangle scheme (YX, RJ, DF, FFD), pp. 758–766.
SIGMOD-2008-JinXRW #graph #query #reachability #scalability: Efficiently answering reachability queries on very large directed graphs (RJ, YX, NR, HW), pp. 595–608.
KDD-2005-JinSA #information management #mining #optimisation: Simultaneous optimization of complex mining tasks with a knowledgeable cache (RJ, KS, GA), pp. 600–605.
KDD-2005-JinWPPA #dataset #graph: Discovering frequent topological structures from graph datasets (RJ, CW, DP, SP, GA), pp. 606–611.
KDD-2003-JinA #performance #streaming: Efficient decision tree construction on streaming data (RJ, GA), pp. 571–576.