The Effectiveness Study of Music Information Retrieval Arbee L.P. Chen National Tsing Hua University 2002 ACM International CIKM Conference.

Slides:



Advertisements
Similar presentations
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance [1] Pirooz Chubak May 22, 2008.
Advertisements

Indexing DNA Sequences Using q-Grams
Haystack: Per-User Information Environment 1999 Conference on Information and Knowledge Management Eytan Adar et al Presented by Xiao Hu CS491CXZ.
Multimedia Database Systems
Music Retrieval and Analysis
Representing and Querying Correlated Tuples in Probabilistic Databases
Effective Keyword Based Selection of Relational Databases Bei Yu, Guoliang Li, Karen Sollins, Anthony K.H Tung.
Proceedings of the Conference on Intelligent Text Processing and Computational Linguistics (CICLing-2007) Learning for Semantic Parsing Advisor: Hsin-His.
TI: An Efficient Indexing Mechanism for Real-Time Search on Tweets Chun Chen 1, Feng Li 2, Beng Chin Ooi 2, and Sai Wu 2 1 Zhejiang University, 2 National.
Query Specific Fusion for Image Retrieval
A Novel Scheme for Video Similarity Detection Chu-Hong Hoi, Steven March 5, 2003.
1 Oct 30, 2006 LogicSQL-based Enterprise Archive and Search System How to organize the information and make it accessible and useful ? Li-Yan Yuan.
Evaluating Search Engine
1 The Four Dimensions of Search Engine Quality Jan Pedersen Chief Scientist, Yahoo! Search 19 September 2005.
Computer Science Spatio-Temporal Aggregation Using Sketches Yufei Tao, George Kollios, Jeffrey Considine, Feifei Li, Dimitris Papadias Department of Computer.
Shared Ontology for Knowledge Management Atanas Kiryakov, Borislav Popov, Ilian Kitchukov, and Krasimir Angelov Meher Shaikh.
FACT: A Learning Based Web Query Processing System Hongjun Lu, Yanlei Diao Hong Kong U. of Science & Technology Songting Chen, Zengping Tian Fudan University.
Retrieval Evaluation: Precision and Recall. Introduction Evaluation of implementations in computer science often is in terms of time and space complexity.
CS/Info 430: Information Retrieval
T.Sharon 1 Internet Resources Discovery (IRD) Music IR.
Evaluating the Performance of IR Sytems
Information Retrieval and Extraction 資訊檢索與擷取 Chia-Hui Chang National Central University
1 An Empirical Study on Large-Scale Content-Based Image Retrieval Group Meeting Presented by Wyman
1 The Representation, Indexing and Retrieval of Music Data at NTHU Arbee L.P. Chen National Tsing Hua University Taiwan, R.O.C.
Retrieval Evaluation. Introduction Evaluation of implementations in computer science often is in terms of time and space complexity. With large document.
Music Indexing and Retrieval for Multimedia Digital Libraries King Fahd University of Petroleum and Minerals Information and Computer Science Department.
SIEVE—Search Images Effectively through Visual Elimination Ying Liu, Dengsheng Zhang and Guojun Lu Gippsland School of Info Tech,
India Research Lab Auto-grouping s for Faster eDiscovery Sachindra Joshi, Danish Contractor, Kenney Ng*, Prasad M Deshpande, and Thomas Hampp* IBM.
Hashed Samples Selectivity Estimators for Set Similarity Selection Queries.
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
Polyphonic Queries A Review of Recent Research by Cory Mckay.
A Time Based Approach to Musical Pattern Discovery in Polyphonic Music Tamar Berman Graduate School of Library and Information Science University of Illinois.
1 Music Classification Using Significant Repeating Patterns Chang-Rong Lin, Ning-Han Liu, Yi-Hung Wu, Arbee L.P. Chen, Proc. of 9th International Conference,
Similarity Measure Based on Partial Information of Time Series Advisor : Dr. Hsu Graduate : You-Cheng Chen Author : Xiaoming Jin Yuchang Lu Chunyi Shi.
Shape Matching with Occlusion in Image Databases Aristeidis Diplaros Euripides G.M. Petrakis Evangelos Milios Technical University of Crete.
Clustering-based Collaborative filtering for web page recommendation CSCE 561 project Proposal Mohammad Amir Sharif
1 Applying Collaborative Filtering Techniques to Movie Search for Better Ranking and Browsing Seung-Taek Park and David M. Pennock (ACM SIGKDD 2007)
Query Routing in Peer-to-Peer Web Search Engine Speaker: Pavel Serdyukov Supervisors: Gerhard Weikum Christian Zimmer Matthias Bender International Max.
UOS 1 Ontology Based Personalized Search Zhang Tao The University of Seoul.
Sujayyendhiren RS, Kaiqi Xiong and Minseok Kwon Rochester Institute of Technology Motivation Experimental Setup in ProtoGENI Conclusions and Future Work.
1 Efficient Search Ranking in Social Network ACM CIKM2007 Monique V. Vieira, Bruno M. Fonseca, Rodrigo Damazio, Paulo B. Golgher, Davi de Castro Reis,
PMLAB Finding Similar Image Quickly Using Object Shapes Heng Tao Shen Dept. of Computer Science National University of Singapore Presented by Chin-Yi Tsai.
Optimizing multi-pattern searches for compressed suffix arrays Kalle Karhu Department of Computer Science and Engineering Aalto University, School of Science,
Chapter 6: Information Retrieval and Web Search
CS 533 Information Retrieval Systems.  Introduction  Connectivity Analysis  Kleinberg’s Algorithm  Problems Encountered  Improved Connectivity Analysis.
RecBench: Benchmarks for Evaluating Performance of Recommender System Architectures Justin Levandoski Michael D. Ekstrand Michael J. Ludwig Ahmed Eldawy.
Efficient Instant-Fuzzy Search with Proximity Ranking Authors: Inci Centidil, Jamshid Esmaelnezhad, Taewoo Kim, and Chen Li IDCE Conference 2014 Presented.
Leonardo Guerreiro Azevedo Geraldo Zimbrão Jano Moreira de Souza Approximate Query Processing in Spatial Databases Using Raster Signatures Federal University.
Melodic Similarity Presenter: Greg Eustace. Overview Defining melody Introduction to melodic similarity and its applications Choosing the level of representation.
Performance Measurement. 2 Testing Environment.
QBSH Corpus The QBSH corpus provided by Roger Jang [1] consists of recordings of children’s songs from students taking the course “Audio Signal Processing.
Comparing Document Segmentation for Passage Retrieval in Question Answering Jorg Tiedemann University of Groningen presented by: Moy’awiah Al-Shannaq
Supporting Knowledge Discovery: Next Generation of Search Engines Qiaozhu Mei 04/21/2005.
Panther: Fast Top-k Similarity Search in Large Networks JING ZHANG, JIE TANG, CONG MA, HANGHANG TONG, YU JING, AND JUANZI LI Presented by Moumita Chanda.
Final Project Mei-Chen Yeh May 15, General In-class presentation – June 12 and June 19, 2012 – 15 minutes, in English 30% of the overall grade In-class.
Dec. 13, 2003W 2 Implementation and Evaluation of an Adaptive Neighborhood Information Retrieval System for Mobile Users Yoshiharu Ishikawa.
Content-Based MP3 Information Retrieval Chueh-Chih Liu Department of Accounting Information Systems Chihlee Institute of Technology 2005/06/16.
1 Hidden Markov Model: Overview and Applications in MIR MUMT 611, March 2005 Paul Kolesnik MUMT 611, March 2005 Paul Kolesnik.
Looking for New, Not Known Music Only : Music Retrieval by Melody Style Fang-Fei Kuo Dept. of Computer Science and Information Engineering National Chiao.
Relevant Document Distribution Estimation Method for Resource Selection Luo Si and Jamie Callan School of Computer Science Carnegie Mellon University
A Music Search Engine for Plagiarism Detection
Music Matching Speaker : 黃茂政 指導教授 : 陳嘉琳 博士.
Information Retrieval and Web Search
موضوع پروژه : بازیابی اطلاعات Information Retrieval
Searching Similar Segments over Textual Event Sequences
Ying Dai Faculty of software and information science,
Retrieval Performance Evaluation - Measures
Probabilistic Ranking of Database Query Results
Presentation transcript:

