Pinghui Wang

According to our database1, Pinghui Wang authored at least 45 papers between 2009 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2017
Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage.
PVLDB, 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

Sampling Online Social Networks by Random Walk with Indirect Jumps.
CoRR, 2017

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

Characterizing Directed and Undirected Networks via Multidimensional Walks with Jumps.
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.
PVLDB, 2016

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

A General Framework for Estimating Graphlet Statistics via Random Walk.
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.
TKDD, 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.
TKDD, 2014

A New Sketch Method for Measuring Host Connection Degree Distribution.
IEEE Trans. Information Forensics and Security, 2014

A new connection degree calculation and measurement method for large scale network monitoring.
J. Network and Computer Applications, 2014

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

Tracking Triadic Cardinality Distributions for Burst Detection in Social Activity Streams.
CoRR, 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 Journal on Selected Areas in Communications, 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

Practical Characterization of Large Networks Using Neighborhood Information.
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
On Set Size Distribution Estimation and the Characterization of Large Networks via Sampling
CoRR, 2012

Virtual indexing based methods for estimating node connection degrees.
Computer 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. Information Forensics and Security, 2011

Monitoring abnormal network traffic based on blind source separation approach.
J. Network and Computer Applications, 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. Information Forensics and Security, 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...