An Improved HotSpot Algorithm and Its Application to Sandstorm Data in Inner Mongolia

Ren Qing-dao-er-ji, Rui Pang and Yue Chang

Mathematical Problems in Engineering, 2020, vol. 2020, 1-10

Abstract:

HotSpot is an algorithm that can directly mine association rules from real data. Aiming at the problem that the support threshold in the algorithm cannot be set accurately according to the actual scale of the dataset and needs to be set artificially according to experience, this paper proposes a dynamic optimization algorithm with minimum support threshold setting: S_HotSpot algorithm. The algorithm combines simulated annealing algorithm with HotSpot algorithm and uses the global search ability of simulated annealing algorithm to dynamically optimize the minimum support in the solution space. Finally, the Inner Mongolia sandstorm dataset is used for experiment while the wine quality dataset is used for verification, and the association rules screening indicators are set for the mining results. The results show that S_HotSpot algorithm can not only dynamically optimize the selection of support but also improve the quality of association rules as it is mining reasonable number of rules.

Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/4020723.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/4020723.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:4020723

DOI: 10.1155/2020/4020723

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().