Unsupervised Learning on Cosmic Ray Daily Harmonic Variations?Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 10)
Publication Date: 2014-10-30
Authors : Roopesh K. Dwivedi; P.K. Rai;
Page : 595-604
Keywords : Clustering; Data mining; K-mean; BIRCH; DBSCAN; Cosmic ray harmonic;
Clustering is division of data into groups of similar objects. From a machine learning perspective cluster correspond to hidden patterns. In unsupervised learning we find cluster to represent a data concept. Since scientific organizations also generate large volumes of data, the challenges are to analyze the data using the recent data mining techniques, so as to arrive at meaningful conclusions. For real life applications, we have used the hourly cosmic ray intensity data from 1965 to 2006 to first derive for each day, the amplitude and phase of the harmonics of the daily variation (r1, ?1, and r2, ?2). We have applied the k-mean partitioning algorithm, the agglomerative hierarchical clustering algorithm BIRCH, and the density based partitioning algorithm DBSCAN on the above set of daily data containing r1, ?1, and r2, ?2 for each day. Many interesting clusters have been identified. The cluster analysis indicates that a very clear-cut 10-11 year periodicity is observed in the harmonics dataset even when all the four attributes are considered together. Moreover, similar characteristics are repeated after a gap of 10-11 years and many years occurring in pairs in the two sets (out of the 4 sets, each of about 10-11 years) are the outlier years. The years 1996 and 1997 are particularly emphasized as outliers. These results are similar to that reported in literature, though by statistical methods and by considering only r1 and ?1 and not all the four attributes taken together. As such the superiority of the mining technique is revealed in the real life situations.
Other Latest Articles
Last modified: 2014-10-27 23:49:44