Transaksi kartu kredit yang semakin meningkat yang diikuti dengan maraknya tindak kecurangan memicu penelitian mengenai pengembangan model prediksi transaksi kartu kredit fraud. Data transaksi kartu kredit Doku digunakan menjadi sumber data pada penelitian. Penelitian ini melakukan pengembangan model prediksi serta webservice prediksi transaksi kartu kredit fraud. Fitur yang digunakan dalam pembuatan model adalah amount, payment bank issuer, payment bank acquirer, payment brand, payment 3D secure ECI, payment type, payment bank issuer country, dan hour. Model Decision Tree memberikan hasil terbaik dalam aspek precision dan F1-score dengan nilai 97.2% dan 96.8%. Model XGBoost memberikan hasil terbaik dalam aspek recall dan FP-rate dengan nilai 96.4% dan 3%. Kedua model tersebut sama-sama memperoleh nilai accuracy terbaik yaitu 96.7%. Dalam aspek webservice, model XGBoost memiliki performa terbaik dengan rata-rata throughput 77 request per detik.
The increasing amount of credit card transaction followed by fraudulent transaction becoming more rampant provokes many studies in fraud credit card transaction prediction model. Doku credit card transaction is used as data source for this study. This study experiments on developing model and webservice to predict fraud credit card transaction. Features used in builiding the model are amount, payment bank issuer, payment bankacquirer, payment brand, payment 3D secure ECI, payment type, payment bank issuer country, and hour. Decision Tree model achieves best precision and F1-score with 97.2% and 96.8% score. XGBoost model achieves best recall and FP-rate with 96.4% and 3% score. Both said model achieves same best accuracy with 96.7% score. In regards of the webservice, XGBoost achieves best performance with average throughput reaching 77 request per second.
"Hate speech and abusive language spreading on social media needs to be identified automatically to avoid conflict between citizen. Moreover, hate speech has target, criteria, and level that also needs to be identified to help the authority in prioritizing hate speech which must be addressed immediately. This thesis discusses multi-label text classification to identify abusive and hate speech including the target, category, and level of hate speech in Indonesian Twitter. This problem was done using machine learning approach with Support Vector Machine (SVM), Naïve Bayes (NB), and Random Forest Decision Tree (RFDT) classifier and Binary Relevance (BR), Label Power-set (LP), and Classifier Chains (CC) as data transformation method. The features that used are term frequency (word n-grams and character n-grams), ortography (exclamation mark, question mark, uppercase, lowercase), and lexicon features (negative sentiment lexicon, positif sentiment lexicon, and abusive lexicon). The experiment results show that in general RFDT classifier using LP as the transformation method gives the best accuracy with fast computational time. RFDT classifier with LP transformation using word unigram feature give 66.16% of accuracy. If only for identifying abusive language and hate speech (without identifying the target, criteria, and level of hate speech), RFDT classifier with LP transformation using combined fitur word unigram, character quadgrams, positive sentiment lexicon, and abusive lexicon can gives 77,36% of accuracy.
"Multi object tracking is one of the most important topics of computer science that has many applications, such as surveillance system, navigation robot, sports analysis, autonomous driving car, and others. One of the main problems of multi-object tracking is occlusion. Occlusion is an object that is covered by other objects. Occlusion may cause the ID between objects to be switched. This study discusses occlusion on multi-object tracking and its completion with network flow. Given objects detection on each frame, the task of multi object tracking is to estimate the movement of objects and then connect the estimation objects corresponding to the objects in the next frame or well known as the data association. Notice that each object on a frame as a node, then there is an edge connecting each node on a frame with other frames, this architecture in graph theory is known as network flow. Then find the set of edges that provide the greatest probaility of transition from one frame to the next, or to the optimization problem well known as max-cost network flow. Edge contains information on how probabiltity a node moves to the node in the frame afterwards. This probability calculation is based on position distance and similarity feature between frames, the feature used is CNN feature. We modeled max-cost network flow as the maximum likelihood problem which was then solved with the Hungarian algorithm. The data used in this research is 2DMOT2015. Performance evaluation results show that the system built gives accuracy 20.1% with the ID switch is 3084 and fast computational process on 215.8 frame/second.
"