Pub Date : 2018-05-03DOI: 10.1109/ICOICT.2018.8528806
Fahmi Salman Nurfikri, M. S. Mubarok, Adiwijaya
News topic classification in this research is categorizing or distinguishing news, in textual data format, into a particular category based on information contained in the news. One of methods that can be used for this task is Bayesian Network that is one of uncertainty reasoning methods that uses probabilistic and directed acyclic graph to model conditional dependencies among variables. However, a textual data normally contains a considerable amount of variables and it could be problem for Bayesian Network since a large number of variables results high complexity, especially time complexity, in learning of Bayesian Network both structure and parameters. In addition, a considerable amount of variables could degrade accuracy since some variables might be irrelevant. In this research, we used Mutual Information as text feature selection method to provide relevant features for Bayesian Network classifier. Based on the conducted research, Mutual information as feature selector is able to improve classification performance of Bayesian Network. The highest classification rate obtained by employing Mutual Information is 75.34%, meanwhile the classification rate without Mutual Information is 45.95%, both in micro-average F1-score.
{"title":"News Topic Classification Using Mutual Information and Bayesian Network","authors":"Fahmi Salman Nurfikri, M. S. Mubarok, Adiwijaya","doi":"10.1109/ICOICT.2018.8528806","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528806","url":null,"abstract":"News topic classification in this research is categorizing or distinguishing news, in textual data format, into a particular category based on information contained in the news. One of methods that can be used for this task is Bayesian Network that is one of uncertainty reasoning methods that uses probabilistic and directed acyclic graph to model conditional dependencies among variables. However, a textual data normally contains a considerable amount of variables and it could be problem for Bayesian Network since a large number of variables results high complexity, especially time complexity, in learning of Bayesian Network both structure and parameters. In addition, a considerable amount of variables could degrade accuracy since some variables might be irrelevant. In this research, we used Mutual Information as text feature selection method to provide relevant features for Bayesian Network classifier. Based on the conducted research, Mutual information as feature selector is able to improve classification performance of Bayesian Network. The highest classification rate obtained by employing Mutual Information is 75.34%, meanwhile the classification rate without Mutual Information is 45.95%, both in micro-average F1-score.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114581895","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}
Bandung public transport route, known as Angkutan Kota (Angkot), has 39 routes to serve intra city transportation. These routes connect more than 40 bus stations in star topology. The centrality analysis of this routes shows that many of them are overlapped into each other in certain location, thus may potentially cause congestion and increased competition for passengers among routes. To achieve operational break event, most fleet tend to conduct activities that reduce its service quality and disturb traffic flow. Having public transport with inconsistent level of service leave passengers with no choice but to find another mode of transportation, including owning private vehicle, which lead public transportation into deeper vicious circle. Some effort to break this circle is to subsidised public transport fare, car restraint (such as 3 in 1 policy), and priority lane for public transport (such as bus way). This paper suggests another way to increase usability of public transport by implementing graph theory to generate new routing strategy. Instead of having path formed from node sequence, we propose nodes that grouped geographically, creating modular routes that cover certain area and can be managed independently. The graph or network is formed by using bus stops/stations as nodes and routes to connect the nodes. We apply Louvain's community detection algorithm to groups bus stops and stations into communities. By assuming that each community is a route coverage, we can define 14 Angkot routes. The proposed routes feature fewer routes and can significantly reduce overlapping between routes while still having similar performance with conventional route.
万隆公共交通路线，被称为Angkutan Kota (Angkot)，有39条路线服务于城市内的交通。这些路线以星形拓扑连接了40多个公交车站。该路线的中心性分析表明，许多路线在某些位置上相互重叠，从而可能造成拥堵和增加路线之间的乘客竞争。为了实现运营中断事件，大多数车队往往会进行降低其服务质量和干扰交通流量的活动。服务水平不一致的公共交通让乘客不得不寻找其他交通方式，包括拥有私家车，这使得公共交通陷入更深的恶性循环。打破这一循环的一些努力是补贴公共交通票价，限制汽车(如三合一政策)，以及公共交通优先车道(如公交线路)。本文提出了另一种提高公共交通可用性的方法，即利用图论生成新的路线策略。我们提出将节点按地理位置分组，创建覆盖特定区域且可独立管理的模块化路径，而不是按节点序列形成路径。以公交车站为节点，以路线连接节点，形成图形或网络。我们将Louvain的社区检测算法应用于将公交站点和车站划分为社区。假设每个社区都有一条路线覆盖，我们可以定义14条吴哥路线。所提出的路由具有较少的路由特征，并且可以显著减少路由之间的重叠，同时仍然具有与传统路由相似的性能。
{"title":"Route Recommendation Using Community Detection Algorithm (Case: Kota Bandung)","authors":"Yahya Peranginangin, Andrias Andi, Kristina Sisilia","doi":"10.1109/ICOICT.2018.8528740","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528740","url":null,"abstract":"Bandung public transport route, known as Angkutan Kota (Angkot), has 39 routes to serve intra city transportation. These routes connect more than 40 bus stations in star topology. The centrality analysis of this routes shows that many of them are overlapped into each other in certain location, thus may potentially cause congestion and increased competition for passengers among routes. To achieve operational break event, most fleet tend to conduct activities that reduce its service quality and disturb traffic flow. Having public transport with inconsistent level of service leave passengers with no choice but to find another mode of transportation, including owning private vehicle, which lead public transportation into deeper vicious circle. Some effort to break this circle is to subsidised public transport fare, car restraint (such as 3 in 1 policy), and priority lane for public transport (such as bus way). This paper suggests another way to increase usability of public transport by implementing graph theory to generate new routing strategy. Instead of having path formed from node sequence, we propose nodes that grouped geographically, creating modular routes that cover certain area and can be managed independently. The graph or network is formed by using bus stops/stations as nodes and routes to connect the nodes. We apply Louvain's community detection algorithm to groups bus stops and stations into communities. By assuming that each community is a route coverage, we can define 14 Angkot routes. The proposed routes feature fewer routes and can significantly reduce overlapping between routes while still having similar performance with conventional route.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116852479","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}
Pub Date : 2018-05-03DOI: 10.1109/ICOICT.2018.8528761
Ignatius Wendianto Notonogoro, Jondri, A. Arifianto
License plate is a part of vehicle's identity. In modern countries, license plate recognition has been developed to collect traffic activity information. The performance of license plate recognition system tend to drop when the input picture contains noises like illumination, dirt, and scratches which cover one or more characters in the license plate. This research was focused on Indonesian license plate as many license plates in Indonesia had various noises like plastic cover and scratches which complicate the recognition. In this study, Indonesian license plate recognition is formed using a Convolutional Neural Network (CNN) which is known to have good performance in recognizing objects, even though the objects are obscured to some degree. Sliding window is used in this study for replace character segmentation. CNN will predict images in every area of window. The highest performance for the whole system to the normal data test is 87.36% and noised data test is 44.93%.
{"title":"Indonesian License Plate Recognition Using Convolutional Neural Network","authors":"Ignatius Wendianto Notonogoro, Jondri, A. Arifianto","doi":"10.1109/ICOICT.2018.8528761","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528761","url":null,"abstract":"License plate is a part of vehicle's identity. In modern countries, license plate recognition has been developed to collect traffic activity information. The performance of license plate recognition system tend to drop when the input picture contains noises like illumination, dirt, and scratches which cover one or more characters in the license plate. This research was focused on Indonesian license plate as many license plates in Indonesia had various noises like plastic cover and scratches which complicate the recognition. In this study, Indonesian license plate recognition is formed using a Convolutional Neural Network (CNN) which is known to have good performance in recognizing objects, even though the objects are obscured to some degree. Sliding window is used in this study for replace character segmentation. CNN will predict images in every area of window. The highest performance for the whole system to the normal data test is 87.36% and noised data test is 44.93%.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129331825","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}
Pub Date : 2018-05-03DOI: 10.1109/ICOICT.2018.8528765
Mhd. Rizky Ferianda, A. Herdiani, Indra Lukmana Sardi
Distance education helps students interacting with course materials, teachers, and their peers without time and place barriers. IDEA is distance education implemented in Telkom University with various of functionalities like course materials, discussion, quiz, and assignment. Meanwhile, the users of IDEA were decreased because the functionalities are not well-supported by a good interaction design. To overcome this problem, we propose gamification method, an application of game-dynamics, mechanics, and frameworks into non-game settings. There are five steps of gamification: understanding the target audience and the context, defining learning objective, structuring the experience, identifying resources, and applying gamification element. We implement four gamification elements into the basic IDEA, they are points, badges, leaderboard, and reward. To evaluate the impact of gamification in IDEA, we used Technology Acceptance Model and it shows a promising result. The value of five constructs are higher than previous research.
{"title":"Increasing Students Interaction in Distance Education Using Gamification","authors":"Mhd. Rizky Ferianda, A. Herdiani, Indra Lukmana Sardi","doi":"10.1109/ICOICT.2018.8528765","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528765","url":null,"abstract":"Distance education helps students interacting with course materials, teachers, and their peers without time and place barriers. IDEA is distance education implemented in Telkom University with various of functionalities like course materials, discussion, quiz, and assignment. Meanwhile, the users of IDEA were decreased because the functionalities are not well-supported by a good interaction design. To overcome this problem, we propose gamification method, an application of game-dynamics, mechanics, and frameworks into non-game settings. There are five steps of gamification: understanding the target audience and the context, defining learning objective, structuring the experience, identifying resources, and applying gamification element. We implement four gamification elements into the basic IDEA, they are points, badges, leaderboard, and reward. To evaluate the impact of gamification in IDEA, we used Technology Acceptance Model and it shows a promising result. The value of five constructs are higher than previous research.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130714154","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}
Pub Date : 2018-05-03DOI: 10.1109/ICOICT.2018.8528767
Anthonya Barsha Rozario, Md. Farhad Hossain
Machine-to-Machine (M2M) communications have now become a highly promising affiliate of the future fifth generation (5G) cellular networks. This paper proposes a novel architecture for M2M communications over cellular networks. $k$-mean clustering for machines as well as cluster head (CH) reselection method is applied in order to balance the power consumption within the machines to increase their battery life. For communication between CH and member machines, time division multiple access (TDMA) is proposed. On the other hand, for communication between CH and BS, non-orthogonal multiple access (NOMA) technology is considered. Performance of the proposed architecture is evaluated through extensive MATLAB simulations. Results clearly demonstrates the capability of the proposed architecture in improving the lifetime of machines and reducing communication delays. Comparisons with other counterparts also attests superior energy efficiency and delay performance of the proposed architecture.
{"title":"An Architecture for M2M Communications Over Cellular Networks Using Clustering and Hybrid TDMA-NOMA","authors":"Anthonya Barsha Rozario, Md. Farhad Hossain","doi":"10.1109/ICOICT.2018.8528767","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528767","url":null,"abstract":"Machine-to-Machine (M2M) communications have now become a highly promising affiliate of the future fifth generation (5G) cellular networks. This paper proposes a novel architecture for M2M communications over cellular networks. $k$-mean clustering for machines as well as cluster head (CH) reselection method is applied in order to balance the power consumption within the machines to increase their battery life. For communication between CH and member machines, time division multiple access (TDMA) is proposed. On the other hand, for communication between CH and BS, non-orthogonal multiple access (NOMA) technology is considered. Performance of the proposed architecture is evaluated through extensive MATLAB simulations. Results clearly demonstrates the capability of the proposed architecture in improving the lifetime of machines and reducing communication delays. Comparisons with other counterparts also attests superior energy efficiency and delay performance of the proposed architecture.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124315532","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}
Pub Date : 2018-05-03DOI: 10.1109/ICOICT.2018.8528814
Fajari Arief Setia, Teuku Yuliar Arif, R. Munadi
IEEE 802.11n Wireless Local Area Network (WLAN) is the default standard that is used on modern smartphones and modern PCs/laptops. Medium Access Control (MAC) 802.11n has the capability of transmitting multiple MAC Protocol Data Units (MPDUs) into an Aggregate-MPDU (A-MPDU). Physical (PHY) 802.11n transmits MPDU or A-MPDU using a PHY rate of 6.5 to 600 Mbps determined by the rate adaptation algorithm. The selected PHY rate is expected according to the channel conditions for MPDU to be received without error. Based on the literature study, Minstrel-HT is one of the rate adaptation algorithms based on proposed channel conditions, especially for IEEE 802.11n high-throughput WLAN. However Minstrel-HT does not have a mechanism to activate RTS/CTS mode dynamically in the event of a collision error. Collision-aware rate adaptation (CARA) has been proposed, however the design has been made not for WLAN high throughput. In this paper we improve CARA to take advantage of MAC and PHY 802.11n capabilities and call it CARA for High Throughput (CARA-HT). We developed the CARA-HT algorithm in NS-3.26 simulator. The simulation results show the throughput produced by CARA-HT is better than Minstrel-HT.
{"title":"Collision-Aware Rate Adaptation Algorithm for High-Throughput IEEE 802.11n WLANs","authors":"Fajari Arief Setia, Teuku Yuliar Arif, R. Munadi","doi":"10.1109/ICOICT.2018.8528814","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528814","url":null,"abstract":"IEEE 802.11n Wireless Local Area Network (WLAN) is the default standard that is used on modern smartphones and modern PCs/laptops. Medium Access Control (MAC) 802.11n has the capability of transmitting multiple MAC Protocol Data Units (MPDUs) into an Aggregate-MPDU (A-MPDU). Physical (PHY) 802.11n transmits MPDU or A-MPDU using a PHY rate of 6.5 to 600 Mbps determined by the rate adaptation algorithm. The selected PHY rate is expected according to the channel conditions for MPDU to be received without error. Based on the literature study, Minstrel-HT is one of the rate adaptation algorithms based on proposed channel conditions, especially for IEEE 802.11n high-throughput WLAN. However Minstrel-HT does not have a mechanism to activate RTS/CTS mode dynamically in the event of a collision error. Collision-aware rate adaptation (CARA) has been proposed, however the design has been made not for WLAN high throughput. In this paper we improve CARA to take advantage of MAC and PHY 802.11n capabilities and call it CARA for High Throughput (CARA-HT). We developed the CARA-HT algorithm in NS-3.26 simulator. The simulation results show the throughput produced by CARA-HT is better than Minstrel-HT.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126721101","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}
Pub Date : 2018-05-01DOI: 10.1109/ICOICT.2018.8528737
Kartika Resiandi, Adiwijaya, D. Q. Utama
Atrial Fibrillation (AF) categorized as one kind of arrhythmia that mostly found on a daily basis. It is indicated by irregular heartbeat in the heart's electrical system from the atrium into the ventricle. A person who has never had a history of heart disease even gets possibility suffering from AF. Risks caused by AF, namely the possibility of stroke, heart failure, and death. For someone who already has symptoms of AF should immediately examine one of them by using an electrocardiogram (EKG). Due to the presence of early detection can reduce the number of percentage of AF population, and the prognosis of AF disease is also preferable. There are three stages in this research; they are pre-processing as a process of uniforming data dimension, feature extraction, and K-NN classification. Feature extraction applied by comparing the RR interval of AF's signal and the normal one. The best performance result of AF detection based on the accuracy of the overall scheme is $mathbf{k}=1$ with an average accuracy at 91.75% and the highest accuracy, sensitifity, and specificity level at 95.45%, 91.67%, and 100% with proportion data at 60:40 percent.
{"title":"Detection of Atrial Fibrillation Disease Based on Electrocardiogram Signal Classification Using RR Interval and K-Nearest Neighbor","authors":"Kartika Resiandi, Adiwijaya, D. Q. Utama","doi":"10.1109/ICOICT.2018.8528737","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528737","url":null,"abstract":"Atrial Fibrillation (AF) categorized as one kind of arrhythmia that mostly found on a daily basis. It is indicated by irregular heartbeat in the heart's electrical system from the atrium into the ventricle. A person who has never had a history of heart disease even gets possibility suffering from AF. Risks caused by AF, namely the possibility of stroke, heart failure, and death. For someone who already has symptoms of AF should immediately examine one of them by using an electrocardiogram (EKG). Due to the presence of early detection can reduce the number of percentage of AF population, and the prognosis of AF disease is also preferable. There are three stages in this research; they are pre-processing as a process of uniforming data dimension, feature extraction, and K-NN classification. Feature extraction applied by comparing the RR interval of AF's signal and the normal one. The best performance result of AF detection based on the accuracy of the overall scheme is $mathbf{k}=1$ with an average accuracy at 91.75% and the highest accuracy, sensitifity, and specificity level at 95.45%, 91.67%, and 100% with proportion data at 60:40 percent.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115149042","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}
Pub Date : 2018-05-01DOI: 10.1109/ICOICT.2018.8528768
Oscar Karnalim, Setia Budi
Low-level approach is a novel way to detect source code plagiarism. Such approach is proven to be effective when compared to baseline approach (i.e., an approach which relies on source code token subsequence matching) in controlled environment. We evaluate the effectiveness of state of the art in low-level approach based on Faidhi & Robinson's plagiarism level taxonomy; real plagiarism cases are employed as dataset in this work. Our evaluation shows that state of the art in low-level approach is effective to handle most plagiarism attacks. Further, it also outperforms its predecessor and baseline approach in most plagiarism levels.
{"title":"The Effectiveness of Low-Level Structure-Based Approach Toward Source Code Plagiarism Level Taxonomy","authors":"Oscar Karnalim, Setia Budi","doi":"10.1109/ICOICT.2018.8528768","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528768","url":null,"abstract":"Low-level approach is a novel way to detect source code plagiarism. Such approach is proven to be effective when compared to baseline approach (i.e., an approach which relies on source code token subsequence matching) in controlled environment. We evaluate the effectiveness of state of the art in low-level approach based on Faidhi & Robinson's plagiarism level taxonomy; real plagiarism cases are employed as dataset in this work. Our evaluation shows that state of the art in low-level approach is effective to handle most plagiarism attacks. Further, it also outperforms its predecessor and baseline approach in most plagiarism levels.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126169286","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}
Pub Date : 2018-05-01DOI: 10.1109/ICOICT.2018.8528800
A. Alamsyah, M. R. Dwi Putra, D. Fadhilah, F. Nurwianti, Ening Ningsih
The advancement of technology has affected human behavior. Social media has become a prominent platform for our lives to share opinion, thoughts, and information. Those activities are stored as a digital trace. Meanwhile in linguistic approach, the unique way of people writing is able to reveal the real personality. The open access data on social media give us an opportunity to assess the characteristic of a person based on a digital trace. The human personality has been classified according to Five Factor Model (FFM). We propose the ontology modeling approach to measure human personality using social media data, particularly in Bahasa Indonesia. The present personality measurement commonly use a test or questionnaire survey. This research enriches current methodology to measure human personality by observing writing and linguistic usage on Twitter. The result is beneficial for marketing study to forecast consumer behavior. It also valuable fo human resources study to decide employee's recruitment and promotion.
{"title":"Ontology Modelling Approach for Personality Measurement Based on Social Media Activity","authors":"A. Alamsyah, M. R. Dwi Putra, D. Fadhilah, F. Nurwianti, Ening Ningsih","doi":"10.1109/ICOICT.2018.8528800","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528800","url":null,"abstract":"The advancement of technology has affected human behavior. Social media has become a prominent platform for our lives to share opinion, thoughts, and information. Those activities are stored as a digital trace. Meanwhile in linguistic approach, the unique way of people writing is able to reveal the real personality. The open access data on social media give us an opportunity to assess the characteristic of a person based on a digital trace. The human personality has been classified according to Five Factor Model (FFM). We propose the ontology modeling approach to measure human personality using social media data, particularly in Bahasa Indonesia. The present personality measurement commonly use a test or questionnaire survey. This research enriches current methodology to measure human personality by observing writing and linguistic usage on Twitter. The result is beneficial for marketing study to forecast consumer behavior. It also valuable fo human resources study to decide employee's recruitment and promotion.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116126216","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}
Pub Date : 2018-05-01DOI: 10.1109/ICOICT.2018.8528760
Yoe One Ariestya Niovitta, R. Sarno
This paper provides research result in determining the optimal route sequence of destination and travel time on tourism buses with the same start-end point to improve tourism services and operational cost savings. The tourism bus service that will be discussed in this research is the tourism bus belonging to the Department of Culture and Tourism (Disbudpar) Surabaya, namely Surabaya Shopping and Culinary Track (SSCT) bus. SSCT bus currently has only two regular routes, namely Museum Track and Maritime Track, and will increase to several other routes type depends on annual tourism events in Surabaya. Unfortunately, in the calculation of this location is still manual so it allows some disadvantages, and if additional route type also still done manually, this mistake will happen repeatedly. Therefore, in this study the calculation of the optimal distance and travel time of SSCT bus will do in the basic formula of the Dynamic Programming method. The used main parameters are distance and time on road between tourist destinations, while traffic congestion as a limitations of the problem in this study. The final results of this study shows that time on road on the Museum Track and the Maritime Track can be saved up to 58% and 25% compared to the current manual time on road calculations. It certainly will help Disbudpar Surabaya in making the best decision in improving SSCT bus service.
{"title":"Travel Route Optimization Using Dynamic Programming","authors":"Yoe One Ariestya Niovitta, R. Sarno","doi":"10.1109/ICOICT.2018.8528760","DOIUrl":"https://doi.org/10.1109/ICOICT.2018.8528760","url":null,"abstract":"This paper provides research result in determining the optimal route sequence of destination and travel time on tourism buses with the same start-end point to improve tourism services and operational cost savings. The tourism bus service that will be discussed in this research is the tourism bus belonging to the Department of Culture and Tourism (Disbudpar) Surabaya, namely Surabaya Shopping and Culinary Track (SSCT) bus. SSCT bus currently has only two regular routes, namely Museum Track and Maritime Track, and will increase to several other routes type depends on annual tourism events in Surabaya. Unfortunately, in the calculation of this location is still manual so it allows some disadvantages, and if additional route type also still done manually, this mistake will happen repeatedly. Therefore, in this study the calculation of the optimal distance and travel time of SSCT bus will do in the basic formula of the Dynamic Programming method. The used main parameters are distance and time on road between tourist destinations, while traffic congestion as a limitations of the problem in this study. The final results of this study shows that time on road on the Museum Track and the Maritime Track can be saved up to 58% and 25% compared to the current manual time on road calculations. It certainly will help Disbudpar Surabaya in making the best decision in improving SSCT bus service.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116755813","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：