메뉴 건너뛰기




Volumn , Issue , 2008, Pages 10-19

Estimators and tail bounds for dimension reduction in l α (0 < α ≤ 2) using stable random projections

Author keywords

[No Author keywords available]

Indexed keywords

CAUCHY DENSITY; DATASTREAM (CO); DIMENSION REDUCTION (DR); MACHINE-LEARNING; RANDOM PROJECTIONS; SAMPLE SIZES;

EID: 51849147253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (61)

References (44)
  • 1
    • 0038166193 scopus 로고    scopus 로고
    • Database-friendly random projections: Johnson-Lindenstrauss with binary coins
    • Diinitris Achlioptas. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4):671-687, 2003.
    • (2003) Journal of Computer and System Sciences , vol.66 , Issue.4 , pp. 671-687
    • Achlioptas, D.1
  • 2
    • 33748109164 scopus 로고    scopus 로고
    • Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
    • Nir Ailon and Bernard Chazelle. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. In STOC, pages 557-563, 2006.
    • (2006) STOC , pp. 557-563
    • Ailon, N.1    Chazelle, B.2
  • 3
    • 33745467619 scopus 로고    scopus 로고
    • An algorithmic theory of learning: Robust concepts and random projection
    • Rosa Arriaga and Santosh Veinpala. An algorithmic theory of learning: Robust concepts and random projection. Machine Learning, 63(2): 161-182, 2006.
    • (2006) Machine Learning , vol.63 , Issue.2 , pp. 161-182
    • Arriaga, R.1    Veinpala, S.2
  • 5
    • 0001058474 scopus 로고
    • Approximate confidence intervals, II
    • M. S. Bartlett. Approximate confidence intervals, II. Biometrika, 40(3/4):306-317, 1953.
    • (1953) Biometrika , vol.40 , Issue.3-4 , pp. 306-317
    • Bartlett, M.S.1
  • 9
    • 0031620041 scopus 로고    scopus 로고
    • Min-wise independent permutations (extended abstract)
    • Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher. Min-wise independent permutations (extended abstract). In STOC, pages 327-336, 1998.
    • (1998) STOC , pp. 327-336
    • Broder, A.Z.1    Charikar, M.2    Frieze, A.M.3    Mitzenmacher, M.4
  • 10
    • 0036040277 scopus 로고    scopus 로고
    • Similarity estimation techniques from rounding algorithms
    • Moses S. Charikar. Similarity estimation techniques from rounding algorithms. In STOC, pages 380-388, 2002.
    • (2002) STOC , pp. 380-388
    • Charikar, M.S.1
  • 11
    • 0000182415 scopus 로고
    • A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
    • Herman Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, 23(4):493-507, 1952.
    • (1952) The Annals of Mathematical Statistics , vol.23 , Issue.4 , pp. 493-507
    • Chernoff, H.1
  • 13
    • 0142245899 scopus 로고    scopus 로고
    • Estimating dominance norms of multiple data streams
    • Graham Cormode and S. Muthukrishnan. Estimating dominance norms of multiple data streams. In ESA, pages 148-160, 2003.
    • (2003) ESA , pp. 148-160
    • Cormode, G.1    Muthukrishnan, S.2
  • 14
    • 3042729411 scopus 로고
    • A note on the behaviour of the stable distributions for small index
    • N. Cressie. A note on the behaviour of the stable distributions for small index. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 31(1):61-64, 1975.
    • (1975) Z. Wahrscheinlichkeitstheorie und Verw. Gebiete , vol.31 , Issue.1 , pp. 61-64
    • Cressie, N.1
  • 15
    • 0037236821 scopus 로고    scopus 로고
    • An elementary proof of a theorem of Johnson and Lindenstrauss
    • Sanjoy Dasgupta and Anupam Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures and Algorithms, 22(1):60-65, 2003.
    • (2003) Random Structures and Algorithms , vol.22 , Issue.1 , pp. 60-65
    • Dasgupta, S.1    Gupta, A.2
  • 16
    • 4544259509 scopus 로고    scopus 로고
    • Locality-sensitive hashing scheme based on pstable distributions
    • Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokn. Locality-sensitive hashing scheme based on pstable distributions. In SCG, pages 253-262, 2004.
    • (2004) SCG , pp. 253-262
    • Datar, M.1    Immorlica, N.2    Indyk, P.3    Mirrokn, V.S.4
  • 17
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • David L. Donoho. Compressed sensing. IEEE Trans. Inform. Theory, 52(4): 1289-1306, 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.4 , pp. 1289-1306
    • Donoho, D.L.1
  • 19
    • 5544261689 scopus 로고
    • Parameter estimates for symmetric stable distributions
    • Eugene F. Fama and Richard Roll. Parameter estimates for symmetric stable distributions. Journal of the American Statistical Association, 66(334):331-338, 1971.
    • (1971) Journal of the American Statistical Association , vol.66 , Issue.334 , pp. 331-338
    • Fama, E.F.1    Roll, R.2
  • 21
    • 38249031101 scopus 로고
    • The Johnson-Lindenstrauss lemma and the sphericity of some graphs
    • P. Frankl and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. Journal of Combinatorial Theory A, 44(3):355-362, 1987.
    • (1987) Journal of Combinatorial Theory A , vol.44 , Issue.3 , pp. 355-362
    • Frankl, P.1    Maehara, H.2
  • 22
    • 38049005048 scopus 로고    scopus 로고
    • On estimating frequency moments of data streams
    • Sumit Ganguly and Graham Cormode. On estimating frequency moments of data streams. In APPROX-RANDOM, pages 479-493, 2007.
    • (2007) APPROX-RANDOM , pp. 479-493
    • Ganguly, S.1    Cormode, G.2
  • 25
    • 0034504507 scopus 로고    scopus 로고
    • Stable distributions, pseudorandom generators, embeddings and data stream computation
    • Piotr Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In FOCS, pages 189-197, 2000.
    • (2000) FOCS , pp. 189-197
    • Indyk, P.1
  • 26
    • 0035162484 scopus 로고    scopus 로고
    • Algorithmic applications of low-distortion geometric embeddings
    • Piotr Indyk. Algorithmic applications of low-distortion geometric embeddings. In FOCS, pages 10-33, 2001.
    • (2001) FOCS , pp. 10-33
    • Indyk, P.1
  • 27
    • 33746851190 scopus 로고    scopus 로고
    • Stable distributions, pseudorandom generators, embeddings, and data stream computation
    • Piotr Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. Journal of ACM, 53(3):307-323, 2006.
    • (2006) Journal of ACM , vol.53 , Issue.3 , pp. 307-323
    • Indyk, P.1
  • 28
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In STOC, pages 604-613, 1998.
    • (1998) STOC , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 29
    • 0001654702 scopus 로고
    • Extensions of Lipschitz mapping into Hilbert space
    • W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mapping into Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
    • (1984) Contemporary Mathematics , vol.26 , pp. 189-206
    • Johnson, W.B.1    Lindenstrauss, J.2
  • 33
    • 36949030233 scopus 로고    scopus 로고
    • α (0 < α ≤ 2) norm. In KDD, 2007.
    • α (0 < α ≤ 2) norm. In KDD, 2007.
  • 34
    • 35748938363 scopus 로고    scopus 로고
    • Using sketches to estimate associations
    • Ping Li and Kenneth W. Church. Using sketches to estimate associations. In HLT/EMNLP, pages 708-715, 2005.
    • (2005) HLT/EMNLP , pp. 708-715
    • Li, P.1    Church, K.W.2
  • 35
    • 34748825544 scopus 로고    scopus 로고
    • A sketch algorithm for estimating two-way and multi-way associations
    • Ping Li and Kenneth W. Church. A sketch algorithm for estimating two-way and multi-way associations. Computational Linguistics, 33(3):305-354, 2007.
    • (2007) Computational Linguistics , vol.33 , Issue.3 , pp. 305-354
    • Li, P.1    Church, K.W.2
  • 36
    • 84864064770 scopus 로고    scopus 로고
    • Conditional random sampling: A sketch-based sampling technique for sparse data
    • Ping Li, Kenneth W. Church, and Trevor J. Hastie. Conditional random sampling: A sketch-based sampling technique for sparse data. In NIPS, pages 873-880, 2007.
    • (2007) NIPS , pp. 873-880
    • Li, P.1    Church, K.W.2    Hastie, T.J.3
  • 37
    • 85162024675 scopus 로고    scopus 로고
    • α (0 < α ≤ 2) using stable random projections
    • α (0 < α ≤ 2) using stable random projections. In NIPS, 2008.
    • (2008) NIPS
    • Li, P.1    Hastie, T.J.2
  • 38
    • 33746094275 scopus 로고    scopus 로고
    • Improving random projections using marginal information
    • Ping Li, Trevor J. Hastie, and Kenneth W. Church. Improving random projections using marginal information. In COLT, pages 635-649, 2006.
    • (2006) COLT , pp. 635-649
    • Li, P.1    Hastie, T.J.2    Church, K.W.3
  • 41
    • 38049084243 scopus 로고
    • Simple consistent estimators of stable distribution parameters
    • J. Huston McCulloch. Simple consistent estimators of stable distribution parameters. Communications on Statistics-Simulation, 15(4):1109-1136, 1986.
    • (1986) Communications on Statistics-Simulation , vol.15 , Issue.4 , pp. 1109-1136
    • Huston McCulloch, J.1
  • 43
    • 14844315829 scopus 로고    scopus 로고
    • American Mathematical Society, Providence, RI
    • Santosh Vempala. The Random Projection Method. American Mathematical Society, Providence, RI, 2004.
    • (2004) The Random Projection Method
    • Vempala, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.