2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)最新文献

筛选
英文 中文
On mining quantitative association rules from multi-relational data with FCA 基于FCA的多关系数据定量关联规则挖掘
M. Nagao, H. Seki
{"title":"On mining quantitative association rules from multi-relational data with FCA","authors":"M. Nagao, H. Seki","doi":"10.1109/IWCIA.2016.7805753","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805753","url":null,"abstract":"We consider the problem of mining quantitative association rules (ARs) from a multi-relational database (MRDB), where a database contains multiple tables (relations), and attributes in a table are either categorical or numerical (or quantitative). To handle numerical data in a precise and efficient way, we consider (logical) conjunctions with interval constraints, using the notion of closed interval patterns (CIPs) proposed by Kaytoue et al. in FCA (Formal Concept Analysis). We then propose an algorithm for mining quantitative ARs which satisfy both a minimum support and a minimum confidence. We also propose a pruning method tailored to computing CIPs and show its correctness. We give some experimental results, which show the effectiveness of the proposed method, compared with the conventional methods such as a discretization-based approach or an optimization-based approach.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130171498","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
Recognition of persisting emotional valence from EEG using convolutional neural networks 卷积神经网络在脑电图持续情绪效价识别中的应用
Miku Yanagimoto, C. Sugimoto
{"title":"Recognition of persisting emotional valence from EEG using convolutional neural networks","authors":"Miku Yanagimoto, C. Sugimoto","doi":"10.1109/IWCIA.2016.7805744","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805744","url":null,"abstract":"Recently there has been considerable interest in EEG-based emotion recognition (EEG-ER), which is one of the utilization of BCI. However, it is not easy to realize the EEG-ER system which can recognize emotions with high accuracy because of the tendency for important information in EEG signals to be concealed by noises. Deep learning is the golden tool to grasp the features concealed in EEG data and enable highly accurate EEG-ER because deep neural networks (DNNs) may have higher recognition capability than humans'. The publicly available dataset named DEAP, which is for emotion analysis using EEG, was used in the experiment. The CNN and a conventional model used for comparison are evaluated by the tests according to 11-fold cross validation scheme. EEG raw data obtained from 16 electrodes without general preprocesses were used as input data. The models classify and recognize EEG signals according to the emotional states \"positive\" or \"negative\" which were caused by watching music videos. The results show that the more training data are, the much higher the accuracies of CNNs are (by over 20%). It also suggests that the increased training data need not to belong to the same person's EEG data as the test data so as to get the CNN recognizing emotions accurately. The results indicate that there are not only the considerable amount of the interpersonal difference but also commonality of EEG properties.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122316448","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}
引用次数: 27
An ensemble model of self-organizing maps for imputation of missing values 缺失值估计的自组织映射集成模型
F. Saitoh
{"title":"An ensemble model of self-organizing maps for imputation of missing values","authors":"F. Saitoh","doi":"10.1109/IWCIA.2016.7805741","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805741","url":null,"abstract":"The purpose of this study is to improve the accuracy of missing value estimation by using self-organizing maps (SOMs). We propose an ensemble model of self-organizing maps, a new method for the imputation of missing values, which is an important preprocessing step in data analysis. Learning results of self-organizing maps have diversity because the self-organizing map's learning algorithm has a dependence on initial values; this property can be used to contribute to improving the accuracy of ensemble learning. In this study, we estimated missing values by an ensemble learning procedure that leverages the initial value dependence of the SOM. We tested the effectiveness of the proposed method by computational experiments using data published in the UCI Machine Learning Repository. Our experimental results confirmed that the proposed method produced higher accuracy than a conventional SOM when estimating values that were randomly set to missing.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124490535","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}
引用次数: 7
Efficiency improvement of imitation operator in multi-agent control model based on Cartesian Genetic Programming 基于笛卡尔遗传规划的多智能体控制模型中模仿算子的效率改进
Akira Hara, Hiroki Konishi, J. Kushida, T. Takahama
{"title":"Efficiency improvement of imitation operator in multi-agent control model based on Cartesian Genetic Programming","authors":"Akira Hara, Hiroki Konishi, J. Kushida, T. Takahama","doi":"10.1109/IWCIA.2016.7805751","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805751","url":null,"abstract":"In this paper, we focus on evolutionary optimization of multi-agent behavior. In our previous work, we have proposed a multi-agent control model based on Cartesian Genetic Programming (CGP). In CGP, each individual is represented by a graph-structural program. The CGP has a characteristics that each individual has multiple output nodes. Therefore, by assigning the outputs to respective agents, we can control multiple agents by an individual. The method enables multiple agents to not only take different actions according to their own roles but also share sub-programs if the same behavior is needed for solving problems. In addition, a new genetic operator for multi-agent control, imitation operator, has been proposed to facilitate the grouping of agents. An agent selects another agent at random for imitating the behavior. However, if the number of agents increases, the appropriate agent cannot always be selected for imitation. Therefore, in this paper, we propose a modified imitation operator for selecting useful agent. We applied our method to a food foraging problem. The experimental results showed that the performance of our method is superior to those of the conventional models.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126363021","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}
引用次数: 0
Cartesian ant programming with transition rule considering internode distance 考虑节点间距离的过渡规则笛卡尔蚁群规划
J. Kushida, Akira Hara, T. Takahama, Shogo Nagura
{"title":"Cartesian ant programming with transition rule considering internode distance","authors":"J. Kushida, Akira Hara, T. Takahama, Shogo Nagura","doi":"10.1109/IWCIA.2016.7805756","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805756","url":null,"abstract":"In recent years, Cartesian Ant Programming (CAP) has been proposed as a swarm-based automatic programming method, which combines graph representations in Cartesian Genetic Programming with search mechanism of Ant Colony Optimization. In CAP, once an ant jumps a number of nodes, the skipped nodes are not utilized and wasted in search. To make the use frequency of nodes uniform, we propose CAP with transition rule considering internode distance. We focus on the distance at the beginning of search to utilize a large number of nodes for exploration of search. As the search proceeds, the search comes to depend on the pheromone information for exploitation of search. In addition, to prevent the excessive use of the unnecessary nodes, we modify the method of dynamic symbol assignments to nodes so that not only functional symbols but also terminal symbols can be assigned to the respective nodes. We examined the effectiveness of our proposed method by applying it to symbolic regression problems. From the experimental results, we confirmed the improvement of performance and the relief of bias in use frequency of nodes by our proposed method.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131966710","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
Agent-based simulation of trust games for communication and information 基于agent的通信与信息信任博弈仿真
Tomoharu Hasegawa, Tomohiro Hayashida, I. Nishizaki, Shinya Sekizaki
{"title":"Agent-based simulation of trust games for communication and information","authors":"Tomoharu Hasegawa, Tomohiro Hayashida, I. Nishizaki, Shinya Sekizaki","doi":"10.1109/IWCIA.2016.7805757","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805757","url":null,"abstract":"A trust game is a two-player game in extended form. The sub game perfect equilibrium of the game is that a player called an investor does not invest the wealth. Because, this behavior is the best response of the investor according to the best response of the another player, called an investor, \"not invest\". Based on the experimental results of Blacht and Feltovitch(2009), many human subjects choose the equilibrium strategies. However, who are allowed to communicate with the opponent by cheap talk or to observe past activities of the opponent sometimes choose cooperative strategies not strategies. In this study, an agent-based simulation experiments are conducted to analyze the effect of the communication and information effects in the trust games. The experimental result indicates that the effect of information of the past behavior of the opponent to the cooperative behavior is larger than the effect of communication.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124304831","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}
引用次数: 0
Particle swarm optimization with dynamic search strategies based on landscape modality estimation 基于景观模态估计的动态搜索策略粒子群优化
Toshiki Nishio, J. Kushida, Akira Hara, T. Takahama
{"title":"Particle swarm optimization with dynamic search strategies based on landscape modality estimation","authors":"Toshiki Nishio, J. Kushida, Akira Hara, T. Takahama","doi":"10.1109/IWCIA.2016.7805758","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805758","url":null,"abstract":"The paper presents particle swarm optimization (PSO) with dynamic search strategies based on landscape modality estimation. In order to control search strategies, we introduce landscape modality estimation method using correlation coefficients between rankings of search points to PSO. This estimation method utilizes relationship between fitness and distance to a reference point to classify whether the landscape modality is uni-modal or multi-modal landscape. Our proposal method can switch the strategies properly according to landscape modality of an objective function. To confirm the search ability of the proposal method, we conducted experiments using standard benchmark functions. The experimental results show that the proposal method outperforms other PSO variants.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127344938","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}
引用次数: 0
A stock price forecasting application using neural networks with multi-optimizer 基于多优化器的神经网络股票价格预测应用
C. Worasucheep
{"title":"A stock price forecasting application using neural networks with multi-optimizer","authors":"C. Worasucheep","doi":"10.1109/IWCIA.2016.7805750","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805750","url":null,"abstract":"This paper proposes an application prototype for forecasting of stock prices using feed-forward neural network with back propagation, Particle Swarm Optimization and Differential Evolution. The prototype provides a convenient graphical user interface that allows choosing stocks, period of data, percentage of training set, technical indicators for model inputs and other algorithmic parameters. Multithreading is provided for efficient running and the downloaded historical data and forecasted output can be save for future use. An experiment was performed to investigate the performance of the three algorithms as well as the effects of number of hidden nodes of the neural networks.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127665678","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}
引用次数: 3
Recommendation incorporating transition of temporally intensive unity 建议纳入过渡的时间密集统一
Kenta Inuzuka, Tomonori Hayashi, T. Takagi
{"title":"Recommendation incorporating transition of temporally intensive unity","authors":"Kenta Inuzuka, Tomonori Hayashi, T. Takagi","doi":"10.1109/IWCIA.2016.7805743","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805743","url":null,"abstract":"It is important to note that user preferences change over time. However, it is not guaranteed that user preferences change at a steady rate. For example, a person who intensively listens to music of the same artist might intensively listen to the music of a different artist after a few days. For this reason, it is effective to incorporate such preference changes into recommender systems. In this paper, we propose an approach that predicts user preferences with consideration of preference changes by learning the transition of the preference that is the temporally intensive unity of purchasing items as one preference. Our approach is composed of a Kalman filter and matrix factorization. We show through experiments using a real-world dataset that our approach outperforms competitive methods such as the first order Markov model.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131013967","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
Recommending paragraphs of wikipedia pages as a travel guide 推荐维基百科页面的段落作为旅游指南
M. Tokuhisa, Yuuki Ishihara, Shuhei Kimura, Kenta Oku
{"title":"Recommending paragraphs of wikipedia pages as a travel guide","authors":"M. Tokuhisa, Yuuki Ishihara, Shuhei Kimura, Kenta Oku","doi":"10.1109/IWCIA.2016.7805749","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805749","url":null,"abstract":"This paper proposes a method to recommend paragraphs of Wikipedia pages as a travel guide. This method helps tourists (users) read attractive descriptions of Wikipedia pages during their travel. In order to rate paragraphs, importance, non-redundancy, and novelty of the paragraphs are evaluated based on a Tf-Idf manner. Especially, novelty is done by user's experience estimated from geo-tagged tweets located to places that the user visited in the past. As the results of the experiments, we confirmed the geo-tagged tweets reflected user's experience and the recommendations exceeded the expectation of MAP criteria.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133987802","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信