The Effectiveness Study of Music Information Retrieval Arbee L.P. Chen National Tsing Hua University 2002 ACM International CIKM Conference

Outline Motivation The Ultima Project –The 1D-List approach –The APS approach The Effectiveness Study –Estimating all relevant references Conclusion

Motivation Various approaches were proposed to provide efficient and effective content-based retrieval of music objects –Music representations pitch, rhythm, contour, chord –Index structures tree-based index, list-based index, n-gram index –Query processing methods exact match, partial match, approximate match

Motivation (Cont.) A platform is needed for the evaluation of various music information retrieval methods –Efficiency response time –Effectiveness recall-precision curve The Ultima project builds such a platform –Same data set and query set –Also serves as a testbed whenever new approaches are proposed

The Ultima Project (Cont.) Architecture Mediator Query processing module Report module Summarization module Query generation module Data store

The Ultima Project (Cont.) Two approaches have been compared –1D-List –APS ApproachRepresentationIndex structure 1D-Listmelody stringlist-based APSsequence of music segmentssuffix tree-based

The 1D-List Approach The 1D-List approach –Music objects are coded as melody strings “so-mi-mi-fa-re-re-do-re-mi-fa-so-so-so” –Melody strings are organized as linked lists –Both exact and approximate matching can be handled Exact link, insertion link, dropout link, transposition link

