Pinghui Wang

Orcid: 0000-0001-5779-6108

According to our database1, Pinghui Wang authored at least 130 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
XTQA: Span-Level Explanations for Textbook Question Answering.
IEEE Trans. Neural Networks Learn. Syst., November, 2024

Sketching Data Distribution by Rotation.
IEEE Trans. Knowl. Data Eng., November, 2024

Robust Visual Question Answering: Datasets, Methods, and Future Challenges.
IEEE Trans. Pattern Anal. Mach. Intell., August, 2024

Half-Xor: A Fully-Dynamic Sketch for Estimating the Number of Distinct Values in Big Tables.
IEEE Trans. Knowl. Data Eng., July, 2024

GTCAlign: Global Topology Consistency-Based Graph Alignment.
IEEE Trans. Knowl. Data Eng., May, 2024

Diagram Perception Networks for Textbook Question Answering via Joint Optimization.
Int. J. Comput. Vis., May, 2024

Tracking Influencers in Decaying Social Activity Streams With Theoretical Guarantees.
IEEE/ACM Trans. Netw., April, 2024

An LDP Compatible Sketch for Securely Approximating Set Intersection Cardinalities.
Proc. ACM Manag. Data, February, 2024

Debate on Graph: a Flexible and Reliable Reasoning Framework for Large Language Models.
CoRR, 2024

Distinguish Confusion in Legal Judgment Prediction via Revised Relation Knowledge.
CoRR, 2024

Look, Listen, and Answer: Overcoming Biases for Audio-Visual Question Answering.
CoRR, 2024

SMUG: Sand Mixing for Unobserved Class Detection in Graph Few-Shot Learning.
Proceedings of the ACM on Web Conference 2024, 2024

Memory Disagreement: A Pseudo-Labeling Measure from Training Dynamics for Semi-supervised Graph Learning.
Proceedings of the ACM on Web Conference 2024, 2024

Grand: A Fast and Accurate Graph Retrieval Framework via Knowledge Distillation.
Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2024

PAIR: Pre-denosing Augmented Image Retrieval Model for Defending Adversarial Patches.
Proceedings of the 32nd ACM International Conference on Multimedia, MM 2024, Melbourne, VIC, Australia, 28 October 2024, 2024

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Multi-Track Message Passing: Tackling Oversmoothing and Oversquashing in Graph Learning via Preventing Heterophily Mixing.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

A Revisit to Graph Neighborhood Cardinality Estimation.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

SWISP: Distributed Convoy Mining via Sliding Window-based Indexing and Sub-track Partitioning.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Representation Learning of Tangled Key-Value Sequence Data for Early Classification.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

A Compact and Accurate Sketch for Estimating a Large Range of Set Difference Cardinalities.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

HAGO-Net: Hierarchical Geometric Massage Passing for Molecular Representation Learning.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

MERGE: Fast Private Text Generation.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
A Secure and Intelligent Data Sharing Scheme for UAV-Assisted Disaster Rescue.
IEEE/ACM Trans. Netw., December, 2023

Robust integrated planning for LEO satellite network design and service operations.
Oper. Res. Lett., November, 2023

SocialSift: Target Query Discovery on Online Social Media With Deep Reinforcement Learning.
IEEE Trans. Neural Networks Learn. Syst., September, 2023

Fast Gumbel-Max Sketch and its Applications.
IEEE Trans. Knowl. Data Eng., September, 2023

Optimizing recommendations under abandonment risks: Models and algorithms.
Perform. Evaluation, September, 2023

Federated Learning Over Coupled Graphs.
IEEE Trans. Parallel Distributed Syst., April, 2023

An Effective and Differentially Private Protocol for Secure Distributed Cardinality Estimation.
Proc. ACM Manag. Data, 2023

Robust and Transferable Log-based Anomaly Detection.
Proc. ACM Manag. Data, 2023

FuAlign: Cross-lingual entity alignment via multi-view representation learning of fused knowledge graphs.
Inf. Fusion, 2023

MERGE: Fast Private Text Generation.
CoRR, 2023

Healing Unsafe Dialogue Responses with Weak Supervision Signals.
CoRR, 2023

Adaptive loose optimization for robust question answering.
CoRR, 2023

Towards Understanding the Instability of Network Embedding (Extended Abstract).
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Multi-Action Dialog Policy Learning from Logged User Feedback.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

SegFormer: A Topic Segmentation Model with Controllable Range of Attention.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Mobile Data Traffic Prediction by Exploiting Time-Evolving User Mobility Patterns.
IEEE Trans. Mob. Comput., 2022

