Wenjie Zhang

Orcid: 0000-0001-6572-2600

Affiliations:
  • University of New South Wales, Sydney, NSW, Australia


According to our database1, Wenjie Zhang authored at least 288 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient Balanced Signed Biclique Search in Signed Bipartite Graphs.
IEEE Trans. Knowl. Data Eng., March, 2024

Denoising Variational Graph of Graphs Auto-Encoder for Predicting Structured Entity Interactions.
IEEE Trans. Knowl. Data Eng., March, 2024

Neural Similarity Search on Supergraph Containment.
IEEE Trans. Knowl. Data Eng., January, 2024

Querying Structural Diversity in Streaming Graphs.
Proc. VLDB Endow., January, 2024

Size-bounded Community Search over Large Bipartite Graphs.
Proceedings of the Proceedings 27th International Conference on Extending Database Technology, 2024

DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs.
Proceedings of the Proceedings 27th International Conference on Extending Database Technology, 2024

2023
Efficient Maximal Biclique Enumeration on Large Uncertain Bipartite Graphs.
IEEE Trans. Knowl. Data Eng., December, 2023

Progressive Hard Negative Masking: From Global Uniformity to Local Tolerance.
IEEE Trans. Knowl. Data Eng., December, 2023

Clique Identification in Signed Graphs: A Balance Theory Based Model.
IEEE Trans. Knowl. Data Eng., December, 2023

GSim: A Graph Neural Network Based Relevance Measure for Heterogeneous Graphs.
IEEE Trans. Knowl. Data Eng., December, 2023

High-Ratio Compression for Machine-Generated Data.
Proc. ACM Manag. Data, December, 2023

FPGN: follower prediction framework for infectious disease prevention.
World Wide Web (WWW), November, 2023

Efficient continuous kNN join over dynamic high-dimensional data.
World Wide Web (WWW), November, 2023

Cohesive Subgraph Discovery Over Uncertain Bipartite Graphs.
IEEE Trans. Knowl. Data Eng., November, 2023

Balanced Clique Computation in Signed Networks: Concepts and Algorithms.
IEEE Trans. Knowl. Data Eng., November, 2023

(p,q)-biclique counting and enumeration for large sparse bipartite graphs.
VLDB J., September, 2023

Finding the Maximum $k$-Balanced Biclique on Weighted Bipartite Graphs.
IEEE Trans. Knowl. Data Eng., August, 2023

Accelerating Graph Similarity Search via Efficient GED Computation.
IEEE Trans. Knowl. Data Eng., May, 2023

Class-aware tiny object recognition over large-scale 3D point clouds.
Neurocomputing, April, 2023

Accelerated butterfly counting with vertex priority on bipartite graphs.
VLDB J., March, 2023

Discovering Significant Communities on Bipartite Graphs: An Index-Based Approach.
IEEE Trans. Knowl. Data Eng., March, 2023

Bipartite graph capsule network.
World Wide Web (WWW), January, 2023

Survey on Exact kNN Queries over High-Dimensional Data Space.
Sensors, January, 2023

ScaleG: A Distributed Disk-Based System for Vertex-Centric Graph Processing.
IEEE Trans. Knowl. Data Eng., 2023

Billion-Scale Bipartite Graph Embedding: A Global-Local Induced Approach.
Proc. VLDB Endow., 2023

Efficient Non-Learning Similar Subtrajectory Search.
Proc. VLDB Endow., 2023

WISK: A Workload-aware Learned Index for Spatial Keyword Queries.
Proc. ACM Manag. Data, 2023

Scaling Up k-Clique Densest Subgraph Detection.
Proc. ACM Manag. Data, 2023

Influence Minimization via Blocking Strategies.
CoRR, 2023

Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs.
CoRR, 2023

DARWIN Series: Domain Specific Large Language Models for Natural Science.
CoRR, 2023

Query2GMM: Learning Representation with Gaussian Mixture Model for Reasoning over Knowledge Graphs.
CoRR, 2023

Large Language Models as Master Key: Unlocking the Secrets of Materials Science with GPT.
CoRR, 2023

Group-based Fraud Detection Network on e-Commerce Platforms.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Quantifying Node Importance over Network Structural Stability.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

