Yan Zhuang

Yan Zhuang

Auto-generated profile, based on publicly available information

Yan Zhuang

Department of Computer and Information Science, University of Macau, Taipa, Macau SAR

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 August 2015 in Soft Computing
Verified
Journal Article
Closed access
PDF file
JLJinyan Li
Jinyan Li
Simon FongSimon Fong
Simon Fong
YZYan Zhuang
Yan Zhuang
RKRichard Khoury
Richard Khoury

30 October 2013 in BioMedical Engineering OnLine
Verified
Journal Article
Open access
PDF file
Simon FongSimon Fong
Simon Fong
YZYan Zhuang
Yan Zhuang
IFIztok Fister
Iztok Fister
A novel hand biometric authentication method based on measurements of the user’s stationary hand gesture of hand sign language is proposed. The measurement of hand gestures could be sequentially acquired by a low-cost video camera. There could possibly be another level of contextual information, associated with these hand signs to be used in biometric authentication. As an analogue, instead of typing a password ‘iloveu’ in text which is relatively vulnerable over a communication network, a signer can encode a biometric password using a sequence of hand signs, ‘i’ , ‘l’ , ‘o’ , ‘v’ , ‘e’ , and ‘u’. Subsequently the features from the hand gesture images are extracted which are integrally fuzzy in nature, to be recognized by a classification model for telling if this signer is who he claimed himself to be, by examining over his hand shape and the postures in doing those signs. It is believed that everybody has certain slight but unique behavioral characteristics in sign language, so are the different hand shape compositions. Simple and efficient image processing algorithms are used in hand sign recognition, including intensity profiling, color histogram and dimensionality analysis, coupled with several popular machine learning algorithms. Computer simulation is conducted for investigating the efficacy of this novel biometric authentication model which shows up to 93.75% recognition accuracy.

1 January 2014 in The Scientific World Journal
Verified
Journal Article
Open access
PDF file
Simon FongSimon Fong
Simon Fong
SDSuash Deb
Suash Deb
XYXin-She Yang
Xin-She Yang
YZYan Zhuang
Yan Zhuang
Traditional K-means clustering algorithms have the drawback of getting stuck at local optima that depend on the random values of initial centroids. Optimization algorithms have their advantages in guiding iterative computation to search for global optima while avoiding local optima. The algorithms help speed up the clustering process by converging into a global optimum early with multiple search agents in action. Inspired by nature, some contemporary optimization algorithms which include Ant, Bat, Cuckoo, Firefly, and Wolf search algorithms mimic the swarming behavior allowing them to cooperatively steer towards an optimal objective within a reasonable time. It is known that these so-called nature-inspired optimization algorithms have their own characteristics as well as pros and cons in different applications. When these algorithms are combined with K-means clustering mechanism for the sake of enhancing its clustering quality by avoiding local optima and finding global optima, the new hybrids are anticipated to produce unprecedented performance. In this paper, we report the results of our evaluation experiments on the integration of nature-inspired optimization methods into K-means algorithms. In addition to the standard evaluation metrics in evaluating clustering quality, the extended K-means algorithms that are empowered by nature-inspired optimization methods are applied on image segmentation as a case study of application scenario.

31 October 2016 in Advances in Fuzzy Systems
Verified
Journal Article
Open access
PDF file
MAMuhammad Afzaal
Muhammad Afzaal
MUMuhammad Usman
Muhammad Usman
AFA. C. M. Fong
A. C. M. Fong
Simon FongSimon Fong
Simon Fong
YZYan Zhuang
Yan Zhuang
Due to the large amount of opinions available on the websites, tourists are often overwhelmed with information and find it extremely difficult to use the available information to make a decision about the tourist places to visit. A number of opinion mining methods have been proposed in the past to identify and classify an opinion into positive or negative. Recently, aspect based opinion mining has been introduced which targets the various aspects present in the opinion text. A number of existing aspect based opinion classification methods are available in the literature but very limited research work has targeted the automatic aspect identification and extraction of implicit, infrequent, and coreferential aspects. Aspect based classification suffers from the presence of irrelevant sentences in a typical user review. Such sentences make the data noisy and degrade the classification accuracy of the machine learning algorithms. This paper presents a fuzzy aspect based opinion classification system which efficiently extracts aspects from user opinions and perform near to accurate classification. We conducted experiments on real world datasets to evaluate the effectiveness of our proposed system. Experimental results prove that the proposed system not only is effective in aspect extraction but also improves the classification accuracy.

28 November 2013 in Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
Simon FongSimon Fong
Simon Fong
YZYan Zhuang
Yan Zhuang
RTRui Tang
Rui Tang
Xin-She YangXin-She Yang
Xin-She Yang
SDSuash Deb
Suash Deb
Selecting the right set of features from data of high dimensionality for inducing an accurate classification model is a tough computational challenge. It is almost a NP-hard problem as the combinations of features escalate exponentially as the number of features increases. Unfortunately in data mining, as well as other engineering applications and bioinformatics, some data are described by a long array of features. Many feature subset selection algorithms have been proposed in the past, but not all of them are effective. Since it takes seemingly forever to use brute force in exhaustively trying every possible combination of features, stochastic optimization may be a solution. In this paper, we propose a new feature selection scheme called Swarm Search to find an optimal feature set by using metaheuristics. The advantage of Swarm Search is its flexibility in integrating any classifier into its fitness function and plugging in any metaheuristic algorithm to facilitate heuristic search. Simulation experiments are carried out by testing the Swarm Search over some high-dimensional datasets, with different classification algorithms and various metaheuristic algorithms. The comparative experiment results show that Swarm Search is able to attain relatively low error rates in classification without shrinking the size of the feature subset to its minimum.

9 January 2008 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
YZYan Zhuang
Yan Zhuang
Simon FongSimon Fong
Simon Fong
MSMeilin Shi
Meilin Shi