Application Of Density-Based Clustering Approaches For Stock Market Analysis

被引:0
|
作者
Das, Tanuja [1 ]
Halder, Anindya [2 ]
Saha, Goutam [3 ]
机构
[1] Gauhati Univ Inst Sci & Technol, Dept Informat Technol, Gauhati, Assam, India
[2] North Eastern Hill Univ, Sch Technol, Dept Comp Applicat, Tura Campus, Tura 794002, Meghalaya, India
[3] North Eastern Hill Univ, Sch Technol, Dept Informat Technol, Shillong, Meghalaya, India
关键词
PORTFOLIO OPTIMIZATION; GENETIC ALGORITHM; VOLATILITY; CHALLENGES; INDEXES;
D O I
10.1080/08839514.2024.2321550
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Present economy is largely dependent on the precise forecasting of the business avenues using the stock market data. As the stock market data falls under the category of big data, the task of handling becomes complex due to the presence of a large number of investment choices. In this paper, investigations have been carried out on the stock market data analysis using various density-based clustering approaches. For experimentation purpose, the stock market data from Quandl stock market was used. It was observed that the effectiveness of Dynamic Quantum clustering approach were better. This is because it has better adopting capability according of changing patterns of the stock market data. Similarly performances of other density-based clustering approaches like Weighted Adaptive Mean Shift Clustering, DBSCAN and Expectation Maximization and also partitive clustering methods such as k-means, k-medoids and fuzzy c means were also experimented on the same stock market data. The performance of all the approaches was tested in terms of standard measures. It was found that in majority of the cases, Dynamic Quantum clustering outperforms the other density-based clustering approaches. The algorithms were also subjected to paired t-tests which also confirmed the statistical significance of the results obtained.
引用
收藏
页数:31
相关论文
共 50 条
  • [21] FULLY ADAPTIVE DENSITY-BASED CLUSTERING
    Steinwart, Ingo
    ANNALS OF STATISTICS, 2015, 43 (05): : 2132 - 2167
  • [22] Anytime parallel density-based clustering
    Mai, Son T.
    Assent, Ira
    Jacobsen, Jon
    Dieu, Martin Storgaard
    DATA MINING AND KNOWLEDGE DISCOVERY, 2018, 32 (04) : 1121 - 1176
  • [23] Fast density-based clustering algorithm
    Zhou, Shuigeng
    Zhou, Aoying
    Cao, Jing
    Hu, Yunfa
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2000, 37 (11): : 1287 - 1292
  • [24] The Framework of Relative Density-Based Clustering
    Cui, Zelin
    Shen, Hong
    PARALLEL ARCHITECTURE, ALGORITHM AND PROGRAMMING, PAAP 2017, 2017, 729 : 343 - 352
  • [25] Density-based clustering with differential privacy
    Wu, Fuyu
    Du, Mingjing
    Zhi, Qiang
    INFORMATION SCIENCES, 2024, 681
  • [26] An ensemble density-based clustering method
    Xia, Luning
    Jing, Jiwu
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND KNOWLEDGE ENGINEERING (ISKE 2007), 2007,
  • [27] Hierarchical density-based clustering of shapes
    Gautama, T
    Van Hulle, MM
    NEURAL NETWORKS FOR SIGNAL PROCESSING XI, 2001, : 213 - 222
  • [28] A varied density-based clustering algorithm
    Fahim, Ahmed
    JOURNAL OF COMPUTATIONAL SCIENCE, 2023, 66
  • [29] Feature Selection for Density-Based Clustering
    Ling, Yun
    Ye, Chongyi
    2009 INTERNATIONAL SYMPOSIUM ON INTELLIGENT UBIQUITOUS COMPUTING AND EDUCATION, 2009, : 226 - 229
  • [30] Deep density-based image clustering
    Ren, Yazhou
    Wang, Ni
    Li, Mingxia
    Xu, Zenglin
    KNOWLEDGE-BASED SYSTEMS, 2020, 197