Skip to main navigation
Skip to search
Skip to main content
Hong Kong Baptist University Home
Help & FAQ
Link opens in a new tab
Search content at Hong Kong Baptist University
Home
Scholars
Departments / Units
Research Output
Projects / Grants
Prizes / Awards
Activities
Student theses
Datasets
Efficient and Effective Similarity Search over Bipartite Graphs
Renchi Yang
*
*
Corresponding author for this work
Department of Computer Science
Research output
:
Chapter in book/report/conference proceeding
›
Conference proceeding
›
peer-review
13
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient and Effective Similarity Search over Bipartite Graphs'. Together they form a unique fingerprint.
Sort by:
Weight
Alphabetically
Keyphrases
Accuracy Guarantee
20%
Baseline Solution
20%
Bipartite Graph
100%
Computation Time
20%
Computational Cost
20%
Graph Traversal
20%
High-order Information
20%
Inherent Drawbacks
20%
Item Recommendation
20%
Large Graphs
20%
Matrix Operation
20%
Online Advertising
20%
Optimal Computational Complexity
20%
Order of Magnitude
20%
Personalized PageRank
80%
Practical Efficiency
20%
Query Rewriting
20%
Recommender Systems
20%
Similarity Measure
60%
Similarity Search
100%
Suboptimal Outcome
20%
Theoretical Accuracy
20%
Unique Properties
20%
Computer Science
Bipartite Graph
100%
Computational Complexity
20%
Computational Cost
20%
Computational Time
20%
Graph Traversal
20%
Large Data Set
20%
Matrix Operation
20%
Order Information
20%
Query Rewriting
20%
Recommender System
20%
Similarity Search
100%
Unique Property
20%