Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

H. P. Lee

dblp:54/5255 · DBLP profile ↗
← Back
10ranked-venue papers
0as first author
0since 2021 · last 2008
0000-0001-9960-0310ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6Databases, data management, data science and information retrieval · 2Theory of computation · 2Applied, interdisciplinary, general and emerging computing · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Motion planning and robot control · 56% Robot manipulation · 44%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › trajectory optimization
joint torque optimization
0.011995
Local optimization of weighted joint torques for redundant robotic manipulators · IEEE Trans. Robotics Autom. 1995
Robotics › Robot manipulation
redundant manipulator
0.011995
Local optimization of weighted joint torques for redundant robotic manipulators · IEEE Trans. Robotics Autom. 1995
Bioinformatics and computational biology
survival analysis
0.011992
Covariance adjustment of survival curves based on Cox's proportional hazards regression model · Comput. Appl. Biosci. 1992
Robotics › Motion planning and robot control › manipulator control
null space control
0.011995
Local optimization of weighted joint torques for redundant robotic manipulators · IEEE Trans. Robotics Autom. 1995

Methods — techniques the papers use, named apart from their topics

weighted projection operator · 0.0jacobian null space analysis · 0.0cox proportional hazards regression · 0.0corrected group prognostic curves · 0.0
YearPublicationVenuePosition
2008 Ant colony intelligence in multi-agent dynamic manufacturing scheduling
W. Xiang, H. P. Lee
Eng. Appl. Artif. Intell.2
2007 Particle swarm optimization-based algorithms for TSP and generalized TSP
Xiaohu Shi, Yanchun Liang 0001, H. P. Lee, C. Lu, Q. X. Wang
Inf. Process. Lett.3
2006 Developing parallel sequential minimal optimization for fast training support vector machine
Lijuan Cao, S. Sathiya Keerthi, Chong Jin Ong, P. Uvaraj, Xiuju Fu, H. P. Lee
Neurocomputing6
2006 Parallel sequential minimal optimization for the training of support vector machines
abstract
Sequential minimal optimization (SMO) is one popular algorithm for training support vector machine (SVM), but it still requires a large amount of computation time for solving large size problems. This paper proposes one parallel implementation of SMO for training SVM. The parallel SMO is developed using message passing interface (MPI). Specifically, the parallel SMO first partitions the entire training data set into smaller subsets and then simultaneously runs multiple CPU processors to deal with each of the partitioned data sets. Experiments show that there is great speedup on the adult data set and the Mixing National Institute of Standard and Technology (MNIST) data set when many processors are used. There are also satisfactory results on the Web data set.
Lijuan Cao, S. Sathiya Keerthi, Chong Jin Ong, J. Q. Zhang, U. Periyathamby, Xiuju Fu, H. P. Lee
IEEE Trans. Neural Networks7
2005 An improved GA and a novel PSO-GA-based hybrid algorithm
Xiaohu Shi, Yanchun Liang 0001, H. P. Lee, Chun Lu, L. M. Wang
Inf. Process. Lett.3
2005 Optimal partition algorithm of the RBF neural network and its application to financial time series forecasting
Y. F. Sun, Yanchun Liang 0001, W. L. Zhang, H. P. Lee, W. Z. Lin, Lijuan Cao
Neural Comput. Appl.4
2004 Bus maintenance scheduling using multi-agent systems
Rong Zhou 0004, B. Fox, H. P. Lee, Andrew Y. C. Nee
Eng. Appl. Artif. Intell.3
1997 Blind restoration of images degraded by space-variant blurs using iterative algorithms for both blur identification and image restoration
Y. P. Guo, H. P. Lee, C. L. Teo
Image Vis. Comput.2
1995 Local optimization of weighted joint torques for redundant robotic manipulators
abstract
In this article, stable local solutions with global characteristics are developed for the weighted joint torque optimization in redundant manipulator. Conditions for these symmetric weight matrices are found that can guarantee that the local optimization of joint torque weighted by these matrices will have the same stability and optimality as the local optimization for the inertia inverse weighted joint torque. The symbolic results of the weighted projection operator of Jacobian matrix are also derived. It is also proposed that the weight matrix plays an important role in avoiding instabilities by relating the null space of the Jacobian matrix to what the authors termed an effective null space of J.>
C. L. Teo, H. P. Lee
IEEE Trans. Robotics Autom.3
1992 Covariance adjustment of survival curves based on Cox's proportional hazards regression model
abstract
Cox's proportional hazards regression model is a useful statistical tool for the analysis of 'survival data' from longitudinal studies. This multivariate method compares the 'survival experience' between two or more exposure groups while allowing for simultaneous adjustment of confounding due to one or more covariates. In addition to the summary regression statistics, further insight on the exposure--response relationship can be gained by visually examining the covariates-adjusted survival curves in the respective comparison groups. Covariates-adjusted survival curves are usually computed by the 'average covariate method'. This method is, however, subject to potential drawbacks. A method that avoids these drawbacks is to estimate adjusted survival curves by the corrected group prognostic curves approach. We have written a computer program to construct survival curves by the latter method. The program is coded in the Interactive Matrix Language of SAS.
Carl Yoshizawa, Lynne R. Wilkens, H. P. Lee
Comput. Appl. Biosci.4