The 1D-List Approach (Cont.)

The APS Approach The APS approach –Music objects are coded as sequences of music segments four segment types to model the music contour pitch and duration are considered –Index structures one-dimensional and two-dimensional augmented suffix tree –Both exact and approximate matching can be handled

The APS Approach (Cont.) Representation type A type B type C type D

The APS Approach (Cont.) The suffix tree of the string S=“ABCAB” (a)An example of suffix tree (b)A 1-D augmented suffix tree 1 A $ A B $ B 2 A B $ 3

The APS Approach (Cont.) Similarity measure –Given a query sequence Q = (i 1, j 1, k 1 ) (i 2, j 2, k 2 )... (i n, j n, k n ), and a candidate sequence from the database C = (i 1, x 1, y 1 ) (i 2, x 2, y 2 )... (i n, x n, y n ).

The Effectiveness Study Traditional measures of effectiveness are precision and recall However, the number of relevant references are usually unknown –it is unrealistic for the user to make relevant judgments to all music objects in the database

The Effectiveness Study (Cont.) How to estimate the number of relevant references NR? –AS x is the set of relevant objects from the top x ranked results –RS x is the set of the top x ranked results retrieved by an approach –Assumption 1:,, the number of the retrieved results is a function of the number of retrieved relevant objects Assumption 2:, where B is a positive integer Based on the two assumptions, NR can be derives as follows:

The Effectiveness Study (Cont.) rankrelevancerecallprecision 1Y0.11 2Y0.21 3Y Y Y Y Y Y Y Y Rankrelevancerecallprecision 1Y0.11 2Y0.21 3Y Y Y |RS x | = 8, |AS x | = 5, |DB| = 20

The Effectiveness Study (Cont.) Method Factor APS 1D-List 1-D AST (duration) 1-D AST (pitch) 2-D AST Number of music objects for generating queries 10 Is the query sample a refrain or an incipit? refrain/incipit Length of query sample, denoted L 6/10 (segment)8/12 (note) Number of query samples per music object 44 Threshold setting of approximation for a query sample th_d = 0, 0.5, 1.0 th_p = 0, 0.5, 1.0 K=0, 4, 7 (for L=8) K=0, 6, 11 (for L=12) Total number of posing queries120 Experiment setup

The Effectiveness Study (Cont.) Experiment results

The Effectiveness Study (Cont.) Experiment results

The Effectiveness Study (Cont.) Experiment results –1D-list achieves a high precision in the limited range of recall, while a moderate precision for the APS family can be obtained –Comparing the APS family, the precision in a descending order is: 1D-AST (pitch), 2D-AST, and 1D-AST (duration) –In average, the effectiveness of “incipit” queries is better than “refrain” queries

Conclusion The Ultima project builds a platform for evaluating the performance of various approaches of music information retrieval A new measure for estimating the number of relevant references is proposed Future work –Design and implement the summarization module as well as the query generation module –Extend the project for evaluating polyphonic music retrieval methods