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.

Fumihiro Matsuo

dblp:18/857 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 1 first-authorArtificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1

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
Information retrieval · 75% Data models and query languages · 25%

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

TopicWeightPapersLastEvidence papers
Information retrieval › document processing
document compression
0.011986
Efficient Storage and Retrieval of Very Large Document Databases · ICDE 1986
Data models and query languages › NoSQL database
document store
0.011986
Efficient Storage and Retrieval of Very Large Document Databases · ICDE 1986
Information retrieval
indexing
0.011986
Efficient Storage and Retrieval of Very Large Document Databases · ICDE 1986
Information retrieval › indexing
inverted file
0.011986
Efficient Storage and Retrieval of Very Large Document Databases · ICDE 1986

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

statistical word occurrence analysis · 0.0
YearPublicationVenuePosition
2003 A Method of Extracting Related Words Using Standardized Mutual Information
Tomohiko Sugimachi, Akira Ishino, Masayuki Takeda, Fumihiro Matsuo
Discovery Science4
2001 Musical Sequence Comparison for Melodic and Rhythmic Similarities
abstract
We address the problem of musical sequence comparison for melodic similarity. Starting with a very simple similarity measure, we improve it step-by-step to finally obtain an acceptable measure. While the measure is still simple and has only two tuning parameters, it is better than that proposed by Mongeau and Sankoff (1990) in the sense that it can distinguish variations on a particular theme from a mixed collection of variations on multiple themes by Mozart, more successfully than the Mongeau-Sankoff measure. We also present a measure for quantifying rhythmic similarity and evaluate its performance on popular Japanese songs.
T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo
SPIRE6
1986 Efficient Storage and Retrieval of Very Large Document Databases
abstract
The authors have developed an information retrieval system named AIR (Augmented Information Retrieval system), which might be one of the most efficient systems for very large document databases. AIR can store the document data compactly and retrieve them quickly. The techniques bringing AIR to the high efficiency, the data compression, the quick keyword index, and the automatic keyword selection, are discussed. These techniques, which are based on the statistical properties of word occurrence, are fairly simple, so that the information retrieval systems employing them can be implemented with ease. The data compression technique reduces English text by a factor of 4. The quick keyword index decreases the average number of disk accesses to retrieve a keyword to about 0.3. The automatic keyword selection technique roughly halves both the number of different keywords and the size of the inverted file with only 2% loss of retrieval power.
Fumihiro Matsuo, Shouichi Futamura, Takeshi Shinohara
ICDE1