2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)最新文献_第8页

iCAST 2019 TOC

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/icawst.2019.8923601

引用次数: 0

An Approach for Automatic Aspect Extraction by Latent Dirichlet Allocation 一种基于潜狄利克雷分配的面向自动提取方法

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/ICAwST.2019.8923417

S. Das, B. Chakraborty

{"title":"An Approach for Automatic Aspect Extraction by Latent Dirichlet Allocation","authors":"S. Das, B. Chakraborty","doi":"10.1109/ICAwST.2019.8923417","DOIUrl":"https://doi.org/10.1109/ICAwST.2019.8923417","url":null,"abstract":"Now a days internet has taken over all form of communication and activities. One of the most affected area is e-commerce which survives through internet. One of the vital process of business survival is customer feedback. There are several form of platforms where the feedbacks can be posted. The main task is to accumulate all the reviews and summarize them in a conceivable manner. The approach here is to summarize the reviews in aspect based manner. This representation will help future consumers to make well informed decision. LDA is one of the popular methods to extract latent topics comprising a document. The present approach intends to use that characteristic to extract aspects from review corpora. The current scope of work is to extract and improve the quality of topics. After several corpora of product reviews were processed through this method, the results were examined through graphically plotting the topics and also examining the dominant keywords of the topics. Finally the accumulated results of the present method are compared with the results of previously implemented Word2Vec based model and human extracted aspects.","PeriodicalId":156538,"journal":{"name":"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129449483","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}

引用次数: 2

Definition and Goal of Graph Clustering -Motivation to Explore a New Algorithm 图聚类的定义与目标——探索新算法的动机

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/ICAwST.2019.8923556

Yuching Lu, G. Chakraborty

{"title":"Definition and Goal of Graph Clustering -Motivation to Explore a New Algorithm","authors":"Yuching Lu, G. Chakraborty","doi":"10.1109/ICAwST.2019.8923556","DOIUrl":"https://doi.org/10.1109/ICAwST.2019.8923556","url":null,"abstract":"In recent years, one of the popular method for mining evolving data, is to convert it to a network, in fact an adjacency matrix, where data units are nodes and their relations/similarity are the link weights. The network is then partitioned into communities to explore information hidden in the data. For last 50 years, various graph partitioning algorithms are proposed. Depending on the application, the optimization objective of the partitioning and the resulting clusters are different. Different algorithms, based on Linear Algebra, heuristics with different greedy optimization criterion, agglomerative algorithms, are proposed to meet different optimization criterion suitable for target network and application.In this work we proposed a genetic algorithm (GA) based dynamic clustering algorithm. Genetic algorithm (GA) for graph clustering, with fitness function as the modularity index, is already proposed, in our previous works. In this work, we propose a multimodal GA. The algorithm starts with modularity index (Q) as the optimization criterion. Once converged, we add another term in the fitness function which will balance the cardinalities of the partitions. The parameters are computed based on the partitions after the first stage of convergence. We continue to run the Genetic search with modified fitness function until a second convergence is achieved. In all our experiments, not only could we achieve better balance of the size of different clusters, in many experiments it actually improved the modularity index. For a highly modular graph, with Q ≥ 0.7, most of the algorithms produce the same result. When the optimum modularity index of the graph is low, GA with only modularity index as optimization criterion usually converges in local minimum. With the proposed modification, we could always find clustering with an improved Q value. We run popular partitioning algorithms on known real-world networks and found that the proposed algorithm could find better partitioning, closest to reality.","PeriodicalId":156538,"journal":{"name":"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130845282","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}

引用次数: 1

Indoor Location Estimation of a Moving Subject Based on a Simple Motion Sensor Array 基于简单运动传感器阵列的运动目标室内位置估计

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/ICAwST.2019.8923162

Ryo Ota, T. Hanyu, Qiangfu Zhao

引用次数: 0

Continuous Cuffless Blood Pressure Estimation Based on Pulse Transit Time: A New Evaluation with Invasive BP Reference* 基于脉冲传递时间的连续无袖带血压估计:一种新的有创血压参考评估方法*

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/ICAwST.2019.8923341

Zunyi Tang, Ying Chen, Shing-Hong Liu, Toshio Kobayashi, Wenxi Chen

引用次数: 1

Dehazed Image Enhancement by a Gamma Correction with Global Limits 基于全局极限的伽玛校正去雾图像增强

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/ICAwST.2019.8923309

C. Hsieh

引用次数: 0

A Study on Multi-objective Chaotic Evolution Algorithms Using Multiple Chaotic Systems 基于多混沌系统的多目标混沌进化算法研究

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/ICAwST.2019.8923329

Zitong Wang, Yan Pei

{"title":"A Study on Multi-objective Chaotic Evolution Algorithms Using Multiple Chaotic Systems","authors":"Zitong Wang, Yan Pei","doi":"10.1109/ICAwST.2019.8923329","DOIUrl":"https://doi.org/10.1109/ICAwST.2019.8923329","url":null,"abstract":"We investigate the optimization performance of multi-objective chaotic evolution (MOCE) algorithm with implementations using different chaotic systems. A comparison experiment of MOCE algorithms with four chaotic systems are employed in MOCE to analyse whether chaotic systems will affect the optimization performance of the MOCE algorithms. We analyze and discuss the performance of the MOCE algorithms implemented using different chaotic systems. Four chaotic systems are introduced in this work, i.e., the logistic map, the Hénon map, the tent map, and the Gauss map, respectively. The number of Pareto solution and the diversity of Pareto solution are two evaluation metrics to evaluate the performance of the multi-objective optimization algorithm. We apply the statistical tests to analyse and investigate the number of Pareto solution and their diversity. The evaluation results indicate that the MOCE with the logistic map has the best optimization performance in both the number of Pareto solution and their diversity. The statistical significance demonstrates that chaotic systems have a great influence on the optimization performance of MOCE algorithms.","PeriodicalId":156538,"journal":{"name":"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130861371","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}

引用次数: 4

A Short Answer Grading System in Chinese by CNN CNN的中文简答评分系统

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/ICAwST.2019.8923528

Shih-Hung Wu, Chun-Yu Yeh

引用次数: 3

Ambiguous Utterance Aware: Communication Learning System for Pragmatic Language Disorders Using a Humanoid Robot 模糊话语感知:基于仿人机器人的语用语言障碍交流学习系统

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/ICAwST.2019.8923299

K. Yabuki, Kaoru Sumi

引用次数: 0

Fault-Tolerant Visual Secret Sharing Scheme Using Meaningful Shares 基于有意义共享的容错可视化秘密共享方案

2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST) Pub Date : 2019-10-01 DOI: 10.1109/ICAwST.2019.8923462

Yu-Chun Chung, Jia-Hao Ou, J. Juan

引用次数: 1