EUVIMEDEUVIMED entdecken
Crossref

HASTA

Shuliang Wang, Yasen Chen

International Journal of Data Warehousing and Mining · 2014

DOI: 10.4018/ijdwm.2014040103 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Data Warehousing and Mining, 2014. Verfasst von Shuliang Wang und 1 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 20 Literaturangaben.

AbstractBibliografische AngabenZitieren

Abstract (Originalsprache)

In this paper, a novel clustering algorithm, HASTA (HierArchical-grid cluStering based on daTA field), is proposed to model the dataset as a data field by assigning all the data objects into qusantized grids. Clustering centers of HASTA are defined to locate where the maximum value of local potential is. Edges of cluster in HASTA are identified by analyzing the first-order partial derivative of potential value, thus the full size of arbitrary shaped clusters can be detected. The experimented case demonstrates that HASTA performs effectively upon different datasets and can find out clusters of arbitrary shapes in noisy circumstance. Besides those, HASTA does not force users to preset the exact amount of clusters inside dataset. Furthermore, HASTA is insensitive to the order of data input. The time complexity of HASTA achieves O(n). Those advantages will potentially benefit the mining of big data.

Zitieren

APA

Wang, S., & Chen, Y. (2014). HASTA. International Journal of Data Warehousing and Mining. https://doi.org/10.4018/ijdwm.2014040103

Vancouver

Wang S, Chen Y. HASTA. International Journal of Data Warehousing and Mining. 2014. doi:10.4018/ijdwm.2014040103

BibTeX
@article{Wang2014,
  author = {Wang, Shuliang and Chen, Yasen},
  title = {HASTA},
  journal = {International Journal of Data Warehousing and Mining},
  year = {2014},
  doi = {10.4018/ijdwm.2014040103}
}
Kostenlos starten →