Approximate nearest neighbor search on high dimensional data—experiments, analyses, and improvement

W Li, Y Zhang, Y Sun, W Wang, M Li… - … on Knowledge and …, 2019 - ieeexplore.ieee.org
Nearest neighbor search is a fundamental and essential operation in applications from
many domains, such as databases, machine learning, multimedia, and computer vision …

Bine: Bipartite network embedding

M Gao, L Chen, X He, A Zhou - … ACM SIGIR conference on research & …, 2018 - dl.acm.org
This work develops a representation learning method for bipartite networks. While existing
works have developed various embedding methods for network data, they have primarily …

Ads recommendation in a collapsed and entangled world

J Pan, W Xue, X Wang, H Yu, X Liu, S Quan… - Proceedings of the 30th …, 2024 - dl.acm.org
We present Tencent's ads recommendation system and examine the challenges and
practices of learning appropriate recommendation representations. Our study begins by …

Learned cardinality estimation for similarity queries

J Sun, G Li, N Tang - Proceedings of the 2021 International Conference …, 2021 - dl.acm.org
In this paper, we study the problem of using deep neural networks (DNNs) for estimating the
cardinality of similarity queries. Intuitively, DNNs can capture the distribution of data points …

Norm-ranging lsh for maximum inner product search

X Yan, J Li, X Dai, H Chen… - Advances in Neural …, 2018 - proceedings.neurips.cc
Neyshabur and Srebro proposed SIMPLE-LSH, which is the state-of-the-art hashing based
algorithm for maximum inner product search (MIPS). We found that the performance of …

Learning vertex representations for bipartite networks

M Gao, X He, L Chen, T Liu, J Zhang… - IEEE transactions on …, 2020 - ieeexplore.ieee.org
Recent years have witnessed a widespread increase of interest in network representation
learning (NRL). By far most research efforts have focused on NRL for homogeneous …

HashEclat: an efficient frequent itemset algorithm

C Zhang, P Tian, X Zhang, Q Liao, ZL Jiang… - International Journal of …, 2019 - Springer
The Eclat algorithm is one of the most widely used frequent itemset mining methods.
However, the inefficiency for calculating the intersection of itemsets makes it a time …

Fast eclat algorithms based on minwise hashing for large scale transactions

C Zhang, P Tian, X Zhang, ZL Jiang… - IEEE Internet of …, 2018 - ieeexplore.ieee.org
The Eclat algorithm is one of the most widely used frequent itemset mining methods. In the
normal Eclat algorithm and its variants, it is inefficient to calculate the intersection size of …

结合属性信息的二分网络表示学习.

赵雪莉, 卢光跃, 吕少卿, 张潘 - Journal of Frontiers of …, 2021 - search.ebscohost.com
现有的网络表示学习算法主要是针对同质网络或异质网络设计的, 而忽略了在推荐系统,
搜索引擎和问答系统等领域出现的二分网络的特殊特征以及这类网络所携带着的非常丰富的 …

Bnemdi: A novel MicroRNA–drug interaction prediction model based on multi-source information with a large-scale biological network

YJ Guan, CQ Yu, LP Li, ZH You, ZH Ren, J Pan… - Frontiers in …, 2022 - frontiersin.org
As a novel target in pharmacy, microRNA (miRNA) can regulate gene expression under
specific disease conditions to produce specific proteins. To date, many researchers …