1, In using heap for selecting top K, why are construction of heap taken 2J operations and top k read in 2logJ steps? As we know construction of heap need take nlogn operations.
2, Why "Bags of words" can be represented as vectors? Such as "Mary is quicker than John" and "John is quicker than Mary" are similar in vector representation I think.
No comments:
Post a Comment