首页 > 最新文献

International Journal of Advanced Research in Artificial Intelligence最新文献

英文 中文
Breast Cancer Diagnosis using Artificial Neural Networks with Extreme Learning Techniques 使用极端学习技术的人工神经网络诊断乳腺癌
Pub Date : 2019-01-07 DOI: 10.14569/IJARAI.2014.030703
C. Utomo, Aan Kardiana, R. Yuliwulandari
Breast cancer is the second cause of dead among women. Early detection followed by appropriate cancer treatment can reduce the deadly risk. Medical professionals can make mistakes while identifying a disease. The help of technology such as data mining and machine learning can substantially improve the diagnosis accuracy. Artificial Neural Networks (ANN) has been widely used in intelligent breast cancer diagnosis. However, the standard Gradient-Based Back Propagation Artificial Neural Networks (BP ANN) has some limitations. There are parameters to be set in the beginning, long time for training process, and possibility to be trapped in local minima. In this research, we implemented ANN with extreme learning techniques for diagnosing breast cancer based on Breast Cancer Wisconsin Dataset. Results showed that Extreme Learning Machine Neural Networks (ELM ANN) has better generalization classifier model than BP ANN. The development of this technique is promising as intelligent component in medical decision support systems.
乳腺癌是妇女死亡的第二大原因。早期发现和适当的癌症治疗可以降低致命的风险。医疗专业人员在识别疾病时可能会犯错误。在数据挖掘和机器学习等技术的帮助下,可以大大提高诊断的准确性。人工神经网络(ANN)在乳腺癌智能诊断中得到了广泛的应用。然而,标准的基于梯度的反向传播人工神经网络(BP ANN)存在一些局限性。一开始需要设置参数,训练时间长,有可能陷入局部极小值。在这项研究中,我们基于乳腺癌威斯康星数据集实现了基于极限学习技术的人工神经网络诊断乳腺癌。结果表明,极限学习机神经网络(ELM ANN)具有比BP神经网络更好的泛化分类器模型。该技术作为医疗决策支持系统的智能组成部分,具有广阔的应用前景。
{"title":"Breast Cancer Diagnosis using Artificial Neural Networks with Extreme Learning Techniques","authors":"C. Utomo, Aan Kardiana, R. Yuliwulandari","doi":"10.14569/IJARAI.2014.030703","DOIUrl":"https://doi.org/10.14569/IJARAI.2014.030703","url":null,"abstract":"Breast cancer is the second cause of dead among women. Early detection followed by appropriate cancer treatment can reduce the deadly risk. Medical professionals can make mistakes while identifying a disease. The help of technology such as data mining and machine learning can substantially improve the diagnosis accuracy. Artificial Neural Networks (ANN) has been widely used in intelligent breast cancer diagnosis. However, the standard Gradient-Based Back Propagation Artificial Neural Networks (BP ANN) has some limitations. There are parameters to be set in the beginning, long time for training process, and possibility to be trapped in local minima. In this research, we implemented ANN with extreme learning techniques for diagnosing breast cancer based on Breast Cancer Wisconsin Dataset. Results showed that Extreme Learning Machine Neural Networks (ELM ANN) has better generalization classifier model than BP ANN. The development of this technique is promising as intelligent component in medical decision support systems.","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116647327","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}
引用次数: 69
Pursuit Reinforcement Competitive Learning: PRCL based Online Clustering with Tracking Algorithm and its Application to Image Retrieval 追求强化竞争学习:基于PRCL的在线聚类跟踪算法及其在图像检索中的应用
Pub Date : 2016-10-01 DOI: 10.14569/IJARAI.2016.050902
K. Arai
Pursuit Reinforcement guided Competitive Learning: PRCL based on relatively fast online clustering that allows grouping the data in concern into several clusters when the number of data and distribution of data are varied of reinforcement guided competitive learning is proposed. One of applications of the proposed method is image portion retrievals from the relatively large scale of the images such as Earth observation satellite images. It is found that the proposed method shows relatively fast on the retrievals in comparison to the other existing conventional online clustering such as Vector Quatization: VQ. Moreover, the proposed method shows much faster than the others for the multi-stage retrievals of image portion as well as scale estimation. A new approach for online clustering based on reinforcement learning, called Pursuit Reinforcement Guided Competitive Learning. PRCL which is derived from pursuit method in reinforcement learning that maintain both action- value and action preferences, with the preferences continually pursuing the action that is greedy according to the current action-value estimates together with learning automata is proposed. PRCL can be used as online clustering method. One of the applications is, then introduced for evacuation simulation. The following section describes the proposed PRCL with learning automata together with the existing conventional online clustering methods of RGCL, SRGCL and VQ. Then preliminary experiments are described followed by its application of image retrievals. After all, conclusion is described with some discussions.
追求强化引导竞争学习:提出了一种基于相对快速在线聚类的PRCL算法,该算法允许在数据数量和数据分布不同的情况下,将所关注的数据分组为几个聚类。该方法的应用之一是从对地观测卫星图像等相对大尺度的图像中提取图像部分。结果表明,与现有的矢量定性聚类方法相比,该方法的检索速度相对较快。此外,该方法在图像部分的多阶段检索和尺度估计方面都比其他方法快得多。一种基于强化学习的在线聚类新方法,称为追求强化引导竞争学习。PRCL是由强化学习中的追求方法衍生而来的,它同时保持动作价值和动作偏好,偏好根据当前估计的动作价值不断追求贪婪的动作,并结合学习自动机。PRCL可以作为在线聚类方法。然后将其应用于疏散模拟。下一节将介绍本文提出的带学习自动机的PRCL以及现有的常规在线聚类方法RGCL、SRGCL和VQ。然后进行了初步实验,并介绍了该方法在图像检索中的应用。毕竟,结论是用一些讨论来描述的。
{"title":"Pursuit Reinforcement Competitive Learning: PRCL based Online Clustering with Tracking Algorithm and its Application to Image Retrieval","authors":"K. Arai","doi":"10.14569/IJARAI.2016.050902","DOIUrl":"https://doi.org/10.14569/IJARAI.2016.050902","url":null,"abstract":"Pursuit Reinforcement guided Competitive Learning: PRCL based on relatively fast online clustering that allows grouping the data in concern into several clusters when the number of data and distribution of data are varied of reinforcement guided competitive learning is proposed. One of applications of the proposed method is image portion retrievals from the relatively large scale of the images such as Earth observation satellite images. It is found that the proposed method shows relatively fast on the retrievals in comparison to the other existing conventional online clustering such as Vector Quatization: VQ. Moreover, the proposed method shows much faster than the others for the multi-stage retrievals of image portion as well as scale estimation. A new approach for online clustering based on reinforcement learning, called Pursuit Reinforcement Guided Competitive Learning. PRCL which is derived from pursuit method in reinforcement learning that maintain both action- value and action preferences, with the preferences continually pursuing the action that is greedy according to the current action-value estimates together with learning automata is proposed. PRCL can be used as online clustering method. One of the applications is, then introduced for evacuation simulation. The following section describes the proposed PRCL with learning automata together with the existing conventional online clustering methods of RGCL, SRGCL and VQ. Then preliminary experiments are described followed by its application of image retrievals. After all, conclusion is described with some discussions.","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129734213","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
Creation of a Remote Sensing Portal for Practical Use Dedicated to Local Goverments in Kyushu, Japan 为日本九州地方政府创建实用遥感门户网站
Pub Date : 2016-03-01 DOI: 10.14569/IJARAI.2016.050301
K. Arai, M. Nakashima
Remote sensing portal site for practical uses which is dedicated to local governments is created. Key components of the site are (1) links to data providers, (2) links to the data analysis software tools, (3) examples of actual uses of the satellite remote sensing data in particular for local governments. Users’ demands for remote sensing satellite data are investigated for the local governments situated in Kyushu, Japan. According to the users’ demands, the remote sensing portal site is created with the aforementioned key components. For the examples of remote sensing data applications, creation of land use maps, disaster mitigations, forest maps, vegetation index map for evaluation of vitality of agricultural fields and forests, etc. are taken into account. In particular for forest map creation, it is created with free open source software: FOSS of classifiers together with open data API derived training samples applied to Landsat-8 OLI data. On the other hand, volcanic eruption is featured for disaster relief with 3D representation by using open data derived DEM data. In accordance with the users’ evaluation reports, it is found that the proposed portal site is useful.
创建了面向地方政府的实用遥感门户网站。该网站的关键组成部分是(1)与数据提供者的链接,(2)与数据分析软件工具的链接,(3)卫星遥感数据的实际使用示例,特别是为地方政府提供的实例。为日本九州地方政府调查了用户对遥感卫星数据的需求。根据用户需求,使用上述关键组件创建遥感门户网站。在遥感数据应用的例子中,考虑到制作土地利用图、减灾、森林图、用于评价农田和森林活力的植被指数图等。特别是对于森林地图的创建,它是使用免费的开源软件创建的:分类器的FOSS以及应用于Landsat-8 OLI数据的开放数据API派生的训练样本。另一方面,利用开放数据衍生的DEM数据,将火山喷发特征进行三维表示,用于灾害救援。根据用户的评估报告,发现建议的门户网站是有用的。
{"title":"Creation of a Remote Sensing Portal for Practical Use Dedicated to Local Goverments in Kyushu, Japan","authors":"K. Arai, M. Nakashima","doi":"10.14569/IJARAI.2016.050301","DOIUrl":"https://doi.org/10.14569/IJARAI.2016.050301","url":null,"abstract":"Remote sensing portal site for practical uses which is dedicated to local governments is created. Key components of the site are (1) links to data providers, (2) links to the data analysis software tools, (3) examples of actual uses of the satellite remote sensing data in particular for local governments. Users’ demands for remote sensing satellite data are investigated for the local governments situated in Kyushu, Japan. According to the users’ demands, the remote sensing portal site is created with the aforementioned key components. For the examples of remote sensing data applications, creation of land use maps, disaster mitigations, forest maps, vegetation index map for evaluation of vitality of agricultural fields and forests, etc. are taken into account. In particular for forest map creation, it is created with free open source software: FOSS of classifiers together with open data API derived training samples applied to Landsat-8 OLI data. On the other hand, volcanic eruption is featured for disaster relief with 3D representation by using open data derived DEM data. In accordance with the users’ evaluation reports, it is found that the proposed portal site is useful.","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115030553","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
Automatic Recognition of Human Parasite Cysts on Microscopic Stools Images using Principal Component Analysis and Probabilistic Neural Network 基于主成分分析和概率神经网络的显微粪便图像中人类寄生虫囊肿的自动识别
Pub Date : 2015-09-10 DOI: 10.14569/IJARAI.2015.040906
Beaudelaire Saha Tchinda, D. Tchiotsop, R. Tchinda, D. Wolf, M. Noubom
Parasites live in a host and get its food from or at the expensive of that host. Cysts represent a form of resistance and spread of parasites. The manual diagnosis of microscopic stools images is time-consuming and depends on the human expert. In this paper, we propose an automatic recognition system that can be used to identify various intestinal parasite cysts from their microscopic digital images. We employ image pixel feature to train the probabilistic neural networks (PNN). Probabilistic neural networks are suitable for classification problems. The main novelty is the use of features vectors extracted directly from the image pixel. For this goal, microscopic images are previously segmented to separate the parasite image from the background. The extracted parasite is then resized to 12x12 image features vector. For dimensionality reduction, the principal component analysis basis projection has been used. 12x12 extracted features were orthogonalized into two principal components variables that consist the input vector of the PNN. The PNN is trained using 540 microscopic images of the parasite. The proposed approach was tested successfully on 540 samples of protozoan cysts obtained from 9 kinds of intestinal parasites. - See more at: http://thesai.org/Publications/ViewPaper?Volume=4&Issue=9&Code=ijarai&SerialNo=6#sthash.S5fRMF9g.dpuf
寄生虫生活在宿主体内,从宿主那里获取食物,或者以宿主为代价。囊肿代表了寄生虫的抵抗和传播形式。显微粪便图像的人工诊断费时且依赖于人类专家。在本文中,我们提出了一种自动识别系统,可用于从显微数字图像中识别各种肠道寄生虫囊肿。我们利用图像像素特征训练概率神经网络(PNN)。概率神经网络适用于分类问题。其主要新颖之处在于使用了直接从图像像素提取的特征向量。为了实现这一目标,显微镜图像先前被分割以将寄生虫图像从背景中分离出来。然后将提取的寄生虫调整为12x12图像特征向量。在降维方面,采用主成分分析基投影法。12x12个提取的特征正交化成两个主成分变量,构成PNN的输入向量。PNN使用540张寄生虫的显微图像进行训练。该方法已在540份来自9种肠道寄生虫的原生动物囊体样本上进行了成功的测试。-详见:http://thesai.org/Publications/ViewPaper?Volume=4&Issue=9&Code=ijarai&SerialNo=6#sthash.S5fRMF9g.dpuf
{"title":"Automatic Recognition of Human Parasite Cysts on Microscopic Stools Images using Principal Component Analysis and Probabilistic Neural Network","authors":"Beaudelaire Saha Tchinda, D. Tchiotsop, R. Tchinda, D. Wolf, M. Noubom","doi":"10.14569/IJARAI.2015.040906","DOIUrl":"https://doi.org/10.14569/IJARAI.2015.040906","url":null,"abstract":"Parasites live in a host and get its food from or at the expensive of that host. Cysts represent a form of resistance and spread of parasites. The manual diagnosis of microscopic stools images is time-consuming and depends on the human expert. In this paper, we propose an automatic recognition system that can be used to identify various intestinal parasite cysts from their microscopic digital images. We employ image pixel feature to train the probabilistic neural networks (PNN). Probabilistic neural networks are suitable for classification problems. The main novelty is the use of features vectors extracted directly from the image pixel. For this goal, microscopic images are previously segmented to separate the parasite image from the background. The extracted parasite is then resized to 12x12 image features vector. For dimensionality reduction, the principal component analysis basis projection has been used. 12x12 extracted features were orthogonalized into two principal components variables that consist the input vector of the PNN. The PNN is trained using 540 microscopic images of the parasite. The proposed approach was tested successfully on 540 samples of protozoan cysts obtained from 9 kinds of intestinal parasites. - See more at: http://thesai.org/Publications/ViewPaper?Volume=4&Issue=9&Code=ijarai&SerialNo=6#sthash.S5fRMF9g.dpuf","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":" 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132012006","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}
引用次数: 10
A two-level on-line learning algorithm of Artificial Neural Network with forward connections 具有前向连接的人工神经网络两级在线学习算法
Pub Date : 2014-12-01 DOI: 10.14569/IJARAI.2014.031206
S. Placzek
An Artificial Neural Network with cross-connection is one of the most popular network structures. The structure contains: an input layer, at least one hidden layer and an output layer. Analysing and describing an ANN structure, one usually finds that the first parameter is the number of ANN’s layers. A hierarchical structure is a default and accepted way of describing the network. Using this assumption, the network structure can be described from a different point of view. A set of concepts and models can be used to describe the complexity of ANN’s structure in addition to using a two-level learning algorithm. Implementing the hierarchical structure to the learning algorithm, an ANN structure is divided into sub-networks. Every sub-network is responsible for finding the optimal value of its weight coefficients using a local target function to minimise the learning error. The second coordination level of the learning algorithm is responsible for coordinating the local solutions and finding the minimum of the global target function. In the article a special emphasis is placed on the coordinator’s role in the learning algorithm and its target function. In each iteration the coordinator has to send coordination parameters into the first level of sub-networks. Using the input X and the teaching ?? vectors, the local procedures are working and finding their weight coefficients. At the same step the feedback information is calculated and sent to the coordinator. The process is being repeated until the minimum of local target functions is achieved. As an example, a two-level learning algorithm is used to implement an ANN in the underwriting process for classifying the category of health in a life insurance company.
具有交叉连接的人工神经网络是目前最流行的网络结构之一。该结构包含:一个输入层、至少一个隐藏层和一个输出层。分析和描述一个人工神经网络结构,人们通常会发现第一个参数是人工神经网络的层数。分层结构是描述网络的默认和可接受的方式。利用这一假设,可以从不同的角度来描述网络结构。除了使用两级学习算法外,还可以使用一组概念和模型来描述人工神经网络结构的复杂性。在学习算法中实现分层结构,将人工神经网络结构划分为子网络。每个子网络负责使用局部目标函数找到其权系数的最优值,以最小化学习误差。学习算法的第二层协调层负责协调局部解和寻找全局目标函数的最小值。在本文中,特别强调了协调器在学习算法中的作用及其目标函数。在每次迭代中,协调器都要向第一层子网发送协调参数。使用输入X和教学??向量,局部程序正在工作并找到它们的权系数。在同一步骤中,计算反馈信息并将其发送给协调器。这个过程不断重复,直到达到局部目标函数的最小值。作为一个例子,采用两级学习算法在承保过程中实现人工神经网络,对寿险公司的健康类别进行分类。
{"title":"A two-level on-line learning algorithm of Artificial Neural Network with forward connections","authors":"S. Placzek","doi":"10.14569/IJARAI.2014.031206","DOIUrl":"https://doi.org/10.14569/IJARAI.2014.031206","url":null,"abstract":"An Artificial Neural Network with cross-connection is one of the most popular network structures. The structure contains: an input layer, at least one hidden layer and an output layer. Analysing and describing an ANN structure, one usually finds that the first parameter is the number of ANN’s layers. A hierarchical structure is a default and accepted way of describing the network. Using this assumption, the network structure can be described from a different point of view. A set of concepts and models can be used to describe the complexity of ANN’s structure in addition to using a two-level learning algorithm. Implementing the hierarchical structure to the learning algorithm, an ANN structure is divided into sub-networks. Every sub-network is responsible for finding the optimal value of its weight coefficients using a local target function to minimise the learning error. The second coordination level of the learning algorithm is responsible for coordinating the local solutions and finding the minimum of the global target function. In the article a special emphasis is placed on the coordinator’s role in the learning algorithm and its target function. In each iteration the coordinator has to send coordination parameters into the first level of sub-networks. Using the input X and the teaching ?? vectors, the local procedures are working and finding their weight coefficients. At the same step the feedback information is calculated and sent to the coordinator. The process is being repeated until the minimum of local target functions is achieved. As an example, a two-level learning algorithm is used to implement an ANN in the underwriting process for classifying the category of health in a life insurance company.","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130162094","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
Parameter optimization for intelligent phishing detection using Adaptive Neuro-Fuzzy 基于自适应神经模糊的网络钓鱼智能检测参数优化
Pub Date : 2014-10-01 DOI: 10.14569/IJARAI.2014.031003
P. Barraclough, G. Sexton, M. A. Hossain, N. Aslam
Phishing attacks has been growing rapidly in the past few years. As a result, a number of approaches have been proposed to address the problem. Despite various approaches proposed such as feature-based and blacklist-based via machine learning techniques, there is still a lack of accuracy and real-time solution. Most approaches applying machine learning techniques requires that parameters are tuned to solve a problem, but parameters are difficult to tune to a desirable output. This study presents a parameter tuning framework, using adaptive Neuron-fuzzy inference system with comprehensive data to maximize systems performance. Extensive experiment was conducted. During ten-fold cross-validation, the data is split into training and testing pairs and parameters are set according to desirable output and have achieved 98.74% accuracy. Our results demonstrated higher performance compared to other results in the field. This paper contributes new comprehensive data, novel parameter tuning method and applied a new algorithm in a new field. The implication is that adaptive neuron-fuzzy system with effective data and proper parameter tuning can enhance system performance. The outcome will provide a new knowledge in the field.
网络钓鱼攻击在过去几年中迅速增长。因此,提出了若干办法来解决这个问题。尽管通过机器学习技术提出了各种方法,如基于特征和基于黑名单的方法,但仍然缺乏准确性和实时性的解决方案。大多数应用机器学习技术的方法都需要调整参数来解决问题,但是参数很难调整到理想的输出。本研究提出一种参数整定架构,利用具有综合资料的自适应神经元-模糊推理系统,使系统效能最大化。进行了大量的实验。在十次交叉验证中,将数据分成训练对和测试对,并根据期望输出设置参数,准确率达到98.74%。与该领域的其他结果相比,我们的结果显示出更高的性能。本文提供了新的综合数据,新的参数整定方法,并在新的领域中应用了新的算法。由此可见,采用有效的数据和适当的参数整定可以提高自适应神经模糊系统的性能。结果将提供该领域的新知识。
{"title":"Parameter optimization for intelligent phishing detection using Adaptive Neuro-Fuzzy","authors":"P. Barraclough, G. Sexton, M. A. Hossain, N. Aslam","doi":"10.14569/IJARAI.2014.031003","DOIUrl":"https://doi.org/10.14569/IJARAI.2014.031003","url":null,"abstract":"Phishing attacks has been growing rapidly in the past few years. As a result, a number of approaches have been proposed to address the problem. Despite various approaches proposed such as feature-based and blacklist-based via machine learning techniques, there is still a lack of accuracy and real-time solution. Most approaches applying machine learning techniques requires that parameters are tuned to solve a problem, but parameters are difficult to tune to a desirable output. This study presents a parameter tuning framework, using adaptive Neuron-fuzzy inference system with comprehensive data to maximize systems performance. Extensive experiment was conducted. During ten-fold cross-validation, the data is split into training and testing pairs and parameters are set according to desirable output and have achieved 98.74% accuracy. Our results demonstrated higher performance compared to other results in the field. This paper contributes new comprehensive data, novel parameter tuning method and applied a new algorithm in a new field. The implication is that adaptive neuron-fuzzy system with effective data and proper parameter tuning can enhance system performance. The outcome will provide a new knowledge in the field.","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122244061","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
Comparison of Supervised and Unsupervised Learning Algorithms for Pattern Classification 模式分类中有监督与无监督学习算法的比较
Pub Date : 2013-02-01 DOI: 10.14569/IJARAI.2013.020206
R. Sathya, Jyoti Nivas, Annamma Abraham.
This paper presents a comparative account of unsupervised and supervised learning models and their pattern classification evaluations as applied to the higher education scenario. Classification plays a vital role in machine based learning algorithms and in the present study, we found that, though the error back-propagation learning algorithm as provided by supervised learning model is very efficient for a number of non-linear real-time problems, KSOM of unsupervised learning model, offers efficient solution and classification in the present study.
本文对高等教育场景下的无监督学习和有监督学习模型及其模式分类评价进行了比较分析。分类在机器学习算法中起着至关重要的作用,在本研究中,我们发现,虽然有监督学习模型提供的误差反向传播学习算法对于许多非线性实时问题是非常有效的,但无监督学习模型的KSOM在本研究中提供了有效的求解和分类。
{"title":"Comparison of Supervised and Unsupervised Learning Algorithms for Pattern Classification","authors":"R. Sathya, Jyoti Nivas, Annamma Abraham.","doi":"10.14569/IJARAI.2013.020206","DOIUrl":"https://doi.org/10.14569/IJARAI.2013.020206","url":null,"abstract":"This paper presents a comparative account of unsupervised and supervised learning models and their pattern classification evaluations as applied to the higher education scenario. Classification plays a vital role in machine based learning algorithms and in the present study, we found that, though the error back-propagation learning algorithm as provided by supervised learning model is very efficient for a number of non-linear real-time problems, KSOM of unsupervised learning model, offers efficient solution and classification in the present study.","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127462521","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}
引用次数: 351
Identification of Ornamental Plant Functioned as Medicinal Plant based on Redundant Discrete Wavelet Transformation 基于冗余离散小波变换的药用植物观赏植物识别
Pub Date : 2013-01-18 DOI: 10.14569/IJARAI.2013.020309
K. Arai, I. N. Abdullah, H. Okumura
Human has a duty to preserve the nature. One of the examples is preserving the ornamental plant. Huge economic value of plant trading, escalating esthetical value of one space and medicine efficacy that contained in a plant are some positive values from this plant. However, only few people know about its medicine efficacy. Considering the easiness to obtain and the medicine efficacy, this plant should be an initial treatment of a simple disease or option towards chemical based medicines. In order to let people get acquaint, we need a system that can proper identify this plant. Therefore, we propose to build a system based on Redundant Discrete Wavelet Transformation (RDWT) through its leaf. Since its character is translation invariant that able to produce some robust features to identify ornamental plant. This system was successfully resulting 95.83% of correct classification rate.
人类有责任保护自然。其中一个例子就是保护观赏植物。巨大的植物交易经济价值、不断提升的空间审美价值和一株植物所蕴含的药用功效都是该植物的积极价值。然而,只有少数人知道它的药用功效。考虑到易获得性和药效,该植物可作为简单疾病的初始治疗或化学类药物的选择。为了让人们了解它,我们需要一个能够正确识别这种植物的系统。因此,我们提出了一个基于冗余离散小波变换(RDWT)的系统。由于其具有平移不变性,因此能够产生一些鲁棒性特征来识别观赏植物。该系统的分类正确率达到95.83%。
{"title":"Identification of Ornamental Plant Functioned as Medicinal Plant based on Redundant Discrete Wavelet Transformation","authors":"K. Arai, I. N. Abdullah, H. Okumura","doi":"10.14569/IJARAI.2013.020309","DOIUrl":"https://doi.org/10.14569/IJARAI.2013.020309","url":null,"abstract":"Human has a duty to preserve the nature. One of the examples is preserving the ornamental plant. Huge economic value of plant trading, escalating esthetical value of one space and medicine efficacy that contained in a plant are some positive values from this plant. However, only few people know about its medicine efficacy. Considering the easiness to obtain and the medicine efficacy, this plant should be an initial treatment of a simple disease or option towards chemical based medicines. In order to let people get acquaint, we need a system that can proper identify this plant. Therefore, we propose to build a system based on Redundant Discrete Wavelet Transformation (RDWT) through its leaf. Since its character is translation invariant that able to produce some robust features to identify ornamental plant. This system was successfully resulting 95.83% of correct classification rate.","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128166324","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}
引用次数: 17
Brain Computer Interface Boulevard of Smarter Thoughts 智能思维的脑机接口大道
Pub Date : 2012-10-01 DOI: 10.14569/IJARAI.2012.010705
Sumit Ghulyani, Yash Pratap, Sumit Bisht, Ravideep Singh
The Brain Computer Interface is a major breakthrough for the technical industry, medical world, military and the society on a whole. It is concerned with the control of devices around us such as computing gears & even automobiles in the near future without really the physical intervention of the user. It helps bridge the communication gap between the society and the disabled. This mainly lays its focus on people suffering from brainstem stroke, going through a spinal cord injury or even blindness. BCI helps such patients to retain or restore communication with the outside world through intelligent signals from the brain due to the high risk of paralysis under such circumstances. This is achieved by a signal acquisition technique and converting these signals available from the sensors placed on the scalp into real-time computer commands that can be visually operated and understood. It has nothing to do with the natural neural transmission of brain signals but extracts them with the help of sensors to be processed and direct the outputs to an external device. This may also prove to be a major military gadget where troops may communicate their thoughts in highly stressed situations without breaking the hush. But, as every technology have some merits and demerits, so does BCI.
脑机接口是技术工业、医学界、军事乃至整个社会的重大突破。它关注的是在不久的将来,在没有用户实际干预的情况下,控制我们周围的设备,如计算设备甚至汽车。它有助于弥合社会与残疾人之间的沟通差距。该项目主要针对脑干中风患者、脊髓损伤患者甚至失明患者。由于在这种情况下瘫痪的风险很高,BCI帮助患者通过来自大脑的智能信号保持或恢复与外界的沟通。这是通过一种信号采集技术实现的,并将这些来自放置在头皮上的传感器的信号转换为可以直观操作和理解的实时计算机命令。它与大脑信号的自然神经传递无关,而是在传感器的帮助下提取信号,进行处理,并将输出定向到外部设备。这也可能被证明是一个主要的军事设备,部队可以在高度紧张的情况下交流他们的想法,而不会打破沉默。但是,正如每种技术都有其优缺点一样,BCI也是如此。
{"title":"Brain Computer Interface Boulevard of Smarter Thoughts","authors":"Sumit Ghulyani, Yash Pratap, Sumit Bisht, Ravideep Singh","doi":"10.14569/IJARAI.2012.010705","DOIUrl":"https://doi.org/10.14569/IJARAI.2012.010705","url":null,"abstract":"The Brain Computer Interface is a major breakthrough for the technical industry, medical world, military and the society on a whole. It is concerned with the control of devices around us such as computing gears & even automobiles in the near future without really the physical intervention of the user. It helps bridge the communication gap between the society and the disabled. This mainly lays its focus on people suffering from brainstem stroke, going through a spinal cord injury or even blindness. BCI helps such patients to retain or restore communication with the outside world through intelligent signals from the brain due to the high risk of paralysis under such circumstances. This is achieved by a signal acquisition technique and converting these signals available from the sensors placed on the scalp into real-time computer commands that can be visually operated and understood. It has nothing to do with the natural neural transmission of brain signals but extracts them with the help of sensors to be processed and direct the outputs to an external device. \u0000This may also prove to be a major military gadget where troops may communicate their thoughts in highly stressed situations without breaking the hush. But, as every technology have some merits and demerits, so does BCI.","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121218214","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
Solving the Resource Constrained Project Scheduling Problem to Minimize the Financial Failure Risk 解决资源受限的项目进度问题以降低财务失败风险
Pub Date : 2012-04-01 DOI: 10.14569/IJARAI.2012.010108
Zhi-Jie Chen, Chiuh-Cheng Chyu
In practice, a project usually involves cash in- and out- flows associated with each activity. This paper aims to minimize the payment failure risk during the project execution for the resource-constrained project scheduling problem (RCPSP). In such models, the money-time value, which is the product of the net cash in-flow and the time length from the completion time of each activity to the project deadline, provides a financial evaluation of project cash availability. The cash availability of a project schedule is defined as the sum of these money-time values associated with all activities, which is mathematically equivalent to the minimization objective of total weighted completion time. This paper presents four memetic algorithms (MAs) which differ in the construction of initial population and restart strategy, and a double variable neighborhood search algorithm for solving the RCPSP problem. An experiment is conducted to evaluate the performance of these algorithms based on the same number of solutions calculated using ProGen generated benchmark instances. The results indicate that the MAs with regret biased sampling rule to generate initial and restart populations outperforms the other algorithms in terms of solution quality. payment failure risk during the project execution. To achieve this goal, the money-time value, which is the product of the cash in-flow and the length from the time the cash received to the project makespan, can provide a financial evaluation of project cash availability. The cash availability of a project schedule is defined as the total money-time values associated with all activities. This financial metric does not consider discount rate, and it will provide a conservative estimate of cash in-flows during the project execution, since cash on hand will grow in value over time. In the proposed model, the cash in-flows are assumed to occur at the completion time of each activity, and the cash amounts can be used during the rest of project execution time. Hereafter, we shall refer to this model as the project cash availability maximization problem (PCAMP) for the resource constrained project scheduling problem (RCPSP). The PCAMP is mathematically equivalent to the RCPSP with the objective of minimizing total weighted completion time (also known as total weighted flow time). This problem is strongly NP-hard since its sub-problem, single machine scheduling with total flow time minimization objective subject
在实践中,一个项目通常涉及与每个活动相关的现金流入和流出。针对资源受限的项目调度问题(RCPSP),本文旨在使项目执行过程中的支付失败风险最小化。在这种模型中,现金-时间价值是净现金流入与从每项活动完成时间到项目截止日期的时间长度的乘积,它提供了对项目现金可用性的财务评价。项目进度表的现金可用性被定义为与所有活动相关的这些金钱时间值的总和,这在数学上等同于总加权完成时间的最小化目标。本文提出了四种不同初始种群构造和重启策略的模因算法,以及一种求解RCPSP问题的双变量邻域搜索算法。在使用ProGen生成的基准实例计算相同数量的解的基础上,进行了实验来评估这些算法的性能。结果表明,采用后悔偏差抽样规则生成初始种群和重新启动种群的MAs在解质量方面优于其他算法。项目执行过程中的付款失败风险。为了实现这一目标,货币时间价值,即现金流入和从收到现金到项目完工时间的长度的乘积,可以提供对项目现金可用性的财务评估。项目进度表的现金可用性定义为与所有活动相关的总金钱时间值。这个财务指标不考虑贴现率,并且它将在项目执行期间提供现金流入的保守估计,因为手头的现金将随着时间的推移而增长。在建议的模型中,假定现金流入发生在每个活动的完成时间,并且现金金额可以在项目执行时间的剩余时间内使用。我们将此模型称为资源约束型项目调度问题(RCPSP)的项目现金可用性最大化问题(PCAMP)。PCAMP在数学上等同于RCPSP,其目标是最小化总加权完井时间(也称为总加权流时间)。该问题的子问题是以总流时间最小化为目标的单机调度问题,因此具有强np困难性
{"title":"Solving the Resource Constrained Project Scheduling Problem to Minimize the Financial Failure Risk","authors":"Zhi-Jie Chen, Chiuh-Cheng Chyu","doi":"10.14569/IJARAI.2012.010108","DOIUrl":"https://doi.org/10.14569/IJARAI.2012.010108","url":null,"abstract":"In practice, a project usually involves cash in- and out- flows associated with each activity. This paper aims to minimize the payment failure risk during the project execution for the resource-constrained project scheduling problem (RCPSP). In such models, the money-time value, which is the product of the net cash in-flow and the time length from the completion time of each activity to the project deadline, provides a financial evaluation of project cash availability. The cash availability of a project schedule is defined as the sum of these money-time values associated with all activities, which is mathematically equivalent to the minimization objective of total weighted completion time. This paper presents four memetic algorithms (MAs) which differ in the construction of initial population and restart strategy, and a double variable neighborhood search algorithm for solving the RCPSP problem. An experiment is conducted to evaluate the performance of these algorithms based on the same number of solutions calculated using ProGen generated benchmark instances. The results indicate that the MAs with regret biased sampling rule to generate initial and restart populations outperforms the other algorithms in terms of solution quality. payment failure risk during the project execution. To achieve this goal, the money-time value, which is the product of the cash in-flow and the length from the time the cash received to the project makespan, can provide a financial evaluation of project cash availability. The cash availability of a project schedule is defined as the total money-time values associated with all activities. This financial metric does not consider discount rate, and it will provide a conservative estimate of cash in-flows during the project execution, since cash on hand will grow in value over time. In the proposed model, the cash in-flows are assumed to occur at the completion time of each activity, and the cash amounts can be used during the rest of project execution time. Hereafter, we shall refer to this model as the project cash availability maximization problem (PCAMP) for the resource constrained project scheduling problem (RCPSP). The PCAMP is mathematically equivalent to the RCPSP with the objective of minimizing total weighted completion time (also known as total weighted flow time). This problem is strongly NP-hard since its sub-problem, single machine scheduling with total flow time minimization objective subject","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127507412","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
期刊
International Journal of Advanced Research in Artificial Intelligence
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1