Detection of Disease and Pest of Kenaf Plant Based on Image Recognition with VGGNet19

One of the advantages of Kenaf fiber as an environmental management product that is currently in the center of attention is the use of Kenaf fiber for luxury car interiors with environmentally friendly plastic materials. The opportunity to export Kenaf fiber raw material will provide significant benefits, especially in the agricultural sector in Indonesia. However, there are problems in several areas of Kenaf's garden, namely plants that are attacked by diseases and pests, which cause reduced yields and even death. This problem is caused by the lack of expertise and working hours of extension workers as well as farmers' knowledge about Kenaf plants which have a terrible effect on Kenaf plants. The development of information technology can be overcome by imparting knowledge into machines known as artificial intelligence. In this study, the Convolutional Neural Network method was applied, which aims to identify symptoms and provide information about disease symptoms in Kenaf plants based on images so that early control of plant diseases can be carried out. Data processing trained directly from kenaf plantations obtained an accuracy of 57.56% for the first two classes of introduction to the VGGNet19 architecture and 25.37% for the four classes of the second introduction to the VGGNet19 architecture. The 5×5 block matrix input feature has been added in training to get maximum results.

Backpropagation Neural Network with Combination of Activation Functions for Inbound Traffic Prediction

Predicting network traffic is crucial for preventing congestion and gaining superior quality of network services. This research aims to use backpropagation to predict the inbound level to understand and determine internet usage. The architecture consists of one input layer, two hidden layers, and one output layer. The study compares three activation functions: sigmoid, rectified linear unit (ReLU), and hyperbolic Tangent (tanh). Three learning rates: 0.1, 0.5, and 0.9 represent low, moderate, and high rates, respectively. Based on the result, in terms of a single form of activation function, although sigmoid provides the least RMSE and MSE values, the ReLu function is more superior in learning the high traffic pattern with a learning rate of 0.9. In addition, Re-LU is more powerful to be used in the first order in terms of combination. Hence, combining a high learning rate and pure ReLU, ReLu-sigmoid, or ReLu-Tanh is more suitable and recommended to predict upper traffic utilization

Do Missing Link Community Smell Affect Developers Productivity: An Empirical Study

Missing link smell occurs when developers contribute to the same source code without communicating with each other. Existing studies have analyzed the relationship of missing link smells with code smell and developer contribution. However, the productivity of developers involved in missing link smell has not been explored yet. This study investigates how productivity differs between smelly and non-smelly developers. For this purpose, the productivity of smelly and non-smelly developers of seven open-source projects are analyzed. The result shows that the developers not involved in missing link smell have more productivity than the developers involved in smells. The observed difference is also found statistically significant.

Indonesian Sentence Boundary Detection using Deep Learning Approaches

Detecting the sentence boundary is one of the crucial pre-processing steps in natural language processing. It can define the boundary of a sentence since the border between a sentence, and another sentence might be ambiguous. Because there are multiple separators and dynamic sentence patterns, using a full stop at the end of a sentence is sometimes inappropriate. This research uses a deep learning approach to split each sentence from an Indonesian news document. Hence, there is no need to define any handcrafted features or rules. In Part of Speech Tagging and Named Entity Recognition, we use sequence labeling to determine sentence boundaries. Two labels will be used, namely O as a non-boundary token and E as the last token marker in the sentence. To do this, we used the Bi-LSTM approach, which has been widely used in sequence labeling. We have proved that our approach works for Indonesian text using pre-trained embedding in Indonesian, as in previous studies. This study achieved an F1-Score value of 98.49 percent. When compared to previous studies, the achieved performance represents a significant increase in outcomes..

Forecasting Stock Exchange Data using Group Method of Data Handling Neural Network Approach

The increasing uncertainty of the natural world has motivated computer scientists to seek out the best approach to technological problems. Nature-inspired problem-solving approaches include meta-heuristic methods that are focused on evolutionary computation and swarm intelligence. One of these problems significantly impacting information is forecasting exchange index, which is a serious concern with the growth and decline of stock as there are many reports on loss of financial resources or profitability. When the exchange includes an extensive set of diverse stock, particular concepts and mechanisms for physical security, network security, encryption, and permissions should guarantee and predict its future needs. This study aimed to show it is efficient to use the group method of data handling (GMDH)-type neural networks and their application for the classification of numerical results. Such modeling serves to display the precision of GMDH-type neural networks. Following the US withdrawal from the Joint Comprehensive Plan of Action in April 2018, the behavior of the stock exchange data stream and commend algorithms has not been able to predict correctly and fit in the network satisfactorily. This paper demonstrated that Group Method Data Handling is most likely to improve inductive self-organizing approaches for addressing realistic severe problems such as the Iranian financial market crisis. A new trajectory would be used to verify the consistency of the obtained equations hence the models' validity.

Face Images Classification using VGG-CNN

Image classification is a fundamental problem in computer vision. In facial recognition, image classification can speed up the training process and also significantly improve accuracy. The use of deep learning methods in facial recognition has been commonly used. One of them is the Convolutional Neural Network (CNN) method which has high accuracy. Furthermore, this study aims to combine CNN for facial recognition and VGG for the classification process. The process begins by input the face image. Then, the preprocessor feature extractor method is used for transfer learning. This study uses a VGG-face model as an optimization model of transfer learning with a pre-trained model architecture. Specifically, the features extracted from an image can be numeric vectors. The model will use this vector to describe specific features in an image. The face image is divided into two, 17% of data test and 83% of data train. The result shows that the value of accuracy validation (val_accuracy), loss, and loss validation (val_loss) are excellent. However, the best training results are images produced from digital cameras with modified classifications. Val_accuracy's result of val_accuracy is very high (99.84%), not too far from the accuracy value (94.69%). Those slight differences indicate an excellent model, since if the difference is too much will causes underfit. Other than that, if the accuracy value is higher than the accuracy validation value, then it will cause an overfit. Likewise, in the loss and val_loss, the two values are val_loss (0.69%) and loss value (10.41%).

Efficient Scheduling of Plantation Company Workers using Genetic Algorithm

Workers at large plantation companies have various activities. These activities include caring for plants, regularly applying fertilizers according to schedule, and crop harvesting activities. The density of worker activities must be balanced with efficient and fair work scheduling. A good schedule will minimize worker dissatisfaction while also maintaining their physical health. This study aims to optimize workers' schedules using a genetic algorithm. An efficient chromosome representation is designed to produce a good schedule in a reasonable amount of time. The mutation method is used in combination with reciprocal mutation and exchange mutation, while the type of crossover used is one cut point, and the selection method is elitism selection. A set of computational experiments is carried out to determine the best parameters’ value of the genetic algorithm. The final result is a better 30 days worker schedule compare to the previous schedule that was produced manually.

A Review of Accessing Big Data with Significant Ontologies

Ontology Based Data Access (OBDA) is a recently proposed approach which is able to provide a conceptual view on relational data sources. It addresses the problem of the direct access to big data through providing end-users with an ontology that goes between users and sources in which the ontology is connected to the data via mappings. We introduced the languages used to represent the ontologies and the mapping assertions technique that derived the query answering from sources. Query answering is divided into two steps: (i) Ontology rewriting, in which the query is rewritten with respect to the ontology into new query; (ii) mapping rewriting the query that obtained from previous step reformulating it over the data sources using mapping assertions. In this survey, we aim to study the earlier works done by other researchers in the fields of ontology, mapping and query answering over data sources.

Simple Modification for an Apriori Algorithm With Combination Reduction and Iteration Limitation Technique

Apriori algorithm is one of the methods with regard to association rules in data mining. This algorithm uses knowledge from an itemset previously formed with frequent occurrence frequencies to form the next itemset. An a priori algorithm generates a combination by iteration methods that are using repeated database scanning process, pairing one product with another product and then recording the number of occurrences of the combination with the minimum limit of support and confidence values. The a priori algorithm will slow down to an expanding database in the process of finding frequent itemset to form association rules. Modification techniques are needed to optimize the performance of a priori algorithms so as to get frequent itemset and to form association rules in a short time. Modifications in this study are obtained by using techniques combination reduction and iteration limitation. Testing is done by comparing the time and quality of the rules formed from the database scanning using a priori algorithms with and without modification. The results of the test show that the modified a priori algorithm tested with data samples of up to 500 transactions is proven to form rules faster with quality rules that are maintained.Keywords: Data Mining; Association Rules; Apriori Algorithms; Frequent Itemset; Apriori Modified;

Segmentation Method for Face Modelling in Thermal Images

Face detection is mostly applied in RGB images. The object detection usually applied the Deep Learning method for model creation. One method face spoofing is by using a thermal camera. The famous object detection methods are Yolo, Fast RCNN, Faster RCNN, SSD, and Mask RCNN. We proposed a segmentation Mask RCNN method to create a face model from thermal images. This model was able to locate the face area in images. The dataset was established using 1600 images. The images were created from direct capturing and collecting from the online dataset. The Mask RCNN was configured to train with 5 epochs and 131 iterations. The final model predicted and located the face correctly using the test image.