Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Datasets
Press/Media
Activities
Fellowships, Honors, and Prizes
Impacts
Search by expertise, name or affiliation
L2AP: Fast cosine similarity search with prefix L-2 norm bounds
David C. Anastasiu
,
George Karypis
Computer Science and Engineering
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
38
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'L2AP: Fast cosine similarity search with prefix L-2 norm bounds'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
L2 Norm
100%
Similarity Search
100%
Prefix
100%
Cosine Similarity
100%
Inverted Index
100%
Norm Bounds
100%
Pruning Strategy
50%
Algorithm Performance
50%
Value-based
50%
Size Dependence
50%
Self-similarity
50%
Approximate Solution
50%
Early Pruning
50%
Approximate Method
50%
All-pairs
50%
Similarity Value
50%
Exact Method
50%
Candidate Identification
50%
Weight Vector
50%
2-norm
50%
Pool Size
50%
Sparse Data
50%
Search Time
50%
All-pairs Similarity Search
50%
Similarity Join
50%
Cauchy-Schwarz Inequality
50%
Similarity Vectors
50%
Candidate Generation
50%
Index Size
50%
Similarity Threshold
50%
Dot Product Computation
50%
Computer Science
Cosine Similarity
100%
Similarity Search
100%
Inverted Index
100%
Algorithm Performance
50%
Similarity Value
50%
Baseline Approach
50%
Approximate Solution
50%
Schwarz Inequality
50%