BibSLEIGH — Aristides

Travelled to:

1 × Australia
1 × Canada
1 × Chile
1 × France
1 × Switzerland
1 × The Netherlands
13 × USA
2 × United Kingdom
3 × China

Collaborated with:

F.Bonchi C.Castillo H.Mannila D.Donato C.E.Tsourakakis A.Ukkonen M.Sozio P.Boldi G.D.F.Morales R.Motwani F.Junqueira O.Kostakis M.Potamias P.Tsaparas A.Anagnostopoulos I.Weber F.Gullo L.Becchetti R.A.Baeza-Yates V.Plachouras V.Murdock F.Silvestri H.Su J.Rousu A.M.Frieze I.Mele T.Lappas E.Terzi M.Papagelis I.K.Paparrizos B.B.Cambazoglu B.Poblete F.N.Afrati T.Kujala P.Indyk P.Rozenshtein N.Tatti M.Das K.Kutzkov A.Bifet T.Tassa I.Bordino G.Kollios T.Mielikäinen K.Puolamäki A.Hinneburg S.Papadimitriou M.Bawa H.Garcia-Molina M.A.Tsiarli V.Leroy M.Serafini M.Mathioudakis S.Leonardi L.Telloli M.N.Garofalakis R.Rastogi S.Seshadri K.Shim S.Vigna

Talks about:

graph (8) network (6) search (6) queri (4) web (4) algorithm (3) learn (3) larg (3) recommend (2) communiti (2)

Person: Aristides Gionis

DBLP: Gionis:Aristides

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2000

1999

Wrote 38 papers:

KDD-2015-GionisT #tutorial: Dense Subgraph Discovery: KDD 2015 tutorial (AG, CET), pp. 2313–2314.
SIGIR-2015-KostakisG #sequence: Subsequence Search in Event-Interval Sequences (OK, AG), pp. 851–854.
ICML-c2-2014-SuGR #network #predict: Structured Prediction of Network Response (HS, AG, JR), pp. 442–450.
KDD-2014-RozenshteinAGT #detection #network #process: Event detection in activity networks (PR, AA, AG, NT), pp. 1176–1185.
KDD-2013-DasMGW #learning: Learning to question: leveraging user preferences for shopping advice (MD, GDFM, AG, IW), pp. 203–211.
KDD-2013-FriezeGT #algorithm #graph #mining #modelling #scalability: Algorithmic techniques for modeling and mining large graphs (AMAzING) (AMF, AG, CET), p. 1523.
KDD-2013-KutzkovBBG #learning #named: STRIP: stream learning of influence probabilities (KK, AB, FB, AG), pp. 275–283.
KDD-2013-TsourakakisBGGT #clique #quality: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees (CET, FB, AG, FG, MAT), pp. 104–112.
VLDB-2013-GionisJLSW #network #social: Piggybacking on Social Networks (AG, FJ, VL, MS, IW), pp. 409–420.
CIKM-2012-MeleBG #graph #recommendation: The early-adopter graph and its application to web-page recommendation (IM, FB, AG), pp. 1682–1686.
KDD-2012-BonchiGGU #clustering #correlation: Chromatic correlation clustering (FB, AG, FG, AU), pp. 1321–1329.
KDD-2012-GionisLT #set: Estimating entity importance via counting set covers (AG, TL, ET), pp. 687–695.
VLDB-2012-BoldiBGT #graph #injection #nondeterminism #obfuscation: Injecting Uncertainty in Graphs for Identity Obfuscation (PB, FB, AG, TT), pp. 1376–1387.
CIKM-2011-PapagelisBG: Suggesting ghost edges for a smaller world (MP, FB, AG), pp. 2305–2308.
KDD-2011-MathioudakisBCGU #network: Sparsification of influence networks (MM, FB, CC, AG, AU), pp. 529–537.
RecSys-2011-PaparrizosCG #recommendation: Machine learned job recommendation (IKP, BBC, AG), pp. 325–328.
VLDB-2011-MoralesGS #pipes and filters #social: Social Content Matching in MapReduce (GDFM, AG, MS), pp. 460–469.
CIKM-2010-AnagnostopoulosBCGL #community #scalability: Power in unity: forming teams in large-scale community systems (AA, LB, CC, AG, SL), pp. 599–608.
KDD-2010-SozioG #how #problem: The community-search problem and how to plan a successful cocktail party (MS, AG), pp. 939–948.
SIGIR-2010-BordinoCDG #graph #query #similarity: Query similarity by projecting the query-flow graph (IB, CC, DD, AG), pp. 515–522.
VLDB-2010-PotamiasBGK #graph #nearest neighbour #nondeterminism: k-Nearest Neighbors in Uncertain Graphs (MP, FB, AG, GK), pp. 997–1008.
CIKM-2009-Baeza-YatesGJPT #multi #on the #web: On the feasibility of multi-site web search engines (RABY, AG, FJ, VP, LT), pp. 425–434.
CIKM-2009-PotamiasBCG #distance #estimation #network #performance #scalability: Fast shortest path distance estimation in large networks (MP, FB, CC, AG), pp. 867–876.
CIKM-2008-BoldiBCDGV #graph: The query-flow graph: model and applications (PB, FB, CC, DD, AG, SV), pp. 609–618.
CIKM-2008-PobleteCG #graph: Dr. Searcher and Mr. Browser: a unified hyperlink-click graph (BP, CC, AG), pp. 1123–1132.
CIKM-2008-UkkonenCDG #information management #wiki: Searching the wikipedia with contextual information (AU, CC, DD, AG), pp. 1351–1352.
KDD-2008-BecchettiBCG #algorithm #graph #performance: Efficient semi-streaming algorithms for local triangle counting in massive graphs (LB, PB, CC, AG), pp. 16–24.
KDD-2008-BonchiCDG #composition #query #topic: Topical query decomposition (FB, CC, DD, AG), pp. 52–60.
SIGIR-2007-Baeza-YatesGJMPS: The impact of caching on search engines (RABY, AG, FJ, VM, VP, FS), pp. 183–190.
SIGIR-2007-CastilloDGMS #detection #using #web: Know your neighbors: web spam detection using the web topology (CC, DD, AG, VM, FS), pp. 423–430.
KDD-2006-GionisMMT #data mining #mining: Assessing data mining results via swap randomization (AG, HM, TM, PT), pp. 167–176.
KDD-2006-GionisMPU #algorithm #order: Algorithms for discovering bucket orders from data (AG, HM, KP, AU), pp. 561–566.
KDD-2005-GionisHPT #clustering: Dimension induced clustering (AG, AH, SP, PT), pp. 51–60.
KDD-2004-AfratiGM #approximate #set: Approximating a collection of frequent sets (FNA, AG, HM), pp. 12–19.
SIGMOD-2004-BawaGGM #network: The Price of Validity in Dynamic Networks (MB, AG, HGM, RM), pp. 515–526.
KDD-2003-GionisKM #order: Fragments of order (AG, TK, HM), pp. 129–136.
SIGMOD-2000-GarofalakisGRSS #documentation #named #xml: XTRACT: A System for Extracting Document Type Descriptors from XML Documents (MNG, AG, RR, SS, KS), pp. 165–176.
VLDB-1999-GionisIM #similarity: Similarity Search in High Dimensions via Hashing (AG, PI, RM), pp. 518–529.