in
the Artificial Intelligence Lab (CSAIL)
e-mail: dannyf@csail.mit.edu
Current research
· Google your
life: activity learning from GPS and sensor networks of smartphones and robots.
· Design and
implementation of streaming algorithm in cloud/GPU systems.
· I am especially
excited about reducing the gap between theoretical and practical algorithms,
using my experience in the industry and academy.
Big Data, Machine
Learning, Robots, Sensor networks, Streaming, Distributed cloud computing,
Optimization algorithms, Compressed sensing, Private data analysis.
Main technique
Core-sets/Sketches: Semantic
compression of data sets into small sets that provably approximate the original
data for a given problem. Using merge-reduce (e.g. Hadoop)
the small sets can then be used for solving hard machine learning problems in
parallel (on the cloud/network) and on Big streaming data.
Publications and Papers
|
·
Big Data for Robots:
Online HMM Coresets for Sensor Streams, ·
K-Robots Clustering of
Moving Sensors using Coresets, with Stephanie Gil, Ross Knepper,
Brian J. Julian, and Daniela Rus. ·
My Long and Winding Road:
From Big (GPS) Data to a Searchable Diary, ·
Learning Big (Image) Data via Coresets
for Dictionaries, with Micha Feigin, and Nir Sochen. The International Biomedical and Astronomical Signal Processing
(BASP) Frontiers workshop, 2013, to appear ·
The Single Pixel GIS:
·
Turning Big Data into Tiny
Data: ·
Trajectory Clustering for Motion Prediction, ·
Communication Coverage for Independently Moving
Robots, ·
An Effective Coreset
Compression Algorithm for Large Scale Sensor Networks, ·
Data Reduction for Weighted
and Outlier-resistant Clustering ·
Scalable Training of Mixture Models via Coresets, · A Unified Framework for
Approximating and Clustering Data, with Michael Langberg. Proc. 43st Annu. ACM Symposium on Theory of Computing (STOC 2011) [Fuller Version] · From High Definition Image
to Low Space Optimization, with Micha Feigin and Nir Sochen. Scale Space and Variational Methods in Computer Vision (SSVM) 2011 · Coresets and
Sketches for High Dimensional Subspace Approximation Problems, with Morteza Monemizadeh, Christian Sohler and
David Woodruf, Proc. 21th
Annu. ACM Symp. on
Discrete Algorithms (SODA) 2010 with Amos Fiat, Haim Kaplan and Kobbi Nissim. Proc. 41st
Annu. ACM Symposium on Theory of Computing (STOC)
2009 [Slides] · A PTAS for k-Means Clustering Based on Weak Coresets, with Morteza Monemizadeh and Christian Sohler, Proc. 23th
Annu. ACM
Symposium on Computational
Geometry (SoCG)
2007 · Bi-criteria Linear-time Approximations
for Generalized k-Mean/Median/Center, with Amos Fiat, Danny Segev and Micha Sharir, Proc. 23th Annu.
ACM Symposium on Computational Geometry (SoCG) 2007 · Coresets for Weighted Facilities and Their Applications, with Amos Fiat and Micha Sharir, Proc. 47th
Annu. IEEE
Symposium on Foundations of Computer Science (FOCS) 2006 [Slides] Thesis
· Coresets and Their Applications, Ph.D Thesis, December 2010 · Algorithms
for Finding the Optimal k-Line Mean, M.Sc Thesis, March 2004 Teaching
·
Algorithms
(2009b) ·
Data Structures (2009b) ·
Approximation Algorithms (2009a) · Data Structures and Algorithms (2009a) ·
Workshop on
Google Gadget (2008b) · Discrete Math (2006a, b) |
|
|