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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Yuichi Nishihara

dblp:35/2610 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2

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.

Computer graphics and multimedia
2 papers
Audio and music processing · 100%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Audio and music processing
music information retrieval		 0.122000
A practical query-by-humming system for a large music database · ACM Multimedia 2000
Let's search for songs by humming! · ACM Multimedia (2) 1999
Audio and music processing › music information retrieval › melody retrieval
query-by-humming		 0.122000
A practical query-by-humming system for a large music database · ACM Multimedia 2000
Let's search for songs by humming! · ACM Multimedia (2) 1999
Information retrieval
similarity search		 0.012000
A practical query-by-humming system for a large music database · ACM Multimedia 2000
Information retrieval › multimedia analysis and retrieval › music retrieval
music information retrieval		 0.011999
Let's search for songs by humming! · ACM Multimedia (2) 1999

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

similarity retrieval · 0.1ranked retrieval · 0.1
YearPublicationVenuePosition
2000 A practical query-by-humming system for a large music database
abstract
A music retrieval system that accepts hummed tunes as queries is described in this paper. This system uses similarity retrieval because a hummed tune may contain errors. The retrieval result is a list of song names ranked according to the closeness of the match. Our ultimate goal is that the correct song should be first on the list. This means that eventually our system's similarity retrieval should allow for only one correct answer.
Naoko Kosugi, Yuichi Nishihara, Tetsuo Sakata, Masashi Yamamuro, Kazuhiko Kushima
 ACM Multimedia2
1999 Let's search for songs by humming!
abstract
No abstract available.
Naoko Kosugi, Yuichi Nishihara, Seiichi Kon'ya, Masashi Yamamuro, Kazuhiko Kushima
 ACM Multimedia (2)2