Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Vovan, Tai
Affiliations: College of Natural Science, Can Tho University, Can Tho, Vietnam | E-mail: [email protected]
Correspondence: [*] Corresponding author: College of Natural Science, Can Tho University, Can Tho, Vietnam. E-mail: [email protected].
Abstract: This study establishes the new results for Cluster Width of probability Density functions (CWD). There are the upper and lower bounds of CWD and the relationships of CWD to other measures in statistical discriminant. The CWD for two and more two probability density functions is determined in the different cases. Based on CWD, we propose a measure called similar coefficient to evaluate the quality of the established clusters. Furthermore, CWD is also used as a criterion to build two algorithms: to determine the suitable number of clusters and to analyse the fuzzy clusters. The numerical examples are given to illustrate the proposed algorithms and to prove their advantages over existing methods.
Keywords: Cluster, density, distance, fuzzy, width
DOI: 10.3233/IDA-173794
Journal: Intelligent Data Analysis, vol. 23, no. 2, pp. 385-405, 2019
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]