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

Proceedings. International Conference on Machine Learning and Cybernetics最新文献

筛选
英文 中文
A new method for edge detection based on support vector classification 一种基于支持向量分类的边缘检测新方法
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1175339
Jing Lei, Xue-qin Shen
{"title":"A new method for edge detection based on support vector classification","authors":"Jing Lei, Xue-qin Shen","doi":"10.1109/ICMLC.2002.1175339","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1175339","url":null,"abstract":"An edge detection method based on a support vector machine is introduced. We use support vector classification (SVC) to detect image edges. With support vector classification, we can observe that: (1) it is very convenient for gray level images whose background and foreground lightness have large differences; (2) we can compress the images through the so-called support vector.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"41 22","pages":"1762-1764 vol.4"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICMLC.2002.1175339","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72411529","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
Real-time animation of CAD-MF system using simplified particle system and fast translation algorithms 利用简化粒子系统和快速平移算法实现CAD-MF系统的实时动画
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1167484
Mu Wang, N. Zhang, Xin Du
{"title":"Real-time animation of CAD-MF system using simplified particle system and fast translation algorithms","authors":"Mu Wang, N. Zhang, Xin Du","doi":"10.1109/ICMLC.2002.1167484","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1167484","url":null,"abstract":"In this paper, we present a simplified particle system and fast translation algorithm to generate real-time animation of a music fountain (MF). This paper briefly describes our algorithms used to simplify the particle system and the process to build the physical model of the music fountain. Then the approach used to translate the controlling information into the fountain animation is introduced. Finally, the simulation results and conclusion are given.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"108 1","pages":"1614-1618 vol.3"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79226660","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
The study of a new multiagent-based genetic algorithm 一种新的基于多智能体的遗传算法研究
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1167398
H. Deng, Yuejin Tan, Ji Li
{"title":"The study of a new multiagent-based genetic algorithm","authors":"H. Deng, Yuejin Tan, Ji Li","doi":"10.1109/ICMLC.2002.1167398","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1167398","url":null,"abstract":"Through the analysis and studying of the simple genetic algorithm (SGA) and its research state, the authors suggest a new multiagent-based genetic algorithm, define the environment of SGA, present the agent structure, genetic operator, target/evaluation function, and flow chat. Finally, they verify this new GA with two test functions. The results show that this new GA have many merits and advantages.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"37 1","pages":"1237-1240 vol.3"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84534601","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
Data distributions automatic identification based on SOM and support vector machines 基于SOM和支持向量机的数据分布自动识别
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1176770
Jia-Yuan Zhu, Heng-Xi Zhang, J. Guo, Jingyu Feng
{"title":"Data distributions automatic identification based on SOM and support vector machines","authors":"Jia-Yuan Zhu, Heng-Xi Zhang, J. Guo, Jingyu Feng","doi":"10.1109/ICMLC.2002.1176770","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1176770","url":null,"abstract":"It is very important to identify probability distributions fast and efficiently in data analysis. The paper analyzes data distributions automatic identification using a combined structure mode via self-organizing map and support vector machines. First, the paper sets up data distributions identification training sets, which are based on summary statistics including kurtosis, skewness, quantile and cumulative probability. Then, different data distributions are clustered using a self-organizing map. Furthermore, the clusters are learned and classified respectively using support vector machines. Finally, identification of random data distribution time series is tested in combined structure mode. The results indicate that the approach of the paper is feasible and efficient for automatically identifying data distributions in comparison with other methods.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"10 1","pages":"340-344 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81927664","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
Document segmentation using wavelet-domain multi-state hidden Markov models 基于小波域多态隐马尔可夫模型的文档分割
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1174532
Jin-ping Song, Xiaoyi Yang, Yuhua Hou, Y.Y. Tang
{"title":"Document segmentation using wavelet-domain multi-state hidden Markov models","authors":"Jin-ping Song, Xiaoyi Yang, Yuhua Hou, Y.Y. Tang","doi":"10.1109/ICMLC.2002.1174532","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1174532","url":null,"abstract":"Presents a document segmentation algorithm, called context-adapted wavelet-domain hidden Markov tree (CAHMT) model, which extends the wavelet-domain hidden Markov tree (HMT) model. The proposed CAHMT can achieve more accurate quality with low computation complexity in document segmentation. In addition to further improving the segmenting performance, we combine a differential operator and the lowest frequency subband with CAHMT and produce much better visual segmentation quality than the HMT.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"15 1","pages":"991-994 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81997312","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 research on graph-based model of MAS 基于图的MAS模型研究
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1175404
Hong-Bing Zhang, Jie-Yu Zhao, Xue-shan Luo
{"title":"A research on graph-based model of MAS","authors":"Hong-Bing Zhang, Jie-Yu Zhao, Xue-shan Luo","doi":"10.1109/ICMLC.2002.1175404","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1175404","url":null,"abstract":"The paper provides a new paradigm to use Bayesian-net model to build a new multi-agent system (MAS). We use influenced diagrams as a modeling representation of agents, which is used to interact with them to predict their behavior. We provide a framework that an agent can use to learn the model of other agents in a MAS system based on their observed behavior. Since the correct model Is usually unknown with certainty, our agents maintain a number of possible models and assign the probability of being correct Our modification refines the parameters of the influenced diagram used to model the other agent's capabilities, preferences, or beliefs. The modified model is then allowed to compete with the other models and the probability assigned to it being correct can be reached based on how well It predicts the observed behaviors of the other agent.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"4 1","pages":"2077-2081 vol.4"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82012656","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
CURE-NS: a hierarchical clustering algorithm with new shrinking scheme CURE-NS:一种具有新收缩方案的分层聚类算法
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1174512
Y. Qian, Qingzhang Shi, Qi Wang
{"title":"CURE-NS: a hierarchical clustering algorithm with new shrinking scheme","authors":"Y. Qian, Qingzhang Shi, Qi Wang","doi":"10.1109/ICMLC.2002.1174512","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1174512","url":null,"abstract":"CURE (clustering using representatives) is an efficient clustering algorithm for large databases, which is more robust to outliers compared with other clustering methods, and identifies clusters having non-spherical shapes and wide variances in size. CURE employs a fixed number or representative points to describe the cluster, and the set of representative points are first chosen randomly, and then are shrunk toward the mean of cluster. The shrinking operation plays a key role in CURE, which is used for weakening the effect of outliers. However, we found that the shrinking scheme of CURE is dependent on a hidden assumption of spherical shape of cluster, therefore CURE has difficulties in dealing with databases having specific shapes. In this paper, CURE-NS (CURE with new shrinking scheme) is proposed to overcome this problem, which uses the difference of density values of the representative points to determine the direction and distance of shrinking. Our shrinking scheme has nothing to do with the shape of cluster. A range of experiments demonstrate that CURE-NS has better clustering performance than CURE.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"12 1","pages":"895-899 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82185928","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}
引用次数: 15
A learning strategy in CBIR system design CBIR系统设计中的学习策略
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1174480
Sheng-rong Gong, Zhao-hui Wang, Jian-Min Zhao
{"title":"A learning strategy in CBIR system design","authors":"Sheng-rong Gong, Zhao-hui Wang, Jian-Min Zhao","doi":"10.1109/ICMLC.2002.1174480","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1174480","url":null,"abstract":"In this paper, a flexible relevance feedback learning strategy is proposed. Applying the learning strategy, the user can embed semantic information by interacting continuously with the retrieval system. Experimental results show that the designed learning strategy is robust, efficient and effective.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"64 1","pages":"754-756 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79509419","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
Optimizing index for semistructured data 优化半结构化数据的索引
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1176762
Liru Han, Xia-Qin Zheng, Xiao-Fang Li
{"title":"Optimizing index for semistructured data","authors":"Liru Han, Xia-Qin Zheng, Xiao-Fang Li","doi":"10.1109/ICMLC.2002.1176762","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1176762","url":null,"abstract":"We propose a set of strategies for optimizing the index for semistructured data. For example, for optimizing the path index, we propose the Improvea algorithm for mining association rules. Also, we propose a Colv algorithm. Based on these strategies, we provide optimizing algorithms for part of the basic query operations such as merger operation, selection operation and projection operation. These algorithms can improve query efficiency.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"10 1","pages":"303-306 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84648273","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
Mining Web log data based on key path 基于关键路径的Web日志数据挖掘
Proceedings. International Conference on Machine Learning and Cybernetics Pub Date : 2002-11-04 DOI: 10.1109/ICMLC.2002.1176728
Aibo Song, Zuo-Peng Liang, Mao-Xian Zhao, Yi-sheng Dong
{"title":"Mining Web log data based on key path","authors":"Aibo Song, Zuo-Peng Liang, Mao-Xian Zhao, Yi-sheng Dong","doi":"10.1109/ICMLC.2002.1176728","DOIUrl":"https://doi.org/10.1109/ICMLC.2002.1176728","url":null,"abstract":"A Web log mining method is presented. First, minimal key path set (MKPS) is defined and an algorithm to find the MKPS online is given. At the same time, for any key path in the MPKS, this algorithm can find out all transactions relevant to it. After scanning the transaction database only once, a relevant matrix is set up, where the key paths in MKPS are taken as columns and the transactions are taken as rows. Compared to previous methods, our method considers the three major features of users' accessing the Web: ordinal, contiguous, and duplicate. Moreover, for clustering transactions, we have lesser dimensions than the previous method. Using the clustering algorithm based on the relevant matrix, better clustering results will be obtained more precisely and quickly. Experiments show the effectiveness of the method.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"34 1","pages":"150-155 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84697569","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
首页 上一页 下一页 尾页
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学术官方微信