Towards Understanding the Instability of Network Embedding.
IEEE Trans. Knowl. Data Eng., 2022

Heterogeneous Network Crawling: Reaching Target Nodes by Motif-Guided Navigation.
IEEE Trans. Knowl. Data Eng., 2022

Approximately Counting Butterflies in Large Bipartite Graph Streams.
IEEE Trans. Knowl. Data Eng., 2022

Accurately Estimating User Cardinalities and Detecting Super Spreaders Over Time.
IEEE Trans. Knowl. Data Eng., 2022

Erasable Virtual HyperLogLog for Approximating Cumulative Distribution over Data Streams.
IEEE Trans. Knowl. Data Eng., 2022

MulSetRank: Multiple set ranking for personalized recommendation from implicit feedback.
Knowl. Based Syst., 2022

LDAAD: An effective label de-noising approach for anomaly detection.
J. Intell. Fuzzy Syst., 2022

AEP: Aligning knowledge graphs via embedding propagation.
Neurocomputing, 2022

"Think Before You Speak": Improving Multi-Action Dialog Policy by Planning Single-Action Dialogs.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Accurate and Scalable Graph Neural Networks for Billion-Scale Graphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

FBPB-SE: A Forward and Backward Private Blockchain-based Searchable Encryption with Fuzzy Multi-keyword.
Proceedings of the IEEE Intl. Conf. on Dependable, 2022

Contrastive Representation based Active Learning for Time Series.
Proceedings of the IEEE Intl. Conf. on Dependable, 2022

2021
Streaming Algorithms for Estimating High Set Similarities in LogLog Space.
IEEE Trans. Knowl. Data Eng., 2021

A machine learning based approach for user privacy preservation in social networks.
Peer-to-Peer Netw. Appl., 2021

Tracking triadic cardinality distributions for burst detection in high-speed graph streams.
Knowl. Inf. Syst., 2021

Automated Intelligent Healing in Cloud-Scale Data Centers.
Proceedings of the 40th International Symposium on Reliable Distributed Systems, 2021

Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Bidirectionally Densifying LSH Sketches with Empty Bins.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Temporal Biased Streaming Submodular Optimization.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Fast Rotation Kernel Density Estimation over Data Streams.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

LogLog Filter: Filtering Cold Items within a Large Range over High Speed Data Streams.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Learning to Check Contract Inconsistencies.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Symmetry Degree Measurement and its Applications to Anomaly Detection.
IEEE Trans. Inf. Forensics Secur., 2020

Addressing the train-test gap on traffic classification combined subflow model with ensemble learning.
Knowl. Based Syst., 2020

Discriminative Streaming Network Embedding.
Knowl. Based Syst., 2020

Improving network embedding with partially available vertex and edge content.
Inf. Sci., 2020

Proactive microwave link anomaly detection in cellular data networks.
Comput. Networks, 2020

Fast Generating A Large Number of Gumbel-Max Variables.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Node Classification on Graphs with Few-Shot Novel Labels via Meta Transformed Network Embedding.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Continuously Tracking Core Items in Data Streams with Probabilistic Decays.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Distinguish Confusing Law Articles for Legal Judgment Prediction.
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020

2019
Continuously Distinct Sampling over Centralized and Distributed High Speed Data Streams.
IEEE Trans. Parallel Distributed Syst., 2019

Inferring Higher-Order Structure Statistics of Large Networks from Sampled Edges.
IEEE Trans. Knowl. Data Eng., 2019

Detecting a Variety of Long-Term Stealthy User Behaviors on High Speed Links.
IEEE Trans. Knowl. Data Eng., 2019

Characterizing Directed and Undirected Networks via Multidimensional Walks with Jumps.
ACM Trans. Knowl. Discov. Data, 2019

SNOD: a fast sampling method of exploring node orbit degrees for large graphs.
Knowl. Inf. Syst., 2019

Practical characterization of large networks using neighborhood information.
Knowl. Inf. Syst., 2019

Fast crawling methods of exploring content distributed over large graphs.
Knowl. Inf. Syst., 2019

Optimizing node discovery on networks: Problem definitions, fast algorithms, and observations.
Inf. Sci., 2019

Effectively Linking Persons on Cameras and Mobile Devices on Networks.
IEEE Internet Comput., 2019

Sampling online social networks by random walk with indirect jumps.
Data Min. Knowl. Discov., 2019

A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

MR-GNN: Multi-Resolution and Dual Graph Neural Network for Predicting Structured Entity Interactions.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Meta Reinforcement Learning with Task Embedding and Shared Policy.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Utilizing Dynamic Properties of Sharing Bits and Registers to Estimate User Cardinalities Over Time.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

