Aristides Gionis
#145,713
Most Influential Person Now
Aristides Gionis's AcademicInfluence.com Rankings
Aristides Gioniscomputer-science Degrees
Computer Science
#7287
World Rank
#7674
Historical Rank
Data Mining
#172
World Rank
#173
Historical Rank
Machine Learning
#2643
World Rank
#2678
Historical Rank
Database
#4348
World Rank
#4522
Historical Rank

Download Badge
Computer Science
Aristides Gionis's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
- Bachelors Computer Science University of Crete
Similar Degrees You Can Earn
Why Is Aristides Gionis Influential?
(Suggest an Edit or Addition)Aristides Gionis's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Similarity Search in High Dimensions via Hashing (1999) (3638)
- Finding high-quality content in social media (2008) (1352)
- Clustering aggregation (2005) (915)
- Maintaining Stream Statistics over Sliding Windows (2002) (862)
- Finding interesting associations without support pruning (2000) (481)
- The community-search problem and how to plan a successful cocktail party (2010) (418)
- Know your neighbors: web spam detection using the web topology (2007) (394)
- The query-flow graph: model and applications (2008) (346)
- Social Network Analysis and Mining for Business Applications (2011) (318)
- Fast shortest path distance estimation in large networks (2009) (311)
- Online team formation in social networks (2012) (309)
- Automated Ranking of Database Query Results (2003) (307)
- The Discrete Basis Problem (2006) (298)
- Efficient semi-streaming algorithms for local triangle counting in massive graphs (2008) (295)
- Quantifying Controversy on Social Media (2015) (290)
- Correlating financial time series with micro-blogging activity (2012) (289)
- Maintaining stream statistics over sliding windows: (extended abstract) (2002) (277)
- Assessing data mining results via swap randomization (2007) (272)
- XTRACT: a system for extracting document type descriptors from XML documents (2000) (268)
- Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees (2013) (266)
- k-nearest neighbors in uncertain graphs (2010) (254)
- Political Discourse on Social Media: Echo Chambers, Gatekeepers, and the Price of Bipartisanship (2018) (234)
- Evaluating strategies for similarity search on the web (2002) (231)
- The impact of caching on search engines (2007) (217)
- k-means-: A Unified Approach to Clustering and Outlier Detection (2013) (210)
- Scalable Techniques for Clustering the Web (2000) (185)
- Mining Graph Evolution Rules (2009) (182)
- Approximating a collection of frequent sets (2004) (177)
- Sparsification of influence networks (2011) (161)
- Learning and Predicting the Evolution of Social Networks (2010) (156)
- From chatter to headlines: harnessing the real-time web for personalized news recommendation (2012) (151)
- Reducing Controversy by Connecting Opposing Views (2016) (145)
- Machine Learning and Knowledge Discovery in Databases (2015) (138)
- Power in unity: forming teams in large-scale community systems (2010) (135)
- Machine learned job recommendation (2011) (135)
- Opinion Maximization in Social Networks (2013) (126)
- The price of validity in dynamic networks (2004) (121)
- Improving recommendation for long-tail queries via templates (2011) (109)
- Event detection in activity networks (2014) (108)
- Injecting Uncertainty in Graphs for Identity Obfuscation (2012) (107)
- An optimization framework for query recommendation (2010) (96)
- Design trade-offs for search engine caching (2008) (94)
- Customized tour recommendations in urban areas (2014) (94)
- Identity obfuscation in graphs through the information theoretic lens (2011) (89)
- k-Anonymization with Minimal Loss of Information (2009) (86)
- k-Anonymization Revisited (2008) (85)
- Estimating Number of Citations Using Author Reputation (2007) (85)
- Efficient algorithms for large-scale local triangle counting (2010) (83)
- XTRACT: Learning Document Type Descriptors from XML Document Collections (2004) (80)
- Finding recurrent sources in sequences (2003) (76)
- Mining Large Networks with Subgraph Counting (2008) (76)
- Overlapping correlation clustering (2011) (76)
- Query similarity by projecting the query-flow graph (2010) (76)
- DopeLearning: A Computational Approach to Rap Lyrics Generation (2015) (71)
- Geometric and Combinatorial Tiles in 0-1 Data (2004) (63)
- Dimension induced clustering (2005) (61)
- Dense Subgraph Discovery: KDD 2015 tutorial (2015) (61)
- Quantifying Controversy in Social Media (2015) (60)
- k-Concealment: An Alternative Model of k-Type Anonymity (2012) (59)
- Where Is the Soho of Rome? Measures and Algorithms for Finding Similar Neighborhoods in Cities (2015) (59)
- Density-friendly Graph Decomposition (2015) (58)
- Fast Reliability Search in Uncertain Graphs (2014) (57)
- Suggesting ghost edges for a smaller world (2011) (56)
- Overlapping community detection in labeled graphs (2014) (56)
- Algorithms for discovering bucket orders from data (2006) (55)
- What is the Dimension of Your Binary Data? (2006) (54)
- Social Content Matching in MapReduce (2011) (52)
- STRIP: stream learning of influence probabilities (2013) (50)
- Balancing information exposure in social networks (2017) (49)
- Estimating Aggregates on a Peer-to-Peer Network (2003) (47)
- Top-k overlapping densest subgraphs (2016) (46)
- Answers, not links: extracting tips from yahoo! answers to address how-to web queries (2012) (44)
- Spectral ordering and biochronology of European fossil mammals (2006) (44)
- YR-2007-005 FINDING HIGH-QUALITY CONTENT IN SOCIAL MEDIA WITH AN APPLICATION TO COMMUNITY-BASED QUESTION ANSWERING (2007) (43)
- Efficient and tumble similar set retrieval (2001) (42)
- Joint Non-negative Matrix Factorization for Learning Ideological Leaning on Twitter (2017) (42)
- Segmentation and dimensionality reduction (2006) (41)
- Chromatic Correlation Clustering (2015) (41)
- Reconstructing an Epidemic Over Time (2016) (40)
- Discovering Polarized Communities in Signed Networks (2019) (40)
- On the feasibility of multi-site web search engines (2009) (39)
- Searching the wikipedia with contextual information (2008) (39)
- Automated 3D Phenotype Analysis Using Data Mining (2008) (38)
- Distance oracles in edge-labeled graphs (2014) (36)
- The Effect of Collective Attention on Controversial Debates on Social Media (2017) (35)
- Piggybacking on Social Networks (2013) (34)
- Bump Hunting in the Dark: Local Discrepancy Maximization on Graphs (2015) (31)
- Temporal PageRank (2016) (31)
- Topical query decomposition (2008) (30)
- Scalable Techniques for Clustering the Web (Extended Abstract) (2000) (30)
- Optimal segmentation using tree models (2006) (28)
- A Hand-held Optical Surface Scanner for Environmental Modeling and Virtual Reality (1996) (28)
- Fragments of order (2003) (28)
- Automatic controversy detection in social media: A content-independent motif-based approach (2017) (27)
- Finding Dynamic Dense Subgraphs (2017) (27)
- Streaming Similarity Self-Join (2016) (27)
- Clustering Aggregation (long version) (2007) (27)
- Maximizing the Diversity of Exposure in a Social Network (2018) (27)
- Finding events in temporal networks: segmentation meets densest subgraph discovery (2018) (26)
- A randomized approximation algorithm for computing bucket orders (2009) (26)
- Discovering Dynamic Communities in Interaction Networks (2014) (26)
- Mining Temporal Networks (2019) (26)
- The early-adopter graph and its application to web-page recommendation (2012) (26)
- Explainable Classification of Brain Networks via Contrast Subgraphs (2020) (25)
- ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2014, New York, NY, USA - August 24 - 27, 2014 (2014) (24)
- Tell me something my friends do not know: diversity maximization in social networks (2018) (24)
- (So) Big Data and the transformation of the city (2020) (24)
- Query-log mining for detecting spam (2008) (24)
- Dr. Searcher and Mr. Browser: a unified hyperlink-click graph (2008) (23)
- Fully Dynamic Algorithm for Top-k Densest Subgraphs (2016) (23)
- A Motif-Based Approach for Identifying Controversy (2017) (22)
- Mining Frequent Patterns in Evolving Graphs (2018) (22)
- Learning to question: leveraging user preferences for shopping advice (2013) (22)
- k -Anonymization with Minimal Loss of Information (2007) (22)
- Global citation recommendation using knowledge graphs (2018) (22)
- Parameter-free spatial data mining using MDL (2005) (21)
- Efficient and Tunable Similar Set Retrieval (2001) (21)
- Explainable Time Series Tweaking via Irreversible and Reversible Temporal Transformations (2018) (21)
- A Shapley Value Approach for Influence Attribution (2011) (21)
- Models and Algorithms for Network Immunization (2005) (20)
- Where Could We Go?: Recommendations for Groups in Location-Based Social Networks (2017) (20)
- Inferring the Strength of Social Ties: A Community-Driven Approach (2017) (19)
- Proceedings of the sixth ACM international conference on Web search and data mining (2013) (19)
- Discovering recurring activity in temporal networks (2017) (19)
- Unimodal segmentation of sequences (2004) (18)
- A Kernel-Learning Approach to Semi-supervised Clustering with Relative Distance Comparisons (2015) (18)
- Chromatic correlation clustering (2012) (18)
- Active Network Alignment: A Matching-Based Approach (2016) (17)
- Exploring Controversy in Twitter (2015) (16)
- Confidence bands for time series data (2014) (16)
- Activity preserving graph simplification (2013) (16)
- Balancing Opposing Views to Reduce Controversy (2016) (16)
- Absorbing Random-Walk Centrality: Theory and Algorithms (2015) (15)
- Introduction to the Special Issue ACM SIGKDD 2013 (2015) (15)
- Evaluating Query Result Significance in Databases via Randomizations (2010) (14)
- DTD Inference from XML Documents: The XTRACT Approach (2003) (14)
- A combinatorial algorithm for MAX CSP (2003) (14)
- Mining chains of relations (2005) (14)
- Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks (2015) (13)
- Discovering conflicting groups in signed networks (2020) (13)
- Similarity Search on the Web: Evaluation and Scalability Considerations (2001) (13)
- Searching for polarization in signed graphs: a local spectral approach (2020) (12)
- The Ebb and Flow of Controversial Debates on Social Media (2017) (12)
- Locally and globally explainable time series tweaking (2019) (12)
- Mary, Mary, Quite Contrary: Exposing Twitter Users to Contrarian News (2017) (11)
- Algorithms for unimodal segmentation with applications to unimodality detection (2007) (11)
- Automated 3 D phenotype analysis using data mining Plyusnin (11)
- Finding large balanced subgraphs in signed networks (2020) (11)
- Assessing data mining results via swap randomization (2006) (11)
- Semi-supervised Kernel Metric Learning Using Relative Comparisons (2016) (10)
- Estimating entity importance via counting set covers (2012) (10)
- Lagrangian relaxations for multiple network alignment (2017) (10)
- Subsequence Search in Event-Interval Sequences (2015) (10)
- Factors in Recommending Contrarian Content on Social Media (2017) (10)
- Diversity-aware k-median : Clustering with fair center representation (2021) (10)
- Scalable Facility Location for Massive Graphs on Pregel-like Systems (2015) (10)
- Discovering Nested Communities (2013) (10)
- Reconstructing a cascade from temporal observations (2018) (9)
- Finding topical experts in Twitter via query-dependent personalized PageRank (2017) (9)
- Nearest-neighbor Queries in Probabilistic Graphs (2009) (9)
- Robust Cascade Reconstruction by Steiner Tree Sampling (2018) (9)
- Clustered segmentations (2004) (9)
- Exposing Twitter Users to Contrarian News (2017) (8)
- Beyond rankings: comparing directed acyclic graphs (2015) (8)
- Query-log mining for detecting polysemy and spam (2008) (8)
- Computationally Inferred Genealogical Networks Uncover Long-Term Trends in Assortative Mating (2018) (8)
- Searching for interestingness in Wikipedia and Yahoo!: answers (2013) (7)
- Diverse Rule Sets (2020) (7)
- Taxonomy-driven lumping for sequence mining (2009) (7)
- Improved mixing time for k-subgraph sampling (2020) (7)
- On Mining Temporal Patterns in Dynamic Graphs, and Other Unrelated Problems (2017) (6)
- The network-untangling problem: from interactions to activity timelines (2017) (6)
- Backbone discovery in traffic networks (2014) (6)
- Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III (2010) (5)
- A Survey of Graph Mining for Web Applications (2010) (5)
- Community-aware network sparsification (2017) (5)
- Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints (2020) (5)
- The Blind Leading the Blind: Network-Based Location Estimation Under Uncertainty (2015) (5)
- Auctioning Data for Learning (2015) (5)
- Relaxing the strong triadic closure problem for edge strength inference (2020) (5)
- antifying Controversy on Social Media (2018) (5)
- Discovering Topically- and Temporally-Coherent Events in Interaction Networks (2016) (5)
- A Combinatorial Approach to Role Discovery (2016) (5)
- Recurrent Predictive Models for Sequence Segmentation (2007) (4)
- Co-exposure Maximization in Online Social Networks (2020) (4)
- Segmentations with Rearrangements (2007) (4)
- AncestryAI: A Tool for Exploring Computationally Inferred Family Trees (2017) (4)
- Measuring and Summarizing Movement in Microblog Postings (2013) (4)
- Next Generation Search (2010) (4)
- Structured Prediction of Network Response (2014) (3)
- Discovering Interesting Cycles in Directed Graphs (2019) (3)
- Restless reachability problems in temporal graphs. (2020) (3)
- Finding low-tension communities (2017) (3)
- Mining Signed Networks: Theory and Applications: Tutorial proposal for the Web Conference 2020 (2020) (3)
- Discovering the Network Backbone from Traffic Activity Data (2014) (3)
- Restless reachability in temporal graphs (2020) (3)
- Pattern detection in large temporal graphs using algebraic fingerprints (2020) (3)
- Algorithmic techniques for modeling and mining large graphs (AMAzING) (2013) (3)
- Mining Dense Subgraphs with Similar Edges (2020) (3)
- Diverse Dimension Decomposition of an Itemset Space (2011) (3)
- Tell me something my friends do not know: diversity maximization in social networks (2020) (2)
- KnowyourNeighbors: WebSpamDetection usingtheWebTopology (2007) (2)
- From acquaintance to best friend forever: robust and fine-grained inference of social tie strengths (2018) (2)
- Extracting Skill Endorsements from Personal Communication Data (2016) (2)
- Covering the Egonet: A Crowdsourcing Approach to Social Circle Discovery on Twitter (2015) (2)
- International Conference on World Wide Web, Florence, 2015 (2015) (2)
- Finding temporal patterns using algebraic fingerprints (2020) (2)
- European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2014, Nancy, France, September 15-19, 2014 (2014) (2)
- Integrity 2020: Integrity in Social Networks and Media (2020) (2)
- Diverse dimension decomposition for itemset spaces (2012) (2)
- Optimal deletion-robust coreset for submodular maximization (2022) (2)
- Maximizing diversity over clustered data (2020) (2)
- Reconciliation k-median: Clustering with Non-polarized Representatives (2019) (2)
- ExCoDE: a Tool for Discovering and Visualizing Regions of Correlation in Dynamic Networks (2019) (2)
- Query the model: precomputations for efficient inference with Bayesian Networks (2019) (1)
- Ranking with submodular functions on a budget (2022) (1)
- Surface Reflectance Recovery under Point Light Illumination (1996) (1)
- (So) Big Data and the transformation of the city (2020) (1)
- Workload-aware Materialization for Efficient Variable Elimination on Bayesian Networks (2021) (1)
- Diverse dimension decomposition for itemset spaces (2012) (1)
- The network-untangling problem: from interactions to activity timelines (2020) (1)
- Machine Learning and Knowledge Discovery in Databases (2009) (1)
- Social piggybacking: leveraging common friends to generate event streams (2012) (1)
- Mining the graph structures of the web (2007) (1)
- Strengthening ties towards a highly-connected world (2022) (1)
- SIEVE: A Space-Efficient Algorithm for Viterbi Decoding (2022) (1)
- EDBT Research Session: Graph Queries and Analytics (2014) (0)
- Mining Signed Networks: Theory and Applications (2020) (0)
- EDBT Research Session: Graph Queries and Analytics (2014) (0)
- Aristides Gionis Title : Lagrangian relaxations for multiple network alignment Year : 2017 Version : Final published version (2018) (0)
- Relaxing the strong triadic closure problem for edge strength inference (2020) (0)
- Learning Cellular Coverage from Real Network Configurations using GNNs (2023) (0)
- Locally and globally explainable time series tweaking (2019) (0)
- Collaborative Procrastination (2021) (0)
- Backbone discovery in traffic networks (2016) (0)
- ties towards a highly-connected world (2021) (0)
- Ranking with submodular functions on the fly (2023) (0)
- Top-k densest subgraphs in sliding-window graph streams (2016) (0)
- Workload-Aware Materialization of Junction Trees (2021) (0)
- Coresets remembered and items forgotten: submodular maximization with deletions (2022) (0)
- Algorithms for similarity search and clustering in large data sets (2003) (0)
- Provable randomized rounding for minimum-similarity diversification (2022) (0)
- Lagrangian relaxations for multiple network alignment (2017) (0)
- Confidence bands for time series data (2014) (0)
- Beyond rankings: comparing directed acyclic graphs (2015) (0)
- Analyzing the evolving Web (2007) (0)
- Succinct Graph Representations as Distance Oracles: An Experimental Evaluation (2022) (0)
- International Conference on Machine Learning, Beijing, China, June 21 - June 26, 2014 (2014) (0)
- Discovering interesting cycles in graphs (2019) (0)
- Research Fields (2017) (0)
- Special issue for ECML PKDD 2010: Guest editors’ introduction (2010) (0)
- Introduction to the special issue of the ECML PKDD 2020 journal track (2020) (0)
- Top-k overlapping densest subgraphs (2016) (0)
- Maximizing the Diversity of Exposure in a Social Network (2022) (0)
- Aristides Gionis Title : AncestryAI : A tool for exploring computationally inferred family trees Year : 2017 Version : Final (2018) (0)
- Regularized impurity reduction: accurate decision trees with complexity guarantees (2022) (0)
- Session details: SNOW'13 workshop (2013) (0)
- Mining Frequent Pa erns in Evolving Graphs (2018) (0)
- Open World Learning Graph Convolution for Latency Estimation in Routing Networks (2022) (0)
- Strengthening ties towards a highly-connected world (2022) (0)
- Generalized Leverage Scores: Geometric Interpretation and Applications (2022) (0)
- SNOW chairs' welcome (2013) (0)
- Overlapping community detection in labeled graphs (2014) (0)
- A novel method for large scale graph exploration (2014) (0)
- Finding events in temporal networks: segmentation meets densest subgraph discovery (2019) (0)
- Provable randomized rounding for minimum-similarity diversification (2022) (0)
- Preface to the Workshop on Mining Communities and People Recommenders (2011) (0)
- Guest editors’ introduction: special issue of selected papers from ECML PKDD 2010 (2010) (0)
- Evimaria Terzi Title : Active Network Alignment : A Matching-Based Approach Year : 2017 Version : Final published version (2018) (0)
- Query Significance in Databases via Randomizations (2009) (0)
- Diameter Minimization by Shortcutting with Degree Constraints (2022) (0)
- Chapter 11 Mining Chains of Relations (2012) (0)
- Introduction to the special issue of the ECML PKDD 2020 journal track (2020) (0)
- Discovering Dense Correlated Subgraphs in Dynamic Networks (2021) (0)
- Accepted Tutorials at The Web Conference 2022 (2022) (0)
- On the high density of leadership nuclei in endorsement social networks (2010) (0)
- Succinct graph representations as distance oracles (2022) (0)
- 9th International Conference on Weblogs and Social Media, (ICWSM) 2015, University of Oxford, Oxford, UK, May 26-29, 2015 (2015) (0)
- Improved analysis of randomized SVD for top-eigenvector approximation (2022) (0)
- Data Analysis (2013) (0)
- Discovering recurring activity in temporal networks (2017) (0)
- Concise and interpretable multi-label rule sets (2022) (0)
- Activity preserving graph simplification (2013) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Aristides Gionis?
Aristides Gionis is affiliated with the following schools: