Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Contemporary Mathematics and Applications (ConMathA)

Implementation of K-Means and Single Linkage on Types of Disabilities in East Java Province Putri Amaningsih; Tony Yulianto; Faisol; Rica Amalia
Contemporary Mathematics and Applications (ConMathA) Vol. 6 No. 2 (2024)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v6i2.58513

Abstract

The high number of people with disabilities is one of the problems faced by the Indonesian government, especially in Java Province. After West Java Province, East Java Province is in second place as the province with the highest rate of people with disabilities in Indonesia. Disabled people are people with physical disabilities such as not being able to walk, not being able to talk, not being able to see, and so on. The aim of this research is to group districts in East Java Province based on types of disabilities with the hope of facilitating activities in fulfilling the rights of people with disabilities in East Java Province. The grouping was carried out in order to determine the characteristics of each cluster using so that the optimal k-means method was used for clustering using the Euclidean distance method with cluster 1 in 29 districts and cluster 2 in 9 districts. The most optimal single linkage uses the Euclidean distance method with cluster 1 having 8 districts and cluster 2 having 30 districts. From the results of the validity index values, it was found that the single linkage method had the smallest validity value of the icdrate method compared to the k-means method.
Comparison of Double Exponential Smoothing and Double Moving Average for Forecasting Lost Vehicle Registration Certificates in Pamekasan Ramadani, Nia; Faisol; Kuzairi; Amalia, Rica
Contemporary Mathematics and Applications (ConMathA) Vol. 7 No. 2 (2025)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v7i2.70201

Abstract

The government issues the Vehicle Registration Certificate (STNK), an official document that certifies a motorized vehicle's identity and authenticity. Pamekasan Regency is one of the regencies in East Java Province that frequently suffers losses associated with Vehicle Registration Certificates (STNK). Consequently, it is essential to predict the amount of car registration losses so that the Pamekasan regional administration can use the information to lower the losses. The Double Exponential Smoothing and Double Moving Average techniques were used in this study to forecast the amount of vehicle registration losses. According to the research findings, the smoothing parameters ? = 0.3 and ? = 0.025 had the lowest MAPE value from the Double Exponential Smoothing method, with a MAPE value of 49.4082%. The double moving average method's smallest MAPE, ? = 3, has a MAPE value of 31.53215%. The twofold moving average approach is the best way to forecast the loss of car registration in Pamekasan, according to the comparison's findings.
Dimensi Partisi pada Graf Hasil Operasi Korona Tingkat-k Amalia, Rica; Ummi Nur Yatun Hasanah; Faisol; Tony Yulianto; Kuzairi
Contemporary Mathematics and Applications (ConMathA) Vol. 6 No. 1 (2024)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v6i1.54748

Abstract

Graph theory is one of the subjects in Discrete Mathematics that have long been known and are widely applied in various fields. The topics that are often discussed in graph theory include labeling, coloring, chromatic numbers, metric dimensions, and partition dimensions. Partition dimensions are obtained by grouping all the vertices on the graph into a number of partition classes, then determine the distance of all vertices to each partition class to get a representation. Partition class which representations have different coordinate vectors is called resolving partition. The minimum cardinality of resolving partition is called partition dimensions of the graph. The purpose of this study is to determine the partition dimensions of level corona operation graphs which are GʘkPm, GʘkCm and GʘkKm, where G, Pm, Cm and Km are connected non trivial graph, path graph, circle graph and complete graph respectively, and any integer k≥1.