期刊名称:Journal of Theoretical and Applied Information Technology
印刷版ISSN:1992-8645
电子版ISSN:1817-3195
出版年度:2015
卷号:71
期号:2
出版社:Journal of Theoretical and Applied
摘要:The note pattern of balungan gending can be used as a parameter reference in creating the gending made by the Javanese gamelan. A number of gending lancaran is used as sample of the experiment and notation as a dataset. The analysis is done by using apriori algorithm, because it can search for the similarity in attribute in a data. The complexity of time is a testing standard of an algorithm to obtain an efficient execution of time, the approach of an asymptotic analysis using the big-O concept is one of the techniques which are usually applied to test the complexity of an algorithm. This research analyse the complexity of time in the algorithm that is used to identify the note pair pattern of the gending lancaran.