A Holistic Approach for Answering Logical Queries on Knowledge Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Towards Efficient Shortest Path Counting on Billion-Scale Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Distributed Near-Maximum Independent Set Maintenance over Large-scale Dynamic Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Efficient Maximum Signed Biclique Identification.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Towards Higher-order Topological Consistency for Unsupervised Network Alignment.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Dynamic Private Task Assignment under Differential Privacy.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Minimizing the Influence of Misinformation via Vertex Blocking.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Efficient and Scalable Distributed Graph Structural Clustering at Billion Scale.
Proceedings of the Database Systems for Advanced Applications, 2023

Higher-Order Peak Decomposition.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Discovering Densest Subgraph over Heterogeneous Information Networks.
Proceedings of the Databases Theory and Applications, 2023

IFGNN: An Individual Fairness Awareness Model for Missing Sensitive Information Graphs.
Proceedings of the Databases Theory and Applications, 2023

Maximum Fairness-Aware (k, r)-Core Identification in Large Graphs.
Proceedings of the Databases Theory and Applications, 2023

2022
Polarity-based graph neural network for sign prediction in signed bipartite graphs.
World Wide Web, 2022

Span-reachability querying in large temporal graphs.
VLDB J., 2022

Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs.
VLDB J., 2022

Answering reachability and K-reach queries on large graphs with label constraints.
VLDB J., 2022

Anchored coreness: efficient reinforcement of social networks.
VLDB J., 2022

Continuous monitoring of moving skyline and top-k queries.
VLDB J., 2022

ABLE: Meta-Path Prediction in Heterogeneous Information Networks.
ACM Trans. Knowl. Discov. Data, 2022

Online Ridesharing with Meeting Points.
Proc. VLDB Endow., 2022

Online Ridesharing with Meeting Points [Technical Report].
CoRR, 2022

Efficient k-clique Listing with Set Intersection Speedup [Technical Report].
CoRR, 2022

GridTuner: Reinvestigate Grid Size Selection for Spatiotemporal Prediction Models [Technical Report].
CoRR, 2022

Structure-based Large-scale Dynamic Heterogeneous Graphs Processing: Applications, Challenges and Solutions.
Proceedings of the Companion of The Web Conference 2022, Virtual Event / Lyon, France, April 25, 2022

Mitigating Multi-class Unintended Demographic Bias in Text Classification with Adversarial Learning.
Proceedings of the Web Information Systems Engineering - WISE 2022, 2022

Hop-Constrained s-t Simple Path Enumeration in Billion-Scale Labelled Graphs.
Proceedings of the Web Information Systems Engineering - WISE 2022, 2022

Neural Subgraph Counting with Wasserstein Estimator.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Efficient Computation of Cohesive Subgraphs in Uncertain Bipartite Graphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficient $k-\text{clique}$ Listing with Set Intersection Speedup.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

