2011 11th International Conference on Hybrid Intelligent Systems (HIS)最新文献

筛选
英文 中文
A Bayesian approach for indoor human activity monitoring 室内人体活动监测的贝叶斯方法
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122126
Gamze Uslu, Ozgur Altun, S. Baydere
{"title":"A Bayesian approach for indoor human activity monitoring","authors":"Gamze Uslu, Ozgur Altun, S. Baydere","doi":"10.1109/HIS.2011.6122126","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122126","url":null,"abstract":"Activity monitoring plays a crucial role in ambient living environments for assessing changes in the normal behavioral pattern of elderly people. In this paper, we present a composite action description and detection model for activity monitoring. The model accomplishes real time continuous monitoring of composite actions by detecting the transitions from one simple action to another and determining the types of those actions. It utilizes a wearable TI Chronos watch with a built-in tri-axial accelerometer for data acquisition and uses naive Bayes classifier for the classification of simple actions; walk, sit stand and lie. The unique feature of these actions is that the transition between walk, sit and lie are the most likely causes of fall event in a home environment for elderly people. The early results of an experimental study conducted for the detection of the composite actions; walk-after-sit and sit-after-lie are very encouraging in terms of detection success rates.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130943886","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
Hybrid classifiers for improved semantic subspace learning of news documents 改进新闻文档语义子空间学习的混合分类器
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122075
Nandita Tripathi, M. Oakes, S. Wermter
{"title":"Hybrid classifiers for improved semantic subspace learning of news documents","authors":"Nandita Tripathi, M. Oakes, S. Wermter","doi":"10.1109/HIS.2011.6122075","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122075","url":null,"abstract":"The volume and diversity of documents available in today's world is increasing daily. It is therefore difficult for a single classifier to efficiently handle multi-level categorization of such a varied document space. In this paper we analyse methods to enhance the efficiency of a single classifier for two-level classification by combining it with classifiers of other types. We use the maximum significance value as an indicator for the subspace of a test document. We represent the documents using the conditional significance vector which increases the distinction between classes within a subspace. Our experiments show that dividing a document space into different semantic subspaces increases the efficiency of such hybrid classifier combinations. Applying different types of classifiers on different subspaces substantially improves overall learning.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"73 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133037570","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
DQAS implementation to support Base Analysis techniques in Data Quality Life Cycle 实施DQAS以支持数据质量生命周期中的基础分析技术
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122073
A. Aziz, Hasniza Hassan, M. Saman
{"title":"DQAS implementation to support Base Analysis techniques in Data Quality Life Cycle","authors":"A. Aziz, Hasniza Hassan, M. Saman","doi":"10.1109/HIS.2011.6122073","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122073","url":null,"abstract":"Good business decision making depends on how good information is provided. Due to this factor, the quality of data provided by transactions systems database is really important to organizations in order to produce the best solution for their company to move forward. Data Quality issues have become major problems in most enterprise systems where in some cases forced companies to stop their operations and in other, create chaos in life environment. Base Analysis technique is part of analyses which are introduced in our previous research in Data Quality Life Cycle. Base Analysis technique is used to profile heterogeneous data in a structured approach, with the intention to determine abnormal data. The technique contains three levels of analyses; Top Level Analysis, Middle Level Analysis and Low Level Analysis. On the other hand, Data Quality Analysis System is a tool developed using open source technologies that are connected to commercial databases to support Base Analysis and implemented in three-tier architecture. This paper describes the implementation of the system to perform data quality analysis using Human Resources data that reside inOracle database platform.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"633 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116082845","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
An improved path planning approach based on Particle Swarm Optimization 一种改进的基于粒子群优化的路径规划方法
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122097
Xianxiang Wu, Ming Yan, Juan Wang
{"title":"An improved path planning approach based on Particle Swarm Optimization","authors":"Xianxiang Wu, Ming Yan, Juan Wang","doi":"10.1109/HIS.2011.6122097","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122097","url":null,"abstract":"In this paper, an improved path planning scheme based on Particle Swarm Optimization and Ferguson Splines is proposed. Firstly, a string of Ferguson Splines are used to describe a path for a mobile robot, and the path planning problem is then equivalent to the optimization of parameters of particular cubic Ferguson splines. Secondly, an improved Particle Swarm Optimization Algorithm, which performs well in avoiding the premature convergence problem, is introduced to optimize the path. The experimental results illustrate the reasonability and great practical value of the proposed path planning scheme. A collision-avoiding smooth optimal path can be planned automatically within 60 iterations.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123410061","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
Comparison of intelligent schemes for scheduling OSPF routing table calculation OSPF路由表计算智能调度方案的比较
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122095
M. Haider, M. Soperi, K. A. Bakar
{"title":"Comparison of intelligent schemes for scheduling OSPF routing table calculation","authors":"M. Haider, M. Soperi, K. A. Bakar","doi":"10.1109/HIS.2011.6122095","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122095","url":null,"abstract":"Topology changes trigger routing protocol to undergo convergence process which prepares new shortest routes needed for packet delivery. Real-time applications (e.g. VoIP) nowadays require routing protocol to have a quick convergence time. This paper presents a new routing table calculation scheme for OSPF routing protocol to better serve real-time applications. The proposed scheme focus on speeding up OSPF networks convergence time by optimizing the scheduling of routing table calculations using computational intelligence technique. The computational intelligence technique that we use in the scheme is Feed Forward Back Propagation (BP) Neural Network. The scheme determines the suitable hold time based on three parameters: LSA-inter arrival time, the number of important control message in queue, and the computing utilization of the routers. We also provide performance comparison between our proposed scheme and another scheme which uses Generalized Regression Neural Network (GRNN). The result shows that the GRNN has higher accuracy and faster training speed compared to the BP neural network.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129073366","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
High performing stochastic local search algorithms for the QAP and their performance in dependence to the instance structure and size QAP的高性能随机局部搜索算法及其性能与实例结构和大小的关系
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122094
M. S. Hussin, T. Stützle
{"title":"High performing stochastic local search algorithms for the QAP and their performance in dependence to the instance structure and size","authors":"M. S. Hussin, T. Stützle","doi":"10.1109/HIS.2011.6122094","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122094","url":null,"abstract":"The Quadratic Assignment Problem (QAP) is a prominent NP-hard combinatorial optimization problem that arises in many real world applications. Solving the QAP to optimality is a very challenging task, and due to this, the QAP is mostly tackled by Stochastic Local Search (SLS) algorithms. Different SLS algorithms, however, achieve different levels of performance when tackling instances of different type, structure, or size. This holds true also for the QAP, where to date, no single SLS algorithm can be said to be the “best” approach for solving the QAP. Here we study the relationship between the relative performance of SLS algorithms for solving a class of real-life like Quadratic Assignment Problem instances and instance size. Experimental results show that population-based metaheuristic algorithms perform very well for solving this class of instances, compared to single point search approaches, and that their relative performance is relatively stable.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127745790","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
Evolutionary spiking neural networks as racing car controllers 作为赛车控制器的进化尖峰神经网络
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122141
Elias Yee, J. Teo
{"title":"Evolutionary spiking neural networks as racing car controllers","authors":"Elias Yee, J. Teo","doi":"10.1109/HIS.2011.6122141","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122141","url":null,"abstract":"The Izhikevich spiking neural network model is investigated as a method to develop controllers for a simple, but not trivial, car racing game, called TORCS. The controllers are evolved using Evolutionary Programming, and the performance of the best individuals is compared with the hand-coded controller included with the Simulated Car Racing Championship API. The results are promising, indicating that this neural network model can be applied to other games or control problems.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127811670","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}
引用次数: 13
A stopping criteria for the Growing Neural Gas based on a validity separation index for clusters 基于聚类有效性分离指标的神经毒气生长停止准则
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122169
Diego Chavez, Guillermo Laures, Kristel Loayza, Raquel Patiño
{"title":"A stopping criteria for the Growing Neural Gas based on a validity separation index for clusters","authors":"Diego Chavez, Guillermo Laures, Kristel Loayza, Raquel Patiño","doi":"10.1109/HIS.2011.6122169","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122169","url":null,"abstract":"Data clustering is a very known problem in the machine learning area, there are a lot of methods that are capable to achieve this task, one of them is the Growing Neural Gas network, which is an unsupervised incremental clustering algorithm, this network is able to learn the important topological relations in a given set of input vectors by means of a simple Hebb-like learning rule. In contrast to previous approaches, this model has parameters which changes over time and is able to continue learning, adding units and connections and occasional removal of units, until a performance criterion can tells it when to stop, without taking into account the iterations number. This article proposes a new stopping criteria for the Growing Neural Gas, based on the error rate of a novel validation index for clusters called SV index, which indicates how much compact are each cluster within each self, and how much separated are between them. The results of the experiments shows that the stopping criteria really avoid unnecessary training, pointing out the validation of the current proposal.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130139238","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
PSO and Computationally Inexpensive Sequential Forward Floating Selection in acquiring significant features for handwritten authorship PSO和计算成本低廉的顺序前向浮动选择在获取手写体作者重要特征中的应用
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122132
S. F. Pratama, A. Muda, Y. Choo, N. A. Muda
{"title":"PSO and Computationally Inexpensive Sequential Forward Floating Selection in acquiring significant features for handwritten authorship","authors":"S. F. Pratama, A. Muda, Y. Choo, N. A. Muda","doi":"10.1109/HIS.2011.6122132","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122132","url":null,"abstract":"The uniqueness of shape and style of handwriting can be used to identify the significant features in confirming the author of writing. Acquiring these significant features leads to an important research in Writer Identification domain. This paper is meant to explore the usage of feature selection in Writer Identification in order to find the most significant features. This paper proposes a hybrid feature selection method of Particle Swarm Optimization and Computationally Inexpensive Sequential Forward Floating Selection for Writer Identification. The promising applicability of the proposed method has been demonstrated and worth to receive further exploration in identifying the handwritten authorship.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129201687","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}
引用次数: 8
Bacterial Foraging Optimization Algorithm for neural network learning enhancement 用于神经网络学习增强的细菌觅食优化算法
2011 11th International Conference on Hybrid Intelligent Systems (HIS) Pub Date : 2011-12-01 DOI: 10.1109/HIS.2011.6122105
I. A. Al-Hadi, S. Hashim, S. Shamsuddin
{"title":"Bacterial Foraging Optimization Algorithm for neural network learning enhancement","authors":"I. A. Al-Hadi, S. Hashim, S. Shamsuddin","doi":"10.1109/HIS.2011.6122105","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122105","url":null,"abstract":"Backpropagation algorithm is widely used to solve many real-world problems, using the concept of Multilayer Perceptron. However, main disadvantages of Backpropagation are the convergence rate of it being relatively slow, and it is often trapped in the local minima. To solve this problem, it is found in the literatures, an evolutionary algorithm such as Particle Swarm Optimization algorithm is applied in feedforward neural network to optimize the learning process in terms of convergence rate and classification accuracy but this process needs longer training time. Hence to provide an alternative solution this study introduced, Bacterial Foraging Optimization Algorithm to be utilized in feedforward neural network to enhance the learning process and improve its convergence rate and classification accuracy. The developed Bacterial Foraging Optimization Algorithm Feedforward Neural Network (BFOANN) is compared against Particle Swarm Optimization Feedforward Neural Network (PSONN). The results show that BFOANN outperforms PSONN with better convergence rate and classification accuracy.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117065968","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}
引用次数: 35
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学术官方微信
小红书