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

2012 Conference on Technologies and Applications of Artificial Intelligence最新文献

筛选
英文 中文
Genre Classification for Musical Documents Based on Extracted Melodic Patterns and Clustering 基于旋律模式提取和聚类的音乐文档类型分类
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.23
Bor-Shen Lin, Tai-Cheng Chen
{"title":"Genre Classification for Musical Documents Based on Extracted Melodic Patterns and Clustering","authors":"Bor-Shen Lin, Tai-Cheng Chen","doi":"10.1109/TAAI.2012.23","DOIUrl":"https://doi.org/10.1109/TAAI.2012.23","url":null,"abstract":"Genre classification for musical documents is conventionally based on keywords, statistical features or low-level acoustic features. Such features are either lack of in-depth information of music content or incomprehensible for music professionals. This paper proposed a classification scheme based on the correlation analysis of the melodic patterns extracted from music documents. The extracted patterns can be further clustered, and smoothing techniques for the statistics of the patterns can be utilized to improve the performance effectively. The accuracy of 70.67% for classifying five types of genre, including jazz, lyric, rock, classical and others, can be achieved, which outperforms an ANN-based classifier using statistical features significantly. The patterns can be converted into symbolic forms such that the classification results are meaningful and comprehensible for most music workers.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128999481","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
Genetic Algorithm for Solving the Master Thesis Timetabling Problem with Multiple Objectives 遗传算法求解多目标硕士论文排课问题
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.50
Thi Thanh Binh Huynh, Pham Quang Dung, D. Pham
{"title":"Genetic Algorithm for Solving the Master Thesis Timetabling Problem with Multiple Objectives","authors":"Thi Thanh Binh Huynh, Pham Quang Dung, D. Pham","doi":"10.1109/TAAI.2012.50","DOIUrl":"https://doi.org/10.1109/TAAI.2012.50","url":null,"abstract":"Master thesis defense scheduling problem is a real-world practical problem that arises from the Vietnamese Universities. In this paper, we give the formulation of the problem based on realistic requirements. We then show that the considered problem is NP-hard and propose a genetic algorithm for solving it. We experiment the proposed algorithm on the real problem instances taken from Hanoi University of Science and Technology. Experimental results show the feasibility of proposed algorithm.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121133304","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
Visualization as Curation with a Holistic Communication 可视化作为整体沟通的策展
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.52
A. Abe
{"title":"Visualization as Curation with a Holistic Communication","authors":"A. Abe","doi":"10.1109/TAAI.2012.52","DOIUrl":"https://doi.org/10.1109/TAAI.2012.52","url":null,"abstract":"Recently (last year) for business and information market, several researchers have pointed out the importance of curation. I have also proposed curation in chance discovery. Both curation aim to offer a certain information to users. And curation in chance discovery suggested a new type of visualization. This paper discusses visualization from the viewpoint of curation, especially from the viewpoint of curation in chance discovery.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132535328","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
Solving a Goal-Planning Task in the MASH Project 解决MASH项目中的一个目标规划任务
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.19
Jean-Baptiste Hoock, Jacques Bibai
{"title":"Solving a Goal-Planning Task in the MASH Project","authors":"Jean-Baptiste Hoock, Jacques Bibai","doi":"10.1109/TAAI.2012.19","DOIUrl":"https://doi.org/10.1109/TAAI.2012.19","url":null,"abstract":"The MASH project is a collaborative platform with the aim to experiment different methods in an unknown environment of large size. The application is a goal-planning task in a 3D video game where runs are expensive. Moreover, there is no prior knowledge, the decisions have unknown semantics, observations on the environment are partial and of big size and accomplishing the task by taking random decisions always requires a very long run. So, solving this task is a big challenge. In this paper, we extend Monte-Carlo Tree Search, which has been proved very effective for applications in which simulating is easy and fast, to contexts in which there are only ârealâ expensive runs. This generic approach combines Clustering and Monte-Carlo Tree Search.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132651877","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
Performance Analysis of Consultation Methods in Computer Chess 计算机国际象棋咨询方法的性能分析
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.34
S. Omori, K. Hoki, Takeshi Ito
{"title":"Performance Analysis of Consultation Methods in Computer Chess","authors":"S. Omori, K. Hoki, Takeshi Ito","doi":"10.1109/TAAI.2012.34","DOIUrl":"https://doi.org/10.1109/TAAI.2012.34","url":null,"abstract":"The performance of consultation methods is examined in computer chess using two kinds of experiments. One is playing self-play games to observe the winning rates, and the other is solving a collection of chess problems to observe the percentages of the correct answers. It is shown that the winning rate of the optimistic selection rule with 4 base programs against the original one is 61%. Moreover, it is shown that the rate of correct answers with the nominal depth 8 increases from 59% to 70% using the optimistic selection rule with 16 base programs. These results indicate that consultation methods allow us simple yet effective distributed computing in chess.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126605116","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
Maintenance of DBV-Trees for Transaction Insertion 维护用于事务插入的dbv树
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.31
H. Le, Thien-Phuong Le, Bay Vo, T. Hong
{"title":"Maintenance of DBV-Trees for Transaction Insertion","authors":"H. Le, Thien-Phuong Le, Bay Vo, T. Hong","doi":"10.1109/TAAI.2012.31","DOIUrl":"https://doi.org/10.1109/TAAI.2012.31","url":null,"abstract":"In this paper, we present an incremental mining algorithm for handling the mining problem from inserted transactions. The algorithm is based on the Dynamic Bit-Vector (DBV) structure and pre-large item sets. The DBV structure facilitates the processes for maintaining large and pre-large item sets. The pre-large concept is used to reduce the number of database scans. The experimental results show that the proposed algorithm is faster than some other algorithms.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129799817","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
Stock Trend Prediction by Sequential Chart Pattern via K-Means and AprioriAll Algorithm 基于k均值和AprioriAll算法的序列图模式股票趋势预测
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.42
Yung-Piao Wu, Kuo-Ping Wu, Hahn-Ming Lee
{"title":"Stock Trend Prediction by Sequential Chart Pattern via K-Means and AprioriAll Algorithm","authors":"Yung-Piao Wu, Kuo-Ping Wu, Hahn-Ming Lee","doi":"10.1109/TAAI.2012.42","DOIUrl":"https://doi.org/10.1109/TAAI.2012.42","url":null,"abstract":"In this paper we present a model to predict the stock trend based on a combination of sequential chart pattern, K-Means and AprioriAll algorithm. The stock price sequence is truncated to charts by sliding window. Then the charts are clustered by K-Means algorithm to form chart patterns. Therefore, the charts form chart pattern sequences, and frequent patterns in the sequences can be extracted by AprioriAll algorithm. The existence of frequent patterns implies that some specific market behaviors often show accompanied, thus the corresponding trend can be predicted. Experiment results show that the proposed system can produce better index return with fewer trade. Its annualized return is also better than award winning mutual funds. Therefore, the proposed method makes profits on the real market, even in a long-term usage.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128132628","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
Pomics: A Computer-Aided Storytelling System with Automatic Picture-to-Comics Composition 图形学:具有自动从图片到漫画合成的计算机辅助讲故事系统
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.28
Ming-Hui Wen, R. Thawonmas, Kuan-Ta Chen
{"title":"Pomics: A Computer-Aided Storytelling System with Automatic Picture-to-Comics Composition","authors":"Ming-Hui Wen, R. Thawonmas, Kuan-Ta Chen","doi":"10.1109/TAAI.2012.28","DOIUrl":"https://doi.org/10.1109/TAAI.2012.28","url":null,"abstract":"People now use photo browsing, photo and video slideshow, and illustrated text to share stories about their lives in pictures, however, these popular mediums are far from perfect. Some are not expressive enough for sophisticated storytelling, while others inevitably have a high usage threshold and involve a great deal of efforts. In this paper, we propose a framework for comic-based computer-aided storytelling systems to help users become comic storytellers. Such systems take users' photos as the input and output comic strips that tell the story behind the photos. We see the system as a vehicle for media fusion, with the art of comic-making as the basis and inspiration. We also discuss the research challenges involved in improving such systems, and present our proof-of-concept implementation, Pomics (available online at http://www.pomics.net).","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132750529","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
An Intelligent System for Mining Usage Patterns from Appliance Data in Smart Home Environment 智能家居环境下家电数据使用模式挖掘的智能系统
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.54
Yi-Cheng Chen, Yu-Lun Ko, Wen-Chih Peng
{"title":"An Intelligent System for Mining Usage Patterns from Appliance Data in Smart Home Environment","authors":"Yi-Cheng Chen, Yu-Lun Ko, Wen-Chih Peng","doi":"10.1109/TAAI.2012.54","DOIUrl":"https://doi.org/10.1109/TAAI.2012.54","url":null,"abstract":"In the last decade, considerable concern has arisen over the electricity saving due to the issue of reducing greenhouse gases. Previous studies on usage pattern utilization mainly are focused on power disaggregation and appliance recognition. Little attention has been paid to utilizing pattern mining for the target of energy saving. In this paper, we develop an intelligent system which analyzes appliance usage to extract users' behavior patterns in a smart home environment. With the proposed system, users can acquire the electricity consumption of each appliance for energy saving easily. In advance, if the electricity cost is high, users can observe the abnormal usage of appliances from the proposed system. Furthermore, we also apply our system on real-world dataset to show the practicability of mining usage pattern in smart home environment.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133879671","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}
引用次数: 14
Effective Music Retrieval by Sequential Pattern-Based Alignment 基于顺序模式对齐的有效音乐检索
2012 Conference on Technologies and Applications of Artificial Intelligence Pub Date : 2012-11-16 DOI: 10.1109/TAAI.2012.9
Ja-Hwung Su, Shao-Yu Fu, V. Tseng
{"title":"Effective Music Retrieval by Sequential Pattern-Based Alignment","authors":"Ja-Hwung Su, Shao-Yu Fu, V. Tseng","doi":"10.1109/TAAI.2012.9","DOIUrl":"https://doi.org/10.1109/TAAI.2012.9","url":null,"abstract":"Due to the rapid growth of music data, how to effectively and efficiently retrieve the interested music piece has been an attractive issue in recent years. In traditional music retrieval systems, the most popular way is to retrieve the music piece by matching query terms and music profiles like file name, artist and so on. However, this type of music retrieval systems suffers from problem of semantic gap. To aim at this problem, in this paper, we propose a new method named Pattern-Based Music Retrieval named PBMR that exploits temporal continuities of acoustical content to represent the musical features. That is, a music piece in this work is first converted into a pattern string by two-stage clustering. Thereupon the similarity between two music pattern strings is calculated by alignment-like algorithm. The experimental evaluations show that our proposed perceptual patterns are sensitive for listening and temporal continuities are helpful to identifying the similarities between music pieces.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130870511","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
首页 上一页 下一页 尾页
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学术官方微信