Chen Chen

Orcid: 0000-0003-3908-6545

Affiliations:
  • University of Wollongong, Australia
  • Zhejiang Gongshang University, Hangzhou, China
  • East China Normal University, China (former)
  • Efiniti Telecommunications Services, Sydney, Australia (former)
  • University of New South Wales, Sydney, Australia (PhD)


According to our database1, Chen Chen authored at least 49 papers between 2015 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

Rumor blocking with pertinence set in large graphs.
World Wide Web (WWW), January, 2024

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

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

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

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

Efficient Top-k Vulnerable Nodes Detection in Uncertain Graphs.
IEEE Trans. Knowl. Data Eng., 2023

Edge Manipulation Approaches for K-Core Minimization: Metrics and Analytics.
IEEE Trans. Knowl. Data Eng., 2023

Maximum Signed $\theta$θ-Clique Identification in Large Signed Graphs.
IEEE Trans. Knowl. Data Eng., 2023

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

Higher-Order Peak Decomposition.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 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

Powerful graph of graphs neural network for structured entity analysis.
World Wide Web, 2022

The art of characterization in large networks: Finding the critical attributes.
World Wide Web, 2022

Critical Nodes Identification in Large Networks: The Inclined and Detached Models.
World Wide Web, 2022

Efficient critical relationships identification in bipartite networks.
World Wide Web, 2022

Locating pivotal connections: the K-Truss minimization and maximization problems.
World Wide Web, 2022

Stable Community Detection in Signed Social Networks.
IEEE Trans. Knowl. Data Eng., 2022

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

Stable Community Detection in Signed Social Networks (Extended abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficient Top-k Vulnerable Nodes Detection in Uncertain Graphs (Extended abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Maximum Signed $\theta$-Clique Identification in Large Signed Graphs (Extended abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficiently Answering Minimum Reachable Label Set Queries in Edge-Labeled Graphs.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

Efficient Attribute (α, β)-Core Detection in Large Bipartite Graphs (Student Abstract).
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Efficient Personalized Influential Community Search in Large Networks.
Data Sci. Eng., 2021

Efficient reachability queries in multi-relation graph: An index-based approach.
Comput. Electr. Eng., 2021

Critical Nodes Identification in Large Networks: An Inclination-Based Model.
Proceedings of the Web Information Systems Engineering - WISE 2021, 2021

Spatial K-Core Identification in Large Spatial Data.
Proceedings of the 22nd IEEE International Conference on Mobile Data Management, 2021

2020
Hurricane in Bipartite Graphs: The Lethal Nodes of Butterflies.
Proceedings of the SSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management, 2020

Cohesive Subgraph Detection in Large Bipartite Networks.
Proceedings of the SSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management, 2020

Querying Influential Maximum Connected Community in Large Graphs.
Proceedings of the 7th IEEE International Conference on Data Science and Advanced Analytics, 2020

Discovering Cliques in Signed Networks Based on Balance Theory.
Proceedings of the Database Systems for Advanced Applications, 2020

Community Identification in Signed Networks: A K-Truss Based Model.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

Maximum Signed (k, r)-Truss Identification in Signed Networks.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Critical Edge Identification: A K-Truss Based Model.
CoRR, 2019

K-Core Maximization through Edge Additions.
CoRR, 2019

Safe Driving at Traffic Lights: An Image Recognition Based Approach.
Proceedings of the 20th IEEE International Conference on Mobile Data Management, 2019

SSVisual: Intelligent Start-Stop System.
Proceedings of the 20th IEEE International Conference on Mobile Data Management, 2019

Pivotal Relationship Identification: The K-Truss Minimization Problem.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

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

Efficient Adoption Maximization in Multi-layer Social Networks.
Proceedings of the 2019 International Conference on Data Mining Workshops, 2019

2018
K-core Minimization: An Edge Manipulation Approach.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

2017
Bring Order into the Samples: A Novel Scalable Method for Influence Maximization.
IEEE Trans. Knowl. Data Eng., 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

2016
EDMS: A System for Efficient Processing Distance-Aware Influence Maximization.
Proceedings of the Databases Theory and Applications, 2016

Effective Order Preserving Estimation Method.
Proceedings of the Databases Theory and Applications, 2016

Efficient Maximum Closeness Centrality Group Identification.
Proceedings of the Databases Theory and Applications, 2016

2015
On Gapped Set Intersection Size Estimation.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015


  Loading...