发布求助
文献互助 智能选刊 最新文献

Sixth International Conference on Machine Learning and Applications (ICMLA 2007)最新文献

筛选
英文 中文
Performance evaluation of EANT in the robocup keepaway benchmark EANT在robocup keepaway基准测试中的性能评估
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.23
J. H. Metzen, M. Edgington, Y. Kassahun, F. Kirchner
{"title":"Performance evaluation of EANT in the robocup keepaway benchmark","authors":"J. H. Metzen, M. Edgington, Y. Kassahun, F. Kirchner","doi":"10.1109/ICMLA.2007.23","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.23","url":null,"abstract":"Several methods have been proposed for solving reinforcement learning (RL) problems. In addition to temporal difference (TD) methods, evolutionary algorithms (EA) are among the most promising approaches. The relative performance of these approaches in certain subdomains of the general RL problem remains an open question at this time. In addition to theoretical analysis, benchmarks are one of the most important tools for comparing different RL methods in certain problem domains. A recently proposed RL benchmark problem is the Keepaway benchmark, which is based on the RoboCup Soccer Simulator. This benchmark is one of the most challenging multiagent learning problems because its state-space is continuous and high dimensional, and both the sensors and actuators are noisy. In this paper we analyze the performance of the neuroevolutionary approach called evolutionary acquisition of neural topologies (EANT) in the Keepaway benchmark, and compare the results obtained using EANT with the results of other algorithms tested on the same benchmark.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134345231","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}
引用次数: 34
Modeling Spatial-Temporal Epidemics Using STBL Model 基于STBL模型的时空流行病建模
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.112
L. Billard, Duck-Ki Kim, Chan-Hee Lee, Sung Duck Lee, Keon-Myung Lee, Sung-Soo Kim
{"title":"Modeling Spatial-Temporal Epidemics Using STBL Model","authors":"L. Billard, Duck-Ki Kim, Chan-Hee Lee, Sung Duck Lee, Keon-Myung Lee, Sung-Soo Kim","doi":"10.1109/ICMLA.2007.112","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.112","url":null,"abstract":"The Space Time Bilinear (STBL) model is a special form of a multiple bilinear time series which can be used to model time series which exhibit bilinear behavior on a spatial neighborhood structure. The STBL model and its identification have been proposed and discussed by Dai and Billard (1998). In this paper, we compare the STBL model with STARMA and single ARMA model. All problems are addressed by setting up the model in state space form and applying the Kalman filter. An application of the STBL model to epidemic surveillance data is given and the results com pared with those from other models.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127778032","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
Design of Simple Limit Cycles with Recurrent Neural Networks for Oscillatory Control 用递归神经网络设计振荡控制的简单极限环
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.99
G. Jouffroy
{"title":"Design of Simple Limit Cycles with Recurrent Neural Networks for Oscillatory Control","authors":"G. Jouffroy","doi":"10.1109/ICMLA.2007.99","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.99","url":null,"abstract":"This work deals with the search of parameters value for recurrent neural networks to generate a simple default limit cycle, to be used, and shaped for specific cases of oscillatory controller, instead of learning to a recurrent neural network to produce the specific oscillator behavior directly. We describe in detail, a generalized form of the \"teacher forcing\" gradient based algorithm, that can be used in the usual way but also as partial teacher forcing when target signals are not all available. We discuss the drawbacks of the resulting algorithm and propose a modified version in the 2 dimensions case, giving criterions toward higher order cases.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116337356","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
Technologies and Solutions for Trend Detection in Public Literature for Biomarker Discovery 面向生物标志物发现的公共文献趋势检测技术与解决方案
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.124
B. Wachmann
{"title":"Technologies and Solutions for Trend Detection in Public Literature for Biomarker Discovery","authors":"B. Wachmann","doi":"10.1109/ICMLA.2007.124","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.124","url":null,"abstract":"Data sets arising in biomedicine and bioinformatics are often huge and consist of quite different types of data (eg, sequence data and microarray measurements). Consequently, standard machine learning techniques usually cannot be directly applied. In this talk, I will describe an algorithm called affinity propagation and discuss why it offers flexibility in analyzing the kinds of data sets arising in bioinformatics and biomedicine. I'll describe applications in the areas of whole-genome transcript detection using microarrays, image segmentation, text analysis and motif discovery. Affinity propagation can implemented in a couple dozen lines of MATLAB or C and is suitable for distributed computing environments, making it attractive for high-throughput computations.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115561029","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 semantic and single term similarity measures for clustering turkish documents 聚类土耳其语文档的语义和单术语相似度度量的比较
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.32
B. Yucesoy, S. Oguducu
{"title":"Comparison of semantic and single term similarity measures for clustering turkish documents","authors":"B. Yucesoy, S. Oguducu","doi":"10.1109/ICMLA.2007.32","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.32","url":null,"abstract":"With the rapid growth of the World Wide Web (www), it becomes a critical issue to design and organize the vast amounts of on-line documents on the web according to their topic. Even for the search engines it is very important to group similar documents in order to improve their performance when a query is submitted to the system. Clusterng is useful for taxonomy design and similarity search of documents on such a domain. Similarity is fundamental to many clustering applications on hypertext. In this paper, we will study how measures of similarity are used to cluster a collection of documents on a web site. Most of the document clustering techniques rely on single term analysis of text, such as vector space model. To better group of related documents we propose a new semantic similarity measure. We compare our measure with Wu-Palmer similarity and cosine similarity. Experimental results show that cosine similarity perform better than the semantic similarities. We demonstrate our results on Turkish documents. This is a first study that considers the semantic similarities between Turkish documents.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126057853","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}
引用次数: 9
Polynomial and RBF Kernels as Marker Selection Tools-A Breast Cancer Case Study 多项式和RBF核作为标记选择工具——一个乳腺癌案例研究
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.67
M. Blazadonakis, M. Zervakis
{"title":"Polynomial and RBF Kernels as Marker Selection Tools-A Breast Cancer Case Study","authors":"M. Blazadonakis, M. Zervakis","doi":"10.1109/ICMLA.2007.67","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.67","url":null,"abstract":"The problem of marker selection in DNA microarray experiment, due to the \"curse of dimensionality\", has been mostly addressed so far by linear approaches. Taking into account the fact that the domain of interest is a complex one, where non-linear interconnections and dependencies may also exist among the extremely large number of examined genes, we address the use of nonlinear tools to assess the problem. In this study, we propose to apply the kernel ability of Support Vector Machines in combination with Fisher's ratio as an alternative approach to assess the problem.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121563625","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
CLASSEQ: Classification of Sequences via Comparative Analysis of Multiple Genomes CLASSEQ:通过多基因组比较分析的序列分类
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.94
Kwangmin Choi, Youngik Yang, Sun Kim
{"title":"CLASSEQ: Classification of Sequences via Comparative Analysis of Multiple Genomes","authors":"Kwangmin Choi, Youngik Yang, Sun Kim","doi":"10.1109/ICMLA.2007.94","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.94","url":null,"abstract":"CLASSEQ is a Web-based system for the analysis and comparison of uncharacterized protein sequences against multiple genomes. The user sequences are combined with protein sequences from the user-specified genomes and then clustered using our in-house fast clustering algorithm, BAG. The pre-computed genome-to-genome pairwise comparison database, PCDB, makes our service fast enough to be provided on the Web even though the analysis typically involves tens of thousands of sequences. Clusters containing the user input sequences can be further characterized by domain search, multiple sequence alignment, phylogenetic tree analysis, and gene neighborhood analysis. This Web service is a useful resource for characterizing proteins of unknown functions via comparative genomics approach. CLASSEQ is available at http://platcom.org/CLASSEQ.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132164712","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}
引用次数: 18
A New Ant Evolution Algorithm to Resolve TSP Problem 一种新的蚂蚁进化算法求解TSP问题
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.18
Qingbao Zhu, Shuyan Chen
{"title":"A New Ant Evolution Algorithm to Resolve TSP Problem","authors":"Qingbao Zhu, Shuyan Chen","doi":"10.1109/ICMLA.2007.18","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.18","url":null,"abstract":"Traveling salesman problem (TSP) is a combinatorial optimization problem. A new ant evolution algorithm to resolve TSP problem is proposed in this paper. Based on the latest achievement of research on actual ants, the algorithm first takes a set of Pareto optimal solution, which is obtained by scout ants using nearest-neighbor search and diffluence strategy, as the initial population. Then the operators of genetic algorithm, including self-adaptive crossover, mutation and inversion which have the strong local search ability, to speed up the procedure of optimization. Consequently, the optimal solution is obtained relatively fast. The experimental results showed that, the algorithm proposed in this paper is characterized by fast convergence, and can achieve better optimization results.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114334261","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}
引用次数: 24
A spline based regression technique on interval valued noisy data 区间值噪声数据的样条回归技术
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.100
Balaji Kommineni, Shubhankar Basu, R. Vemuri
{"title":"A spline based regression technique on interval valued noisy data","authors":"Balaji Kommineni, Shubhankar Basu, R. Vemuri","doi":"10.1109/ICMLA.2007.100","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.100","url":null,"abstract":"In this paper we present a spline based center and range method (SCRM) to perform regression on interval valued noisy data. The method provides a fast and accurate mechanism to model and predict upper and lower limits of unknown functions in a bounded design space. This technique is superior to previously existing techniques like center and range linear least square regression (CRM). The accurate models may find wide usage in high precision applications. The effectiveness of the proposed technique is demonstrated through experiments on datasets with various applications.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"1999 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128257599","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
Learning: An Effective Approach in Endgame Chess Board Evaluation 学习:棋局终局评估的有效方法
Sixth International Conference on Machine Learning and Applications (ICMLA 2007) Pub Date : 2007-12-13 DOI: 10.1109/ICMLA.2007.48
M. Samadi, Z. Azimifar, M. Z. Jahromi
{"title":"Learning: An Effective Approach in Endgame Chess Board Evaluation","authors":"M. Samadi, Z. Azimifar, M. Z. Jahromi","doi":"10.1109/ICMLA.2007.48","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.48","url":null,"abstract":"Classical chess engines exhaustively explore moving possibilities from a chess board position to decide what the next best move to play is. The main component of a chess engine is board evaluation function. In this article we present a new method to solve chess endgames optimally without using brute-force algorithms or endgame tables. We propose to use artificial neural network to obtain better evaluation function for endgame positions. This method is specifically applied to three classical endgames: king-bishop-bishop-king, king-rook-king, and king-queen-king. The empirical results show that the proposed learning strategy is effective in wining against an opponent who offers its best survival defense using Nalimov database of best endgame moves.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127065872","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
首页 上一页 下一页 尾页
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学术官方微信