ABSTRACT
Without question, astronomy is about Big Data and clustering is a very common task over astronomy domain. The expectation-maximization algorithm is among the top 10 data mining algorithms used in scientific and industrial applications, however, we observe that astronomical community does not make use of it as a clustering algorithm. In this work, we cluster $\sim$ 1M stellar objects (simulated Galactic spectral data) via the traditional expectation-maximization algorithm for clustering (EM-T) and our extended EM-T algorithm that we call EM* and present the experimental results.
- Mark Jenne, Owen Boberg, Hasan Kurban, and Mehmet Dalkilic. 2014. Studying the milky way galaxy using paraheap-k. Computer, Vol. 47, 9 (2014), 26--33. Google ScholarDigital Library
- Hasan Kurban, Mark Jenne, and Mehmet M Dalkilic. 2016. EM*: An EM Algorithm for Big Data. In Data Science and Advanced Analytics (DSAA), 2016 IEEE International Conference on. IEEE, 312--320.Google ScholarCross Ref
- Hasan Kurban, Mark Jenne, and Mehmet M Dalkilic. 2017. Using data to build a better EM: EM* for big data. International Journal of Data Science and Analytics (2017), 1--15.Google Scholar
Index Terms
- Case Study: Clustering Big Stellar Data with EM*
Recommendations
Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance
Abstract The present work proposes hybridization of Expectation-Maximization EM and K-means techniques as an attempt to speed-up the clustering process. Even though both the K-means and EM techniques look into different areas, K-means can be viewed as ...
Parallel Implementation of Density Peaks Clustering Algorithm Based on Spark
Clustering algorithm is widely used in data mining. It attempt to classify elements into several clusters, and the elements in the same cluster are more similar to each other meanwhile the elements belonging to other clusters are not similar. The ...
k-Means Performance Improvements with Centroid Calculation Heuristics Both for Serial and Parallel Environments
BIGDATACONGRESS '15: Proceedings of the 2015 IEEE International Congress on Big DataK-means is the most widely used clustering algorithm due to its fairly straightforward implementations in various problems. Meanwhile, when the number of clusters increase, the number of iterations also tend to slightly increase. However there are still ...
Comments