Shuguang Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Shuguang Hu has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Fazhou Wang
Wuhan University of Technology
3 shared publications - T. -H. Hubert Chan
The University of Hong Kong, Hong Kong, China
2 shared publications - Arnaud Guerquin
LTCI, TELECOM ParisTech, 52844 Paris, le-de-France, France
1 shared publication - Chenzi Zhang
The University of Hong Kong
1 shared publication - Chi Sun Poon
Department of Civil and Environmental Engineering, The Hong Kong Polytechnic University, Kowloon, Hong Kong
1 shared publication - Chuanlin Hu
State Key Laboratory of Silicate Materials for Architectures, School of Materials Science and Engineering, Wuhan University of Technology, Wuhan, China
1 shared publication
Latest Publications
- 31 July 2023
- Published by Elsevier in Journal of Cleaner Production
- Vol. 421, 138298
Preparation of glass-ceramic-based artificial aggregates using multiple solid wastes: Crystallization mechanism
- 31 July 2023
- Published by Elsevier in Journal of Cleaner Production
- Vol. 421, 138298
Preparation of glass-ceramic-based artificial aggregates using multiple solid wastes: Crystallization mechanism
- 10 June 2022
- Published by Springer Nature in Journal of Wuhan University of Technology-Mater. Sci. Ed.
- Vol. 37 (3) , 475-481
Mechanical Performance and Micro-structure of Pore Steel Slag Block Prepared by Accelerated Carbonation
- 10 June 2022
- Published by Springer Nature in Journal of Wuhan University of Technology-Mater. Sci. Ed.
- Vol. 37 (3) , 475-481
Mechanical Performance and Micro-structure of Pore Steel Slag Block Prepared by Accelerated Carbonation
- 9 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Fully Dynamic k-Center Clustering with Improved Memory Efficiency
Static and dynamic clustering algorithms are a fundamental tool in any machine learning library. Most of the efforts in developing dynamic machine learning and data mining algorithms have been focusing on the sliding window model (where at any given point in time only the most recent data items are retained) or more simplistic models. However, in many real-world applications one might need to deal with arbitrary deletions and insertions. We develop a $(2+\epsilon)$ -approximation algorithm for the k-center clustering problem with ``small'' amortized cost under the fully dynamic adversarial model. In such a model, points can be added or removed arbitrarily, provided that the adversary does not have access to the random choices of our algorithm. The amortized cost of our algorithm is poly-logarithmic when the ratio between the maximum and minimum distance between any two points in input is bounded by a polynomial, while k and ϵ are constant. Furthermore, we significantly improve the memory requirement of our fully dynamic algorithm, although at the cost of a worse approximation ratio of $4 +\epsilon$ . Our theoretical results are complemented with an extensive experimental evaluation on dynamic data from Twitter, Flickr, as well as trajectory data, demonstrating the effectiveness of our approach- 9 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Fully Dynamic k-Center Clustering with Improved Memory Efficiency
Static and dynamic clustering algorithms are a fundamental tool in any machine learning library. Most of the efforts in developing dynamic machine learning and data mining algorithms have been focusing on the sliding window model (where at any given point in time only the most recent data items are retained) or more simplistic models. However, in many real-world applications one might need to deal with arbitrary deletions and insertions. We develop a $(2+\epsilon)$ -approximation algorithm for the k-center clustering problem with ``small'' amortized cost under the fully dynamic adversarial model. In such a model, points can be added or removed arbitrarily, provided that the adversary does not have access to the random choices of our algorithm. The amortized cost of our algorithm is poly-logarithmic when the ratio between the maximum and minimum distance between any two points in input is bounded by a polynomial, while k and ϵ are constant. Furthermore, we significantly improve the memory requirement of our fully dynamic algorithm, although at the cost of a worse approximation ratio of $4 +\epsilon$ . Our theoretical results are complemented with an extensive experimental evaluation on dynamic data from Twitter, Flickr, as well as trajectory data, demonstrating the effectiveness of our approach- 9 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 32 (3) , 506-518
Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass
We revisit semi-supervised learning on hypergraphs. Same as previous approaches, our method uses a convex program whose objective function is not everywhere differentiable. We exploit the non-uniqueness of the optimal solutions, and consider confidence intervals which give the exact ranges that unlabeled vertices take in any optimal solution. Moreover, we give a much simpler approach for solving the convex program based on the subgradient method. Our experiments on real-world datasets confirm that our confidence interval approach on hypergraphs outperforms existing methods, and our subgradient method gives faster running times when the number of vertices is much larger than the number of edges. Our experiments also support that using directed hypergraphs to capture causal relationships can improve the prediction accuracy. Furthermore, our model can be readily extended to capture multiclass learning.
- 9 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 32 (3) , 506-518
Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass
We revisit semi-supervised learning on hypergraphs. Same as previous approaches, our method uses a convex program whose objective function is not everywhere differentiable. We exploit the non-uniqueness of the optimal solutions, and consider confidence intervals which give the exact ranges that unlabeled vertices take in any optimal solution. Moreover, we give a much simpler approach for solving the convex program based on the subgradient method. Our experiments on real-world datasets confirm that our confidence interval approach on hypergraphs outperforms existing methods, and our subgradient method gives faster running times when the number of vertices is much larger than the number of edges. Our experiments also support that using directed hypergraphs to capture causal relationships can improve the prediction accuracy. Furthermore, our model can be readily extended to capture multiclass learning.
- Open Access
A PTAS for the Steiner Forest Problem in Doubling Metrics
We achieve a (randomized) polynomial-time approximation scheme (PTAS) for the Steiner Forest Problem in doubling metrics. Before our work, a PTAS is given only for the Euclidean plane in [FOCS 2008: Borradaile, Klein and Mathieu]. Our PTAS also shares similarities with the dynamic programming for sparse instances used in [STOC 2012: Bartal, Gottlieb and Krauthgamer] and [SODA 2016: Chan and Jiang]. However, extending previous approaches requires overcoming several non-trivial hurdles, and we make the following technical contributions. (1) We prove a technical lemma showing that Steiner points have to be "near" the terminals in an optimal Steiner tree. This enables us to define a heuristic to estimate the local behavior of the optimal solution, even though the Steiner points are unknown in advance. This lemma also generalizes previous results in the Euclidean plane, and may be of independent interest for related problems involving Steiner points. (2) We develop a novel algorithmic technique known as "adaptive cells" to overcome the difficulty of keeping track of multiple components in a solution. Our idea is based on but significantly different from the previously proposed "uniform cells" in the FOCS 2008 paper, whose techniques cannot be readily applied to doubling metrics.
Open AccessA PTAS for the Steiner Forest Problem in Doubling Metrics
We achieve a (randomized) polynomial-time approximation scheme (PTAS) for the Steiner Forest Problem in doubling metrics. Before our work, a PTAS is given only for the Euclidean plane in [FOCS 2008: Borradaile, Klein and Mathieu]. Our PTAS also shares similarities with the dynamic programming for sparse instances used in [STOC 2012: Bartal, Gottlieb and Krauthgamer] and [SODA 2016: Chan and Jiang]. However, extending previous approaches requires overcoming several non-trivial hurdles, and we make the following technical contributions. (1) We prove a technical lemma showing that Steiner points have to be "near" the terminals in an optimal Steiner tree. This enables us to define a heuristic to estimate the local behavior of the optimal solution, even though the Steiner points are unknown in advance. This lemma also generalizes previous results in the Euclidean plane, and may be of independent interest for related problems involving Steiner points. (2) We develop a novel algorithmic technique known as "adaptive cells" to overcome the difficulty of keeping track of multiple components in a solution. Our idea is based on but significantly different from the previously proposed "uniform cells" in the FOCS 2008 paper, whose techniques cannot be readily applied to doubling metrics.
- 1 December 2014
- Published by Elsevier in Construction and Building Materials
- Vol. 73, 145-152
Bond behavior of roughing FRP sheet bonded to concrete substrate
- 1 December 2014
- Published by Elsevier in Construction and Building Materials
- Vol. 73, 145-152
Bond behavior of roughing FRP sheet bonded to concrete substrate
- 12 June 2010
- Published by Springer Nature in Journal of Wuhan University of Technology-Mater. Sci. Ed.
- Vol. 25 (3) , 504-508
Relationship between autogenous deformation and internal relative humidity of high-strength expansive concrete
- 12 June 2010
- Published by Springer Nature in Journal of Wuhan University of Technology-Mater. Sci. Ed.
- Vol. 25 (3) , 504-508
Relationship between autogenous deformation and internal relative humidity of high-strength expansive concrete