Please check our Instructions to Authors and send your manuscripts to nifs.journal@gmail.com. Next issue: September/October 2024.
Deadline for submissions: 16 November 2024.
Issue:Clustering stock price volatility using intuitionistic fuzzy sets: Difference between revisions
Jump to navigation
Jump to search
Created page with "{{PAGENAME}} {{PAGENAME}} {{PAGENAME}} {{issue/title | title = Clustering stock price volatility using intuitionistic fuzzy sets | shortcut = nifs/28/3/343-352 }} {{issue/author | author = Georgy Urumov | institution = School of Computer Science and Engineering, University of Westminster | address..." |
No edit summary |
||
Line 26: | Line 26: | ||
| format = PDF | | format = PDF | ||
| size = 937 | | size = 937 | ||
| abstract = Clustering involves gathering a collection of objects into homogeneous groups or clusters, such that objects in the same cluster are more similar when compared to objects present in other groups. Clustering algorithms that generate a tree of clusters called dendrogram which can be either divisive or agglomerative. The partitional clustering gives a single partition of objects, with a predefined K number of clusters. The most popular partition clustering approaches are: ''k''-means and fuzzy C-means (FCM). In ''k''-means clustering, data are divided into a number of clusters where data elements belong to exactly one cluster. The k-means clustering works well when data elements are well separable. To overcome the problem of non-separability, FCM and IFCM clustering algorithm were proposed. Here we review the use of FCM/IFCM with reference to the problem of market volatility. | | abstract = Clustering involves gathering a collection of objects into homogeneous groups or clusters, such that objects in the same cluster are more similar when compared to objects present in other groups. Clustering algorithms that generate a tree of clusters called dendrogram which can be either divisive or agglomerative. The partitional clustering gives a single partition of objects, with a predefined K number of clusters. The most popular partition clustering approaches are: ''k''-means and fuzzy C-means (FCM). In ''k''-means clustering, data are divided into a number of clusters where data elements belong to exactly one cluster. The ''k''-means clustering works well when data elements are well separable. To overcome the problem of non-separability, FCM and IFCM clustering algorithm were proposed. Here we review the use of FCM/IFCM with reference to the problem of market volatility. | ||
| keywords = K-Means, FCM, IFCM, Intuitionistic fuzzy sets, Volatility of Volatility. | | keywords = K-Means, FCM, IFCM, Intuitionistic fuzzy sets, Volatility of Volatility. | ||
| ams = 03E72, 68T20. | | ams = 03E72, 68T20. |
Revision as of 15:39, 7 September 2022
shortcut
|
|