Jianye Yang

Orcid: 0000-0002-0818-4970

Affiliations:
  • Guangzhou University, Cyberspace Institute of Advanced Technology, China


According to our database1, Jianye Yang authored at least 38 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
BigSet: An Efficient Set Intersection Approach.
IEEE Trans. Knowl. Data Eng., December, 2024

Deep Learning Approaches for Similarity Computation: A Survey.
IEEE Trans. Knowl. Data Eng., December, 2024

Multi-Source Shortest Path Query With Assembly Points on Large Graphs.
IEEE Trans. Knowl. Data Eng., December, 2024

Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs.
IEEE Trans. Knowl. Data Eng., September, 2024

TC-Match: Fast Time-constrained Continuous Subgraph Matching.
Proc. VLDB Endow., July, 2024

Efficient Regular Simple Path Queries under Transitive Restricted Expressions.
Proc. VLDB Endow., March, 2024

Efficient Learning-based Top-k Representative Similar Subtrajectory Query.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Efficient Multi-Query Oriented Continuous Subgraph Matching.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

PLIS: Persistent Learned Index for Strings.
Proceedings of the Web Information Systems and Applications, 2024

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

TSEE: a novel knowledge embedding framework for cyberspace security.
World Wide Web (WWW), November, 2023

Persistent graph stream summarization for real-time graph analytics.
World Wide Web (WWW), September, 2023

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

Efficient Maximum Edge-Weighted Biclique Search on Large Bipartite Graphs.
IEEE Trans. Knowl. Data Eng., August, 2023

Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases.
Proc. ACM Manag. Data, 2023

Edge Coloring on Dynamic Graphs.
Proceedings of the Database Systems for Advanced Applications, 2023

2022
Efficient maintenance for maximal bicliques in bipartite graph streams.
World Wide Web, 2022

Efficient game theoretic approach to dynamic graph partitioning.
Inf. Sci., 2022

A parameter-free approach to lossless summarization of fully dynamic graphs.
Inf. Sci., 2022

2021
Efficient Utilization of Missing Data in Cost-Sensitive Learning.
IEEE Trans. Knowl. Data Eng., 2021

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

Efficient Approaches to Top-r Influential Community Search.
IEEE Internet Things J., 2021

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

A Parameter-Free Approach for Lossless Streaming Graph Summarization.
Proceedings of the Database Systems for Advanced Applications, 2021

Fast k-NN Graph Construction by GPU based NN-Descent.
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

2020
Efficient Maximal Balanced Clique Enumeration in Signed Networks.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

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

sf GQA<sub>sf RDF</sub>: A Graph-Based Approach Towards Efficient SPARQL Query Answering.
Proceedings of the Database Systems for Advanced Applications, 2020

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

Efficient Maximal Spatial Clique Enumeration.
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

2018
Efficient set containment join.
VLDB J., 2018

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

2017
Efficient Influence Related Queries.
PhD thesis, 2017

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

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

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


  Loading...