TMN: Trajectory Matching Networks for Predicting Similarity.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Discovering Hierarchy of Bipartite Graphs with Cohesive Subgraphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficient Personalized Maximum Biclique Search.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Reachability-Driven Influence Maximization in Time-dependent Road-social Networks.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing (Extended Abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Maximal Balanced Signed Biclique Enumeration in Signed Bipartite Graphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

GridTuner: Reinvestigate Grid Size Selection for Spatiotemporal Prediction Models.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Estimating Node Importance Values in Heterogeneous Information Networks.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficient Reinforcement of Bipartite Networks at Billion Scale.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficient kNN Join over Dynamic High-Dimensional Data.
Proceedings of the Databases Theory and Applications, 2022

Hop-Constrained s-t Simple Path Enumeration in Large Uncertain Graphs.
Proceedings of the Databases Theory and Applications, 2022

Cohesive Subgraph Search Over Large Heterogeneous Information Networks
Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-97567-8, 2022

2021
Efficient Hop-constrained s-t Simple Path Enumeration.
VLDB J., 2021

On Directed Densest Subgraph Discovery.
ACM Trans. Database Syst., 2021

Efficient and High-Quality Seeded Graph Matching: Employing Higher-order Structural Information.
ACM Trans. Knowl. Discov. Data, 2021

CP-GNN: A Software for Community Detection in Heterogeneous Information Networks.
Softw. Impacts, 2021

Efficient Directed Densest Subgraph Discovery.
SIGMOD Rec., 2021

On Querying Historical K-Cores.
Proc. VLDB Endow., 2021

(p, q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs.
Proc. VLDB Endow., 2021

Efficient Bi-triangle Counting for Large Bipartite Networks.
Proc. VLDB Endow., 2021

Hierarchical Core Maintenance on Large Dynamic Graphs.
Proc. VLDB Endow., 2021

Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale.
Proc. VLDB Endow., 2021

Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs.
Proc. VLDB Endow., 2021

Unsupervised Cross-View Feature Selection on incomplete data.
Knowl. Based Syst., 2021

Discovering fortress-like cohesive subgraphs.
Knowl. Inf. Syst., 2021

Communication-Efficient Distributed Covariance Sketch, with Application to Distributed PCA.
J. Mach. Learn. Res., 2021

Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs.
Inf. Sci., 2021

Keyword Search on Large Graphs: A Survey.
Data Sci. Eng., 2021

Towards User Engagement Dynamics in Social Networks.
CoRR, 2021

A Coarse-to-Fine Approach for Rock Bolt Detection From 3D Point Clouds.
IEEE Access, 2021

SQL2Cypher: Automated Data and Query Migration from RDBMS to GDBMS.
Proceedings of the Web Information Systems Engineering - WISE 2021, 2021

HUGE: An Efficient and Scalable Subgraph Enumeration System.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

T3S: Effective Representation Learning for Trajectory Similarity Computation.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient and Effective Community Search on Large-scale Bipartite Graphs.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient Community Search with Size Constraint.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Pareto-optimal Community Search on Large Bipartite Graphs.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

Top-k Tree Similarity Join.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

A Cohesive Structure Based Bipartite Graph Analytics System.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

DLQ: A System for Label-Constrained Reachability Queries on Dynamic Graphs.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

Detecting Communities from Heterogeneous Graphs: A Context Path-based Graph Neural Network Model.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Efficient (α, β)-core computation in bipartite graphs.
VLDB J., 2020

Correction: A survey of community search over big graphs.
VLDB J., 2020

A survey of community search over big graphs.
VLDB J., 2020

Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems.
IEEE Trans. Knowl. Data Eng., 2020

Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement.
IEEE Trans. Knowl. Data Eng., 2020

ESPM: Efficient Spatial Pattern Matching.
IEEE Trans. Knowl. Data Eng., 2020

Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond.
Proc. VLDB Endow., 2020

Effective and Efficient Community Search over Large Heterogeneous Information Networks.
Proc. VLDB Endow., 2020

Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs.
Proceedings of the 2020 International Conference on Management of Data, 2020

Global Reinforcement of Social Networks: The Anchored Coreness Problem.
Proceedings of the 2020 International Conference on Management of Data, 2020

An Empirical Study on Recent Graph Database Systems.
Proceedings of the Knowledge Science, Engineering and Management, 2020

Knowledge-guided Deep Reinforcement Learning for Interactive Recommendation.
Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

Distributed Streaming Set Similarity Join.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Effective and Efficient Truss Computation over Large Heterogeneous Information Networks.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Efficiently Answering Span-Reachability Queries in Large Temporal Graphs.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Efficient Bitruss Decomposition for Large-scale Bipartite Graphs.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Finding the Best k in Core Decomposition: A Time and Space Optimal Solution.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

ESPM: Efficient Spatial Pattern Matching (Extended Abstract).
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Speeding Up GED Verification for Graph Similarity Search.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing.
Proceedings of the Database Systems for Advanced Applications, 2020

I/O Efficient Algorithm for c-Approximate Furthest Neighbor Search in High-Dimensional Space.
Proceedings of the Database Systems for Advanced Applications, 2020

2019
Efficient community discovery with user engagement and similarity.
VLDB J., 2019

SimRank*: effective and scalable pairwise similarity search based on graph topology.
VLDB J., 2019

Hyperspectral Imagery Classification via Stochastic HHSVMs.
IEEE Trans. Image Process., 2019

Spatial pattern matching: a new direction for finding spatial objects.
ACM SIGSPATIAL Special, 2019

Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks.
Proc. VLDB Endow., 2019

Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice.
Proc. VLDB Endow., 2019

Efficient Progressive Minimum k-core Search.
Proc. VLDB Endow., 2019

Distributed Subgraph Matching on Timely Dataflow.
Proc. VLDB Endow., 2019

Metric Learning for Multi-Output Tasks.
IEEE Trans. Pattern Anal. Mach. Intell., 2019

Cost optimization based on influence and user preference.
Knowl. Inf. Syst., 2019

Selectivity Estimation on Set Containment Search.
Data Sci. Eng., 2019

K-Core Maximization through Edge Additions.
CoRR, 2019

A Survey and Experimental Analysis of Distributed Subgraph Matching.
CoRR, 2019

Efficient (a,β)-core Computation: an Index-based Approach.
Proceedings of the World Wide Web Conference, 2019

CoreCube: Core Decomposition in Multilayer Graphs.
Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

K-Core Maximization: An Edge Addition Approach.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Know Your Mind: Adaptive Cognitive Activity Recognition with Reinforced CNN.
Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

Efficient Maximal Spatial Clique Enumeration.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Hierarchical Decomposition of Big Graphs.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Index-Based Densest Clique Percolation Community Search in Networks (Extended Abstract).
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Accelerate MaxBRkNN Search by kNN Estimation.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Towards Efficient k-TriPeak Decomposition on Large Graphs.
Proceedings of the Database Systems for Advanced Applications, 2019

Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018
Efficient structure similarity searches: a partition-based approach.
VLDB J., 2018

Dynamical SimRank search on time-varying networks.
VLDB J., 2018

Efficient set containment join.
VLDB J., 2018

Index-Based Densest Clique Percolation Community Search in Networks.
IEEE Trans. Knowl. Data Eng., 2018

An Optimal and Progressive Approach to Online Search of Top-K Influential Communities.
Proc. VLDB Endow., 2018

Distributed computing connected components with linear communication cost.
Distributed Parallel Databases, 2018

Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information.
CoRR, 2018

Ranking Preserving Nonnegative Matrix Factorization.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Efficiently Reinforcing Social Networks over User Engagement and Tie Strength.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Efficient Computing of Radius-Bounded k-Cores.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Efficient Probabilistic K-Core Computation on Uncertain Graphs.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

External Topological Sorting in Large Graphs.
Proceedings of the Database Systems for Advanced Applications, 2018

A Signal Quality Assessment Method for Electrocardiography Acquired by Mobile Device.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

Doubly Approximate Nearest Neighbor Classification.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Categorical top-k spatial influence query.
World Wide Web, 2017

Reverse k nearest neighbors queries and spatial reverse top-k queries.
VLDB J., 2017

Top-k spatial-keyword publish/subscribe over sliding window.
VLDB J., 2017

Unsupervised Metric Fusion Over Multiview Data by Graph Random Walk-Based Cross-View Diffusion.
IEEE Trans. Neural Networks Learn. Syst., 2017

Bring Order into the Samples: A Novel Scalable Method for Influence Maximization.
IEEE Trans. Knowl. Data Eng., 2017

Efficient Distance-Aware Influence Maximization in Geo-Social Networks.
IEEE Trans. Knowl. Data Eng., 2017

pSCAN: Fast and Exact Structural Graph Clustering.
IEEE Trans. Knowl. Data Eng., 2017

Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval.
IEEE Trans. Image Process., 2017

OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks.
Proc. VLDB Endow., 2017

When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks.
Proc. VLDB Endow., 2017

Effective and Efficient Dynamic Graph Coloring.
Proc. VLDB Endow., 2017

An Optimal and Progressive Approach to Online Search of Top-k Important Communities.
CoRR, 2017

Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation.
CoRR, 2017

Local Top-N Recommendation via Refined Item-User Bi-Clustering.
Proceedings of the Web Information Systems Engineering - WISE 2017, 2017

Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Efficient Matrix Sketching over Distributed Data.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Tracking Matrix Approximation over Distributed Sliding Windows.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

TT-Join: Efficient Set Containment Join.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Bring Order into the Samples: A Novel Scalable Method for Influence Maximization (Extended Abstract).
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

DSKQ: A System for Efficient Processing of Diversified Spatial-Keyword Query.
Proceedings of the Databases Theory and Applications, 2017

Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Diversified top-k clique search.
VLDB J., 2016

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search.
IEEE Trans. Knowl. Data Eng., 2016

Efficient Probabilistic Supergraph Search.
IEEE Trans. Knowl. Data Eng., 2016

Efficient Identification of Local Keyword Patterns in Microblogging Platforms.
IEEE Trans. Knowl. Data Eng., 2016

I/O Efficient ECC Graph Decomposition via Graph Reduction.
Proc. VLDB Endow., 2016

SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window.
Proc. VLDB Endow., 2016

Shifting multi-hypergraphs via collaborative probabilistic voting.
Knowl. Inf. Syst., 2016

Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement (v1.0).
CoRR, 2016

Efficient Subgraph Matching by Postponing Cartesian Products.
Proceedings of the 2016 International Conference on Management of Data, 2016

Iterative Views Agreement: An Iterative Low-Rank Based Structured Optimization Method to Multi-View Spectral Clustering.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Influence based cost optimization on user preference.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

Distance-aware influence maximization in geo-social network.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

Computing Connected Components with linear communication cost in pregel-like systems.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

pSCAN: Fast and exact structural graph clustering.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

A time-series similarity method for QRS morphology variation analysis.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

2015
Probabilistic n-of-N skyline computation over uncertain data streams.
World Wide Web, 2015

Guest editorial: web applications and techniques.
World Wide Web, 2015

AP-Tree: efficiently support location-aware Publish/Subscribe.
VLDB J., 2015

Finding Top k Most Influential Spatial Facilities over Uncertain Objects.
IEEE Trans. Knowl. Data Eng., 2015

Fast All-Pairs SimRank Assessment on Large Graphs and Bipartite Domains.
IEEE Trans. Knowl. Data Eng., 2015

Robust Subspace Clustering for Multi-View Data by Exploiting Correlation Consensus.
IEEE Trans. Image Process., 2015

Optimal Enumeration: Efficient Top-k Tree Matching.
Proc. VLDB Endow., 2015

Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

LBMCH: Learning Bridging Mapping for Cross-modal Hashing.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

Effective Multi-Query Expansions: Robust Landmark Retrieval.
Proceedings of the 23rd Annual ACM Conference on Multimedia Conference, MM '15, Brisbane, Australia, October 26, 2015

AP-Tree: Efficiently support continuous spatial-keyword queries over stream.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Spatial Keyword Range Search on Trajectories.
Proceedings of the Database Systems for Advanced Applications, 2015

Efficient String Similarity Search: A Cross Pivotal Based Approach.
Proceedings of the Database Systems for Advanced Applications, 2015

Range Search on Uncertain Trajectories.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014
Efficient top-k similarity join processing over multi-valued objects.
World Wide Web, 2014

Consensus-Based Ranking of Multivalued Objects: A Generalized Borda Count Approach.
IEEE Trans. Knowl. Data Eng., 2014

Effectively Indexing the Multidimensional Uncertain Objects.
IEEE Trans. Knowl. Data Eng., 2014

A Generic Framework for Top-<i>k</i> Pairs and Top-<i>k</i> Objects Queries over Sliding Windows.
IEEE Trans. Knowl. Data Eng., 2014

A Unified Framework for Answering k Closest Pairs Queries and Variants.
IEEE Trans. Knowl. Data Eng., 2014

Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations.
Proc. VLDB Endow., 2014

Matching dominance: capture the semantics of dominance for multi-dimensional uncertain objects.
Proceedings of the Conference on Scientific and Statistical Database Management, 2014

Efficiently identify local frequent keyword co-occurrence patterns in geo-tagged Twitter stream.
Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2014

An Iterative Fusion Approach to Graph-Based Semi-Supervised Learning from Multiple Views.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2014

Exploiting Correlation Consensus: Towards Subspace Clustering for Multi-modal Data.
Proceedings of the ACM International Conference on Multimedia, MM '14, Orlando, FL, USA, November 03, 2014

Fast incremental SimRank on link-evolving graphs.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

Diversified Spatial Keyword Search On Road Networks.
Proceedings of the 17th International Conference on Extending Database Technology, 2014

A Unified Framework for Efficiently Processing Ranking Related Queries.
Proceedings of the 17th International Conference on Extending Database Technology, 2014

Improving Performance of Graph Similarity Joins Using Selected Substructures.
Proceedings of the Database Systems for Advanced Applications, 2014

Identifying Top k Dominating Objects over Uncertain Data.
Proceedings of the Database Systems for Advanced Applications, 2014

Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time.
Proceedings of the Databases Theory and Applications, 2014

2013
Efficient general spatial skyline computation.
World Wide Web, 2013

A Partition-Based Approach to Structure Similarity Search.
Proc. VLDB Endow., 2013

More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks.
Proc. VLDB Endow., 2013

Probabilistic skyline operator over sliding windows.
Inf. Syst., 2013

Probabilistic k-Skyband Operator over Sliding Windows.
Proceedings of the Web-Age Information Management - 14th International Conference, 2013

Towards efficient SimRank computation on large networks.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

A safe zone based approach for monitoring moving skyline queries.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

On Efficient Graph Substructure Selection.
Proceedings of the Database Systems for Advanced Applications, 2013

AVR-Tree: Speeding Up the NN and ANN Queries on Location Data.
Proceedings of the Database Systems for Advanced Applications, 2013

2012
A space and time efficient algorithm for SimRank computation.
World Wide Web, 2012

Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks.
VLDB J., 2012

Efficiently processing snapshot and continuous reverse k nearest neighbors queries.
VLDB J., 2012

Stochastic skylines.
ACM Trans. Database Syst., 2012

Efficient Computation of Range Aggregates against Uncertain Location-Based Queries.
IEEE Trans. Knowl. Data Eng., 2012

Skyline: Stacking Optimal Solutions in Exact and Uncertain Worlds.
Int. J. Softw. Informatics, 2012

On the Efficiency of Estimating Penetrating Rank on Large Graphs.
Proceedings of the Scientific and Statistical Database Management, 2012

TreeSpan: efficiently computing similarity all-matching.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

SimFusion+: extending simfusion towards efficient estimation on large and dynamic networks.
Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

Efficiently Monitoring Top-k Pairs over Sliding Windows.
Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012

Effectively indexing the multi-dimensional uncertain objects for range searching.
Proceedings of the 15th International Conference on Extending Database Technology, 2012

Efficient Subgraph Similarity All-Matching.
Proceedings of the Database Systems for Advanced Applications, 2012

Top-k Similarity Join over Multi-valued Objects.
Proceedings of the Database Systems for Advanced Applications, 2012

General Spatial Skyline Operator.
Proceedings of the Database Systems for Advanced Applications, 2012

2011
Continuous Monitoring of Distance-Based Range Queries.
IEEE Trans. Knowl. Data Eng., 2011

Ranking uncertain sky: The probabilistic top-k skyline operator.
Inf. Syst., 2011

Stochastic skyline operator.
Proceedings of the 27th International Conference on Data Engineering, 2011

Influence zone: Efficiently processing reverse k nearest neighbors queries.
Proceedings of the 27th International Conference on Data Engineering, 2011

A unified approach for computing top-k pairs in multidimensional space.
Proceedings of the 27th International Conference on Data Engineering, 2011

BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries.
Proceedings of the Database Systems for Advanced Applications, 2011

A Unified Algorithm for Continuous Monitoring of Spatial Queries.
Proceedings of the Database Systems for Advanced Applications, 2011

2010
Efficiently and effectively processing probabilistic queries on uncertain data.
PhD thesis, 2010

Threshold-based probabilistic top-<i>k</i> dominating queries.
VLDB J., 2010

Effectively Indexing the Uncertain Space.
IEEE Trans. Knowl. Data Eng., 2010

Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data.
IEEE Trans. Knowl. Data Eng., 2010

PrefIndex: An Efficient Supergraph Containment Search Technique.
Proceedings of the Scientific and Statistical Database Management, 2010

Efficient rank based KNN query processing over uncertain data.
Proceedings of the 26th International Conference on Data Engineering, 2010

Quantile-based KNN over multi-valued objects.
Proceedings of the 26th International Conference on Data Engineering, 2010

Multi-guarded safe zone: An effective technique to monitor moving circular range queries.
Proceedings of the 26th International Conference on Data Engineering, 2010

Counting distinct objects over sliding windows.
Proceedings of the Database Technologies 2010, 2010

2009
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN.
Proc. VLDB Endow., 2009

Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data.
Proceedings of the Advances in Data and Web Management, Joint International Conferences, 2009

Probabilistic Skyline Operator over Sliding Windows.
Proceedings of the 25th International Conference on Data Engineering, 2009

Uncertain Location Based Range Aggregates in a Multi-dimensional Space.
Proceedings of the 25th International Conference on Data Engineering, 2009

2008
Managing Uncertain Data: Probabilistic Approaches.
Proceedings of the Ninth International Conference on Web-Age Information Management, 2008

Ranking queries on uncertain data: a probabilistic threshold approach.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data.
Proceedings of the 24th International Conference on Data Engineering, 2008


  Loading...