메뉴 건너뛰기




Volumn , Issue , 2013, Pages

Beyond pairwise: Provably fast algorithms for approximate κ-way similarity search

Author keywords

[No Author keywords available]

Indexed keywords

BINARY VECTORS; FAST ALGORITHMS; HIGHER-ORDER; LOCALITY SENSITIVE HASHING; RETRIEVAL QUALITY; SEARCH PROBLEM; SIMILARITY FUNCTIONS; SIMILARITY SEARCH;

EID: 84898997631     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (30)
  • 1
    • 84898956757 scopus 로고    scopus 로고
    • http://www.howtogeek.com/howto/15799/how-to-use-autofill-on-a-google- docs-spreadsheet-quick-tips/.
  • 3
    • 77954782513 scopus 로고    scopus 로고
    • Group recommendation: Semantics and efficiency
    • Sihem Amer-Yahia, Senjuti Basu Roy, Ashish Chawlat, Gautam Das, and Cong Yu. Group recommendation: semantics and efficiency. Proc. VLDB Endow., 2(1):754-765, 2009.
    • (2009) Proc. VLDB Endow , vol.2 , Issue.1 , pp. 754-765
    • Amer-Yahia, S.1    Basu Roy, S.2    Chawlat, A.3    Das, G.4    Yu, C.5
  • 4
    • 79952370249 scopus 로고    scopus 로고
    • Dynamic ranked retrieval
    • Christina Brandt, Thorsten Joachims, Yisong Yue, and Jacob Bank. Dynamic ranked retrieval. In WSDM, pages 247-256, 2011.
    • (2011) WSDM , pp. 247-256
    • Brandt, C.1    Joachims, T.2    Yue, Y.3    Bank, J.4
  • 5
    • 0031346696 scopus 로고    scopus 로고
    • Broder. on the resemblance and containment of documents
    • Positano, Italy
    • Andrei Z. Broder. On the resemblance and containment of documents. In the Compression and Complexity of Sequences, pages 21-29, Positano, Italy, 1997.
    • (1997) The Compression and Complexity of Sequences , pp. 21-29
    • Andrei, Z.1
  • 6
    • 0031620041 scopus 로고    scopus 로고
    • Min-wise independent permutations (extended abstract)
    • Dallas, TX
    • Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher. Min-wise independent permutations (extended abstract). In STOC, pages 327-336, Dallas, TX, 1998.
    • (1998) STOC , pp. 327-336
    • Broder, A.Z.1    Charikar, M.2    Frieze, A.M.3    Mitzenmacher, M.4
  • 7
    • 0032594951 scopus 로고    scopus 로고
    • Support vector machines for histogram-based image classification
    • Olivier Chapelle, Patrick Haffner, and Vladimir N. Vapnik. Support vector machines for histogram-based image classification. IEEE Trans. Neural Networks, 10(5):1055-1064, 1999.
    • (1999) IEEE Trans. Neural Networks , vol.10 , Issue.5 , pp. 1055-1064
    • Chapelle, O.1    Haffner, P.2    Vapnik, V.N.3
  • 8
    • 0036040277 scopus 로고    scopus 로고
    • Similarity estimation techniques from rounding algorithms
    • Moses S. Charikar. Similarity estimation techniques from rounding algorithms. In STOC, 2002.
    • (2002) STOC
    • Charikar, M.S.1
  • 9
    • 84860149386 scopus 로고    scopus 로고
    • LSH-preserving functions and their applications
    • Flavio Chierichetti and Ravi Kumar. LSH-preserving functions and their applications. In SODA, 2012.
    • (2012) SODA
    • Chierichetti, F.1    Kumar, R.2
  • 10
    • 84880492977 scopus 로고    scopus 로고
    • A large-scale study of the evolution of web pages
    • Budapest, Hungary
    • Dennis Fetterly, Mark Manasse, Marc Najork, and Janet L. Wiener. A large-scale study of the evolution of web pages. In WWW, pages 669-678, Budapest, Hungary, 2003.
    • (2003) WWW , pp. 669-678
    • Fetterly, D.1    Manasse, M.2    Najork, M.3    Wiener, J.L.4
  • 12
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • Michel X. Goemans and David P.Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM, 42(6):1115-1145, 1995.
    • (1995) Journal of ACM , vol.42 , Issue.6 , pp. 1115-1145
    • Goemans, M.X.1    David P.Williamson2
  • 13
    • 84871949205 scopus 로고    scopus 로고
    • Approximate nearest neighbor: Towards removing the curse of dimensionality
    • Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani. Approximate nearest neighbor: Towards removing the curse of dimensionality. Theory of Computing, 8(14):321-350, 2012.
    • (2012) Theory of Computing , vol.8 , Issue.14 , pp. 321-350
    • Har-Peled, S.1    Indyk, P.2    Motwani, R.3
  • 14
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • Dallas, TX
    • Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In STOC, pages 604-613, Dallas, TX, 1998.
    • (1998) STOC , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 15
    • 79951749405 scopus 로고    scopus 로고
    • Improved consistent sampling, weighted minhash and l1 sketching
    • Sergey Ioffe. Improved consistent sampling, weighted minhash and l1 sketching. In ICDM, 2010.
    • (2010) ICDM
    • Ioffe, S.1
  • 16
    • 36849003521 scopus 로고    scopus 로고
    • Towards optimal bag-of-features for object categorization and semantic video retrieval
    • Amsterdam, Netherlands
    • Yugang Jiang, Chongwah Ngo, and Jun Yang. Towards optimal bag-of-features for object categorization and semantic video retrieval. In CIVR, pages 494-501, Amsterdam, Netherlands, 2007.
    • (2007) CIVR , pp. 494-501
    • Jiang, Y.1    Ngo, C.2    Yang, J.3
  • 19
    • 84864064770 scopus 로고    scopus 로고
    • Conditional random sampling: A sketch-based sampling technique for sparse data
    • Vancouver, Canada
    • 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, Vancouver, Canada, 2006.
    • (2006) NIPS , pp. 873-880
    • Li, P.1    Church, K.W.2    Hastie, T.J.3
  • 21
    • 85162008856 scopus 로고    scopus 로고
    • B-bit minwise hashing for estimating three-way similarities
    • Vancouver, Canada
    • Ping Li, Arnd Christian König, and Wenhao Gui. b-bit minwise hashing for estimating three-way similarities. In NIPS, Vancouver, Canada, 2010.
    • (2010) NIPS
    • Li, P.1    König, A.C.2    Gui, W.3
  • 22
    • 84877737308 scopus 로고    scopus 로고
    • One permutation hashing
    • Lake Tahoe, NV
    • Ping Li, Art B Owen, and Cun-Hui Zhang. One permutation hashing. In NIPS, Lake Tahoe, NV, 2012.
    • (2012) NIPS
    • Li, P.1    Owen, A.B.2    Zhang, C.3
  • 23
    • 84899020873 scopus 로고    scopus 로고
    • B-bit minwise hashing in practice
    • Changsha, China
    • Ping Li, Anshumali Shrivastava, and Arnd Christian König. b-bit minwise hashing in practice. In Inter-netware, Changsha, China, 2013.
    • (2013) Inter-netware
    • Li, P.1    Shrivastava, A.2    König, C.3
  • 24
    • 51849127391 scopus 로고    scopus 로고
    • Near optimal dimensionality reductions that preserve volumes
    • Avner Magen and Anastasios Zouzias. Near optimal dimensionality reductions that preserve volumes. In APPROX / RANDOM, pages 523-534, 2008.
    • (2008) APPROX /RANDOM , pp. 523-534
    • Magen, A.1    Zouzias, A.2
  • 26
    • 84877788187 scopus 로고    scopus 로고
    • Fast near neighbor search in high-dimensional binary data
    • Bristol, UK
    • Anshumali Shrivastava and Ping Li. Fast near neighbor search in high-dimensional binary data. In ECML, Bristol, UK, 2012.
    • (2012) ECML
    • Shrivastava, A.1    Li, P.2
  • 27
    • 84919820423 scopus 로고    scopus 로고
    • Densifying one permutation hashing via rotation for fast near neighbor search
    • Beijing, China
    • Anshumali Shrivastava and Ping Li. Densifying one permutation hashing via rotation for fast near neighbor search. In ICML, Beijing, China, 2014.
    • (2014) ICML
    • Shrivastava, A.1    Li, P.2
  • 28
    • 0012951952 scopus 로고    scopus 로고
    • A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
    • Roger Weber, Hans-Jörg Schek, and Stephen Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB, pages 194-205, 1998.
    • (1998) VLDB , pp. 194-205
    • Weber, R.1    Schek, H.2    Blott, S.3
  • 29
    • 78649359388 scopus 로고    scopus 로고
    • Spectral hashing
    • Vancouver, Canada
    • Yair Weiss, Antonio Torralba, and Robert Fergus. Spectral hashing. In NIPS, Vancouver, Canada, 2008.
    • (2008) NIPS
    • Weiss, Y.1    Torralba, A.2    Fergus, R.3
  • 30
    • 33745845542 scopus 로고    scopus 로고
    • Beyond pairwise classification and clustering using hypergraphs
    • Vancouver, Canada
    • D. Zhou, J. Huang, and B. Schölkopf. Beyond pairwise classification and clustering using hypergraphs. In NIPS, Vancouver, Canada, 2006.
    • (2006) NIPS
    • Zhou, D.1    Huang, J.2    Schölkopf, B.3


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