2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)最新文献

筛选
英文 中文
Fractional order state space canonical model identification using fractional order information filter 基于分数阶信息过滤器的分数阶状态空间正则模型识别
B. Safarinejadian, M. Asad
{"title":"Fractional order state space canonical model identification using fractional order information filter","authors":"B. Safarinejadian, M. Asad","doi":"10.1109/AISP.2015.7123479","DOIUrl":"https://doi.org/10.1109/AISP.2015.7123479","url":null,"abstract":"In the present paper the identification and estimation problem of a fractional order state space system will be addressed. This paper presents a fractional order information filter and also a hierarchical identification algorithm to identify and estimate parameters and states of a fractional order system. Then, merging this algorithm with fractional order information filter, a novel identification method based on hierarchical identification theory is introduced to reduce the computational complexity. Finally, the applicability and performance of this platform on an exemplary system is examined.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"65 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116580969","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
Dynamic swarm learning for nanoparticles to control drug release function using RBF networks in atherosclerosis 基于RBF网络的纳米颗粒动态群学习控制动脉粥样硬化药物释放功能
Alieh Hajizadeh-S, M. Akbarzadeh-T., A. Rowhanimanesh
{"title":"Dynamic swarm learning for nanoparticles to control drug release function using RBF networks in atherosclerosis","authors":"Alieh Hajizadeh-S, M. Akbarzadeh-T., A. Rowhanimanesh","doi":"10.1109/AISP.2015.7123492","DOIUrl":"https://doi.org/10.1109/AISP.2015.7123492","url":null,"abstract":"Nanomedicine is an interdisciplinary research area that aims at prevention, diagnosis and treatment of complex diseases by the nanoscale operators to reduce side effects and increase the cure rate. Simplicity and limited functionality of these particles, as well as the decentralized computing and the uncertain dynamics of the human body environment are some of major challenges in this area. In this paper, we propose that equipping the nano-agents with learning ability provides high robustness against the uncertainties and changing dynamics of the human body. In particular, we propose a swarm of learning nano-agents for the treatment of Atherosclerosis. The swarm learns to approximate the desirable drug release function that changes in time according to the environmental conditions of the disease location. For this purpose, we use radial basis function neuron structures that can adapt with human body. Experimental results show the effectiveness of the proposed method in terms of disease control time and drug release rate, as well as robustness against possible disturbances.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"429 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116700889","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}
引用次数: 5
A multi-agent solution to maximizing product adoption in dynamic social networks 动态社会网络中最大化产品采用率的多代理解决方案
Milad Vadoodparast, F. Taghiyareh
{"title":"A multi-agent solution to maximizing product adoption in dynamic social networks","authors":"Milad Vadoodparast, F. Taghiyareh","doi":"10.1109/AISP.2015.7123484","DOIUrl":"https://doi.org/10.1109/AISP.2015.7123484","url":null,"abstract":"It is an interesting problem in a social system investigating how to affect a large number of people by just investing on a minority of them. This problem, i.e., influence maximization, is called “maximizing product adoption” in marketing applications. In this paper, we first propose a multi-agent framework called MAFIM to be used for maximizing product adoption in dynamic social networks. MAFIM consists of two types of agents: modeling agents and solution provider agents. These agents view a dynamic social network as consecutive static network snapshots and regarding that, choose a budget assignment policy so that each snapshot obtains its share from the budget defined by the sales manager. Based on MAFIM, we present MASPEL, a single product model which takes network communities, their judgments on each other and their profitabilities into account. MASPEL makes use of a specific budget assignment policy in which budgets are assigned to advertisement campaigns in a progressively decreasing manner. We applied our model on several real and synthetic dynamic social networks then evaluated the effectiveness of different campaign lengths. Our results show that it is more effective to launch many short-lived campaigns instead of few long-lived ones. It was also observed that betweenness has the best performance among centrality-based heuristics in leading the majority towards liking the advertised product.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115111375","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 new algorithm for improving deficiencies of past self-organized criticality based extinction algorithms 一种新的基于自组织临界的消光算法
Ahmadreza Ghaffarizdeh, M. Eftekhari, Donya Yazdani, Kamilia Ahmadi
{"title":"A new algorithm for improving deficiencies of past self-organized criticality based extinction algorithms","authors":"Ahmadreza Ghaffarizdeh, M. Eftekhari, Donya Yazdani, Kamilia Ahmadi","doi":"10.1109/AISP.2015.7123506","DOIUrl":"https://doi.org/10.1109/AISP.2015.7123506","url":null,"abstract":"In this paper, new ideas are presented for resolving the issues of two past self-organized criticality (SOC) evolutionary algorithms (EAs). The concept of SOC was first developed for modeling Mass Extinction and implemented by means of Sand Pile model in EAs. These types of EAs are especially employed when the optimization problems are multimodal in which preserving the diversity of solutions is a crucial task. Therefore analyzing the problems of SOC based EAs is worthwhile for making a progress in the field of multimodal optimization. Consequently, after an exact inspection of past research studies, the major shortcomings of previously developed algorithms are addressed which are twofold: firstly, the lack of avalanches in early generations, and secondly, the number of avalanches occurred in a population is out of proportion in terms of population size. In order to resolve these problems, some solutions are proposed in this study. The impact of these modifications are examined and illustrated by means of several benchmark optimization problems extracted from past research studies. Modified algorithm is compared and contrasted against previously developed SOC based algorithms and classical Genetic Algorithm (CGA). Results apparently show the effectiveness of eliminating addressed deficiencies in terms of accuracy and escaping from local optima.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115206760","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
A novel image watermarking scheme using blocks coefficient in DHT domain 一种基于DHT域分块系数的图像水印算法
E. Moeinaddini, Roya Ghasemkhani
{"title":"A novel image watermarking scheme using blocks coefficient in DHT domain","authors":"E. Moeinaddini, Roya Ghasemkhani","doi":"10.1109/AISP.2015.7123512","DOIUrl":"https://doi.org/10.1109/AISP.2015.7123512","url":null,"abstract":"Copyright protection of digital media becomes a major problem in internet due to its nature which allows gross duplication, alteration or even stolen of data. Several watermarking methods are reported in recent years to protect copyright of digital images. A good watermarking algorithm must satisfy imperceptibility, robustness and high data hiding capacity but without compromising for any of them. In this paper a novel blind watermarking scheme in Hadamard transform domain for digital image is proposed. For embedding watermark bits we modify the DHT coefficient of two adjacent blocks in same position. Watermark is a string of characters. This algorithm offers advantages of simpler implementation, low computation cost and high resiliency under compression. The experimental results and performance analysis shows good robustness under JPEG image compression and other common image processing operations like cropping, rotation, noise addition and filtering.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"11 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114025252","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
Semi-supervised learning for named entity recognition using weakly labeled training data 基于弱标记训练数据的半监督学习命名实体识别
Atefeh Zafarian, Ali Rokni, Shahram Khadivi, Sonia Ghiasifard
{"title":"Semi-supervised learning for named entity recognition using weakly labeled training data","authors":"Atefeh Zafarian, Ali Rokni, Shahram Khadivi, Sonia Ghiasifard","doi":"10.1109/AISP.2015.7123504","DOIUrl":"https://doi.org/10.1109/AISP.2015.7123504","url":null,"abstract":"The shortage of the annotated training data is still an important challenge to building many Natural Language Process (NLP) tasks such as Named Entity Recognition. NER requires a large amount of training data with a high degree of human supervision whereas there is not enough labeled data for every language. In this paper, we use an unlabeled bilingual corpora to extract useful features from transferring information from resource-rich language toward resource-poor language and by using these features and a small training data, make a NER supervised model. Then we utilize a graph-based semi-supervised learning method that trains a CRF-based supervised classifier using that labeled data and uses high-confidence predictions on the unlabeled data to expand the training set and improve efficiency of NER model with the new training set.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127662989","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}
引用次数: 16
Improving the quality of overlapping community detection through link addition based on topic similarity 基于主题相似度的链接添加提高重叠社区检测质量
Sonia Ghiasifard, Shahram Khadivi, M. Asadpour, Atefeh Zafarian
{"title":"Improving the quality of overlapping community detection through link addition based on topic similarity","authors":"Sonia Ghiasifard, Shahram Khadivi, M. Asadpour, Atefeh Zafarian","doi":"10.1109/AISP.2015.7123518","DOIUrl":"https://doi.org/10.1109/AISP.2015.7123518","url":null,"abstract":"Community detection in social networks is usually done based on the density of connections between groups of nodes. However, these links do not necessarily represent an actual friendship especially in online social networks. There are users with declared friendship connections but without actual communication and no common interests. Most of the works in this area can be divided into two groups: topology-based and topic-based. The former usually leads to communities each containing diverse topics, and the latter leads to communities each with a consistent topic but with diverse structure. In this paper, we measure the similarity between users using topic models to generate virtual links for users with common interests. Moreover, in order to reduce the effect of useless links between users, we weight the network by measuring similarity of users' topics, so we could generate conforming communities, which contain only one topic or a group of consistent topics. The test results on Enron email dataset have shown the superior performance of our proposed method in the task of community detection.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127364885","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
Diffusion of innovations over multiplex social networks 创新在多元社会网络上的扩散
Rasoul Ramezanian, Mostafa Salehi, Matteo Magnani, D. Montesi
{"title":"Diffusion of innovations over multiplex social networks","authors":"Rasoul Ramezanian, Mostafa Salehi, Matteo Magnani, D. Montesi","doi":"10.1109/AISP.2015.7123501","DOIUrl":"https://doi.org/10.1109/AISP.2015.7123501","url":null,"abstract":"The ways in which an innovation (e.g., new behaviour, idea, technology, product) diffuses among people can determine its success or failure. In this paper, we address the problem of diffusion of innovations over multiplex social networks where the neighbours of a person belong to one or multiple networks (or layers) such as friends, families, or colleagues. To this end, we generalise one of the basic game-theoretic diffusion models, called networked coordination game, for multiplex networks. We present analytical results for this extended model and validate them through a simulation study, finding among other properties a lower bound for the success of an innovation. While simple and leading to intuitively understandable results, to the best of our knowledge this is the first extension of a game-theoretic innovation diffusion model for multiplex networks and as such it provides a basic framework to study more sophisticated innovation dynamics.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116981636","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}
引用次数: 11
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学术文献互助群
群 号:481959085
Book学术官方微信