Sequence Classification and Melody Tracks Selection
close menu
Bookswagon
search
My Account
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology Books > Business applications > Enterprise software > Sequence Classification and Melody Tracks Selection
Sequence Classification and Melody Tracks Selection

Sequence Classification and Melody Tracks Selection


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This dissertation, "Sequence Classification and Melody Tracks Selection" by Fung, Michael, Tang, 鄧峰, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Abstract of thesis entitled Sequence Classification and Melody Tracks Selection submitted by Tang Fung Michael for the degree of Master of Philosophy at the University of Hong Kong in August 2001 One major approach to music retrieval is to model music as a sequence of features, after which traditional information retrieval techniques are applied on thesequence. Becauseofthetemporalnatureofmusicandtheinexactnessofuser queries, most efforts on music retrieval systems focus on issues such as indexing and approximation match. In contrast, the processing of music before feature extraction, such as the identification of melody track, were often considered easy or done. This may be the case in a controlled environment, such as one for musicology research, where the pieces are carefully analyzed by human beings before being submitted to the database. However, in an environment where large volumes of music are obtained from the Web, manual music analysis is impractical. Sincemanywell-knownmusicalfeaturesoftenpertaintothemelody ofmusicalpieces, andusersoftenrememberthemelodyofasong, algorithmsthat select the melody tracks of a piece are important for Web-based content-based retrieval systems. Such algorithms merely answer "yes" or "no" upon whether an input music track is melody. Hence melody tracks selection can be seen as a classification problem. Classification is a very important topic in the field of machine learning and data mining. Most of the existing classifiers, however, works on itemsets only. Sequences can also be transformed into itemsets, but information loss is inevitable. Hence classification algorithms which operate on sequences directly are important.Asaresult, anumberofalgorithmsformelodytracksselectionareproposed. Some of them exploit music knowledge on selecting melody tracks. In particular, "Range" works with the property of melodies and the interval range of human voices. "SilenceRatio" is based on an hypothesis about the amount of silence within a melody. "PMRatio" deals with the limit of monophony of human voice. "AvgVel" and "TrackName" make use of the features provided by MIDI file format. Other melody tracks selection algorithms presented in this thesis are se- quence classification algorithms. The music is first converted into feature se- quences. These sequences are then classified for identifying melody tracks. The sequence classification involved makes uses of emerging substrings. Emerging substrings in sequence database are similar to the emerging patterns in itemset database, which capture significant difference between two databases. Emerg- ing substrings mining algorithms are covered in this thesis. They make use of a datastructurecalledmerged suffix tree tostoreinformationofallpossibleemerg- ing substrings. The sequence classification algorithms developed shall work with other sequence data, including DNA, stock prices and text. Experiments were conducted on the classification power on the proposed algorithms, and their results are shown in the thesis. In brief, the results are a bit below satisfactory. This may be due to the insufficient use of music features and deficiency of the algorithms proposed. Further enhancement are possible on the construction of classifiers exploiting music knowledge and the sequence classifiers using emerging substrings. (481 words) DOI: 10.5353/th_b2974297 Subjects: Pattern recognition systemsMachine learning


Best Sellers


Product Details
  • ISBN-13: 9781374713420
  • Publisher: Open Dissertation Press
  • Publisher Imprint: Open Dissertation Press
  • Height: 279 mm
  • Weight: 263 gr
  • ISBN-10: 1374713422
  • Publisher Date: 27 Jan 2017
  • Binding: Paperback
  • Spine Width: 6 mm
  • Width: 216 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Sequence Classification and Melody Tracks Selection
Open Dissertation Press -
Sequence Classification and Melody Tracks Selection
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Sequence Classification and Melody Tracks Selection

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!