Bridging dense and sparse maximum inner product search

S Bruch, FM Nardini, A Ingber, E Liberty - ACM Transactions on …, 2024 - dl.acm.org
Maximum inner product search (MIPS) over dense and sparse vectors have progressed
independently in a bifurcated literature for decades; the latter is better known as top-retrieval …

An approximate algorithm for maximum inner product search over streaming sparse vectors

S Bruch, FM Nardini, A Ingber, E Liberty - ACM Transactions on …, 2023 - dl.acm.org
Maximum Inner Product Search or top-k retrieval on sparse vectors is well understood in
information retrieval, with a number of mature algorithms that solve it exactly. However, all …

Improving sign-random-projection via count sketch

PP Dubey, BD Verma, R Pratap… - Uncertainty in Artificial …, 2022 - proceedings.mlr.press
Computing the angular similarity between pairs of vectors is a core part of various machine
learning algorithms. The seminal work of Charikar (aka Sign-Random-Projection (SRP) or …

[PDF][PDF] Clustering performance using k-modes with modified entropy measure for breast cancer

NM Mahfuz, H Suhartanto, K Kusmardi… - Indonesian Journal of …, 2023 - academia.edu
Breast cancer is a serious disease that requires data analysis for diagnosis and treatment.
Clustering is a data mining technique that is often used in breast cancer research to assess …

A sketch-based approach towards scalable and efficient attributed network embedding

T Chakraborty, D Bera - 2021 - repository.iiitd.edu.in
With the advent of big data, graphs have gained popularity as one of the most efficient data
storage mechanisms. A graph can not only capture relationships between entities, but it can …