Find results with:

Add another field

Search by date

to

Searching collections:

Dartmouth Dissertations

Add or remove collections

Home Dartmouth Dissertations Page 1

Reference URL

To link to the entire object, paste this link in email, IM or document

To embed the entire object, paste this HTML in website

To link to this page, paste this link in email, IM or document

To embed this page, paste this HTML in website

Aligned hierarchies for sequential data / by Katherine M. Kinnaird.

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Back to top

Powered by CONTENTdm®

Author	Kinnaird, Katherine M.
Title	Aligned hierarchies for sequential data / by Katherine M. Kinnaird.
Date	2014
Abstract	We present aligned hierarchies, a novel solution to the dimension reduction problem, representing high-dimensional and noisy sequential data as a low-dimensional object that encodes relevant information. In this thesis, we motivate our presentation and discussion of aligned hierarchies through the lens of Music Information Retrieval (MIR), constructing aligned hierarchies by finding, encoding, and synthesizing all repeated structure present in a song. In the method for building these aligned hierarchies, we present a novel geometric-based approach to the parameter used for thresholding self-similarity and self-dissimilarity matrix representations for songs. Given a particular MIR task, such as locating the chorus of a given musical song or finding all copies of a particular recording of a song, we compare songs based on their aligned hierarchies. For the fingerprint task and the cover song task, we present comparisons for two music data sets, one based on digitized score, and the other one performances of scores. Results from these comparisons on clean data had very high precision-recall values and provide a proof of concept for the aligned hierarchies. Results on noisy data were not as successful, but demonstrate the effect of different pre-processing techniques on the comparisons.
Description	xi, 122 leaves : ill.
Format	application/pdf
College	Dartmouth College. Department of Mathematics.
Issuing Body	Dartmouth Dissertations are made available through the Dartmouth Digital Library.
Degree	Thesis (Ph.D.)--Dartmouth College.
Copyright	All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means without permission in writing from the author.
DOI	http://dx.doi.org/10.1349/ddlp.1256

Title	Page 1
Full Text	ALIGNED HIERARCHIES FOR SEQUENTIAL DATA A Thesis Submitted to the Faculty in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics by Katherine M. Kinnaird DARTMOUTH COLLEGE Hanover, New Hampshire May 14, 2014 Examining Committee: Scott D. Pauls, Chair Michael A. Casey Daniel P.W. Ellis Daniel N. Rockmore F. Jon Kull, Ph.D. Dean of Graduate Studies

Find results with:

Searching collections:

Home Dartmouth Dissertations Page 1

Aligned hierarchies for sequential data / by Katherine M. Kinnaird.

Object Description

Description

Aligned hierarchies for sequential data / by Katherine M....

Aligned hierarchies for sequential data / by Katherine M....

	All
	Pages Enter page numbers or page ranges separated by commas. For example: 1,3,5-12