Aristides Gionis
Research Subjects
Research Interests
Aristides Gionis has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Debora Donato
Yahoo! Research
2 shared publications - Francesco Bonchi
Yahoo Labs Barcelona Spain
2 shared publications - Antti Ukkonen
Yahoo! Research
1 shared publication - Arnon Mazza
Division of Computer Science, The Open University, Ra'anana, Israel
1 shared publication - Carlos Castillo
Universitat Pompeu Fabra
1 shared publication - Foto Afrati
National Technical University of Athens
1 shared publication
Latest Publications
- 22 July 2012
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 35 (1) , 1-32
Overlapping correlation clustering
- 22 July 2012
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 35 (1) , 1-32
Overlapping correlation clustering
- Open Access
Social content matching in MapReduce
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for social media. Our goal is to distribute content from information suppliers to information consumers. We seek to maximize the overall relevance of the matched content from suppliers to consumers while regulating the overall activity, e.g., ensuring that no consumer is overwhelmed with data and that all suppliers have chances to deliver their content. We propose two matching algorithms, GreedyMR and StackMR, geared for the MapReduce paradigm. Both algorithms have provable approximation guarantees, and in practice they produce high-quality solutions. While both algorithms scale extremely well, we can show that StackMR requires only a poly-logarithmic number of MapReduce steps, making it an attractive option for applications with very large datasets. We experimentally show the trade-offs between quality and efficiency of our solutions on two large datasets coming from real-world social-media web sites.
Open AccessSocial content matching in MapReduce
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for social media. Our goal is to distribute content from information suppliers to information consumers. We seek to maximize the overall relevance of the matched content from suppliers to consumers while regulating the overall activity, e.g., ensuring that no consumer is overwhelmed with data and that all suppliers have chances to deliver their content. We propose two matching algorithms, GreedyMR and StackMR, geared for the MapReduce paradigm. Both algorithms have provable approximation guarantees, and in practice they produce high-quality solutions. While both algorithms scale extremely well, we can show that StackMR requires only a poly-logarithmic number of MapReduce steps, making it an attractive option for applications with very large datasets. We experimentally show the trade-offs between quality and efficiency of our solutions on two large datasets coming from real-world social-media web sites.
- 21 July 2009
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 19 (2) , 227-244
Taxonomy-driven lumping for sequence mining
- 21 July 2009
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 19 (2) , 227-244
Taxonomy-driven lumping for sequence mining
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 744-753
k-Anonymization Revisited
In this paper we introduce new notions of k-type anonymizations. Those notions achieve similar privacy goals as those aimed by Sweenie and Samarati when proposing the concept of k-anonymization: an adversary who knows the public data of an individual cannot link that individual to less than k records in the anonymized table. Every anonymized table that satisfies k-anonymity complies also with the anonymity constraints dictated by the new notions, but the converse is not necessarily true. Thus, those new notions allow generalized tables that may offer higher utility than k-anonymized tables, while still preserving the required privacy constraints. We discuss and compare the new anonymization concepts, which we call (1,k)-, (k, k)- and global (1, k)-anonymizations, according to several utility measures. We propose a collection of agglomerative algorithms for the problem of finding such anonymizations with high utility, and demonstrate the usefulness of our definitions and our algorithms through extensive experimental evaluation on real and synthetic datasets.
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 744-753
k-Anonymization Revisited
In this paper we introduce new notions of k-type anonymizations. Those notions achieve similar privacy goals as those aimed by Sweenie and Samarati when proposing the concept of k-anonymization: an adversary who knows the public data of an individual cannot link that individual to less than k records in the anonymized table. Every anonymized table that satisfies k-anonymity complies also with the anonymity constraints dictated by the new notions, but the converse is not necessarily true. Thus, those new notions allow generalized tables that may offer higher utility than k-anonymized tables, while still preserving the required privacy constraints. We discuss and compare the new anonymization concepts, which we call (1,k)-, (k, k)- and global (1, k)-anonymizations, according to several utility measures. We propose a collection of agglomerative algorithms for the problem of finding such anonymizations with high utility, and demonstrate the usefulness of our definitions and our algorithms through extensive experimental evaluation on real and synthetic datasets.