首页> 外文会议>International Conference on Asian Digital Libraries(ICADL 2004); 20041213-17; Shanghai(CN) >A Kind of Index for Content-Based Music Information Retrieval and Theme Mining
【24h】

A Kind of Index for Content-Based Music Information Retrieval and Theme Mining

机译:基于内容的音乐信息检索和主题挖掘的一种索引

获取原文
获取原文并翻译 | 示例

摘要

Content-based music information retrieval and theme mining are two key problems in digital music libraries, where "themes" mean the longest repeating patterns in a piece of music. However, most data structures constructed for retrieving music data can not be efficiently used to mine the themes of music pieces, and vice versa. The suffix tree structure can be used for both functions, nevertheless its height is too large and its maintenance is somewhat difficult. In this paper, a kind of index structure is introduced, which adopts the idea of inverted files and that of N-gram. It can be used to retrieve music data as well as to mine music themes. Based on the index and several useful concepts, a theme mining algorithm is proposed. Also, two implementations of a content-based music information retrieval algorithm are presented. Experiments show the correctness and efficiency of the proposed index and algorithms.
机译:基于内容的音乐信息检索和主题挖掘是数字音乐库中的两个关键问题,其中“主题”是指音乐中最长的重复模式。但是,为检索音乐数据而构造的大多数数据结构不能有效地用于挖掘音乐作品的主题,反之亦然。后缀树结构可以同时用于这两种功能,但是其高度太大,并且维护起来有些困难。本文介绍了一种索引结构,它采用了倒排文件和N-gram的思想。它可以用于检索音乐数据以及挖掘音乐主题。基于索引和几个有用的概念,提出了主题挖掘算法。另外,提出了基于内容的音乐信息检索算法的两种实现。实验证明了所提出指标和算法的正确性和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号