Chuangyin Dang

Prof. Dr. Chuangyin Dang

Department of Systems Engineering and Engineering Management, City University of Hong Kong, Hong Kong

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

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

Representative Publications

View All Publications
1 March 2010 in Information Sciences
Verified
Journal Article
Closed access
YQYuhua Qian
Yuhua Qian
JLJiye Liang
Jiye Liang
YYYiyu Yao
Yiyu Yao
Chuangyin DangChuangyin Dang
Chuangyin Dang

1 June 2010 in Artificial Intelligence
Verified
Journal Article
Closed access
YQYuhua Qian
Yuhua Qian
JLJiye Liang
Jiye Liang
WPWitold Pedrycz
Witold Pedrycz
Chuangyin DangChuangyin Dang
Chuangyin Dang

3 March 2011 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XLXingwen Liu
Xingwen Liu
Chuangyin DangChuangyin Dang
Chuangyin Dang
This technical note addresses the stability problem of delayed positive switched linear systems whose subsystems are all positive. Both discrete-time systems and continuous-time systems are studied. In our analysis, the delays in systems can be unbounded. Under certain conditions, several stability results are established by constructing a sequence of functions that are positive, monotonically decreasing, and convergent to zero as time tends to infinity (additionally continuous for continuous-time systems). It turns out that these functions can serve as an upper bound of the systems' trajectories starting from a particular region. Finally, a numerical example is presented to illustrate the obtained results.

15 December 2009 in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
Verified
Journal Article
Closed access
YQYuhua Qian
Yuhua Qian
JLJiye Liang
Jiye Liang
Chuangyin DangChuangyin Dang
Chuangyin Dang
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of view, the classical rough-set theory is based on a single granulation. This correspondence paper first extends the rough-set model based on a tolerance relation to an incomplete rough-set model based on multigranulations, where set approximations are defined through using multiple tolerance relations on the universe. Then, several elementary measures are proposed for this rough-set framework, and a concept of approximation reduct is introduced to characterize the smallest attribute subset that preserves the lower approximation and upper approximation of all decision classes in this rough-set model. Finally, several key algorithms are designed for finding an approximation reduct.

1 July 2002 in International Journal of General Systems
Verified
Journal Article
Closed access
JLJiye Liang
Jiye Liang
KCK.S. Chin
K.S. Chin
Chuangyin DangChuangyin Dang
Chuangyin Dang
RYRichard C.M. Yam
Richard C.M. Yam
Based on the complement behavior of information gain, a new definition of information entropy is proposed along with its justification in rough set theory. Some properties of this definition imply those of Shannon's entropy. Based on the new information entropy, conditional entropy and mutual information are then introduced and applied to knowledge bases. The new information entropy is proved to also be a fuzzy entropy.

23 July 2012 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JLJiye Liang
Jiye Liang
FWFeng Wang
Feng Wang
Chuangyin DangChuangyin Dang
Chuangyin Dang
YQYuhua Qian
Yuhua Qian
Many real data increase dynamically in size. This phenomenon occurs in several fields including economics, population studies, and medical research. As an effective and efficient mechanism to deal with such data, incremental technique has been proposed in the literature and attracted much attention, which stimulates the result in this paper. When a group of objects are added to a decision table, we first introduce incremental mechanisms for three representative information entropies and then develop a group incremental rough feature selection algorithm based on information entropy. When multiple objects are added to a decision table, the algorithm aims to find the new feature subset in a much shorter time. Experiments have been carried out on eight UCI data sets and the experimental results show that the algorithm is effective and efficient.