7th International Conference on Hybrid Intelligent Systems (HIS 2007)最新文献_第3页

A Hybrid Approach to Intelligent Living Assistance 智能生活援助的混合方法

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.69

M. Nick, Martin Becker

引用次数: 16

Hybrid approach to solve a crew scheduling problem: an exact column generation algorithm improved by metaheuristics

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.58

A. G. Santos, G. Mateus

引用次数: 5

A Partitioning Fuzzy Clustering Algorithm for Symbolic Interval Data based on Adaptive Mahalanobis Distances 基于自适应Mahalanobis距离的符号区间数据分区模糊聚类算法

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.33

Camilo P. Tenorio, F. D. Carvalho, Julio T. Pimentel

引用次数: 4

New Particle Swarm Optimization Algorithm Incorporating Reproduction Operator for Solving Global Optimization Problems 求解全局优化问题的结合繁殖算子的粒子群算法

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.20

M. Pant, R. Thangaraj, A. Abraham

引用次数: 14

Content Based Image Retrieval using a Descriptors Hierarchy 使用描述符层次结构的基于内容的图像检索

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.63

R. E. Patiño-Escarcina, J. A. F. Costa

{"title":"Content Based Image Retrieval using a Descriptors Hierarchy","authors":"R. E. Patiño-Escarcina, J. A. F. Costa","doi":"10.1109/HIS.2007.63","DOIUrl":"https://doi.org/10.1109/HIS.2007.63","url":null,"abstract":"Content based image retrieval (CBIR), a technique which tries to find a set of images similar to a given example. Low level descriptors can be used to represent and index images. The main problem of CBIR is the gap between these descriptors and abstract concepts. The proposal present in this paper resembles the search process within a set of objects. First, objects can be found in a collection by looking general features and discarding those objects that do not fit into these features to reduce the search space. Next, another more specific feature can help to find these objects in the reduced search space. This work proposes the arrangement of low level descriptors into a hierarchy. This arrangement has to be done considering the detail of information that descriptor gives. Finally, descriptors on each level of the hierarchy are used to index images in the search space and a filter to reduce it has to be executed. This process is repeated until the low level of the hierarchy is reached. Experiments demonstrate the effectiveness of the proposed approach compared with the traditional ones and reveal it as a good option to implement CBIR systems.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122786456","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}

引用次数: 6

Particle Swarm Optimization of Neural Network Architectures andWeights 神经网络结构与权值的粒子群优化

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.45

Marcio Carvalho, Teresa B Ludermir

引用次数: 52

A Cooperative System of Metaheuristics 元启发式的合作系统

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.14

J. M. Cadenas, M. C. Garrido, E. M. Ballester

{"title":"A Cooperative System of Metaheuristics","authors":"J. M. Cadenas, M. C. Garrido, E. M. Ballester","doi":"10.1109/HIS.2007.14","DOIUrl":"https://doi.org/10.1109/HIS.2007.14","url":null,"abstract":"Hybrid systems give more flexible mechanisms for solving complex problems that can be very difficult to solve using less tolerant approaches. Therefore, a hybrid system will be the most suitable tool in order to cope with the algorithm-instance problem, which says that it is possible that an algorithm and its parameters that obtain good results for an instance of a problem, do not get the same results for another instance of the same problem. All this leads us to use different algorithms to solve combinatorial optimization problems within a single coordinated schema, that is a hybrid cooperative system of metaheuristics. In order to build this system we have proposed a methodology for the construction of a hybrid system, based on data mining and soft computing. In order to test the usefulness of this methodology two hybrid systems based on a fuzzy model have been constructed to solve the knapsack problem. The first system coordinates two metaheuristics, a genetic algorithm and a tabu search. The second one adds a third metaheuristic, simulated annealing, in order to check the robustness of the system and its capacity of obtaining higher quality solutions when a metaheuristic is added. Results obtained by this systems and a comparison with the ones obtained with individual metaheuristics are shown.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124722502","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

Comparative Study of Clustering Techniques for the Organization of Software Repositories 软件存储库组织的聚类技术比较研究

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.41

Ronaldo C. Veras, S. Meira, Adriano Oliveira, Bruno J. M. Melo

引用次数: 25

Markov-Blanket Based Strategy for Translating a Bayesian Classifier into a Reduced Set of Classification Rules 基于马尔可夫毛毯的贝叶斯分类器转化为简化分类规则集的策略

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.68

Estevam Hruschka, M. C. Nicoletti, V. Oliveira, G. Bressan

{"title":"Markov-Blanket Based Strategy for Translating a Bayesian Classifier into a Reduced Set of Classification Rules","authors":"Estevam Hruschka, M. C. Nicoletti, V. Oliveira, G. Bressan","doi":"10.1109/HIS.2007.68","DOIUrl":"https://doi.org/10.1109/HIS.2007.68","url":null,"abstract":"Bayesian network (BN) is a formalism for representing and reasoning about uncertain domains. In BN the knowledge is represented by a combination of a graph-based structure and probability theory. A particular type of BN known as Bayesian Classifier (BC) aims at classifying a given instance into a discrete class. BCs have been extensively used for modeling knowledge in many different applications and have been the focus of many works related to data mining. Depending on the size of a BC the understandability of the knowledge it represents is not an easy task. This paper proposes an approach to help the process of understanding the knowledge represented by a BC, by translating it into a more convenient and easily understandable form of representation, that of classification rules. The proposed method named BayesRule (BR) uses the concept of Markov Blanket (MB) to obtain a reduced set of rules in respect to both, the number of rules and the number of antecedents in rules. Experiments using the ALARM network showed that the reduced set of rules extracted from the BC can be smaller than the set of rules representing a decision tree generated by C4.5, and still maintains a high accuracy rate.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126289839","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

Dynamic Overlay Networks for Image Processing Grids 用于图像处理网格的动态覆盖网络

7th International Conference on Hybrid Intelligent Systems (HIS 2007) Pub Date : 2007-09-17 DOI: 10.1109/HIS.2007.50

Andreas Dinges, Björn Wagner, P. Müller

{"title":"Dynamic Overlay Networks for Image Processing Grids","authors":"Andreas Dinges, Björn Wagner, P. Müller","doi":"10.1109/HIS.2007.50","DOIUrl":"https://doi.org/10.1109/HIS.2007.50","url":null,"abstract":"During the development and parametrization of 2D image-processing algorithms for surface inspection uses, you need to test a huge amount of image-data for each modification of the algorithms or parameters. For algorithm runtimes up to several seconds, this will take a long time. To speed up this process it is recommended to distribute the computation in a parallel computation environment. Compute Grids, which use the unused resources of existing hardware are the most cost efficient way to solve this problem. The most existing Grid-Concepts are based on flat connection structures with a scheduler on the top; for high job-rates the scheduler becomes the bottleneck of the whole system. Concepts to solve this problem organize the nodes in tree-structures to discharge the central scheduler. In heterogeneous Desktop-Grids where the different nodes are widely distributed the usually used random arrangement of the nodes in the tree-structure can be counterproductive, because the bandwidthes and latencies in a Grid can be varying. In this paper we will show a solution to arrange the nodes of the grid optimized by bandwidth and latency, using modified spanning-tree algorithms, so that the average response time is reduced and in result of this the job-throughput of the Compute-Grid is increased.","PeriodicalId":359991,"journal":{"name":"7th International Conference on Hybrid Intelligent Systems (HIS 2007)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117269500","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