cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
jurnalmantik@gmail.com
Editorial Address
Mathematics Department, Faculty of Science and Technology UIN Sunan Ampel Surabaya Jl. A. Yani no 117 Surabaya, Jawa Timur, Indonesia
Location
Kota surabaya,
Jawa timur
INDONESIA
Jurnal Matematika: MANTIK
ISSN : 25273159     EISSN : 25273167     DOI : 10.15642/mantik
Core Subject : Education,
Jurnal Matematika MANTIK is a mathematical journal published biannually by the Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya. Journal includes research papers, literature studies, analysis, and problem-solving in Mathematics (Algebra, Analysis, Statistics, Computing and Applied).
Arjuna Subject : -
Articles 8 Documents
Search results for , issue "Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics" : 8 Documents clear
Sebuah Aplikasi Metode Hybrid Forecasting Singular Spectrum Analysis – Extreme Learning Machine pada Peramalan Wisatawan Mancanegara Muhammad Fajar
Jurnal Matematika MANTIK Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (492.833 KB) | DOI: 10.15642/mantik.2019.5.2.60-68

Abstract

International tourism is one indicator of measuring tourism development. Tourism development is important for the national economy since tourism could boost foreign exchange, create business opportunities, and provide employment opportunities. The prediction of foreign tourist numbers in the future obtained from forecasting is used as an input parameter for strategy and tourism programs planning. In this paper, the Hybrid Singular Spectrum Analysis – Extreme Learning Machine (SSA-ELM) is used to forecast the number of foreign tourists. Data used is the number of foreign tourists January 1980 - December 2017 taken from Badan Pusat Statistik (Statistics Indonesia). The result of this research concludes that Hybrid SSA-ELM performance is very good at forecasting the number of foreign tourists. It is shown by the MAPE value of 4.91 percent with eight observations out a sample.
Model Indeks Harga Saham Gabungan menggunakan Artificial Neural Network dan Multivariate Adaptive Regression Spline Mutia Yollanda; Dodi Devianto; Putri Permathasari
Jurnal Matematika MANTIK Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15642/mantik.2019.5.2.112-122

Abstract

The Indonesian Composite Stock Price Index is an indicator of changes in stock prices are a guide for investors to invest in reducing risk. Fluctuations in stock data tend to violate the assumptions of normality, homoscedasticity, autocorrelation, and multicollinearity. This problem can be overcome by modelling the Composite Stock Price Index uses an artificial neural network (ANN) and multivariate adaptive regression spline (MARS). In this study, the time-series data from the Composite Stock Price Index starting in April 2003 to March 2018 with its predictor variables are crude oil prices, interest rates, inflation, exchange rates, gold prices, Down Jones, and Nikkei 225. Based on the coefficient of determination, the determination coefficient of ANN is 0.98925, and the MARS determination coefficient is 0.99427. While based on the MAPE value, MAPE value of ANN was obtained, namely 6.16383 and MAPE value of MARS, which was 4.51372. This means that the ANN method and the good MARS method are used to forecast the value of the Indonesian Composite Stock Index in the future, but the MARS method shows the accuracy of the model is slightly better than ANN.
Application of Expectation-Maximization (EM) Algorithm in Grouping Popularity Tourism Objects in Malang Raya Based on Indicator of Many Visitors Nur Atikah
Jurnal Matematika MANTIK Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (284.161 KB) | DOI: 10.15642/mantik.2019.5.2.123-134

Abstract

Malang Metropolitan Area is one of the areas in East Java which is a leading tourism destination in Indonesia with Batu Tourism City (Kota Wisata Batu) as the center. Considering the development of tourism in Malang, it is necessary to do a grouping of the popularity of tourism objects so that it can be used as a reference for making policy by the tourism department and tourism management. In this article, the grouping is analyzed by using the method of grouping the Expectation Maximation (EM) algorithm. The data used is secondary data obtained from BPS data, namely data of many tourism visitors in Malang Raya. The results of the grouping the popularity of leading tourism objects in Malang are based on indicators of the number of visitors divided into five groups, there are Group 1: Selecta; Group 2: Balekambang, Pemandian Wendit and Wisata Oleh-Oleh Brawijaya; Group3: Museum Angkut, Coban Rondo, Museum Satwa, Jatim Park, BNS, Petik Apel “Makmur Abadi and Agro Kebun Teh Wonosari; Group 4: Kusuma Agro Wisata, Kampoeng Kidz, Air Panas Cangar, Eco Green Park, Predator Fun Park, Wana Wisata Coban Rais, Gunung Banyak, Mahajaya T-Shirt & Oleh-oleh, Ngliyep and Bendungan Selorejo; Group 5: Vihara “Dammadhipa Arama”, Rafting “Kaliwatu”, Batu Rafting, Wana Wisata Coban Talun, Pemandian Tirta Nirwana, Pemandian Air Panas Alam Songgoriti, Wonderland Waterpark, Sahabat Air Rafting, Petik Apel Mandiri, Batu Agro Apel, Kampung Wisata.
The Local Antimagic On Disjoint Union of Some Family Graphs Marsidi Marsidi; Ika Hesti Agustin
Jurnal Matematika MANTIK Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (274.121 KB) | DOI: 10.15642/mantik.2019.5.2.69-75

