Ika Marta Sari, S. Soemartojo, T. Siswantining, Devvi Sarwinda
{"title":"Mining Biological Information from 3D Medulloblastoma Cancerous Gene Expression Data Using TimesVector Triclustering Method","authors":"Ika Marta Sari, S. Soemartojo, T. Siswantining, Devvi Sarwinda","doi":"10.1109/ICICoS51170.2020.9299108","DOIUrl":"https://doi.org/10.1109/ICICoS51170.2020.9299108","url":null,"abstract":"Triclustering analysis is the development of clustering analysis and biclustering analysis. The purpose of triclustering study is to group three-dimensional data simultaneously. The three-dimensional data can be in the form of observations, attributes, and context. One of the approaches used in tricluster analysis, namely an approach based on sample patterns, is the TimesVector method. The TimesVector method aims to group data matrices that show the same or different patterns in three-dimensional data. The TimesVector method has a work step that starts with reducing the three-dimensional data matrix to a two-dimensional data matrix to minimize complexity in the grouping. In this method, the Spherical K-means algorithm will be used in cluster it. The next step is to identify the pattern of the groups generated in the Spherical K-means. The pattern referred to consists of three types, namely DEP (Differentiated Patterns), ODEP (Differentiated Patterns), and SEP (Differentiated Patterns). The TimesVector method was applied on gene expression data, namely medulloblastoma cancerous data carried out in 6 scenarios. Each scenario uses the same many clusters but different threshold values. The six scenarios’ results will be validated using the coverage value and the tricluster diffusion (TD) value. The application of the TimesVector method shows that using a threshold of 1.5 gives the most optimal results because it has a high coverage value and a low TD value. High-value coverage indicates the method’s ability to extract data, and a low TD value suggests that the resulting tricluster has a large volume and high coherence. The best tricluster results can be used by medical experts to perform further actions on medulloblastoma cancerous patients.","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114144394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ICICoS 2020 TOC","authors":"","doi":"10.1109/icicos51170.2020.9299097","DOIUrl":"https://doi.org/10.1109/icicos51170.2020.9299097","url":null,"abstract":"","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126300011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ICICoS 2020 Cover Page","authors":"","doi":"10.1109/icicos51170.2020.9299064","DOIUrl":"https://doi.org/10.1109/icicos51170.2020.9299064","url":null,"abstract":"","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133621119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simple MyUnet3D for BraTS Segmentation","authors":"Agus Subhan Akbar, C. Fatichah, N. Suciati","doi":"10.1109/ICICoS51170.2020.9299072","DOIUrl":"https://doi.org/10.1109/ICICoS51170.2020.9299072","url":null,"abstract":"The deep learning architectures that have been used for brain tumor segmentation in the BraTS challenge have performed well for the WT, TC, and ET segmentations. However, these architectures generally have many parameters and require large storage capacity for the model. In this paper, we propose a Simple MyUnet3D to do segmentation on BraTS 2018 dataset. This proposed architecture was inspired by 2D U-Net and modified to do 3D image segmentation. Dataset divides into 2 parts, one part of training and the other for validation. From 285 data, 213 for training, and 72 for validating the model. The segmentation consists of 3 parts, whole tumor(WT), tumor core(TC), and enhanced tumor(ET). Even its simplicity, it produces a dice coefficient of 0.8269 at segmenting the whole tumor. Nevertheless, its performance in tumor core and enhanced tumor need to be developed. The simplicity and its result in segmenting the whole tumor have great potential to be better developed.","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124834477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation of Textrank Algorithm in Product Review Summarization","authors":"M. R. Ramadhan, S. Endah, Aprinaldi Jasa Mantau","doi":"10.1109/ICICoS51170.2020.9299005","DOIUrl":"https://doi.org/10.1109/ICICoS51170.2020.9299005","url":null,"abstract":"Internet technology led to the emergence of Web 2.0 which increase the number of User Generated Content (UGC) on the network. Online product review is a form of UGC. The case study in this research is a review of handphone products. The large number of reviews will take long time to read and compare between existing product reviews, so we need a technique that online product review can be read quickly without losing of its important information. The technique that can be used is the text summarizing technique. Text summarization techniques produce simplified versions of texts. In general, text summarization can be divided into two types, namely extractive and abstractive summaries. This research used extractive summaries. One important component in the process of obtaining an extractive summary is sentence extraction. In this study, the algorithm used for sentence extraction is TextRank. The purpose of this study was to determine the performance of the TextRank algorithm with handphone product reviews data by implementing it in different data conditions based on the presence or absence of a stopword and typo. These data conditions are used to formulate test scenarios. Testing is done by calculating the Rouge-1 value which compares the summary of system and experts. Expert who involved in this study are 2. Expert 1 is a person with expertise in Indonesian and Expert 2 is someone who has the knowledge and understanding of mobile phones with various types and characteristics. From the test results obtained, Expert 1 gets the best results for scenario 2 where data conditions are there is typo and no stopword with an average value of Rouge-1 of 42.29% and Expert 2 gets the best results for scenario 3 where data conditions are no typo and there is stopword with an average value of Rouge-1 is 46.71%. The results shows that the TextRank algorithm is not able to produce a good summary for handphone product review dataset.","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122332680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Indonesian Ethnicity Recognition Based on Face Image Using Uniform Local Binary Pattern (ULBP) and Color Histogram","authors":"Tiani Tiara Putri, Ema Rachmawati, F. Sthevanie","doi":"10.1109/ICICoS51170.2020.9299103","DOIUrl":"https://doi.org/10.1109/ICICoS51170.2020.9299103","url":null,"abstract":"Ethnicity is one of identity every human has and can be used to categorize individuals in populations or large groups. We presented an Indonesian ethnicity recognition based on facial images using Uniform Local Binary Pattern (ULBP) and Color Histogram as a feature extraction method. We used the five largest ethnic groups in Indonesia, namely Sundanese, Javanese, Banjar, Buginese, and Malay. In the experiment, we used Random Forest as a classification method. The research obtained a performance accuracy of 98.25% using 2290 facial images.","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123455158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zharfan Akbar Andriawan, Satriawan Rasyid Purnama, A. Darmawan, Ricko, A. Wibowo, A. Sugiharto, F. Wijayanto
{"title":"Prediction of Hotel Booking Cancellation using CRISP-DM","authors":"Zharfan Akbar Andriawan, Satriawan Rasyid Purnama, A. Darmawan, Ricko, A. Wibowo, A. Sugiharto, F. Wijayanto","doi":"10.1109/ICICoS51170.2020.9299011","DOIUrl":"https://doi.org/10.1109/ICICoS51170.2020.9299011","url":null,"abstract":"Online travel sales continue to increase every year. Recorded in 2019, digital transactions related to online travel reached USD 755.4 billion. One of the supports of the travel business is the tourism and hospitality industry. The online reservation system is one of the most attractive solutions in the hospitality industry. Cancellation of hotel bookings or reservations through the online system is currently one of the problems in the hotel management system. When the reservation has been canceled, the hotel will be harmed. Therefore, predicting whether a booking will be canceled or not using the help of data science is needed so that the hotel can minimize lost profits. Therefore, by using datasets related to hotel booking requests, a predictive analysis using the CRISP-DM framework is conducted. By first performing some data preparation processes, this study uses a tree-based algorithm to perform the prediction. The experiment produced that Random Forest model has the best value with an accuracy value of 0.8725 and it is found that the time difference between booking is made and arrival time is the most influential feature in predicting the level of cancellation.","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125510837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Z. F. Pusdiktasari, Rahma Fitriani, E. Sumarminingsih
{"title":"Simulation Study using Average Difference Algorithm to Analyze the Outlierness Degree of Spatial Observations","authors":"Z. F. Pusdiktasari, Rahma Fitriani, E. Sumarminingsih","doi":"10.1109/ICICoS51170.2020.9298999","DOIUrl":"https://doi.org/10.1109/ICICoS51170.2020.9298999","url":null,"abstract":"Attribute values are the main elements in calculating degree of outlierness of spatial objects. The problem arises when the spatial outliers with extreme values are the nearest neighbors of a central object. In this study, several scenarios are simulated to verify the effect of spatial outliers’ extreme values to the degree of outlierness of its nearest neighbors, based on Average Difference Algorithm. The results confirmed the effect can lead to falsely detected spatial outliers. The algorithm detect the true spatial outliers correctly if their values are three sigma away from the mean attribute values of its nearest neighbors.","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130374664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Puteri Khatya Fahira, Zulia Putri Rahmadhani, P. Mursanto, A. Wibisono, H. Wisesa
{"title":"Classical Machine Learning Classification for Javanese Traditional Food Image","authors":"Puteri Khatya Fahira, Zulia Putri Rahmadhani, P. Mursanto, A. Wibisono, H. Wisesa","doi":"10.1109/ICICoS51170.2020.9299039","DOIUrl":"https://doi.org/10.1109/ICICoS51170.2020.9299039","url":null,"abstract":"Indonesia is a culturally rich nation with more than three hundred ethnic groups. This sheer number of ethnic groups reflects the country’s diverse culture. One of the identities that could be associated with a group of people is its cuisine. As with the high number of ethnic groups, the diversity of Indonesian traditional food is also very high. However, the diversity of food is threatened by the current food systems, which could endanger food security of a population. To prevent this issue, a traditional food database system is created to monitor the food systems of each area in Indonesia. In this research, automatic traditional food classification is developed as one of the main features of this system. There were 17 Indonesian traditional foods from the Java area that were acquired and used as a dataset for this research. Several key features of the food dataset were extracted using various methods. The data were then classified using various machine learning algorithms. From the experiment, Random Forest classifier achieved the highest accuracy compared to other classical machine learning methods.","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132461966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rismiyati, S. Endah, Khadijah, Ilman Nabil Shiddiq
{"title":"Xception Architecture Transfer Learning for Garbage Classification","authors":"Rismiyati, S. Endah, Khadijah, Ilman Nabil Shiddiq","doi":"10.1109/ICICoS51170.2020.9299017","DOIUrl":"https://doi.org/10.1109/ICICoS51170.2020.9299017","url":null,"abstract":"Solid waste management issue is main problem especially in developing countries, including Indonesia. Several efforts are made to solve waste management problem. Indonesia government has launched movement to sort different type of garbage on September 2019. Automatic garbage sortation is able to help this program. In order to be able to perform this task, the computer needs to differentiate each type of garbage. This process can be done by using machine learning method to differentiate garbage type. In this research, Transfer learning is used to perform classification task on TrashNet dataset. The models used in this research are ImageNet pretrained VGG16, ResNet-50 and Xception.The experiment result shows that Xception model is able to achieve highest accuracy of 88%, average precision of 84%, and average recall of 84%","PeriodicalId":122803,"journal":{"name":"2020 4th International Conference on Informatics and Computational Sciences (ICICoS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125460549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}