Compressed counting meets compressed sensing

Journal of Machine Learning Research

Volumn 35, Issue , 2014, Pages 1058-1077

  Li, Ping ^a   Zhang, Cun Hui ^a   Zhang, Tong ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RECOVERY; SIGNAL RECONSTRUCTION;

COMPUTATIONALLY EFFICIENT; DATA STREAM COMPUTATION; ENTROPY ESTIMATION; RANDOM PROJECTIONS; RECOVERY PROCEDURE; RESEARCH TOPICS; SIGNAL RECOVERY; SPARSE SIGNAL RECOVERIES;

COMPRESSED SENSING;

EID: 84939641232     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (33)

1. Emmanuel Candes and Justin Romberg. l1-magic: Reocvery of sparse signals via convex programming. Technical report, Calinfornia Institute of Technology, 2005.
2. Emmanuel Candes, Justin Romberg, and Terence Tao. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory, 52(2):489-509, 2006.
3. John M. Chambers, C. L. Mallows, and B. W. Stuck. A method for simulating stable random variables. Journal of the American Statistical Association, 71(354):340-344, 1976.
4. Scott Shaobing Chen, David L. Donoho, Michael, and A. Saunders. Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 20:33-61, 1998.
5. Graham Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithm, 55(1):58-75, 2005.
6. Daivd L. Donoho and Xiaoming Huo. Uncertainty principles and ideal atomic decomposition. Information Theory, IEEE Transactions on, 40(7):2845-2862, nov. 2001.
7. David L. Donoho. Compressed sensing. IEEE Trans. Inform. Theory, 52(4):1289-1306, 2006.
8. David L. Donoho and Philip B. Stark. Uncertainty principles and signal recovery. SIAM Journal of Applied Mathematics, 49(3):906-931, 1989.
9. David L. Donoho and Jared Tanner. Counting faces of randomly projected polytopes when the projection radically lowers dimension. Journal of the American Mathematical Society, 22(1), jan. 2009.
10. Laura Feinstein, Dan Schnackenberg, Ravindra Balupari, and Darrell Kindred. Statistical approaches to DDoS attack detection and response. In DARPA Information Survivability Conference and Exposition, pages 303-314, 2003.
11. William Feller. An Introduction to Probability Theory and Its Applications (Volume II). John Wiley & Sons, New York, NY, second edition, 1971.
12. A. Gilbert and P. Indyk. Sparse recovery using sparse matrices. Proc. of the IEEE, 98(6):937-947, june 2010.
13. Piotr Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. Journal of ACM, 53(3):307-323, 2006.
14. Ping Li. Very sparse stable random projections for dimension reduction in lα (0 < α ≤ 2) norm. In KDD, San Jose, CA, 2007.
15. Ping Li. Estimators and tail bounds for dimension reduction in lα (0 < α ≤ 2) using stable random projections. In SODA, pages 10-19, San Francisco, CA, 2008.
16. Ping Li. Compressed counting. In SODA, New York, NY, 2009a.
17. Ping Li. Improving compressed counting. In UAI, Montreal, CA, 2009b.
18. Ping Li and Cun-Hui Zhang. A new algorithm for compressed counting with applications in shannon entropy estimation in dynamic data. In COLT, 2011.
19. Ping Li and Cun-Hui Zhang. Entropy estimations using correlated symmetric stable random projections. In NIPS, Lake Tahoe, NV, 2012.
20. Ping Li and Cun-Hui Zhang. Exact sparse recovery with L0 projections. In KDD, pages 302-310, 2013.
21. Ping Li, Cun-Hui Zhang, and Tong Zhang. Sparse recovery with very sparse compressed counting. Technical report, 2013.
22. Tsung-Han Lin and H. T. Kung. Compressive sensing medium access control for wireless lans. In Globecom, 2012.
23. S. G. Mallat and Zhifeng Zhang. Matching pursuits with time-frequency dictionaries. Signal Processing, IEEE Transactions on, 41(12):3397-3415, 1993.
24. S. Muthukrishnan. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1:117-236, 2 2005.
25. Noam Nisan. Pseudorandom generators for space-bounded computations. In Proceedings of the twenty-second annual ACM symposium on Theory of computing, STOC, pages 204-212, 1990.
26. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In Signals, Systems and Computers, 1993. 1993 Conference Record of The Twenty-Seventh Asilomar Conference on, pages 40-44 vol. 1, Nov. 1993.
27. J. A. Tropp. Greed is good: algorithmic results for sparse approximation. Information Theory, IEEE Transactions on, 50(10):2231-2242, oct. 2004.
28. Ewout Van Den Berg and Michael P. Friedlander. Probing the pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput., 31(2):890-912, 2008.
29. Jun. Wang, Haitham Hassanieh, Dina Katabi, and Piotr Indyk. Efficient and reliable low-power backscatter networks. In SIGCOMM, pages 61-72, Helsinki, Finland, 2012a.
30. Meng Wang, Weiyu Xu, Enrique Mallada, and Ao Tang. Sparse recovery with graph constraints: Fundamental limits and measurement construction. In Infomcom, 2012b.
31. Tong Zhang. Sparse recovery with orthogonal matching pursuit under rip. Information Theory, IEEE Transactions on, 57(9):6215-6221, sept. 2011.
32. Haiquan (Chuck) Zhao, Ashwin Lall, Mitsunori Ogihara, Oliver Spatscheck, Jia Wang, and Jun. Xu. A data streaming algorithm for estimating entropies of od flows. In IMC, San Diego, CA, 2007.
33. Vladimir M. Zolotarev. One-dimensional Stable Distributions. American Mathematical Society, Providence, RI, 1986.