A Fast Sketch Method for Mining User Similarities Over Fully Dynamic Graph Streams.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

A Large-Scale Empirical Study of Internet Users' Privacy Leakage in China.
Proceedings of the 2019 IEEE Intl Conf on Dependable, 2019

Submodular Optimization over Streams with Inhomogeneous Decays.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs.
IEEE Trans. Knowl. Data Eng., 2018

Predicting attributes and friends of mobile users from AP-Trajectories.
Inf. Sci., 2018

Mining Long-Term Stealthy User Behaviors on High Speed Links.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs (Extended Abstract).
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017
Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage.
Proc. VLDB Endow., 2017

I/O-efficient calculation of H-group closeness centrality over disk-resident graphs.
Inf. Sci., 2017

AL-bitmap: Monitoring network traffic activity graphs on high speed links.
Inf. Sci., 2017

Mining repeating pattern in packet arrivals: Metrics, models, and applications.
Inf. Sci., 2017

Tracking Triadic Cardinality Distributions for Burst Detection in High-Speed Multigraph Streams.
CoRR, 2017

Towards Efficient Node Discoverability Optimization on Large Networks.
CoRR, 2017

Inferring Demographics and Social Networks of Mobile Device Users on Campus From AP-Trajectories.
Proceedings of the 26th International Conference on World Wide Web Companion, 2017

2016
Efficiently Estimating Statistics of Points of Interests on Maps.
IEEE Trans. Knowl. Data Eng., 2016

A General Framework for Estimating Graphlet Statistics via Random Walk.
Proc. VLDB Endow., 2016

A Fast Sampling Method of Exploring Graphlet Degrees of Large Directed and Undirected Graphs.
CoRR, 2016

Minfer: A method of inferring motif statistics from sampled edges.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2015
Unbiased Characterization of Node Pairs over Large Graphs.
ACM Trans. Knowl. Discov. Data, 2015

Moss: A Scalable Tool for Efficiently Sampling and Counting 4- and 5-Node Graphlets.
CoRR, 2015

Minfer: Inferring Motif Statistics From Sampled Edges.
CoRR, 2015

A tale of three graphs: Sampling design on hybrid social-affiliation networks.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Tracking Triadic Cardinality Distributions for Burst Detection in Social Activity Streams.
Proceedings of the 2015 ACM on Conference on Online Social Networks, 2015

2014
Efficiently Estimating Motif Statistics of Large Networks.
ACM Trans. Knowl. Discov. Data, 2014

A New Sketch Method for Measuring Host Connection Degree Distribution.
IEEE Trans. Inf. Forensics Secur., 2014

A new connection degree calculation and measurement method for large scale network monitoring.
J. Netw. Comput. Appl., 2014

A Tale of Three Social Networks: User Activity Comparisons across Facebook, Twitter, and Foursquare.
IEEE Internet Comput., 2014

Design of Efficient Sampling Methods on Hybrid Social-Affiliation Networks.
CoRR, 2014

An efficient sampling method for characterizing points of interests on maps.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

2013
On Set Size Distribution Estimation and the Characterization of Large Networks via Sampling.
IEEE J. Sel. Areas Commun., 2013

Social Sensor Placement in Large Scale Networks: A Graph Sampling Perspective
CoRR, 2013

A Peep on the Interplays between Online Video Websites and Online Social Networks
CoRR, 2013

Sampling Content Distributed Over Graphs.
CoRR, 2013

Efficiently Estimating Subgraph Statistics of Large Networks in the Dark.
CoRR, 2013

Sampling node pairs over large graphs.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

2012
Virtual indexing based methods for estimating node connection degrees.
Comput. Networks, 2012

Sampling directed graphs with random walks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
A Data Streaming Method for Monitoring Host Connection Degrees of High-Speed Links.
IEEE Trans. Inf. Forensics Secur., 2011

Monitoring abnormal network traffic based on blind source separation approach.
J. Netw. Comput. Appl., 2011

A new virtual indexing method for measuring host connection degrees.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
Dynamic Feature Analysis and Measurement for Large-Scale Network Traffic Monitoring.
IEEE Trans. Inf. Forensics Secur., 2010

2009
Monitoring Abnormal Traffic Flows Based on Independent Component Analysis.
Proceedings of IEEE International Conference on Communications, 2009

A New Data Streaming Method for Locating Hosts with Large Connection Degree.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

P2P Traffic Identification Based on the Signatures of Key Packets.
Proceedings of the IEEE 14th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, 2009


  Loading...