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

筛选
英文 中文
Neural Networks with Complex-Valued Neurons for Recurrent and Feedforward Architectures 递归与前馈结构的复值神经元神经网络
J. Zurada
{"title":"Neural Networks with Complex-Valued Neurons for Recurrent and Feedforward Architectures","authors":"J. Zurada","doi":"10.1109/ICMLA.2007.116","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.116","url":null,"abstract":"data between private and public organization as well as the different levels of government. Ontologies have been shown in research to enhance the conceptual modeling of geographic data and allow a more effective and efficient way of integrating multiple sources of information. Different aspects such as fuzziness of the features, different levels of accuracy, precision and scale, heterogeneity of data models, generalization of concepts etc. may be resolved using ontologies. It still remains a challenge to use ontologies in order to automatically resolve the diverse geo-integration issues. One area that we are investigating is to integrate data related to shelters and hospitals with appropriate diverse geo-information sources so as to improve emergency management during floods, hurricanes and natural disasters.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"367 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":"122921281","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
Multi-Stages Genetic Algorithms: Introducing Temporal Structures to Facilitate Selection of Optimal Evolutionary Paths 多阶段遗传算法:引入时间结构以促进最优进化路径的选择
Ting Qian
{"title":"Multi-Stages Genetic Algorithms: Introducing Temporal Structures to Facilitate Selection of Optimal Evolutionary Paths","authors":"Ting Qian","doi":"10.1109/ICMLA.2007.86","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.86","url":null,"abstract":"Standard genetic algorithms (GA) are often confronted with the problem of rapid premature convergence. The loss of diversity in a population usually slows down evolution to a significant extent. In this paper, we explore the use of an original strategy called the multi-stages GA as a means of impeding premature convergence and optimizing evolutionary progresses at the same time. The algorithm introduces the idea of temporally organizing an evolutionary process. Evaluation results show that the multi-stages GA significantly outperforms the standard GA.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"92 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":"116568386","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
Toward optimal selection of feature clusters 特征聚类的优化选择
Lei Yu, Hao Li
{"title":"Toward optimal selection of feature clusters","authors":"Lei Yu, Hao Li","doi":"10.1109/ICMLA.2007.93","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.93","url":null,"abstract":"In microarray data analysis, the large number of equally predictive gene sets and the disparity among them reveals the gap between necessary genes for accurate models and candidate genes for biomarkers. We propose to bridge this gap by a new learning task, feature cluster selection, which aims to select all relevant features in a data set and group them into coherent clusters. We provide problem definitions and an empirical solution to feature cluster selection. Experiments on microarray data show that our proposed solution can select highly predictive representative gene sets and discover gene clusters with statistical significance.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"1 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":"130665040","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
Semantic Partition Based Association Rule Mining across Multiple Databases Using Abstraction 基于语义分区的抽象跨数据库关联规则挖掘
P. Santhi, Thilagam Sr Lecturer, V. S. Ananthanarayana, Professor
{"title":"Semantic Partition Based Association Rule Mining across Multiple Databases Using Abstraction","authors":"P. Santhi, Thilagam Sr Lecturer, V. S. Ananthanarayana, Professor","doi":"10.1109/ICMLA.2007.44","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.44","url":null,"abstract":"Association rule mining activity is both computationally and I/O intensive. A majority of ARM algorithms reported in the literature is efficient in handling high dimensional data but is single database based. Many enterprises maintain several databases independently to serve different purposes. There could be an implicit association among various parts of such data. In this paper, we investigate a mechanism to generate association rules (ARs) between the sets of values which are subsets of domains of attributes occurring in relations present in different databases. In our approach, the relevant databases, relations and attributes are identified using knowledge, multiple navigation paths are generated using data dictionary, a structure is constructed which semantically partitions the resultant relation using this navigation paths. We propose an efficient algorithm which uses this structure to generate ARs.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"32 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":"128275461","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
Web-based maze robot learning using fuzzy motion control system 基于web的迷宫机器人学习模糊运动控制系统
N. Yilmaz, Ş. Sağiroğlu
{"title":"Web-based maze robot learning using fuzzy motion control system","authors":"N. Yilmaz, Ş. Sağiroğlu","doi":"10.1109/ICMLA.2007.19","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.19","url":null,"abstract":"In this study, a Web based maze robot system has been designed and implemented for solving different maze algorithms with the help of machine learning approaches. The robot system has a map-based heuristic maze solving algorithm. The algorithm used for solving the maze is based on map creation and produces a control signal for robot direction. Robot motions were controlled by a fuzzy motion control system running on a chip. The control algorithm can be easily changed with the help of an algorithm via web interface controlled by the control center. The control center program powered by MATLAB functions and special libraries (image and control) in DELPHI manage all robotic activities. These activities are: command interpreter, image capturing, processing and serving, machine learning techniques, Web serving, database management, communication with robot, and compiling microcontroller programs. The results have shown that the proposed, designed and implemented system provides amazing new features to the applicants doing their real-time programming exercises on Web.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"9 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":"130997078","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
Association Learning in SOMs for Fuzzy-Classification som模糊分类中的关联学习
T. Villmann, Frank-Michael Schleif, M. Werff, A. Deelder, R. Tollenaar
{"title":"Association Learning in SOMs for Fuzzy-Classification","authors":"T. Villmann, Frank-Michael Schleif, M. Werff, A. Deelder, R. Tollenaar","doi":"10.1109/ICMLA.2007.29","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.29","url":null,"abstract":"We present a general framework for association learning in self-organizing maps (SOMs), which can be specified for the utilization for supervised fuzzy classification. In this way, we obtain a prototype based fuzzy classification model (FLSOM), which can be easily interpreted and visualized due to the fundamental properties of SOMs. Moreover, the provided extension gives the ability to detect class similarities. We apply this approch to classification and class similarity detection for mass spectrometric data in case of cancer disease and obtain comparable results. We demonstrate that the FLSOM-based class similarity detection leads to clinically expected class similarities. Finally, this approach can be taken a semi-supervised learning approach in a twofold sense: association learning is influenced by two terms an unsupervised and a supervised learning term. Further, if no association is given for a data point, only the unsupervised learning amount is applied.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"1 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":"131152793","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
Covariance matrix computations with federated databases 用联邦数据库计算协方差矩阵
B. Young, R. Bhatnagar, G. Tatavarty, Haiyun Bian
{"title":"Covariance matrix computations with federated databases","authors":"B. Young, R. Bhatnagar, G. Tatavarty, Haiyun Bian","doi":"10.1109/ICMLA.2007.88","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.88","url":null,"abstract":"We present an approach to computing the covariance matrix with federated databases. This is a useful tool in principal components analysis and other pattern recognition methodologies. The databases are implicitly joined by a set of arbitrary shared attributes. We compute the covariance matrix exactly rather than an approximation. We show the correctness of the approach with minimal data exchanged. Each node shares the composition of the global result. We assume that the values for shared attributes are allowed to be shared. Each node is allowed to ask for information and it will be truthfully given the summary it requests. We provide no proof of theorems or lemmas due to lack of space.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"34 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120909864","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
Combining active learning and relevance vector machines for text classification 结合主动学习和相关向量机进行文本分类
Catarina Silva, Bernardete Ribeiro
{"title":"Combining active learning and relevance vector machines for text classification","authors":"Catarina Silva, Bernardete Ribeiro","doi":"10.1109/ICMLA.2007.72","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.72","url":null,"abstract":"Relevance vector machines (RVM) have proven successful in many learning tasks. However, in large applications, they scale poorly. In many settings there is a large amount of unlabeled data which could be actively chosen by a learner and integrated in the learning procedure. The idea is to improve performance meanwhile reducing costs from data categorization. In this paper we propose an active learning RVM method based on the kernel trick. The underpinning idea is to define a working space between the relevance vectors (RV) initially obtained in a small labeled data set and the new unlabeled examples, where the most informative instances are chosen. By using kernel distance metrics, such a space can be defined and more informative examples can be added to the training set, increasing performance even though the problem dimension is not significantly affected. We detail the proposed method giving illustrative examples in the Reuters-21578 benchmark. Results show performance improvement and scalability.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"13 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":"124727487","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
Probabilistic Graphical Models-Theory, Algorithm, and Application 概率图形模型-理论,算法和应用
E. Xing
{"title":"Probabilistic Graphical Models-Theory, Algorithm, and Application","authors":"E. Xing","doi":"10.1109/ICMLA.2007.126","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.126","url":null,"abstract":"","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"75 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":"115906978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A music recommendation system with a dynamic k-means clustering algorithm 基于动态k-means聚类算法的音乐推荐系统
D. Kim, Kunsu Kim, Kyo-Hyun Park, Jee-Hyong Lee, Keon-Myung Lee
{"title":"A music recommendation system with a dynamic k-means clustering algorithm","authors":"D. Kim, Kunsu Kim, Kyo-Hyun Park, Jee-Hyong Lee, Keon-Myung Lee","doi":"10.1109/ICMLA.2007.97","DOIUrl":"https://doi.org/10.1109/ICMLA.2007.97","url":null,"abstract":"A large number of people download music files easily from Web sites. But rare music sites provide personalized services. So, we suggest a method for personalized services. We extract the properties of music from music's sound wave. We use STFT (shortest time fourier form) to analyze music's property. And we infer users' preferences from users' music list. To analyze users' preferences we propose a dynamic K-means clustering algorithm. The dynamic K-means clustering algorithm clusters the pieces in the music list dynamically adapting the number of clusters. We recommend pieces of music based on the clusters. The previous recommendation systems analyze a user's preference by simply averaging the properties of music in the user's list. So those cannot recommend correctly if a user prefers several genres of music. By using our K-means clustering algorithm, we can recommend pieces of music which are close to user's preference even though he likes several genres. We perform experiments with one hundred pieces of music. In this paper we present and evaluate algorithms to recommend music.","PeriodicalId":448863,"journal":{"name":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","volume":"1 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":"131522950","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
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学术官方微信