Abstract

A graph in this paper is nontrivial, finite, connected, simple, and undirected. Graph consists of a vertex set and edge set. Let u,v be two elements in vertex set, and q is the cardinality of edge set in G, a bijective function from the edge set to the first q natural number is called a vertex local antimagic edge labelling if for any two adjacent vertices and , the weight of is not equal with the weight of , where the weight of (denoted by ) is the sum of labels of edges that are incident to . Furthermore, any vertex local antimagic edge labelling induces a proper vertex colouring on where is the colour on the vertex . The vertex local antimagic chromatic number is the minimum number of colours taken over all colourings induced by vertex local antimagic edge labelling of . In this paper, we discuss about the vertex local antimagic chromatic number on disjoint union of some family graphs, namely path, cycle, star, and friendship, and also determine the lower bound of vertex local antimagic chromatic number of disjoint union graphs. The chromatic numbers of disjoint union graph in this paper attend the lower bound.
Lemma Schanuel di Modul P-Miskin Iqbal Maulana
Jurnal Matematika MANTIK Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (300.76 KB) | DOI: 10.15642/mantik.2019.5.2.76-82

Abstract

Modules are a generalization of the vector spaces of linear algebra in which the “scalars” are allowed to be from a ring with identity, rather than a field. In module theory there is a concept about projective module, i.e. a module over ring R in which it is projective module relative to all modules over ring R. Next, there is the fact that every module over ring R is projective module relative to all semisimple modules over ring R. If P is a module over ring R which it’s projective relative only to all semisimple modules over ring R, then P is called p-poor module. In the discussion of the projective module, there is a lemma associated with the equivalence of two modules K1 and K2 provided that there are two projective modules P1 and P2 such that is isomorphic to . That lemma is known as Schanuel’s lemma in projective modules. Because the p-poor module is a special case of the projective module, then in this paper will be discussed about Schanuel’s lemma in p-poor modules
K-Nearest Neighbor untuk Pengenalan karakter tulisan arab Muhammad Athoillah
Jurnal Matematika MANTIK Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (289.195 KB) | DOI: 10.15642/mantik.2019.5.2.83-89

Abstract

Handwritten text recognition is the ability of a system to recognize human handwritten and convert it into digital text. Handwritten text recognition is a form of classification problem, so a classification algorithm such as Nearest Neighbor (NN) is needed to solve it. NN algorithms is a simple algorithm yet provide a good result. In contrast with other algorithms that usually determined by some hypothesis class, NN Algorithm finds out a label on any test point without searching for a predictor within some predefined class of functions. Arabic is one of the most important languages in the world. Recognizing Arabic character is very interesting research, not only it is a primary language that used in Islam but also because the number of this research is still far behind the number of recognizing handwritten Latin or Chinese research. Due to that's the background, this framework built a system to recognize handwritten Arabic Character from an image dataset using the NN algorithm. The result showed that the proposed method could recognize the characters very well confirmed by its average of precision, recall and accuracy.
Comparison of Kernel Function on Support Vector Machine in Classification of Childbirth Putroue Keumala Intan
Jurnal Matematika MANTIK Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (339.123 KB) | DOI: 10.15642/mantik.2019.5.2.90-99

Abstract

The maternal mortality rate during childbirth can be reduced through the efforts of the medical team in determining the childbirth process that must be undertaken immediately. Machine learning in terms of classifying childbirth can be a solution for the medical team in determining the childbirth process. One of the classification methods that can be used is the Support Vector Machine (SVM) method which is able to determine a hyperplane that will form a good decision boundary so that it is able to classify data appropriately. In SVM, there is a kernel function that is useful for solving non-linear classification cases by transforming data to a higher dimension. In this study, four kernel functions will be used; Linear, Radial Basis Function (RBF), Polynomial, and Sigmoid in the classification process of childbirth in order to determine the kernel function that is capable of producing the highest accuracy value. Based on research that has been done, it is obtained that the accuracy value generated by SVM with linear kernel functions is higher than the other kernel functions.
Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes Bib Paruhum Silalahi; Nurul Fathiah; Prapto Tri Supriyo
Jurnal Matematika MANTIK Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (406.991 KB) | DOI: 10.15642/mantik.2019.5.2.100-111

Abstract

Ant Colony Optimization is one of the meta-heuristic methods used to solve combinatorial optimization problems that are quite difficult. Ant Colony Optimization algorithm is inspired by ant behavior in the real world to build the shortest path between food sources and their nests. Traveling Salesman Problem is a problem in optimization. Traveling Salesman Problem is a problem to find the minimum distance from the initial node to the whole node with each node must be visited exactly once and must return to the initial node. Traveling Salesman Problem is a non-deterministic polynomial-time complete problem. This research discusses the solution of the Traveling Salesman Problem using the Ant Colony Optimization algorithm and also using the exact algorithm. The results showed that the greater the size of the Traveling Salesman Problem case, the longer the execution time required. The results also showed that the execution times of the Ant Colony Optimization are much faster than the execution time of the exact method.

Page 1 of 1 | Total Record : 8