1,270 Hits in 6.1 sec

An Approach to Automatic Music Band Member Detection Based on Supervised Learning [chapter]

Peter Knees
2013 Lecture Notes in Computer Science  
In this paper, a supervised approach to learning to identify and to extract the members of a music band from related Web documents is proposed.  ...  Automatically extracting factual information about musical entities, such as detecting the members of a band, helps building advanced browsing interfaces and recommendation systems.  ...  Acknowledgments Thanks are due to Andreas Krenmair for sharing his implementation of the JAPE grammars and to Markus Schedl for making available his data set and also for his support with the evaluations  ... 
doi:10.1007/978-3-642-37425-8_10 fatcat:rqydkjbnczbfbigbkkgh5stwgi

Automatic Tune Family Identification By Musical Sequence Alignment

Patrick E. Savage, Quentin D. Atkinson
2015 Zenodo  
identificaton of near-duplicate music documents,” [5] B. H.  ...  Allali, Anuario Interamericano de Investigacion “Adaptation of string matching algorithms for Musical, vol. 9, pp. 45–63, 1973.  ... 
doi:10.5281/zenodo.1417134 fatcat:tkphigizpfgmpodr3ytco2fkni

Audio Cover Song Identification and Similarity: Background, Approaches, Evaluation, and Beyond [chapter]

Joan Serrà, Emilia Gómez, Perfecto Herrera
2010 Studies in Computational Intelligence  
Acknowledgments The authors want to thank their colleagues and staff at the Music Technology Group (UPF) for their support and work.  ...  The sense of match implies different degrees of specificity: it can be exact, retrieving music with specific content, or approximate, retrieving near neighbors in a musical space where proximity encodes  ...  As the quoted sections are usually of short duration, special adaptations of the reviewed algorithms would be required to detect them.  ... 
doi:10.1007/978-3-642-11674-2_14 fatcat:ou4l5a3rc5ehto74hbmcicxxni

Gdup: An Integrated And Scalable Graph Deduplication System

Claudio Atzori, Cinzia Bernardeschi, Paolo Manghi
2016 Zenodo  
Duplicate identification has the aim of efficiently identifying pairs of equivalent objects for the same entity type, while graph disambiguation has the goal of removing the duplication anomaly from the  ...  As things stand today, data curators can find a plethora of tools supporting duplicate identification for Big collections of objects, which they can adopt to efficiently process the objects of individual  ...  Pain, frustration, hardships, encouragement, trust and joy are just a few of the endless moods that accompanied me during this journey.  ... 
doi:10.5281/zenodo.1454879 fatcat:2gwjffyufreoxohd5khem77kpq

Automatic Recognition of Samples in Musical Audio

Jan Van Balen, Joan Serrà
2011 Zenodo  
The problem of sample identification as a music information retrieval task has not been addressed before, it is therefore first defined and situated in the broader context of sampling as a musical phenomenon  ...  This project aims at developing an algorithm that, given a database of candidate recordings, can detect samples of these in a given query.  ...  There is an entire on-line community of people devoted to the identification and documentation of samples in all kinds of music.  ... 
doi:10.5281/zenodo.3754086 fatcat:hqxrkx6bezcjxjmgfycpkieklm

Report on WEMIS 2009

Nicola Orio, Andreas Rauber, David Rizo
2009 D-Lib Magazine  
WEMIS 2009% ii this end, music content should thus include the symbolic representation of music works and the information on the structure of music pieces.  ...  We would like to express our sincere gratitude to the ECDL' 09 organizers, and specially to the members of the program committee for ensuring a high quality proceedings. This document can be found at:  ...  We present the results of an online experiment where alternative approaches for matching POIs and music, based on tagging and text matching, have been tested with users. ACKNOWLEDGEMENTS  ... 
doi:10.1045/november2009-orio fatcat:zel4p7ushfhc7edqcafbryjlvu

Leveraging the Storage Layer to Support XML Similarity Joins in XDBMSs [chapter]

Leonardo Andrade Ribeiro, Theo Härder
2012 Lecture Notes in Computer Science  
What is badly needed is efficient support of common database operations under the similarity matching paradigm.  ...  We experimentally confirm the accuracy, performance, and scalability of our approach.  ...  For PCI -based profiles, we use a slightly adapted version of Algorithm 2, where lines 4-5 and line 7 are executed for all input nodes.  ... 
doi:10.1007/978-3-642-33074-2_1 fatcat:rc6sn2pghbej7khlmihdudfkqe


Weifeng Su, Jiying Wang, Frederick H. Lochovsky
2009 ACM Transactions on Database Systems  
ODE first constructs an ontology for a domain according to information matching between the query interfaces and query result pages from different Web sites within the same domain.  ...  The ontology-assisted data extraction method is fully automatic and overcomes many of the deficiencies of current automatic data extraction methods.  ...  III Identified Matchings for Book Domain Matching # Discovered Matching 1 Author (String) = {Last Name (String), First Name (String)} 2 Category (String) = Subject (String) 3 Title (String) Table IV  ... 
doi:10.1145/1538909.1538914 fatcat:tim7fufujbcqrdvn5dxemc6gje

