{"title":"Prediction of stock price using an adaptive Neuro-Fuzzy Inference System trained by Firefly Algorithm","authors":"Hien Nguyen Nhu, S. Nitsuwat, M. Sodanil","doi":"10.1109/ICSEC.2013.6694798","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694798","url":null,"abstract":"The substance of the design of Adaptive Neuro-Fuzzy Inference System (ANFIS) can be seen as an optimization problem to find the best parameters with minimal error function. This paper proposes a combination of the Firefly Algorithm and Adaptive Neuro-Fuzzy Inference System. The fuzzy neural network model will be trained by the Firefly Algorithm, and applied to predict stock prices in the Vietnam Stock Market. The experiments will compare performance between the proposed system and ANFIS trained by the Hybrid Algorithm, Back Propagation and Particle Swarm Optimization (PSO). The experimental results show that the system has reasonable efficient performance.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"661 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116097410","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":"Detecting Romanized Thai tokens in social media texts","authors":"Nutthamon Moknarong, A. Suchato, P. Punyabukkana","doi":"10.1109/ICSEC.2013.6694753","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694753","url":null,"abstract":"Social media contents were created by a large number of users or writers. Additionally, each of them has their own writing styles, which depend on their creative thinking or attitudes. As commonly found in online social networks of Thai users, typed texts sometimes include Thai words that were transliterated with Roman letters. Therefore, text-to-speech systems cannot pronounce these transliterated tokens correctly. In this work, we propose and evaluate statistical methods for detecting Romanized Thai tokens. Both context-dependent and context-free classification features are proposed. Real social network texts are used for constructing the training set and the test set. Human subjects can detect Thai Romanized tokens at 91.16% accuracy on average when adjacent contexts are hidden while the accuracy is at 99.41% with contexts. With the proposed features, a decision tree-based classifier and an N-gram-based classifier yield 87.63% and 74.42% accuracy, respectively. In the later case, the accuracy increases to 82.60% when the tokens' existence in English dictionaries is considered. Combining the two methods results in a detection accuracy of 89.36%.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123946156","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":"Buddhist amulet coin recognition by genetic algorithm","authors":"C. Pornpanomchai, Natdanai Srisupornwattana","doi":"10.1109/ICSEC.2013.6694802","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694802","url":null,"abstract":"The objective of this research is to develop a computer system, which can recognize some Thai Buddhist amulet coins. The system is called “Buddhist amulet coin recognition system” or BACRS. The system consists of five modules, namely: 1) image acquisition, 2) image preprocessing, 3) feature extraction, 4) image recognition and 5) result presentation. The BACRS applied the rule-based technique and genetic algorithm method to recognize Buddhist amulet coins. The BACRS used 216 amulet coin patterns with 1,080 images to train the system. The experiments conducted on 130 Buddhist amulet coins for recognition. The precision rate of the system is 91.53 percent and the average access time is 1.05 seconds per amulet image.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"111 3S 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130038810","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}
Rattanapong Chairukwattana, Thanapat Kangkachit, T. Rakthanmanon, Kitsana Waiyamai
{"title":"Efficient evolution-based clustering of high dimensional data streams with dimension projection","authors":"Rattanapong Chairukwattana, Thanapat Kangkachit, T. Rakthanmanon, Kitsana Waiyamai","doi":"10.1109/ICSEC.2013.6694776","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694776","url":null,"abstract":"SE-Stream is an evolution-based stream clustering method that supports high dimensional data streams. SE-Stream is able to monitor and detect change in the clustering structure during the progression of data streams. In this paper, we improve performance of SE-Stream by reducing its execution time and increasing its cluster quality. SE-Stream reduces complexity of stream processing by determining appropriated subset of dimensions of each active cluster to express cluster specific characteristics during the progression of data streams. With elimination of redundant operations, SE-Stream is improved both in terms of cluster quality and execution time. Experimental results on two real-world datasets show that SE-Stream outperforms its previous version in terms execution time. Further, the cluster quality in terms of both purity and f-measure has been considerably improved. Compared with HPStream, a state of the art algorithm for projected clustering of high dimensional data streams, SE-Stream outperforms in terms of cluster quality and yields comparable execution time.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116041557","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":"Support Vector Machine accuracy improvement with k-means clustering","authors":"Teera Siriteerakul, V. Boonjing","doi":"10.1109/ICSEC.2013.6694782","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694782","url":null,"abstract":"Support Vector Machine (SVM) is a classifier tool which, originally, uses a hyperplane as a border for separating two classes of data in hyperspace. However, if data from each class are not clustered together, the two classes might not be linearly separable. Typically, researchers attempted to resolve this issue by replacing the hyperplane with a complex border via kernel tricks. However, these kernel tricks could result in a longer training time or only a minute accuracy improvement (or both). On the other hand, if data from one class are separated into subclasses according to their proximity, then all the subclasses should be easily separated by hyperplanes. Therefore, this paper proposes a method to improve the accuracy of linear SVM by first applying k means clustering to each class of input data. Then, after clustered, a multi-classes linear SVM is trained using each subclass as a separate class. Thus, the trained SVM can identify any new input into a subclass which can be easily mapped to the correct class. To evaluate, the proposed method is experimentally used to classify images of Thai character where multiple fonts of characters can be taken as hidden clusters within classes. Empirically, the proposed method could achieve over 6% improvement from a linear SVM or SVMs with RBF or polynomial kernel.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122370738","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":"Improving the running time of the nearest neighbor algorithm","authors":"Nattakon Chompupatipong, K. Jearanaitanakij","doi":"10.1109/ICSEC.2013.6694795","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694795","url":null,"abstract":"Nearest neighbor algorithm is a well-known method, in pattern recognition, for classifying objects based on the nearest examples in the feature space. However, it's major drawback is the sequential search operation which calculates the distance between the probing object and the entire set of the training instances. In this paper, we propose a novel method to accelerate the searching operation in the nearest neighbor algorithm. Our method consists of two main steps; creating the reference table and searching the nearest neighbor. Reference table of the training instances is created once in the initial phase and referred periodically by the searching step. Surprisingly, this reference table can drastically reduce the searching time of the nearest neighbor algorithm on any feature space. The experimental results on five real-world datasets from the VCI repository show a remarkable improvement on the searching time while the accuracy is still preserved.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117349173","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":"Ontology development for SMEs E-commerce website based on content analysis and its recommendation system","authors":"Pagon Gatchalee, Zhoujun Li, T. Supnithi","doi":"10.1109/ICSEC.2013.6694744","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694744","url":null,"abstract":"This paper describes ontology development for SMEs E-commerce website based on content analysis technique for getting knowledge and develops recommendation system based on this ontology. In this paper there are three main tasks that regard and lead the goal of this paper. Three main tasks are 1) content analysis for SMEs e-commerce website by using SMEs e-commerce in Thailand as sample group, this main task describes how to get knowledge about SMEs e-commerce website's module that will know which modules should be include in SMEs e-commerce website based on sample group in Thailand 2) Ontology development for SMEs e-commerce website as ontology domain by using knowledge from content analysis at 1) and develops ontology on HOZO ontology editor tool 3) Recommendation system for SMEs e-commerce website, this is the goal of this paper that uses knowledge from 1) and also knowledge from experts and uses ontology from 2) to develop recommendation system based on OAM framework.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128117000","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":"Path-reputation based technique in reactive AODV Ad Hoc sensor networks routing for flood warning application","authors":"Nuttida Khawsaard, C. Saivichit","doi":"10.1109/ICSEC.2013.6694790","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694790","url":null,"abstract":"This paper emphasises on a modification of a well-known reactive routing protocol, namely, ad hoc on demand (AODV) for flood warning application by using the statical analysis Monte Carlo method. An extension of AODV has been incorporated with the trust evaluation system which is generally known as the reputation value. The work shows the process of development of node reputation as an immediacy indexed to the reputation for all the routes, namely, path reputation to increase the system reliability. The mathematical framework for the path reputation with Monte Carlo (PRMC) has been shown. The implementation of the PRMC were conducted on five different scenarios. The results are presented in terms of the remaining energy and the remaining lifetime. From the reported results, by using the intelligence control, our proposed method outperforms the other routing protocols. The improvement of remaining energy can be saved by up to approximately 15% for both cases. Finally, the calculation of computational complexity are shown for each algorithm.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114838937","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":"The last eternity a 3D role-playing game with a cross-platform development","authors":"Yodthong Rodkaew","doi":"10.1109/ICSEC.2013.6694800","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694800","url":null,"abstract":"This paper describes a cross-platform game engine for PC-based and iOS-based mobile devices. The purpose of this paper is to demonstrate a case study for a game developer and a game designer on the mobile platform. We discuss an implementation case-study on the game `The Last Eternity'. We present the wrapper around OpenGL|ES and OpenGL for PC, a structure of 3D game engine, a simple script design within the game engine, and a design and structure of the game. The game design, limitations, technical problems, and API are solved and discussed in this paper.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124335517","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":"A performance evaluation of a probabilistic parallel genetic algorithm: FPGA vs. multi-core processor","authors":"Y. Jewajinda","doi":"10.1109/ICSEC.2013.6694797","DOIUrl":"https://doi.org/10.1109/ICSEC.2013.6694797","url":null,"abstract":"This paper presents a performance evaluation between hardware and software implementation of a probabilistic parallel genetic algorithm. The compact genetic algorithm is extended to support parallel implementation. The parallelized compact genetic algorithm is implemented in FPGA hardware and parallelized software version running on multicore processors for performance evaluation using standard benchmark functions. The experimental results show that the hardware implementation of the parallel compact genetic algorithm delivers speedup of between 100-fold to 500-fold depending on problems size and number of generations.","PeriodicalId":191620,"journal":{"name":"2013 International Computer Science and Engineering Conference (ICSEC)","volume":"8 16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124636481","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}