Spiros Papadimitriou
Research Subjects
Spiros Papadimitriou has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Christos Faloutsos
Carnegie Mellon University
3 shared publications - Jimeng Sun
Carnegie Mellon University
3 shared publications - Philip S. Yu
University of Illinois Chicago
3 shared publications - Christos Faloutsos
Carnegie Mellon University
1 shared publication - Cui Zhu
Faculty of Information Technology, Beijing University of Technology, Beijing, 100020, China
1 shared publication - Dimitris Papadias
Hong Kong University of Science and Technology
1 shared publication
Latest Publications
- 13 August 2010
- Published by Springer Nature
- p. 211-236
Proximity Tracking on Dynamic Bipartite Graphs: Problem Definitions and Fast Solutions
- 13 August 2010
- Published by Springer Nature
- p. 211-236
Proximity Tracking on Dynamic Bipartite Graphs: Problem Definitions and Fast Solutions
- 13 August 2010
- Published by Springer Nature
- p. 73-104
Community Evolution and Change Point Detection in Time-Evolving Graphs
- 13 August 2010
- Published by Springer Nature
- p. 73-104
Community Evolution and Change Point Detection in Time-Evolving Graphs
- 10 August 2010
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 36 (2) , 217-247
Outlier detection by example
- 10 August 2010
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 36 (2) , 217-247
Outlier detection by example
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 1388-1390
Online Failure Forecast for Fault-Tolerant Data Stream Processing
In this paper, we present a new online failure forecast system to achieve predictive failure management for fault-tolerant data stream processing. Different from previous reactive or proactive approaches, predictive failure management employs failure forecast to perform informed and just-in-time preventive actions on abnormal components only. We employ stream-based online learning methods to continuously classify runtime operator state into normal, alert, or failure, based on collected feature streams. We have implemented the online failure forecast system as part of the IBM system S stream processing system. Our experiments show that the on-line failure forecast system can achieve good prediction accuracy for a range of stream processing software failures, while imposing low overhead to the stream system.
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 1388-1390
Online Failure Forecast for Fault-Tolerant Data Stream Processing
In this paper, we present a new online failure forecast system to achieve predictive failure management for fault-tolerant data stream processing. Different from previous reactive or proactive approaches, predictive failure management employs failure forecast to perform informed and just-in-time preventive actions on abnormal components only. We employ stream-based online learning methods to continuously classify runtime operator state into normal, alert, or failure, based on collected feature streams. We have implemented the online failure forecast system as part of the IBM system S stream processing system. Our experiments show that the on-line failure forecast system can achieve good prediction accuracy for a range of stream processing software failures, while imposing low overhead to the stream system.
- 12 April 2007
- Published by Springer Nature in The VLDB Journal
- Vol. 17 (4) , 923-945
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
- 12 April 2007
- Published by Springer Nature in The VLDB Journal
- Vol. 17 (4) , 923-945
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
- 3 April 2007
- Published by Springer Nature
- p. 261-288
Dimensionality Reduction and Forecasting on Streams
- 3 April 2007
- Published by Springer Nature
- p. 261-288
Dimensionality Reduction and Forecasting on Streams
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 686-695
Hiding in the Crowd: Privacy Preservation on Evolving Streams through Correlation Tracking
We address the problem of preserving privacy in streams, which has received surprisingly limited attention. For static data, a well-studied and widely used approach is based on random perturbation of the data values. However, streams pose additional challenges. First, analysis of the data has to be performed incrementally, using limited processing time and buffer space, making batch approaches unsuitable. Second, the characteristics of streams evolve over time. Consequently, approaches based on global analysis of the data are not adequate. We show that it is possible to efficiently and effectively track the correlation and autocorrelation structure of multivariate streams and leverage it to add noise which maximally preserves privacy, in the sense that it is very hard to remove. Our techniques achieve much better results than previous static, global approaches, while requiring limited processing time and memory. We provide both a mathematical analysis and experimental evaluation on real data to validate the correctness, efficiency, and effectiveness of our algorithms.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 686-695
Hiding in the Crowd: Privacy Preservation on Evolving Streams through Correlation Tracking
We address the problem of preserving privacy in streams, which has received surprisingly limited attention. For static data, a well-studied and widely used approach is based on random perturbation of the data values. However, streams pose additional challenges. First, analysis of the data has to be performed incrementally, using limited processing time and buffer space, making batch approaches unsuitable. Second, the characteristics of streams evolve over time. Consequently, approaches based on global analysis of the data are not adequate. We show that it is possible to efficiently and effectively track the correlation and autocorrelation structure of multivariate streams and leverage it to add noise which maximally preserves privacy, in the sense that it is very hard to remove. Our techniques achieve much better results than previous static, global approaches, while requiring limited processing time and memory. We provide both a mathematical analysis and experimental evaluation on real data to validate the correctness, efficiency, and effectiveness of our algorithms.