Dilshan I. De Silva, M. R. A. Nashry, S. Varathalingam, R. Murugathas, Kushnara Suriyawansa
{"title":"iShop — Shopping application for visually challenged","authors":"Dilshan I. De Silva, M. R. A. Nashry, S. Varathalingam, R. Murugathas, Kushnara Suriyawansa","doi":"10.1109/KST.2017.7886121","DOIUrl":"https://doi.org/10.1109/KST.2017.7886121","url":null,"abstract":"In the life of visually challenged people shopping is one of the greatest challenges. From getting around the supermarket to paying the bill at the cashier they need to rely on someone else. They never get a chance to shop on their own. Whether the person uses a cane, a seeing-eye dog or other sight tools, shopping is still a painstaking chore for them. This paper presents iShop — a complete mobile solution for the above mentioned problem of visually challenged people. iShop is developed in order to address the issues that the visually challenged people face while they do shopping and to provide a new, convenient shopping experience using modern technology.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130044920","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":"Explicit and implicit aspects of human cognition and behavior","authors":"Katsumi Watanabe","doi":"10.1109/KST.2017.7886064","DOIUrl":"https://doi.org/10.1109/KST.2017.7886064","url":null,"abstract":"In this talk, I would like to illustrate how human minds and brains may be approached scientifically, with a particular focus on human visual system and its cognitive characteristics. Understanding human cognition and behavior is essential for any information system, in particular in emerging fields such as Artificial Intelligence, Virtual Reality, and Robotics, etc. Cognitive sciences involve studies on information systems, which obviously include humans, by examining what we can do (i.e., performances), what we cannot do (i.e., limits), what we are good or bad at (i.e., species-specific characteristics), and the extent to which we can change (plasticity). As cognitive science is interdisciplinary by its nature and the ranges of interests and issues vary, setting several must-follow principles would be vital; here I would list just several ones for handling human cognition and action: experimental attitude, complexity appreciation, appropriate reductionism, evolutional perspective, and understanding dynamically changing systems. Then, I shall discuss some important aspects of human cognition and action by showing visual demonstrations and discuss four issues in cognitive sciences. Bottom-up process versus Top-down process: Human cognition and actions are based on various automatic, stimulus-driven processes as well as deliberative, internally-driven processes. Although it is often difficult to disentangle these two processes, it is a good strategy to examine to what extent a phenomenon at hand is based on bottom-up processes and top-down processes. Interaction between Perception & Action: What we perceive is not necessarily identical to what we act on. Sometimes, perception and action are dissociable and sometimes they interact. Due to these dissociable and interacting bottom-up and top-down processes and the relationship between perceptual and action, we experience the complex mixture of conscious and unconscious effects.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122560315","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":"Mining weighted-frequent-regular itemsets from transactional database","authors":"Kittipa Klangwisan, Komate Amphawan","doi":"10.1109/KST.2017.7886090","DOIUrl":"https://doi.org/10.1109/KST.2017.7886090","url":null,"abstract":"Frequent-regular itemsets mining has been explored and proposed to find interesting itemsets based on their own occurrence behavior. Traditionally, an itemset is identified as interesting, if it occurs frequently and regularly in a database. However, this task only considers items without defining difference or significance of each item which may affect the missing of important/interesting knowledge in real-world applications. To address this issue, we introduce an approach on mining weighted-frequent-regular itemsets, (also called mining WFRIs). To mine WFRIs, a tree-and-pattern growth based algorithm called WFRIM (Weighted-Frequent-Regular Itemsets Miner) is proposed. An FP-tree like structure named WFRI-tree is designed to efficiently maintain candidate itemsets during mining process. The concept of overestimated-weighted-frequency of items/itemsets under global/local maximum weight is also applied to early prune search space. Experimental results on synthetic and real datasets show efficiency of WFRIM in the terms of computational time, memory consumption and capability to find valuable itemsets.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130452684","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":"Partition-based overlapping clustering using cluster's parameters and relations","authors":"Tanawat Limungkura, P. Vateekul","doi":"10.1109/KST.2017.7886124","DOIUrl":"https://doi.org/10.1109/KST.2017.7886124","url":null,"abstract":"Conventional clustering algorithms based on the assumption that a data point can be assigned to only a single cluster. In spite of, there are several types of data that a data point belongs to multiple categories and causes ground-truth clusters overlap. To handle this situation, several algorithms are proposed and referred as “overlapping clustering”. One of state-of-the-art partition-based overlapping clustering technique is “Non-exhaustive, Overlapping K-Means” or “NEO-K-Means” in short, which is an extension of K-Means clustering algorithm. Although NEO-K-Means works effectively for most real-world multi-category data. However, the process of assigning clusters focuses only on the minimum distance from the data to the centroid and ignores other essential parameters, such as, distance between clusters and the radius of clusters. Moreover, the number of estimation of data points on overlapping area is also still not accurate enough. These are huge drawbacks of NEO-K-Means that makes clustering accuracy lower than it should be. In this paper, we aim to overcome this limitation in NEO-K-Means by using radius of cluster and distance between clusters for assisting in estimating data and assigning clusters. The experimental results show that our method significantly outperforms NEO-K-Means on nine real multi-category data sets in terms of F1.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"28 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046516","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":"Merging artificial immune system and ordinal optimization for solving the optimal buffer resource allocation of production line","authors":"S. Horng, Shieh-Shing Lin","doi":"10.1109/KST.2017.7886069","DOIUrl":"https://doi.org/10.1109/KST.2017.7886069","url":null,"abstract":"Choosing suitable buffer setups for network-flow production lines of automated manufacturing systems to augment throughputs is a pragmatic issue. In this work, an approach merging artificial immune system (AIS) and ordinal optimization (OO) is developed to determine an optimal buffer resource allocation of a network-flow production line for maximizing the throughput. The proposed approach consists of two levels. The first level is using AIS assisted by a rough estimation to select a candidate subset of solutions. The second level is to identify an excellent solution among the solutions obtained from the first level using optimal computing budget allocation (OCBA) technique. We have tested the proposed approach on a three-stage ten-node network-flow production line and compared the test results with those obtained by three swarm intelligence methods with accurate estimation. Test results demonstrate that the proposed approach can obtain an excellent solution within a reasonable computing time and outperforms the three swarm intelligence methods.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122259763","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":"Building issue-data maps to support the resolution of socio-national issues: Focusing on the issue of increase in domestic inflow of foreign infectious diseases","authors":"Mi-Nyeong Hwang, Seungwoo Lee, Heeyoung Oh","doi":"10.1109/KST.2017.7886131","DOIUrl":"https://doi.org/10.1109/KST.2017.7886131","url":null,"abstract":"Owing to the development of big-data-related technology, interest on systematic methodology that determines policies has been increasing based on data in the public health field. In this study, a method is proposed to establish an issue data map required to discover main national and social issues based on the data and solve issues through cooperation with domain experts. First, main issues with socially high interest are selected through literature review and analysis on news and search trends. Next, the factors that influence these selected issues are analyzed, and specific monitoring items of each driving force are selected to investigate the related data. In addition, a map is established to interconnect researchers with considerable experience in issue domain research and policy decision organizations that have decision-making capacity to solve the issues. This study empirically shows the process of establishing an issue map on a main social issue, which is the “increase in domestic inflow of foreign infectious diseases.” Efficient policy decision making will be possible if an issue-detection system that enables constant monitoring based on this issue map is established.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123395591","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 character-level convolutional neural network with dynamic input length for Thai text categorization","authors":"Thanabhat Koomsubha, P. Vateekul","doi":"10.1109/KST.2017.7886102","DOIUrl":"https://doi.org/10.1109/KST.2017.7886102","url":null,"abstract":"A Character-level Convolutional Neural Network (Char-CNN) is an efficient text categorization method. It can be used in categorization task without a word segmentation step, which is necessary by traditional method for Thai. Currently, the existing model of Char-CNN uses a fixed input length and requires cutting off exceeding characters, which may lead to a missing of important content. In this paper, we propose a new Char-CNN model with a capability to accept any length of input by employing k-max pooling before a fully connected layer. The result shows that our model outperforms a Char-CNN model with a fixed input length on Thai news categorization. Moreover, our proposed method gives a better accuracy than many word-level methods: Naive Bayes, Logistic Regression, Support Vector Machine except a word-level CNN.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128584949","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":"Ambiguity in patent vocabulary: Experiments with clarity scores for claims and descriptions","authors":"J. Bertram, Thomas Mandl","doi":"10.1109/KST.2017.7886135","DOIUrl":"https://doi.org/10.1109/KST.2017.7886135","url":null,"abstract":"The ambiguity of query terms is a major obstacle for performance in information retrieval. Clarity or ambiguity scores measure how often terms appear together with different other terms by applying the Kullback-Leibler Divergence. These scores have been used to predict the performance of queries. We calculated the clarity scores within a large patent collection and compared the ambiguity of terms selected form claims and description within the same and within the other field.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128748858","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":"Time-frequency ratio hashing for content-based audio retrieval","authors":"Petcharat Panyapanuwat, Suwatchai Kamonsantiroj, Luepol Pipanmaekaporn","doi":"10.1109/KST.2017.7886103","DOIUrl":"https://doi.org/10.1109/KST.2017.7886103","url":null,"abstract":"Several approaches have previously been taken to the problem of content-based audio retrieval. These have used different features for indexing and searching. However, due to the nonstationarities and discontinuities exist in the audio signals, the retrieval strategy remains a formidable challenge. In this paper, we propose a novel fingerprint hash model with the concept of time-frequency ratio for audio matching in an attempt to achieve high retrieval accuracy. This model is examined using a database composed of variety of eight genres of 300 audio clips, collected from ballroom dataset. The results of the experiment support the effectiveness for audio retrieval with high precision and recall values at 0.99 and 0.95 respectively.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131399645","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}
Ryan Coughlin, Jean-Charles Coetsier, Rachsuda Jiamthapthaksin
{"title":"Integrating Labeled Latent Dirichlet Allocation into sentiment analysis of movie and general domains","authors":"Ryan Coughlin, Jean-Charles Coetsier, Rachsuda Jiamthapthaksin","doi":"10.1109/KST.2017.7886071","DOIUrl":"https://doi.org/10.1109/KST.2017.7886071","url":null,"abstract":"Sentiment Analysis is an ongoing research, which involves design and development of various algorithms. The goal of this work is to improve the accuracy of widely used algorithms in sentiment analysis. To achieve it, the work proposes to integrate different preprocessing methods including Labeled Latent Dirichlet Allocation, removing stop words and using adjectives that have a significant impact on the document's sentiment, into three popular text classification algorithms: Support Vector Machine, Naïve Bayes and artificial neural network. By implementing them and using 5 real datasets in general and specific domains, the study evaluates the effectiveness of the proposed preprocessing method in sentiment analysis. The results show that it achieves improvement on both domains.","PeriodicalId":190832,"journal":{"name":"2017 9th International Conference on Knowledge and Smart Technology (KST)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131239051","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}