Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Natural Science: Journal of Science and Technology

RANCANG BANGUN SISTEM KLASIFIKASI STATUS GIZI BALITA MENGGUNAKAN METODE K-NEAREST NEIGHBOR (KNN) Amalia, Rizki; Musdalifah, Selvy; Hendra, Andi; Sudarsana, I Wayan
Natural Science: Journal of Science and Technology Vol 2, No 2 (2013): Volume 2 Number 2 (August 2013)
Publisher : Univ. Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Children under five age is a group that susceptible to health problems such as lack of energy and protein nutrition, so this age group should get special attentions. One of the problems that should get an attention is problems nutritional status of children. Nutritional status of children is one of the indicators the level of social welfare. The classification of children?s nutritional status was conducted by nutritionist, but the problem is the scattering of nutritionist in Palu is very limited, especially in areas which far away from the city center. This case of study will be taken from Pantoloan Boya village. The limited of nutritionist was being the problems in detecting the indication of malnutrition. Through this research will be made an implementation based of computer system that has a same understanding as a nutritionist who is able to determine the nutritional status of children. One method that can be used in solving the classification of the nutritional status of children is K-Nearest Neighbor (KNN) method. K-Nearest Neighbor (KNN) is one method that use the learning algorithm where the result from the new testing sample is classified based on the majority of KNN?s category. In this research, the system classified the children according to their nutritional status based on data that obtained from the place of research. These results using k = 1 as the number of nearest neighbors which labels the majority of the k nearest neighbors are used to predict the unknown nutritional status of new data. This is because for k = 1 has better accuracy results than other values ??of k is equal to 81.67%.
PELABELAN TOTAL SISI AJAIB SUPER (TSAS) PADA GABUNGAN GRAF ULAT BULU DAN BIPARTITE LENGKAP Sudarsana, I Wayan; Fitria, Fitria; Musdalifah, Selvy
Natural Science: Journal of Science and Technology Vol 3, No 1 (2014): Volume 3 Number 1 (March 2014)
Publisher : Univ. Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (799.749 KB)

Abstract

An  edge anti-magic total labelling, -EAMT, on graph  with  vertices and  edges is bijektion , which has a set of edge weights  with  and . A  super edge anti-magic total labelling , -SEAMT, if the vertex set of  obtain the smallest labels . An -EAMT (SEAMT) labelling  is called EMT (SEMT) labelling if  and . Furthermore,  is called the magic constant. A graph  is said EMT, SEMT, -EAMT and -SEAMT if there is EMT, SEMT, -EAMT and -SEAMT labelling on graph , respectively. In this paper, we showed that the union of caterpillars and complete bipartite graph are SEAMT and SEMT, especialy for  has (-SEAMT and -SEAMT with ; graph  has -SEAMT and -SEAMT for ; and graph  has -SEAMT and -SEAMT with       where  and  for . Thus, graph  is SEMT with  for ; graph  also SEMT with  for ; as well graph  is SEMT with  for .
PELABELAN TOTAL SISI AJAIB SUPER (TSAS) PADA GABUNGAN GRAF BINTANG GANDA DAN LINTASAN Sudarsana, I Wayan; Noviana, Noviana; Musdalifah, Selvy; Kasim, Anita Ahmad
Natural Science: Journal of Science and Technology Vol 2, No 1 (2013): Volume 2 Number 1 (March 2013)
Publisher : Univ. Tadulako

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (694.968 KB)

Abstract

An edge-magic total (EMT) labeling on a graph G(V,E) with the vertex set V and the edge set E, where |V| = p and |E| = q, is a bijective function ?: V E {1, 2, 3, ..., p + q} with the property that for each edge (xy) of G, ?(x) + ?(xy) + ?(y) = k, for a fixed positive integer k. The labeling ? is called a super edge magic total (SEMT) if it has the property that for each vertex obtain the smallest label, (V) = {1, 2, ..., p}. A graph G(V,E) is called EMT (SEMT) if there exists an EMT (SEMT) labeling on G. Study on SEMT labeling for the union of stars and paths initiated by Figueroa-Centeno et al. [2] with graph form . Furthermore, an investigation will be conducted on SEMT labeling of double stars and path, that are 2 ; 2 ;    2  and 2 . We obtain that the graphs presented above are SEMT with the magic constants k = , , and , respectively