Z
Zhixin Zhou
Researcher at Baidu
Publications - 18
Citations - 244
Zhixin Zhou is an academic researcher from Baidu. The author has contributed to research in topics: Biclustering & Stochastic block model. The author has an hindex of 6, co-authored 13 publications receiving 124 citations. Previous affiliations of Zhixin Zhou include University of California, Los Angeles & City University of Hong Kong.
Papers
More filters
Proceedings Article
Möbius Transformation for Fast Inner Product Search on Graph
TL;DR: This work proposes a simple but novel graph indexing and searching algorithm to find the optimal solution with the largest inner product with the query based on the property that Mobius transformation introduces an isomorphism between a subgraph of l^2-Delaunay graph and Delaunaygraph for inner product.
Journal Article
Analysis of spectral clustering algorithms for community detection: the general bipartite setting
Zhixin Zhou,Arash A. Amini +1 more
TL;DR: In this paper, the authors consider spectral clustering algorithms for community detection under a general bipartite stochastic block model (SBM) and propose a new data-driven regularization that can restore the concentration of the adjacency matrix even for the sparse networks.
Proceedings ArticleDOI
Fast Item Ranking under Neural Network based Measures
TL;DR: This paper formulate ranking under neural network based measures as a generic ranking task, Optimal Binary Function Search (OBFS), which does not make strong assumptions for the ranking measures, and proposes a flexible graph-based solution for it, Binary Function search on Graph (BFSG).
Proceedings ArticleDOI
On Efficient Retrieval of Top Similarity Vectors
TL;DR: An efficient method for searching vectors via a typical non-metric matching function: inner product, which constructs an approximate Inner Product Delaunay Graph (IPDG) for top-1 Maximum Inner Product Search (MIPS), transforms retrieving the most suitable latent vectors into a graph search problem with great benefits of efficiency.
Posted Content
Analysis of spectral clustering algorithms for community detection: the general bipartite setting
Zhixin Zhou,Arash A. Amini +1 more
TL;DR: In this paper, the authors consider spectral clustering algorithms for community detection under a general bipartite stochastic block model (SBM) and propose a new data-driven regularization that can restore the concentration of the adjacency matrix even for the sparse networks.