Property testing of data dimensionality

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 18-27

  Krauthgamer, Robert ^a,b   Sasson, Ori ^c  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATRIX ALGEBRA; PROBABILITY; VECTORS;

DATA DIMENSIONALITY; LOW DIMENSIONAL STRUCTURE;

DATA REDUCTION;

EID: 0038416696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations. In 33rd Annual ACM Symposium on the Theory of Computing, pages 611-618, July 2001.
2. H. J. Bandelt, V. Chepoi, and M. Laurent. Embedding into rectilinear spaces. Discrete Comput. Geom., 19(4):595-604, 1998.
3. M. Charikar, V. Guruswami, R. Kumar, S. Rajagopalan, and A. Sahai. Combinatorial feature selection problems. In 41st Annual IEEE Symposium on Foundations of Computer Science, pages 631-640, November 2000.
4. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391-407, 1990.
5. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky. Improved testing algorithms for monotonicity. In Randomization, approximation, and combinatorial optimization (RANDOM), pages 97-108, Berlin, 1999. Springer.
6. M. Deza and M. Laurent. Geometry of cuts and metrics. Springer-Verlag, Berlin, 1997.
7. T. K. Dey, J. Giesen, S. Goswami, and W. Zhao. Shape dimension and approximation from samples. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 772-780, 2002.
8. F. Ergün, S. Kannan, S. R. Kumar, R. Rubinfeld, and M. Viswanathan. Spot-checkers. J. Comput. System Sci., 60(3):717-751, 2000.
9. U. Feige. Approximating the bandwidth via volume respecting embeddings. J. Comput. System Sci., 60(3):510-539, 2000.
10. A. Frieze, R. Kannan, and S. Vempala. Fast Monte-Carlo algorithms for finding low rank approximation. In 39th Annual IEEE Symposium on Foundations of Computer Science, pages 370-378, November 1998.
11. E. Fischer. The art of uninformed decisions: A primer to property testing. Bulletin of the European Association for Theoretical Computer Science. EATCS, (75):97-126, 2001.
12. E. Fischer and I. Newman. Testing of matrix properties. In 33rd Annual ACM Symposium on the Theory of Computing, pages 286-295, July 2001.
13. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. J. ACM, 45(4):653-750, 1998.
14. F. Hadlock and F. Hoffman. Manhattan trees. Utilitas Math., 13:55-67, 1978.
15. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In 30th Annual ACM Symposium on Theory of Computing, pages 604-613, May 1999.
16. P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 10-33, October 2001.
17. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, Conn., 1982), pages 189-206. Amer. Math. Soc., Providence, RI, 1984.
18. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 668-677. ACM, 1998.
19. K. Menger. Untersuchungen uber allgemeine metrik. Mathematische Annalen, 100:75-163, 1928.
20. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
21. V. D. Milman and G. Schechtman. Asymptotic theory of finite-dimensional normed spaces. Springer-Verlag, Berlin, 1986.
22. J. G. Oxley. Matroid theory. Oxford Science Publications. The Clarendon Press Oxford University Press, New York, 1992.
23. M. Parnas and D. Ron. Testing metric properties. In 33rd Annual ACM Symposium on the Theory of Computing, pages 576-585, July 2001.
24. D. Ron. Property testing. In P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, editors, Handbook of Randomized Computing. Kluwer Academic, 2001.
25. Y. Rabinovich and R. Raz. Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete Comput. Geom., 19(1):79-94, 1998.
26. R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM J. Comput., 25(2):252-271, 1996.