Tourist Recommender Systems Based on Emotion Recognition—A Scientometric Review

Luz Santamaria-Granados, Juan Francisco Mendoza-Moreno, Gustavo Ramirez-Gonzalez
2020 Future Internet  
This article reviews the principal recommendation approach documents found in scientific databases (Elsevier's Scopus and Clarivate Web of Science) through a scientometric analysis in ScientoPy.  ...  Finally, the discussion section provides guidelines for designing emotion-sensitive tourist recommenders.  ...  For this, it implemented the semantic-based match algorithm for the user's profile.  ... 
doi:10.3390/fi13010002 fatcat:h6hfzyfe5bdw3hvlqinjmrunmq

Federated text retrieval from uncooperative overlapped collections

Milad Shokouhi, Justin Zobel
2007 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '07  
Grainy hash vectors In this section, we describe our novel document-digest feature for near-duplicate document identification, the grainy hash vector (GHV).  ...  However, we demonstrate that, with an appropriate match threshold, GHVs can provide powerful discrimination of near-duplicate documents even with n = 32.  ... 
doi:10.1145/1277741.1277827 dblp:conf/sigir/ShokouhiZ07 fatcat:pxmnr6eumnh5tk5a7pkvkkyiwm

Music Genre Classification System - Machine Learning and Artificial Intelligence

Sangpo Lama
Music Genre Classification is an advance platform of listing different genre music and system can automatically detect the genre of music by implementing machine learning algorithms like K-Nearest Neighbors  ...  (KNN) algorithm, CNN, and Neural Nets.  ...  In music genre classification, K-Nearest Neighbour (KNN) algorithms help to find out the similar genre of music near to each other and can be beneficial for recommending alike music to listeners.  ... 
doi:10.6084/m9.figshare.13298408.v1 fatcat:exsabqyr5vge7dx3ehwvccia44

Information Extraction

Sunita Sarawagi
2007 Foundations and Trends in Databases  
In each case we highlight the different kinds of models for capturing the diversity of clues driving the recognition process and the algorithms for training and efficiently deploying the models.  ...  We survey techniques for optimizing the various steps in an information extraction pipeline, adapting to dynamic data, integrating with existing entities and handling uncertainty in the extraction process  ...  Acknowledgments I am indebted to many people for making this survey possible.  ... 
doi:10.1561/1900000003 fatcat:bw42p45zkbgajmroydls2m2giq

Automatic music transcription: challenges and future directions

Emmanouil Benetos, Simon Dixon, Dimitrios Giannoulis, Holger Kirchhoff, Anssi Klapuri
2013 Journal of Intelligent Information Systems  
Other promising approaches include the integration of information from multiple algorithms and different musical aspects.  ...  In this paper we analyse limitations of current methods and identify promising directions for future research.  ...  the different strings and string locations.  ... 
doi:10.1007/s10844-013-0258-3 fatcat:olfkl6jj7jhl3nxcy6td6qgdj4


Rui Cai, Jiang-Ming Yang, Wei Lai, Yida Wang, Lei Zhang
2008 Proceeding of the 17th international conference on World Wide Web - WWW '08  
pages from a forum site; and 3) Long threads that are divided into multiple pages can be re-concatenated and archived as a whole thread, which is of great help for further indexing and data mining.  ...  and invalid pages; 2) Efficiency -With a small cost of pre-sampling a few pages for learning the necessary knowledge, iRobot saves substantial network bandwidth and storage as it only fetches informative  ...  Another related work is near-duplicate detection. The objective of near-duplicate detection is to remove redundant Web documents, to facilitate further indexing and archiving tasks.  ... 
doi:10.1145/1367497.1367558 dblp:conf/www/CaiYLWZ08 fatcat:uwn5a624xnfkplxotp7kj5lrla

Challenges with using names to link digital biodiversity information

David Patterson, Dmitry Mozzherin, David Shorthouse, Anne Thessen
2016 Biodiversity Data Journal  
The need for a names-based cyber-infrastructure for digital biology is based on the argument that scientific names serve as a standardized metadata system that has been used consistently and near universally  ...  instead of names need to be managed in reconciliation services (mapping alternative name-strings for the same taxon together).  ...  Parte, Curator, List of Prokaryotic Names with Standing in Nomenclature. We thank reviewers Rich Pyle and Donat Agosti, and editor Vince Smith for their valuable insights and improvements.  ... 
doi:10.3897/bdj.4.e8080 pmid:27346955 pmcid:PMC4910497 fatcat:5oe32cdnf5fnflpxo76ujwbeh4
« Previous Showing results 1 — 15 out of 1,270 results