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
No edit summary |
No edit summary |
||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
[[Category:Publications on intuitionistic fuzzy sets in economics|{{PAGENAME}}]] | |||
[[Category:Publications on intuitionistic fuzzy sets|{{PAGENAME}}]] | [[Category:Publications on intuitionistic fuzzy sets|{{PAGENAME}}]] | ||
[[Category:Publications in Notes on IFS|{{PAGENAME}}]] | [[Category:Publications in Notes on IFS|{{PAGENAME}}]] | ||
Line 21: | Line 22: | ||
}} | }} | ||
{{issue/data | {{issue/data | ||
| conference = 25<sup>th</sup> [[ICIFS]], Sofia, 9—10 September 2022 | |||
| issue = [[Notes on Intuitionistic Fuzzy Sets/28/3|Notes on Intuitionistic Fuzzy Sets, Volume 28 (2022), Number 3]], pages 343–352 | | issue = [[Notes on Intuitionistic Fuzzy Sets/28/3|Notes on Intuitionistic Fuzzy Sets, Volume 28 (2022), Number 3]], pages 343–352 | ||
| doi = https://doi.org/10.7546/nifs.2022.28.3.343-352 | | doi = https://doi.org/10.7546/nifs.2022.28.3.343-352 | ||
| file = NIFS-28-3-343-352.pdf | | file = NIFS-28-3-343-352.pdf | ||
| format = PDF | | format = PDF | ||
| size = | | size = 914 | ||
| 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. |
Latest revision as of 15:44, 7 September 2022
shortcut
|
|