Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ning-Han Liu

dblp:83/4000 · DBLP profile ↗
← Back
10ranked-venue papers
7as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorComputer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 77% Information retrieval · 23%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › collaborative filtering
hybrid recommendation
0.212014
Effective Results Ranking for Mobile Query by Singing/Humming Using a Hybrid Recommendation Mechanism · IEEE Trans. Multim. 2014
Recommender systems
music recommendation
0.212014
Effective Results Ranking for Mobile Query by Singing/Humming Using a Hybrid Recommendation Mechanism · IEEE Trans. Multim. 2014
Audio and music processing
music information retrieval
0.212014
Effective Results Ranking for Mobile Query by Singing/Humming Using a Hybrid Recommendation Mechanism · IEEE Trans. Multim. 2014
Audio and music processing › music information retrieval › melody retrieval
query by singing/humming
0.212014
Effective Results Ranking for Mobile Query by Singing/Humming Using a Hybrid Recommendation Mechanism · IEEE Trans. Multim. 2014
Information retrieval › ranking
result ranking
0.112014
Effective Results Ranking for Mobile Query by Singing/Humming Using a Hybrid Recommendation Mechanism · IEEE Trans. Multim. 2014
Information retrieval
retrieval models
0.112014
Effective Results Ranking for Mobile Query by Singing/Humming Using a Hybrid Recommendation Mechanism · IEEE Trans. Multim. 2014

Methods — techniques the papers use, named apart from their topics

user search history analysis · 0.4probability calculation · 0.4
YearPublicationVenuePosition
2014 Design of an intelligent car radio and music player system
Ning-Han Liu
Multim. Tools Appl.1
2014 Effective Results Ranking for Mobile Query by Singing/Humming Using a Hybrid Recommendation Mechanism
abstract
When a user cannot remember the title of a song, or its related details, the most direct and convenient method to search for the song is by humming a section of it. This search method is particularly important when a user does not have access to operate the audio device. The design methodology used in conventional search mechanisms that query by singing/humming, commonly emphasize signal processing or music comparison. The background of the user often influences the genres of the songs being searched, and this is an area of research seldom studied. In our study, we use the information from a user's search history, as well as the properties of genres common to users with similar backgrounds, to estimate the genre or style the current user may be interested in based on a probability calculation. The accuracy from querying by singing/humming is improved. Our method can be divided into two phases. In the first phase, we find the possible search results. This is similar to the conventional singing/humming query process. During the second phase, the musical preference of the user is utilized to rank the possible search results again. Songs that are most likely to be queried would be positioned at the front of the list in the search results. Through our experiments, significant improvement is demonstrated with our method.
Ning-Han Liu
IEEE Trans. Multim.1
2013 Comparison of content-based music recommendation using different distance estimation methods
Ning-Han Liu
Appl. Intell.1
2010 PHD: an efficient data clustering scheme using partition space technique for knowledge discovery in large databases
Cheng-Fa Tsai, Heng-Fu Yeh, Jui-Fang Chang, Ning-Han Liu
Appl. Intell.4
2010 An intelligent music playlist generator based on the time parameter with artificial neural networks
Ning-Han Liu, Shu-Ju Hsieh, Cheng-Fa Tsai
Expert Syst. Appl.1
2009 Long-Term Animal Observation by Wireless Sensor Networks with Sound Recognition
Ning-Han Liu, Chen-An Wu, Shu-Ju Hsieh
WASA1
2005 An Efficient Approach to Extracting Approximate Repeating Patterns in Music Databases
Ning-Han Liu, Yi-Hung Wu, Arbee L. P. Chen
DASFAA1
2005 Efficient kNN search in polyphonic music databases using a lower bounding mechanism
Ning-Han Liu, Yi-Hung Wu, Arbee L. P. Chen
Multim. Syst.1
2004 Music Classification Using Significant Repeating Patterns
Chang-Rong Lin, Ning-Han Liu, Yi-Hung Wu, Arbee L. P. Chen
DASFAA2
2002 The effectiveness study of various music information retrieval approaches
abstract
In this paper, we describe the Ultima project which aims to construct a platform for evaluating various approaches of music information retrieval. Two kinds of approaches are adopted in this project. These approaches differ in various aspects, such as representations of music objects, index structures, and approximate query processing strategies. For a fair comparison, we propose a measurement of the retrieval effectiveness by recall-precision curves with a scaling factor adjustment. Finally, the performance study of the retrieval effectiveness based on various factors of these approaches is presented.
Jia-Lien Hsu, Arbee L. P. Chen, Hung-Chen Chen, Ning-Han Liu
CIKM4